An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks

TitleAn energy-aware spanning tree algorithm for data aggregation in wireless sensor networks
Publication TypeConference Paper
Year of Publication2005
AuthorsLee, M., and V. W. S. Wong
Conference NameCommunications, Computers and signal Processing, 2005. PACRim. 2005 IEEE Pacific Rim Conference on
Pagination300 - 303
Date Publishedaug.
Keywordsdata aggregation, data communication, directed diffusion, distributed protocol, energy-aware spanning tree algorithm, network routing, routing protocols, wireless sensor networks
Abstract

In wireless sensor networks, data aggregation is used to collect local data from neighboring nodes (sources) and generate a data report. In this paper, we propose E-span, which is an energy-aware spanning tree algorithm. E-Span is a distributed protocol and facilitates the sources within an event region to perform data aggregation. In E-span, the source node which has the highest residual energy is chosen as the root. Other source nodes choose their corresponding parent node among their neighbors based on the residual energy and distance to the root. By selecting the directed diffusion [C. Intanagonwiwat et al., Aug. 2000] as the underlying routing platform, simulation results show that the lifetime of sources can be extended significantly when E-Span is used.

URLhttp://dx.doi.org/10.1109/PACRIM.2005.1517285
DOI10.1109/PACRIM.2005.1517285

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia