Distributive and self-sustainable scheduling algorithm for wireless sensor networks

• Main Authors: Sheikh, M.A., Ali, N.B.Z., Awang, A.
• Format: Conference or Workshop Item
• Published: 2013
• Online Access: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893234670&doi=10.1109%2fWOCC.2013.6676403&partnerID=40&md5=929f56a75ae20d05c53a74c326b432c4; http://eprints.utp.edu.my/32689/

Scheduling or allocation of resources becomes one of the fundamental problems in wireless networks when several nodes contend to access a single and a common medium. To design a scalable wireless network, the slot scheduling algorithm must be computationally simple and distributive. In the past, many scheduling algorithms were proposed. However, when these techniques were implemented in dense networks, they often lacked the scalability factor due to node failure and dynamic topology changes. Thus, the design of optimal distributed scheduling algorithm has remained a challenge for the last few decades. In this paper, we propose a distributive and self-sustainable scheduling algorithm (DSSA). DSSA is a schedule based protocol and the objective of the algorithm is to assign the time slots to the nodes and avoid collision. DSSA is a simple, distributed and performance optimal scheduling algorithm and overcomes a variety of slot scheduling problems. DSSA resolves slot scheduling challenges by presenting a novel heuristic approach. The proposed technique is not centralized, hence it is distributive. It is fair and simple in terms of implementation, because the node which REQUEST first is given a priority to schedule its slot. Moreover, it is robust against any dynamic change without incurring extra message overhead and, utilizes minimal resources to provide an optimal collision free transmission. Simulation results show that DSSA is more performance optimal than the distributed randomized scheduling algorithm DRAND in terms of energy consumption, message overhead and execution time. © 2013 IEEE.