Minimum latency scheduling for Multi-Regional Query in Wireless Sensor Networks

Authors:
Mingyuan Yan;Jing (Selena) He;Shouling Ji;Yingshu Li
Affiliations:
Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA;Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA;Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA;Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Venue:
PCCC '11 Proceedings of the 30th IEEE International Performance Computing and Communications Conference
Year:
2011

Citing 0
Cited 3

Cell-based snapshot and continuous data collection in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Distributed data collection in large-scale asynchronous wireless sensor networks under the generalized physical interference model

IEEE/ACM Transactions on Networking (TON)
EGF-tree: an energy-efficient index tree for facilitating multi-region query aggregation in the internet of things

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Query scheduling as one of the most important technologies used in query processing has been widely studied recently. Unfortunately, to the best of our knowledge, no previous work focuses on the Minimum Latency Multi-Regional Query Scheduling (ML-MRQS) problem. In this paper, we investigate the ML-MRQS problem in Wireless Sensor Networks (WSNs), which aims to generate a scheduling plan with minimum latency for a more practical query model called Multi-Regional Query (MRQ). A MRQ targets at user interested data from multiple region-sofa WSN, where each region is a subarea of the WSN. We claim that the ML-MRQS problem is NP-hard. Therefore, we propose a heuristic scheduling algorithm Multi-Regional Query Scheduling Algorithm (MRQSA) to solve this problem. Theoretical analysis shows that the latency of MRQSA is upper bounded by 23A + B + C for a MRQ with m query regions R