Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks

Abstract

Aggregation is an important and commonplace operation in wireless sensor networks. Due to wireless interferences, aggregation in wireless sensor networks often suffers from packet collisions. In order to solve the collision problem, aggregation scheduling is extensively researched in recent years. In many sensor network applications such as real-time monitoring, aggregation time is the most concerned performance. This paper considers the minimum-time aggregation scheduling problem in duty-cycled wireless sensor networks for the first time. We show that this problem is NP-hard and present an approximation algorithm based on connected dominating set. The theoretical analysis shows that the proposed algorithm is a nearly-constant approximation. Simulation shows that the scheduling algorithm has a good performance.

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

“…For the dc-MTAS problem, scheduling algorithm (SA) [23] is one of the earliest schemes. The scheme consists of two phases.…”

“…The schedule of all dominatees is a collision-free schedule [23]. We only need to prove that there is no collision between any transmission of dominators and connectors.…”

“…It is defined as the number of working periods for all data aggregated at the sink, in duty-cycled WSNs. We implement SA (LSC + WPS) [23], to compare its performances with our proposed scheme (DTC + FAS), in terms of data aggregation time. Moreover, for detailed analysis between SA and our proposed scheme, we also compare with the two schemes of (LSC + FAS) and (DTC + WPS).…”

“…Yu et al [23] claim the NP-hardness of the minimum time aggregation scheduling problem in duty-cycled WSNs, later on referred to as dc-MTAS problem, and have presented an aggregation scheduling algorithm. The algorithm, named SA, deploys a minimal covering schedule on a layered network structure to minimize aggregation delay.…”

A Distributed Collision-Free Data Aggregation Scheme for wireless sensor network

“…Data aggregation plays a significant role in WSNs, and the problem of minimizing the delay in this technique is NP-hard and many researches contribute to solve this problem. Yu and Li 13 analyze the time cost that complete the aggregation in SA, and the algorithm shows that the time required is not lager than T ( 15 R ( G , s ) + Δ − 3 ) time units, where T is the constant time units in every WP and R ( G , s ) is the transmission range of node s in the network graph G . In Sarkar et al, 14 ARS (Action and Relay Station) line scheduling algorithm is proposed to manage data by cluster nodes collecting the data from different neighbor nodes and then transmit the aggregated data to the sink node.…”