In low-duty-cycle wireless sensor networks, wireless nodes usually have two states: active state and dormant state. The necessary condition for a successful wireless transmission is that both the sender and the receiver are awake. In this paper, we study the problem: How fast can raw data be collected from all source nodes to a sink in low-duty-cycle WSNs with general topology? Both the lower and upper tight bounds are given for this problem. We use TDMA scheduling on the same frequency channel and present centralized and distributed fast data collection algorithms to find an optimal solution in polynomial time when no interfering links happen. If interfering links happen, multichannel scheduling is introduced to eliminate them. We next propose a novel Receiver-based Channel and Time Scheduling (RCTS) algorithm to obtain the optimal solution. Based on real trace, extensive simulations are conducted and the results show that the proposed RCTS algorithm is significantly more efficient than the link schedule on one channel and achieves the lower bound. We also evaluate the proposed data collection algorithms and find that RCTS is time-efficient and suffices to eliminate most of the interference in both indoor and outdoor environment for moderate size networks.
Data Collection for Time-Critical Applications in the Low-Duty-Cycle Wireless Sensor Networks
Shuyun Luo,Yongmei Sun,Yuefeng Ji
Published 2015 in Int. J. Distributed Sens. Networks
ABSTRACT
PUBLICATION RECORD
- Publication year
2015
- Venue
Int. J. Distributed Sens. Networks
- Publication date
2015-08-01
- Fields of study
Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-31 of 31 references · Page 1 of 1
CITED BY
Showing 1-8 of 8 citing papers · Page 1 of 1