Universiti Teknologi Malaysia Institutional Repository

DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks

Dezfouli, Behnam and Radi, Marjan and Whitehouse, Kamin and Abd. Razak, Shukor and Tan, Hwee Pink (2015) DICSA: Distributed and concurrent link scheduling algorithm for data gathering in wireless sensor networks. Ad Hoc Networks, 25 . pp. 54-71. ISSN 1570-8705

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/j.adhoc.2014.09.011

Abstract

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.

Item Type:Article
Uncontrolled Keywords:interference, MAC, scheduling algorithm
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:Computing
ID Code:58305
Deposited By: Haliza Zainal
Deposited On:04 Dec 2016 04:07
Last Modified:15 Dec 2021 03:24

Repository Staff Only: item control page