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.
Original language | English |
---|---|
Title of host publication | 2010 Proceedings IEEE INFOCOM |
DOIs | |
Publication status | Published - 15 Jun 2010 |
Event | IEEE INFOCOM 2010 - San Diego, CA, United States Duration: 14 Mar 2010 → 19 Mar 2010 |
Conference
Conference | IEEE INFOCOM 2010 |
---|---|
Country/Territory | United States |
City | San Diego, CA |
Period | 14/03/10 → 19/03/10 |
Keywords
- Data gathering
- Maximum lifetime
- Spanning tree
- Wireless sensor networks
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering