Energy efficient routing and scheduling for real-time data aggregation in WSNs

In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario where the data aggregation must be performed within a specified latency constraint. The objective is to minimize the overall...

Full description

Saved in:
Bibliographic Details
Published inComputer communications Vol. 29; no. 17; pp. 3527 - 3535
Main Authors Du, Hongwei, Hu, Xiaodong, Jia, Xiaohua
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 08.11.2006
Tokyo Elsevier Science
New York, NY
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Data aggregation
Energy efficiency
Exact sciences and technology
Software
Wireless sensor network
Wireless sensor network
Data aggregation
Energy efficiency
Measurement sensor
Routing
Distributed system
Real time
Energy savings
Delay
Aggregation
Processor scheduling
Wireless network
Sensor array
Online AccessGet full text

Cover

More Information
Summary:In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario where the data aggregation must be performed within a specified latency constraint. The objective is to minimize the overall energy cost of the sensor nodes in the aggregation tree subject to the latency constraint. We propose an algorithm that can construct a data aggregation tree with theoretically bounded energy cost under the latency constraint. Extensive simulations show that the proposed algorithm is very efficient in energy-saving under the latency constraint and has better performance than other existing algorithms.
ISSN:0140-3664
1873-703X
DOI:10.1016/j.comcom.2006.01.032