A pure P2P paradigm for query processing in mobile ad-hoc networks
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks
Personal and Ubiquitous Computing
Short communication: Location-based grid-index for spatial query processing
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
A fundamental problem for peer-to-peer (P2P) applications in mobile-pervasive computing environment is to efficiently identify the node that stores particular data items and download them while preserving battery power. In this paper, we propose a P2P Minimum Boundary Rectangle (PMBR, for short) which is a new spatial index specifically designed for mobile P2P environments. A node that contains desirable data item (s) can be easily identified by reading the PMBR index. Then, we propose a selective tuning algorithm, called Distributed exponential Sequence Scheme (DSS, for short), that provides clients with the ability of selective tuning of data items, thus preserving the scarce power resource. The proposed algorithm is simple but efficient in supporting linear transmission of spatial data and processing of location-aware queries. The results from theoretical analysis and experiments show that the proposed algorithm with the PMBR index is scalable and energy efficient in both range queries and nearest neighbor queries.