Delay-aware tree construction and scheduling for data aggregation in duty-cycled wireless sensor networks

Duc Tai Le,Taewoo Lee,Hyunseung Choo

doi:10.1186/s13638-018-1108-3

Duc Tai Le, Taewoo Lee + Show 1 more

Open Access

https://doi.org/10.1186/s13638-018-1108-3

Copy DOI

Abstract

Data aggregation is one of the most essential operations in wireless sensor networks (WSNs), in which data from all sensor nodes is collected at a sink node. A lot of studies have been conducted to assure collision-free data delivery to the sink node, with the goal of minimizing aggregation delay. The minimum delay data aggregation problem gets more complex when recent WSNs have adopted the duty cycle scheme to conserve energy and to extend the network lifetimes. The reason is that the duty cycle yields a notable increase of communication delay, beside a reduction of energy consumption, due to the periodic sleeping periods of sensor nodes. In this paper, we propose a novel data aggregation scheme that minimizes the data aggregation delay in duty-cycled WSNs. The proposed scheme takes the sleeping delay between sensor nodes into account to construct a connected dominating set (CDS) tree in the first phase. The CDS tree is used as a virtual backbone for efficient data aggregation scheduling in the second phase. The scheduling assigns the fastest available transmission time for every sensor node to deliver all data collision-free to the sink. The simulation results show that our proposed scheme reduces data aggregation delay by up to 72% compared to previous work. Thanks to data aggregation delay reduction, every sensor node has to work shorter and the network lifetime is prolonged.

Highlights

Wireless sensor networks (WSNs) are generally composed of a large number of sensor nodes cooperating with each other to conduct various services, such as monitoring a disaster area in environmental services, detecting event on a barrier in military surveillance services, gathering a patient information in health care services, and so on [1]
We prove that the fit aggregation scheduling (FAS) scheme generates a collision-free aggregation schedule, as follows: Theorem 1 The FAS scheme provides a collision-free data aggregation scheduling
6 Conclusions In this paper, we proposed a scheme for collision-free data aggregation scheduling in duty-cycled WSNs, which significantly reduces the data aggregation delay

Summary

Introduction

Wireless sensor networks (WSNs) are generally composed of a large number of sensor nodes cooperating with each other to conduct various services, such as monitoring a disaster area in environmental services, detecting event on a barrier in military surveillance services, gathering a patient information in health care services, and so on [1]. The tree construction phase first forms a CDS for a duty-cycled WSN It takes the sleeping delay between a pair of neighboring nodes into account to build a delay-aware data aggregation tree based on the CDS. The scheduling phase guarantees collision-free data aggregation on the constructed tree It seeks the fastest available transmitting time slot for each node in the network to minimize aggregation delay. The intuition behinds this is that the smaller sleeping delay a link has, the shorter time period a transmission is delayed on the link Such an aggregation tree construction has been sketched in [26] by an algorithm using both topology and duty-cycling information of a duty-cycled WSN. The correctness of the proposed scheme and its complexity are analyzed in the paper

Preliminary

Delay-aware tree construction

Results and discussion

Conclusions