Abstract
Data broadcasting provides an effective way to disseminate information in a wireless mobile environment. How to provide the service of k nearest neighbors (kNN) search using data broadcasting is studied in this paper. Given a data set D and a query point p, the kNN search finds k data points in D closest to p. By assuming that the data is indexed by an R-tree, we propose an efficient protocol for kNN search on the broadcast R-tree in terms of the tuning time which is the amount of time spent listening to the broadcast, latency which is time elapsed between issuing and termination of the query, and memory usage on the clients. We last validate the proposed protocol by experiments and present our findings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
