2015
DOI: 10.3390/s150818209
|View full text |Cite
|
Sign up to set email alerts
|

Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks

Abstract: The k-Nearest Neighbors (kNN) query is an important spatial query in mobile sensor networks. In this work we extend kNN to include a distance constraint, calling it a l-distant k-nearest-neighbors (l-kNN) query, which finds the k sensor nodes nearest to a query point that are also at l or greater distance from each other. The query results indicate the objects nearest to the area of interest that are scattered from each other by at least distance l. The l- kNN query can be used in most kNN applications for the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…As it has been shown, those models that include high computation seem to perform better. Actually, K-nearest neighbor outperformed many other solutions; however, its implementation in battery feed devices could drain the battery in a relatively short period of time [ 40 ].…”
Section: Fall Detection With a Wrist-worn Sensormentioning
confidence: 99%
“…As it has been shown, those models that include high computation seem to perform better. Actually, K-nearest neighbor outperformed many other solutions; however, its implementation in battery feed devices could drain the battery in a relatively short period of time [ 40 ].…”
Section: Fall Detection With a Wrist-worn Sensormentioning
confidence: 99%
“…Moreover, several works on similarity queries in sensor network are also proposed [25][26][27][28][29][30][31][32]. In this paper, we focus on the spatial search in road sensor networks on the air by proposing a fully distributed air index (called IEI) to process different spatial queries, including kNN query, range query, and CkNN query.…”
Section: Data Broadcast Algorithms For Spatial Search In Road Networkmentioning
confidence: 99%
“…A straightforward, well-known approach of interpreting such feature vectors are k -Nearest Neighbor ( k -NN) classifiers [ 42 ]. There is no need to train k -NNs, but the distance of the features of a sample to all training samples has to be computed, in order to classify the sample as those class, that is mostly represented in the k closest training samples.…”
Section: Introductionmentioning
confidence: 99%