In-Network Processing of Nearest Neighbor Queries for Wireless Sensor Networks
Author(s) -
Yuxia Yao,
Xueyan Tang,
EePeng Lim
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-33337-1
DOI - 10.1007/11733836_5
Subject(s) - computer science , wireless sensor network , efficient energy use , k nearest neighbors algorithm , node (physics) , distributed computing , computer network , scheme (mathematics) , key distribution in wireless sensor networks , energy consumption , sensor node , data mining , wireless network , wireless , real time computing , artificial intelligence , telecommunications , mathematical analysis , mathematics , structural engineering , electrical engineering , engineering , ecology , biology
Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. The sensor nodes in the network have the abilities to sense, store, compute and communicate. To enable object tracking applications, spatial queries such as nearest neighbor queries are to be supported in these networks. The queries can be injected by the user at any sensor node. Due to the limited power supply for sensor nodes, energy efficiency is the major concern in query processing. Centralized data storage and query processing schemes do not favor energy efficiency. In this paper, we propose a distributed scheme called DNN for in-network processing of nearest neighbor queries. A cost model is built to analyze the performance of DNN. Experimental results show that DNN outperforms the centralized scheme significantly in terms of energy consumption and network lifetime
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom