TY - GEN
T1 - Reliable Stream Scheduling with Minimum Latency for Wireless Sensor Networks
AU - Yang, Hao Tsung
AU - Liu, Kin Sum
AU - Gao, Jie
AU - Lin, Shan
AU - Munir, Sirajum
AU - Whitehouse, Kamin
AU - Stankovic, John
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/6/30
Y1 - 2017/6/30
N2 - As sensor networks are increasingly deployed for critical applications, reliability and latency guarantee become more important than ever to meet industrial requirements. In this paper, we investigated the impact of link burstiness on stream scheduling using a data trace of 3,600,000 packets collected from an indoor testbed. We demonstrate that a good tradeoff between reliability and latency can be achieved by allocating certain time slots on each link for stream transmissions based on its burst length and frequency distributions. With this observation, we design transmission scheduling and routing algorithms for data streams to meet a specified reliability requirement while minimizing end-to- end latency. For the multi-stream scheduling problem, we prove its NP-hardness and design an algorithm that achieves the reliability guarantee and an O(log n) approximation of minimizing the maximum end-to-end latency for any stream. Trace- driven simulations show that our solution meets specified end-to-end reliability requirements with latency up to 9.18 times less than existing solutions.
AB - As sensor networks are increasingly deployed for critical applications, reliability and latency guarantee become more important than ever to meet industrial requirements. In this paper, we investigated the impact of link burstiness on stream scheduling using a data trace of 3,600,000 packets collected from an indoor testbed. We demonstrate that a good tradeoff between reliability and latency can be achieved by allocating certain time slots on each link for stream transmissions based on its burst length and frequency distributions. With this observation, we design transmission scheduling and routing algorithms for data streams to meet a specified reliability requirement while minimizing end-to- end latency. For the multi-stream scheduling problem, we prove its NP-hardness and design an algorithm that achieves the reliability guarantee and an O(log n) approximation of minimizing the maximum end-to-end latency for any stream. Trace- driven simulations show that our solution meets specified end-to-end reliability requirements with latency up to 9.18 times less than existing solutions.
UR - https://www.scopus.com/pages/publications/85031700000
U2 - 10.1109/SAHCN.2017.7964927
DO - 10.1109/SAHCN.2017.7964927
M3 - Conference contribution
AN - SCOPUS:85031700000
T3 - 2017 14th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2017
BT - 2017 14th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 14th Annual IEEE International Conference on Sensing, Communication, and Networking, SECON 2017
Y2 - 12 June 2017 through 14 June 2017
ER -