A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks

  • Authors:
  • Natarajan Meghanathan

  • Affiliations:
  • Jackson State University, USA

  • Venue:
  • International Journal of Interdisciplinary Telecommunications and Networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.