Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
RAP: A Real-Time Communication Architecture for Large-Scale Wireless Sensor Networks
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Energy efficient wireless packet scheduling and fair queuing
ACM Transactions on Embedded Computing Systems (TECS)
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Scheduling Messages with Deadlines in Multi-Hop Real-Time Sensor Networks
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Fine-grained network time synchronization using reference broadcasts
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
VigilNet: An integrated sensor network system for energy-efficient surveillance
ACM Transactions on Sensor Networks (TOSN)
ATPC: adaptive transmission power control for wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Robust implicit EDF: A wireless MAC protocol for collaborative real-time systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section LCTES'05
Using WSN Technology for Industrial Monitoring: A Real Case
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
The β-factor: measuring wireless link burstiness
Proceedings of the 6th ACM conference on Embedded network sensor systems
Robust topology control for indoor wireless sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Towards Stable Network Performance in Wireless Sensor Networks
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
BurstProbe: debugging time-critical data delivery in wireless sensor networks
EWSN'11 Proceedings of the 8th European conference on Wireless sensor networks
Quantifying the channel quality for interference-aware wireless sensor networks
ACM SIGBED Review - Special Issue on the 10th International Workshop on Real-time Networks (RTN 2011)
Time-Critical data delivery in wireless sensor networks
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Radio link quality estimation in wireless sensor networks: A survey
ACM Transactions on Sensor Networks (TOSN)
Taming uncertainties in real-time routing for wireless networked sensing and control
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
The GINSENG system for wireless monitoring and control: Design and deployment experiences
ACM Transactions on Sensor Networks (TOSN)
Discrete-time Markov Model for Wireless Link Burstiness Simulations
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
As wireless sensor networks mature, they are increasingly being used in real-time applications. Many of these applications require reliable transmission within latency bounds. Achieving this goal is very difficult because of link burstiness and interference. Based on significant empirical evidence of 21 days and over 3,600,000 packets transmission per link, we propose a scheduling algorithm that produces latency bounds of the real-time periodic streams and accounts for both link bursts and interference. The solution is achieved through the definition of a new metric Bmax that characterizes links by their maximum burst length, and by choosing a novel least-burst-route that minimizes the sum of worst case burst lengths over all links in the route. A testbed evaluation consisting of 48 nodes spread across a floor of a building shows that we obtain 100% reliable packet delivery within derived latency bounds. We also demonstrate how performance deteriorates and discuss its implications for wireless networks with insufficient high quality links.