Abstract

Together with the advance of positioning and mobile technologies, P2P query processing has attracted a growing interest number of location-aware applications such as answering kNN queries in Mobile Ad-hoc Networks. It not only overcomes drawbacks of centralized paradigms; for example single point of failure and bottle-neck issues, but more importantly harnesses power of peers' collaboration. In this research, we propose a pure mobile P2P query processing with novel searching and validating algorithms to find kNNs without support from the base station. The simulation results show that our paradigm can make use of data sharing from peers to save energy consumption on querying at least six times compared with centralized and hybrid paradigms in a reasonable mean latency of processing time for networks with high density of moving objects.

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 call

Disclaimer: 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.