An efficient continuous range query processing scheme in mobile P2P networks

With the development of mobile devices, interest in the mobile P2P-based services has increased. However, the existing schemes spend too much cost to process a continuous range query in mobile P2P network environments. In this paper, we propose a new efficient range query processing scheme in mobile P2P network environments. The proposed scheme consists of two phases. In the query distribution phase, it prunes the peers that are impossible to be included in the query result. In the monitoring phase, the proposed scheme updates the query result incrementally. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the number of messages.

[1]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[2]  Chi-Yin Chow,et al.  On Efficient and Scalable Support of Continuous Queries in Mobile Peer-to-Peer Environments , 2011, IEEE Transactions on Mobile Computing.

[3]  Ying Cai,et al.  A Generic Platform for Efficient Processing of Spatial Monitoring Queries in Mobile Peer-to-Peer Networks , 2010, 2010 Eleventh International Conference on Mobile Data Management.

[4]  Kurt Rothermel,et al.  Moving range queries in distributed complex event processing , 2012, DEBS.

[5]  Wang-Chien Lee,et al.  Collaborative caching for spatial queries in Mobile P2P Networks , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[6]  Takahiro Hara Energy Efficient Data Access in Mobile Ad Hoc Networks , 2010, 2010 Eleventh International Conference on Mobile Data Management.

[7]  Sangwook Kim,et al.  A Mobile Peer-to-Peer Query in a Social Network , 2008, 2008 International Conference on Advanced Language Processing and Web Information Technology.

[8]  Agnès Voisard,et al.  Location-Based Mobile Querying in Peer-to-Peer Networks , 2005, OTM Workshops.

[9]  Abbas Jamalipour,et al.  An Epidemic P2P Content Search Mechanism for Intermittently Connected Mobile Ad Hoc Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[10]  Kyriakos Mouratidis,et al.  Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring , 2005, SIGMOD '05.

[11]  Jie Wu,et al.  On reducing broadcast redundancy in ad hoc wireless networks , 2002, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

[12]  R. Varshney,et al.  Supporting top-k join queries in relational databases , 2011 .

[13]  Michael F. Goodchild,et al.  Location-Based Services , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[14]  Kien A. Hua,et al.  ExtRange: Continuous Moving Range Queries in Mobile Peer-to-Peer Networks , 2009, 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware.

[15]  Shervin Shirmohammadi,et al.  Design Issues of Peer-to-Peer Systems for Wireless Ad Hoc Networks , 2007, Sixth International Conference on Networking (ICN'07).

[16]  Philip S. Yu,et al.  On incremental processing of continual range queries for location-aware services and applications , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[17]  Bo Huang,et al.  Popularity Based Mobile Peer-to-Peer Search Mechanism , 2009, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[18]  Bo Xu,et al.  In-network query processing in mobile P2P databases , 2009, GIS.