DICSA: Distributed and Concurrent Link Scheduling Algorithm for Data Gathering in Wireless Sensor Networks

• Main Authors: DEZFOULI, Behnam, RADI, Marjan, WHITEHOUSE, Kamin, ABD RAZAK, Shukor, Hwee-Pink TAN
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2015
• Subjects: Scheduling algorithm; Interference; MAC; Computer Sciences; Software Engineering; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/2899
• Institution: Singapore Management University

Although link scheduling has been used to improve the performance of data gathering applications, unfortunately, existing link scheduling algorithms are either centralized or they rely on specific assumptions that are not realistic in wireless sensor networks. In this paper, we propose a distributed and concurrent link scheduling algorithm, called DICSA, that requires no specific assumption regarding the underlying network. The operation of DICSA is managed through two algorithms: (i) Primary State Machine (PSM): Enables each node to perform its own slot reservation; (ii) Secondary State Machine (SSM): Enables each node to concurrently participate in the slot reservation of its neighbors. Through these algorithms and a set of forbidden slots managed by them, DICSA provides concurrent and collision-free slot reservation. Our results show that the execution duration and energy consumption of DICSA are at least 50% and 40% less than that of DRAND, respectively. In terms of slot assignment efficiency, while our results show higher spatial reuse over DRAND, the maximum slot number assigned by DICSA is at least 60% lower than VDEC. In data-gathering applications, our results confirm the higher performance of DICSA in terms of throughput, delivery ratio and packet delay. We show that the network throughput achievable by DICSA is more than 50%, 70%, 90% and 170% higher than that of DRAND, SEEDEX, NCR and FPS, respectively.