Abstract
We consider the problem of real-time data collection in wireless sensor networks, in which data need to be delivered to one or more sinks within end-to-end deadlines. To enhance performance with respect to end-to-end deadline miss ratio, existing approaches schedule packets by prioritizing them based on per-packet deadlines and other factors such as the distance to the sink. However, important factors affecting the end-to-end performance such as queuing delays and buffer overruns have largely been ignored in the existing real-time schemes. Packet prioritization by itself cannot assist with these issues, and may in fact, exacerbate them for real-time data collection, since many high priority packets may simultaneously contend for the constrained network resources. In sensor networks, where the channel bandwidth and buffer space are often quite limited, these issues can dramatically impact real-time performance. Based on this observation, we propose Just-in-Time Scheduling (JiTS) strategies where packets are judiciously delayed within their slack time to reduce contention and load balance the use of the network buffers. We explore several policies for delaying data packets at different intermediate nodes considering potential contention. In addition, we also show that the routing protocol has a significant impact on real-time performance. In particular, shortest path routing leads to considerably better performance than geographic forwarding, which is often used for real-time data transmission in wireless sensor networks. Using an extensive simulation study, we demonstrate that JiTS can significantly improve the deadline miss ratio and packet drop ratio compared to two state-of-the-art approaches for real-time packet delivery for sensor networks (RAP and SPEED) under various scenarios. Notably, JiTS requires neither lower layer (e.g., MAC layer) support nor synchronization among the sensor nodes.
Similar content being viewed by others
References
Ahn GS, Campbell AT, Veres A, Sun L-H (2002) Supporting service differentiation for real-time and best effort traffic in stateless wireless ad hoc networks (SWAN). IEEE Trans Mobile Comput 1(3)
Bose P, Morin P, Stojmenovic I, Urrutia J (1999) Routing with guaranteed delivery in ad hoc wireless networks. In: 3rd ACM int workshop on discrete algorithms and methods for mobile computing and communications DIAL M99, Seattle, WA, August 1999
Bruck J, Gao J, Jiang A (2005) Map: medial axis based geometric routing in sensor networks. In: MobiCom’05: Proceedings of the 11th annual international conference on mobile computing and networking, pp 88–102
Bulusu N, Heidemann J, Estrin D (2000) GPS-less low cost outdoor localization for very small devices. IEEE Personal Commun Mag, pp 28–34, 2000
Fang Q, Gao J, Guibas L, de Silva V, Zhang L (2005) GLIDER: gradient landmark-based distributed routing for sensor networks. In: Proc IEEE conference on computer communications (INFOCOM)
Felemban E, Lee CG, Ekici E, Boder R, Vural S (2005) Probabilistic QoS guarantee in reliability and timeliness domains in wireless sensor networks. In: Proc of IEEE INFOCOM 2005
Fonseca R, Ratnasamy S, Zhao J, Ee CT, Culler D, Shenker S, Stoica I (2005) Beacon vector routing: scalable point-to-point routing in wireless sensornets. In: Proc of the 2nd symposium on networked systems design and implementation (NSDI 2005), May 2005
He T, Stankovic JA, Lu C, Abdelzaher T (2003) SPEED: a stateless protocol for real-time communication in sensor networks. In: Proc of international conference on distributed computing systems (ICDCS 2003), May 2003
He T, Stankovic JA, Lu C, Abdelzaher TF (2005) A spatiotemporal protocol for wireless sensor network. IEEE Trans Parallel Distrib Syst 16(10):995–1006
Huang Q, Lu C, Roman G-C (2003) Mobicast: just-in-time multicast for sensor networks under spatiotemporal constraints. In: Proc of international workshop on information processing in sensor networks (IPSN’03), April 2003
Huang Q, Lu C, Roman G-C (2003) Spatiotemporal multicast in sensor networks. In: Proc of the 1st international conference on embedded networked sensor systems (SenSys’03), pp 205–217
Johnson DB, Maltz DA, Broch J (2001) DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks. In: Perkins CE (ed) Ad Hoc networking. Addison-Wesley, Reading, pp 139–172
Kang JW, Zhang Y, Nath B (2004) Adaptive resource control scheme to alleviate congestion in sensor networks. In: Proc of the first workshop on broadband advanced sensor networks
Kanodia V, Li C, Sabharwal A, Sadeghi B, Knightly E (2001) Distributed multi-hop scheduling and medium access with delay and throughput constraints. In: Proceedings of the seventh annual international conference on mobile computing and networking (MobiCom 2001)
Karp B, Kung HT (2000) GPSR: greedy perimeter stateless routing for wireless networks. In: Proc 6th annual international conference on mobile computing and networking (MobiCom 2000)
Li H, Shenoy P, Ramamritham K (2004) Scheduling messages with deadlines in multi-hop real-time sensor networks. UMASS CMPSCI technical report TR04-91
Liu K, Abu-Ghazaleh NB (2006) Aligned virtual coordinates for greedy geometric routing in wireless sensor networks. In: Proc of 3rd IEEE international conference on mobile Ad-hoc and sensor networks (MASS), October 2006
Liu K, Abu-Ghazaleh NB (2006) Virtual coordinate backtracking for void traversal in geographic routing. In: Proc of 5th international conference on AD-HOC networks & wireless (Ad hoc Now), August 2006
Lu C, Blum BM, Abdelzaher TF, Stankovic JA, He T (2002) RAP: a real-time communication architecture for large-scale wireless sensor networks. In: Proc of real-time and embedded technology and applications symposium, 24–27 September 2002
Network simulator (2002) http://www.isi.edu/nsnam/ns/
Tilak S, Abu-Ghazaleh N, Heinzleman W (2002) Infrastructure tradeoffs in sensor networks. In: Proc of ACM workshop on sensor networks and applications (WSNA’02). Held in Conjunction with MobiCom 2002
Wan C-Y, Eisenman SB, Campbell AT (2003) Coda: congestion detection and avoidance in sensor networks. In: Proc first ACM conference on embedded networked sensor systems (SenSys 2003), pp 266–279, November 2003
Xing G, Lu C, Pless R, Huang Q (2004) On greedy geographic routing algorithms in sensing-covered networks. In: ACM international symposium on mobile ad hoc networking and computing (MobiHoc’04), May 2004
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was partially supported by NSF grants CNS-0454298, CNS-0751161 and CNS-0916323.
Rights and permissions
About this article
Cite this article
Liu, K., Abu-Ghazaleh, N. & Kang, KD. Exploiting slack time for just-in-time scheduling in wireless sensor networks. Real-Time Syst 45, 1–25 (2010). https://doi.org/10.1007/s11241-010-9093-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-010-9093-6