Back to Search
Start Over
Processing KNN Queries in Grid-Based Sensor Networks.
- Source :
-
Algorithms . 2014, Vol. 7 Issue 4, p582-596. 15p. - Publication Year :
- 2014
-
Abstract
- Recently, developing efficient processing techniques in spatio-temporal databases has been a much discussed topic. Many applications, such as mobile information systems, traffic control system, and geographical information systems, can benefit from efficient processing of spatio-temporal queries. In this paper, we focus on processing an important type of spatio-temporal queries, the K-nearest neighbor (KNN) queries. Different from the previous research, the locations of objects are located by the sensors which are deployed in a grid-based manner. As the positioning technique used is not the GPS technique, but the sensor network technique, this results in a greater uncertainty regarding object location. With the uncertain location information of objects, we try to develop an efficient algorithm to process the KNN queries. Moreover, we design a probability model to quantify the possibility of each object being the query result. Finally, extensive experiments are conducted to demonstrate the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19994893
- Volume :
- 7
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 100119376
- Full Text :
- https://doi.org/10.3390/a7040582