The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree
ACM SIGMOD Record
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Negotiation-based protocols for disseminating information in wireless sensor networks
Wireless Networks - Selected Papers from Mobicom'99
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
Publish/subscribe in a mobile environment
Wireless Networks - Special issue: Pervasive computing and communications
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Cooperative Caching with Adaptive Prefetching in Mobile Ad Hoc Networks
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Nearest neighbor queries with peer-to-peer data sharing in mobile environments
Pervasive and Mobile Computing
Simulating wireless and mobile networks in OMNeT++ the MiXiM vision
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Mobile service oriented architectures for NN-queries
Journal of Network and Computer Applications
In-network query processing in mobile P2P databases
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
EcoTop: an economic model for dynamic processing of top-k queries in mobile-P2P networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Energy Efficient Data Access in Mobile P2P Networks
IEEE Transactions on Knowledge and Data Engineering
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
GroCoca: group-based peer-to-peer cooperative caching in mobile environment
IEEE Journal on Selected Areas in Communications
A hierarchical overlay with cluster-based reputation tree for dynamic peer-to-peer systems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
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.