Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8642
Title: An efficient algorithm for constructing maximum lifetime tree for data gathering without aggregation in wireless sensor networks
Authors: Liang, J
Wang, J
Cao, J 
Chen, J
Lu, M
Keywords: Data gathering
Maximum lifetime
Spanning tree
Wireless sensor networks
Issue Date: 2010
Source: Proceedings - IEEE INFOCOM, 2010, 5462181 How to cite?
Abstract: Data gathering is a broad research area in wireless sensor networks. The basic operation in sensor networks is the systematic gathering and transmission of sensed data to a sink for further processing. The lifetime of the network is defined as the time until the first node depletes its energy. A key challenge in data gathering without aggregation is to conserve the energy consumption among nodes so as to maximize the network lifetime. We formalize the problem of tackling the challenge as to construct a min-max-weight spanning tree, in which the bottleneck nodes have the least number of descendants according to their energy. However, the problem is NP-complete. A Ω(log n/ log log n)-approximation algorithm MITT is proposed to solve the problem without location information. Simulation results show that MITT can achieve longer network lifetime than existing algorithms.
Description: IEEE INFOCOM 2010, San Diego, CA, 14-19 March 2010
URI: http://hdl.handle.net/10397/8642
ISBN: 9781424458363
ISSN: 0743-166X
DOI: 10.1109/INFCOM.2010.5462181
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

42
Last Week
0
Last month
1
Citations as of Sep 10, 2017

Page view(s)

40
Last Week
2
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.