Towards predictable wireless cyber-physical applications
ACM SIGBED Review - Special issue on the RTSS forum on deeply embedded real-time computing
Energy efficient layered sensor networks with multihop polling
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
A cyclic MAC scheduler for collecting data from heterogeneous sensors
Computer Communications
Adaptive real-time query scheduling for wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Efficient scheduling for periodic aggregation queries in multihop sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal sensing using query arrival distributions
Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications
Queen-bee: query interaction-aware for buffer allocation and scheduling problem
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
Recent years have seen the emergence of wireless sensor network systems that must support high data rate and real- time queries of physical environments. This paper proposes Real-Time Query Scheduling (RTQS), a novel approach to conflict-free transmission scheduling for real-time queries in wireless sensor networks. First, we show that there is an inherent trade-off between prioritization and throughput in conflict-free query scheduling. We then present three new real-time scheduling algorithms. The non-preemptive query scheduling algorithm achieves high throughput while intro- ducing priority inversions. The preemptive query schedul- ing algorithm eliminates priority inversion at the cost of reduced throughput. The slack stealing query scheduling algorithm combines the benefits of preemptive and non- preemptive scheduling by improving the throughput while meeting query deadlines. Furthermore, we provide schedu- lability analysis for each scheduling algorithm. The anal- ysis and advantages of our scheduling algorithms are vali- dated through NS2 simulations.