The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2011 vol.23)
pp: 1619-1634
Kwangjin Park , Wonkwang University, Iksan-Shi
Patrick Valduriez , INRIA Sophia Antipolis, Montpellier
ABSTRACT
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.
INDEX TERMS
Moving objects, mobile computing, wireless data broadcasting, peer-to-peer.
CITATION
Kwangjin Park, Patrick Valduriez, "Energy Efficient Data Access in Mobile P2P Networks", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 11, pp. 1619-1634, November 2011, doi:10.1109/TKDE.2010.194
REFERENCES
[1] H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, and A. Zhou, "VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes," Proc. 22nd Int'l Conf. Data Eng. (ICDE), p. 34, 2006.
[2] B. Xu and O. Wolfson, "Data Management in Mobile Peer-to-Peer Networks," Proc. Second Int'l Workshop Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), pp. 1-15, 2004.
[3] Z. Huang, C.S. Jensen, H. Lu, and B.C. Ooi, "Skyline Queries against Mobile Lightweight Devices in MANETs," Proc. Int'l Conf. Data Eng. (ICDE), p. 66, 2006.
[4] H.V. Jagadish, B.C. Ooi, and Q.H. Vu, "BATON: A Balanced Tree Structure for Peer-to-Peer Networks," Proc. 31st Very Large Data Bases (VLDB) Conf., pp. 661-672, 2005.
[5] K. Aberer, A. Datta, M. Hauswirth, and R. Schmidt, "Indexing Data-Oriented Overlay Networks," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB), pp. 685-696, 2005.
[6] J.X. Parreira, D. Donato, S. Michel, and G. Weikum, "Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), pp. 415-426, 2006.
[7] K.C.K. Lee, W.-C. Lee, J. Winter, B. Zheng, and J. Xu, "CS Cache Engine: Data Access Accelerator for Location-Based Service in Mobile Environments," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 787-789, 2006.
[8] D.L. Lee, W.-C. Lee, J. Xu, and B. Zheng, "Data Management in Location-Dependent Information Services: Challenges and Issues," IEEE Pervasive Computing, vol. 1, no. 3, pp. 65-72, July 2002.
[9] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, "Location-Based Spatial Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 443-454, 2003.
[10] B. Zheng, J. Xu, W.-C. Lee, and D.L. Lee, "Grid-Partition Index: A Hybrid Method for Nearest-Neighbor Queries in Wireless Location-Based Services," Int'l J. Very Large Data Bases, vol. 15, no. 1, pp. 21-39, 2006.
[11] B. Zheng, W.-C. Lee, and D.L. Lee, "Spatial Queries in Wireless Broadcast Systems," Wireless Network, vol. 10, no. 6, pp. 723-736, 2004.
[12] T. Imielinski, S. Viswanathan, and B.R. Badrinath, "Data on Air: Organization and Access," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 353-372, May/June 1997.
[13] T. Imielinski, S. Viswanathan, and B.R. Badrinath, "Energy Efficient Indexing on Air," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 25-36, 1994.
[14] R. Zimmermann, W.S. Ku, and H. Wang, "Spatial Data Query Support in Peer-to-Peer Systems," Proc. 28th Ann. Int'l Computer Software and Applications Conf. (COMPSAC) Workshops, pp. 82-85, 2004.
[15] H. Wang, R. Zimmermann, and W.S. Ku, "ASPEN, an Adaptive Spatial Peer-to-Peer Network," Proc. Geographic Information Systems (GIS), pp. 230-239, 2005.
[16] O. Wolfson, B. Xu, and H. Yin, "Dissemination of Spatial-Temporal Information in Mobile Networks with Hotspots," Proc. Second Int'l Workshop Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), pp. 185-199, 2004.
[17] A. Mondal, Y. Lifu, and M. Kitsuregawa, "P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments," Proc. Extending Database Technology (EDBT) Workshops, pp. 516-525, 2004.
[18] W.-S. Ku, R. Zimmermann, C.-N. Wan, and H. Wang, "MAPLE: A Mobile Scalable P2P Nearest Neighbor Query System for Location-Based Services," Proc. Int'l Conf. Data Eng. (ICDE), p. 160, 2006.
[19] M. Demirbas and H. Ferhatosmanoglu, "Peer-to-Peer Spatial Queries in Sensor Networks," Proc. Int'l Conf. Peer-to-Peer Computing, pp. 32-39, 2003.
[20] G. Monti and G. Moro, "Multidimensional Range Query and Load Balancing in Wireless Ad Hoc and Sensor Networks," Proc. Int'l Conf. Peer-to-Peer Computing, pp. 205-214, 2008.
[21] P. Zhou, T. Nadeem, P. Kang, and C. Borcea, and L. Iftode, "EZCab: A Cab Booking Application Using Short-Range Wireless Communication," Proc. IEEE Third Int'l Conf. Pervasive Computing and Comm. (PerCom '05), pp. 27-38, 2005.
[22] A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57, 1984.
[23] K. Park and C.-S. Hwang, "Client-Side Caching for Nearest Neighbor Queries," J. Comm. and Networks, vol. 7, no. 4, pp. 417-428, 2005.
[24] K. Park, M. Song, and C.-S. Hwang, "Continuous Spatial Queries via Wireless Data Broadcast," Proc. Symp. Applied Computing (SAC), pp. 78-82, 2006.
[25] K. Park and H. Choo, "Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing," IEEE Trans. Computers, vol. 56, no. 6, pp. 754-768, June 2007.
[26] K. Park, P. Valduriez, and H. Choo, "Mobile Continuous Nearest Neighbor Queries on Air," Proc. ACM SIGSPATIAL Int'l Conf. Advances in Geographic Information Systems (ACM-GIS), p. 65, 2008.
[27] S.E. Hambrusch, C.-M. Liu, W. Aref, and S. Prabhakar, "Query Processing in Broadcasted Spatial Index Trees," Proc. Symp. Spatial and Temporal Databases (SSTD), pp. 502-521, 2001.
[28] A. Prasad Sistla, O. Wolfson, and B. Xu, "Opportunistic Data Dissemination in Mobile Peer-to-Peer Networks," Proc. Symp. Spatial and Temporal Databases (SSTD), pp. 346-363, 2005.
[29] N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 71-79, 1995.
[30] K. Park, M. Song, K.-S. Kong, S.-W. Kang, C.-S. Hwang, K.-S. Chung, and S.Y. Jung, "Effective Low-Latency K-Nearest Neighbor Search via Wireless Data Broadcast," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA '06), pp. 900-909, 2006.
[31] T. Camp, J. Boleng, and V. Davies, "A Survey of Mobility Models for Ad Hoc Network Research," Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp. 483-502, 2002.
[32] O. Kasten, "Energy Consumption," ETH-Zurich, Swiss Fed. Inst. of Technology. http://www.inf.ethz.ch/~kasten/research/ bathtubenergy_consumption.html, 2011.
[33] L.M. Feeney and M. Nilsson, "Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment," Proc. IEEE INFOCOM, pp. 1548-1557, 2001.
[34] http:/www.rtreeportal.org, 2011.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool