Efficient scheduling for periodic aggregation queries in multihop sensor networks

Authors:
XiaoHua Xu;Xiang-Yang Li;Peng-Jun Wan;ShaoJie Tang
Affiliations:
Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL and Tsinghua National Laboratory for Information Science and Technology, Beijing, China and HangZhou DianZi University ...;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 15
Cited 2

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

IEEE Transactions on Software Engineering
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Real-Time Query Scheduling for Wireless Sensor Networks

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Minimum-latency aggregation scheduling in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Canopy closure estimates with GreenOrbs: sustainable sensing in the forest

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Energy-efficient data gathering in wireless sensor networks with asynchronous sampling

ACM Transactions on Sensor Networks (TOSN)
Locating sensors in the wild: pursuit of ranging quality

Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
A Delay-Efficient Algorithm for Data Aggregation in Multihop Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Minimum data aggregation time problem in wireless sensor networks

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
The capacity of wireless networks

IEEE Transactions on Information Theory

Continuous data aggregation and capacity in probabilistic wireless sensor networks

Journal of Parallel and Distributed Computing
Distributed data collection in large-scale asynchronous wireless sensor networks under the generalized physical interference model

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study periodic query scheduling for data aggregation with minimum delay under various wireless interference models. Given a set Q of periodic aggregation queries, each query Qi ε Q has its own period pi and the subset of source nodes Sicontaining the data. We first propose a family of efficient and effective real-time scheduling protocols that can answer every job of each query task Qi ε Q within a relative delay O(pi) under resource constraints by addressing the following tightly coupled tasks: routing, transmission plan constructions, node activity scheduling, and packet scheduling. Based on our protocol design, we further propose schedulability test schemes to efficiently and effectively test whether, for a set of queries, each query job can be finished within a finite delay. Our theoretical analysis shows that our methods achieve at least a constant fraction of the maximum possible total utilization for query tasks, where the constant depends on wireless interference models. We also conduct extensive simulations to validate the proposed protocol and evaluate its practical performance. The simulations corroborate our theoretical analysis.