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

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

ISBN13: 9781466600508|ISBN10: 1466600500|EISBN13: 9781466600515
DOI: 10.4018/978-1-4666-0050-8.ch010
Cite Chapter Cite Chapter

MLA

Meghanathan, Natarajan. "A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks." Research, Practice, and Educational Advancements in Telecommunications and Networking, edited by Michael Bartolacci and Steven R. Powell, IGI Global, 2012, pp. 161-177. https://doi.org/10.4018/978-1-4666-0050-8.ch010

APA

Meghanathan, N. (2012). A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks. In M. Bartolacci & S. Powell (Eds.), Research, Practice, and Educational Advancements in Telecommunications and Networking (pp. 161-177). IGI Global. https://doi.org/10.4018/978-1-4666-0050-8.ch010

Chicago

Meghanathan, Natarajan. "A Data Gathering Algorithm Based on Energy-Aware Connected Dominating Sets to Minimize Energy Consumption and Maximize Node Lifetime in Wireless Sensor Networks." In Research, Practice, and Educational Advancements in Telecommunications and Networking, edited by Michael Bartolacci and Steven R. Powell, 161-177. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-4666-0050-8.ch010

Export Reference

Mendeley
Favorite

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.