Issue No. 11 - November (2011 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.194
Kwangjin Park , Wonkwang University, Iksan-Shi
Patrick Valduriez , INRIA Sophia Antipolis, Montpellier
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.
Moving objects, mobile computing, wireless data broadcasting, peer-to-peer.
Kwangjin Park, Patrick Valduriez, "Energy Efficient Data Access in Mobile P2P Networks", IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 1619-1634, November 2011, doi:10.1109/TKDE.2010.194