Delay-Efficient Data Aggregation Scheduling in Duty-cycled Wireless Sensor Networks

Nguyen Phan Khanh Ha, Vyacheslav Zalyubovskiy, and Hyunseung Choo

Proceedings of the 2012 ACM Research in Applied Computation Symposium, pp. 203-208, Oct. 2012

Abstract

Data aggregation is an essential operation in wireless sensor networks (WSNs) in which sensed data are aggregated and transmitted to the sink. In many applications, reducing the latency of data aggregation is an important target. In addition, one of the primary challenges in WSNs is energy scarcity and reducing energy consumption is a problem. Recently, duty cycling, i.e., periodically switching on and off communication and sensing capabilities, has been considered to significantly reduce the sensor’s energy consumption and extend a network lifetime. In this paper, we consider the minimum-latency aggregation scheduling problem in duty-cycled WSNs. We propose a Delay-Efficient Data Aggregation Scheduling (DEDAS) scheme to generate a collision-free schedule and minimize the delay for data aggregation in duty-cycled WSNs. Our analysis and comprehensive simulation results indicate that our solution performs better than existing schemes.

 

Keyword

Data Aggregation Scheduling, Duty Cycle, Wireless Sensor Networks, Minimum-latency

 

View Full Text