A energy-oriented distributed TDMA scheduling algorithm for wireless sensor networks

Considering the industrial field, the problems of limited energy and changed topology of the network restrict the development of the centralized resource allocation. Although the traditional distributed resource allocation algorithm solves the network topology change partly, there is still no breakthrough in terms of energy consumption. In this paper, we simulate the Distributed Randomized TDMA scheduling (DRAND) on the OMNeT++ platform, and it was found that the resource allocation algorithm based on random probability leads to a high collision of the message, which results in the waste of energy. According to the above questions, the author propose a dynamic priority allocation algorithm called RE-DRAND. Compared with DRAND, the algorithm can obviously reduce the execution time about 28.6%, and it provides a solution of topology changes and scarce energy problems in the industrial wireless sensor networks and the traditional self-organizing networks.