ABSTRACT
Broadcast latency minimization is one of the most important problems in duty-cycled Wireless Sensor Networks (WSNs). In order to minimize the broadcast latency, recent scheduling schemes prefer to schedule transmissions to nodes along critical paths of a network. Nodes in a critical path are referred as critical nodes and other nodes is referred as non-critical ones. The schemes are typically motivated to find a collision-free broadcast schedule to ensure their completions, i.e. all nodes receive a broadcast message collision-freely. Observing that any delay on transmission to a critical node will result in an increase of the overall broadcast latency, we propose a novel broadcast scheduling, named Parameterized Collision Tolerant Scheduling (PCTS), that allows collision at non-critical nodes to speed up the broadcast process for critical ones. Simulation results show that the proposed scheme significantly reduces broadcast latency compared with the existing schemes, and slightly increases the number of transmissions due to retransmission.
- X. Jiao, W. Lou, J. Ma, J. Cao, X. Wang, and X. Zhou. 2012. Minimum Latency Broadcast Scheduling in Duty-cycled Multi-hop Wireless Networks. IEEE Transactions on Parallel and Distributed Systems (Jan. 2012), vol. 23, 110--117. Google ScholarDigital Library
- G. Anastas, M. Conti, M. D. Francesco, and A. Passarell. 2009. Energy Conservation in Wireless Sensor Networks: a Survey. Journal Ad Hoc Networks (May 2009), vol. 7, issue 3, 537--568. Google ScholarDigital Library
- Y. Duan, S. Ji, and Z. Cai. 2011. Generalized Broadcast Scheduling in Duty-Cycle Multi-Hop Wireless Networks. In Proceeding of Performance Computing and Communications Conference (PCCC) (November 17--19, 2011), 1--6. Google ScholarDigital Library
- G. Im, D.-T. Le, H. Choo, D.S. Kim. 2015. Critical-path Aware Broadcast Scheduling in Duty-cycled Wireless Sensor Networks, In Proceeding of International Conference on Information Networking (ICOIN) (January 12--14, 2015), 410--411.Google ScholarCross Ref
- E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische Mathematik, vol. 1, no. 1, 269--271. Google ScholarDigital Library
Index Terms
- Parameterized Collision Tolerant Scheduling for Broadcast Latency Minimization in Duty-cycled Wireless Sensor Networks
Recommendations
Collision-tolerant broadcast scheduling in duty-cycled wireless sensor networks
AbstractThe minimum-latency broadcast problem in duty-cycled wireless sensor networks has received significant attention over the last few years. A common approach for the problem is to assign collision-free transmitting times to forwarding ...
Highlights- A novel scheduling strategy for broadcast latency minimization in duty-cycled WSNs.
Latency aware Broadcast Scheduling in Duty Cycled wireless sensor networks
ICOIN '13: Proceedings of the 2013 International Conference on Information Networking (ICOIN)Broadcast is a fundamental operation in wireless sensor networks and plays an important role in the communication protocol design. This paper investigates the Minimum Latency Broadcast Scheduling in Duty Cycle (MLBSDC) problem in wireless sensor ...
Approximation algorithms for broadcasting in duty cycled wireless sensor networks
Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called ...
Comments