TY - GEN
T1 - Parameterized collision tolerant scheduling for broadcast latency minimization in duty-cycled wireless sensor networks
AU - Le, Duc Tai
AU - Duc, Thang Le
AU - Park, Yechan
AU - Hwang, Hojin
AU - Zalyubovskiy, Vyacheslav V.
AU - Choo, Hyunseung
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/1/4
Y1 - 2016/1/4
N2 - 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.
AB - 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.
KW - Broadcast scheduling
KW - Collision tolerant
KW - Duty cycle
KW - Minimum latency
KW - Wireless sensor networks
UR - https://www.scopus.com/pages/publications/84965060705
U2 - 10.1145/2857546.2857651
DO - 10.1145/2857546.2857651
M3 - Conference contribution
AN - SCOPUS:84965060705
T3 - ACM IMCOM 2016: Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication
BT - ACM IMCOM 2016
PB - Association for Computing Machinery, Inc
T2 - 10th International Conference on Ubiquitous Information Management and Communication, IMCOM 2016
Y2 - 4 January 2016 through 6 January 2016
ER -