A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks

Larry King, Natarajan Meghanathan

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.


Full Text: PDF DOI: 10.5539/cis.v2n4p3

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Computer and Information Science   ISSN 1913-8989 (Print)   ISSN 1913-8997 (Online)
Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.