Sciweavers

Share
RTAS
2005
IEEE

Scheduling Messages with Deadlines in Multi-Hop Real-Time Sensor Networks

9 years 7 months ago
Scheduling Messages with Deadlines in Multi-Hop Real-Time Sensor Networks
Consider a team of robots equipped with sensors that collaborate with one another to achieve a common goal. Sensors on robots produce periodic updates that must be transmitted to other robots and processed in real-time to enable such collaboration. Since the robots communicate with one another over an ad-hoc wireless network, we consider the problem of providing timeliness guarantees for multihop message transmissions in such a network. We derive the effective deadline and the latest start time for per-hop message transmissions from the validity intervals of the sensor data and the constraints imposed by the consuming task at the destination. Our technique schedules messages by carefully exploiting spatial channel reuse for each per-hop transmission to avoid MAC layer collisions, so that deadline misses are minimized. Extensive simulations show the effectiveness of our channel reuse-based SLF (smallest lateststart-time first) technique when compared to a simple perhop SLF technique, ...
Huan Li, Prashant J. Shenoy, Krithi Ramamritham
Added 25 Jun 2010
Updated 25 Jun 2010
Type Conference
Year 2005
Where RTAS
Authors Huan Li, Prashant J. Shenoy, Krithi Ramamritham
Comments (0)
books