DocumentCode
2168438
Title
An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks
Author
Lee, Marc ; Wong, Vincent W S
Author_Institution
Dept. of Electr. & Comput. Eng., British Columbia Univ., Canada
fYear
2005
fDate
24-26 Aug. 2005
Firstpage
300
Lastpage
303
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.
Keywords
data communication; routing protocols; wireless sensor networks; data aggregation; directed diffusion; distributed protocol; energy-aware spanning tree algorithm; network routing; wireless sensor networks; Aggregates; Chemical sensors; Costs; Event detection; Intelligent networks; Intelligent sensors; Monitoring; Protocols; Routing; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Computers and signal Processing, 2005. PACRIM. 2005 IEEE Pacific Rim Conference on
Print_ISBN
0-7803-9195-0
Type
conf
DOI
10.1109/PACRIM.2005.1517285
Filename
1517285
Link To Document