Abstract

This paper develops an energy-aware connected dominating set based data gathering (ECDS-DG) algorithm for wireless sensor networks. The algorithm includes only nodes that have a relatively higher energy level in ECDS. For every round, a data gathering tree (ECDS-DG tree) rooted at the ECDS Leader, that is, the node with the largest available energy, which transmits the data packet to the sink, is formed by considering only the nodes in the ECDS as the intermediate nodes of the tree. The non-ECDS nodes are leaf nodes of the tree, and the upstream node of an intermediate ECDS node in the ECDS-DG tree is the closest ECDS node that is also relatively closer to the ECDS Leader. Performance comparison studies involving well-known LEACH and PEGASIS algorithms indicate that ECDS-DG incurs the lowest energy consumption per round and sustains the largest number of rounds before first node failure.

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 call

Disclaimer: 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.