Abstract
We propose a weighted-density connected dominating set (wDCDS) based data gathering algorithm for wireless sensor networks. The wDCDS is constructed using the weighted-density of a sensor node, which is defined as the product of the number of neighbors available for the node and the fraction of the initially supplied energy available for the node. A data gathering tree (wDCDS-DG tree) rooted at the wDCDS Leader (the node with the largest available energy) is formed by considering only the nodes in the wDCDS as the intermediate nodes of the tree. The leader node forwards the aggregated data packet to the sink. The wDCDS and wDCDS-DG tree are dynamically reconstructed for each round of data gathering. Simulation studies reveal that the wDCDS-DG tree yields a significantly larger network lifetime, lower delay and lower energy consumption per round compared to the density-only CDS and energy-only CDS based data gathering trees.
Highlights
Whereas, nodes with relatively lower energy are used only as leaf nodes of the tree
We propose a weighted-density connected dominating set based data gathering algorithm for wireless sensor networks
There is no significant difference between the delay per round incurred by the Density-based Connected Dominating Set (DCDS) and weighted-density connected dominating set (wDCDS) based data gathering trees
Summary
We briefly review the data gathering algorithms proposed based on different communication structures. A sensor selects the cluster-head closer to it and directly transmits the data to the cluster-head. The role of the high-energy consuming cluster-head position is rotated among all the sensor nodes in the network. If P is the percentage of nodes that can be cluster heads, LEACH ensures that a sensor node is elected as cluster head exactly once within every 1/P rounds of data communication. PEGASIS (Lindsey, Raghavendra & Sivalingam, 2002) forms a chain of the sensor nodes and uses this chain as the basis for data aggregation. Once the leader node is selected and notified by the sink node, each node on both sides of the chain (with respect to the leader node), receives and transmits the aggregated data to the node in the chain, until the data reaches the leader node
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
