Header menu link for other important links
Scheduling of data aggregation trees using local heuristics to enhance network lifetime in sensor networks
, Manisha J. Nene
Published in Elsevier
Volume: 160.0
Issue: 160.0
Pages: 51.0 - 64.0
Data gathering is a basic requirement in many applications of Wireless Sensor Networks (WSNs). In tree based data gathering, Data Aggregation Tree (DAT) is constructed by the sink or by the nodes in a distributed manner. In this paper, we study the problem of enhancing Network Lifetime (NL) using hybrid DAT construction methods. In hybrid methods of DAT construction, the sink and the nodes collaboratively construct the DAT. We propose three algorithms for Scheduling DATs using Local Heuristics with Ordering (SDLHO), with Randomization (SDLHR) and with Tree factor (SDLHT) techniques.These techniques avoid disparity in energy levels of the nodes and increase the survivability of the network. In addition, to address imperfect link quality, we propose an algorithm for Scheduling DATs using Local Heuristics with Ordering based on Link Quality (SDLHO-LQ). Rigorous simulation results demonstrate the efficacy of the proposed algorithms; and their ability to scaleup to suit deployment of applications in harsh regions. Further, their performances evaluated to quantify the amount of enhancements of NL with the existing state of art is propitious to suit the distributed environments.
About the journal
JournalData powered by TypesetComputer Networks
PublisherData powered by TypesetElsevier
Open Access0