A Novel Penalty Controllable Dynamic Voltage Scaling Scheme for Mobile Multimedia Applications
IEEE Transactions on Mobile Computing
System design issues in sensor databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A real-time routing protocol with load distribution in wireless sensor networks
Computer Communications
Simple and efficient scheduling scheme in sensor networks
AIC'08 Proceedings of the 8th conference on Applied informatics and communications
A data collection protocol for real-time sensor applications
Pervasive and Mobile Computing
Real-time data gathering in sensor networks
Discrete Applied Mathematics
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Feedback based real-time MAC (RT-MAC) protocol for wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Scheduling for real-time mobile MapReduce systems
Proceedings of the 5th ACM international conference on Distributed event-based system
A cyclic MAC scheduler for collecting data from heterogeneous sensors
Computer Communications
Cross-layer analysis of the end-to-end delay distribution in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Design of a MAC protocol for e-emergency WSNs
UCAmI'12 Proceedings of the 6th international conference on Ubiquitous Computing and Ambient Intelligence
An enhanced real-time routing protocol with load distribution for mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 multi-hop 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 latest-start-time first) technique when compared to a simple per-hop SLF technique, especially at moderate to high channel utilization or when the probability of collisions is high.