Delay Efficient Data Aggregation Scheduling in Multi-channel Duty-Cycled WSNs

• Main Authors: Jiao, Xianlong, Lou, Wei, Feng, Xinxi, Wang, Xiaodong, Yang, Libin, Chen, Guirong
• Format: Conference Proceeding
• Language: English
• Subjects: Approximation algorithms; Data aggregation; data aggregation scheduling; Delays; duty cycle; Interference; multi channel; Receivers; Scheduling; Wireless sensor networks; wireless sensor networks (WSNs)
• ISSN: 2155-6814
• DOI: 10.1109/MASS.2018.00055

Data aggregation scheduling is a critical issue in wireless sensor networks (WSNs). This paper studies the Delay efficient Data Aggregation scheduling problem in multi-Channel Duty-cycled WSNs (DDACD problem), which aims to accomplish data aggregation with minimum delay. Existing researches, nevertheless, either focus on non-sleeping scenarios, or assume that nodes communicate on one single channel, and thus have poor performance in multi-channel duty-cycled scenarios. In this paper, we first show that DDACD problem is NP-hard. We then propose two new concepts of Candidate Active Conflict Graphs (CACG) and Feasible Active Conflict Graphs (FACG) to depict the relationship of the data aggregation links, and present two coloring methods to well separate the links at different time-slots or on different channels. Based on these two new concepts and two coloring methods, we propose an Efficient Data Aggregation Scheduling algorithm called EDAS, which exploits the fewest-children-first rule to choose the forwarding nodes to benefit the link scheduling. We theoretically prove that our proposed EDAS algorithm can achieve provable performance guarantee. The results of extensive simulations confirm the efficiency of our algorithm.