Duty cycle aware spatial query processing in wireless sensor networks |
| |
Authors: | Rone Ilídio da Silva Daniel Fernandes Macedo José Marcos S Nogueira |
| |
Affiliation: | 1. DTECH, Federal University of São João del-Rei, Campus Alto Paraopeba, Ouro Branco, MG, Brazil;2. Computer Science Department, Federal University of Minas Gerais, Belo Horizonte, MG, Brazil;1. Institute for Media and Schools, Schwyz University of Teacher Education, 6410 Goldau, Switzerland;2. Institute for Educational Evaluation, University of Zurich, 8032 Zurich, Switzerland;1. Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong;2. Department of Computer Science, University of Virginia, Charlottesville, VA, USA;3. Department of Information and, Communication Engineering, DGIST, Daegu, Republic of Korea;1. Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran;2. Department of Industrial Engineering, Sharif University of Technology, Azadi Ave., Tehran, Iran;3. Faculty of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran |
| |
Abstract: | The recent evolution in sensor node location technology has spurred the development of a special type of in-network processing for wireless sensor networks (WSN), called spatial query processing. These queries require data from nodes within a region (called region of interest) defined by the users. The state of the art of spatial query processing considers, in general, that nodes are always on. However, nodes can go to sleep mode (turn off the radio in duty cycles) in order to save energy. This work proposes an energy-efficient in-network spatial query processing mechanism that assumes nodes having no knowledge about their neighbors. The proposed mechanism is able to process spatial queries without the necessity of periodic beacon transmissions for neighbor table updates or for synchronization. Hence, it can work properly over different types of duty cycle algorithms. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|