The Community for Technology Leaders
IEEE International Performance Computing and Communications Conference (2011)
Orlando, FL, USA
Nov. 17, 2011 to Nov. 19, 2011
ISBN: 978-1-4673-0010-0
pp: 1-8
Mingyuan Yan , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Jing (Selena) He , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Yingshu Li , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
Shouling Ji , Department of Computer Science, Georgia State University, Atlanta, Georgia, 30303, USA
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
INDEX TERMS
CITATION
Mingyuan Yan, Jing (Selena) He, Yingshu Li, Shouling Ji, "Minimum latency scheduling for Multi-Regional Query in Wireless Sensor Networks", IEEE International Performance Computing and Communications Conference, vol. 00, no. , pp. 1-8, 2011, doi:10.1109/PCCC.2011.6108063
177 ms
(Ver 3.3 (11022016))