Thao P. Nghiem
ABSTRACT
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.
- N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The r-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec., 19:322--331, May 1990. Google Scholar
Digital Library
- R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. Nearest neighbor and reverse nearest neighbor queries for moving objects. In Database Engineering and Applications Symposium, 2002. Proceedings. International, pages 44--53, 2002. Google ScholarDigital Library
- K. L. Cheung and A. W. Fu. Enhanced nearest neighbour search on the r-tree. SIGMOD Rec., 27:16--21, September 1998. Google ScholarDigital Library
- C. Chow, H. V. Leong, and A. T. S. Chan. Grococa: group-based peer-to-peer cooperative caching in mobile environment. Selected Areas in Communications, IEEE Journal on, 25(1):179--191, January 2007. Google ScholarDigital Library
- M. K. Denko and J. Tian. Cooperative caching with adaptive prefetching in mobile ad hoc networks. In Wireless and Mobile Computing, Networking and Communications, 2006. (WiMob'2006). IEEE International Conference on, pages 38--44, June 2006. Google ScholarDigital Library
- Y. Du, S. K. Gupta, and G. Varsamopoulos. Improving on-demand data access efficiency in manets with cooperative caching. Ad Hoc Networks, 7(3):579--598, 2009. Google ScholarDigital Library
- A. Guttman. R-trees: a dynamic index structure for spatial searching. SIGMOD Rec., 14:47--57, June 1984. Google ScholarDigital Library
- G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24:265--318, June 1999. Google ScholarDigital Library
- Y. Huang and H. Garcia-Molina. Publish/subscribe in a mobile environment. Wireless Networks, 10:643--652, 2004. Google ScholarDigital Library
- A. Köpke, M. Swigulski, K. Wessel, D. Willkomm, P. T. K. Haneveld, T. E. V. Parker, O. W. Visser, H. S. Lichte, and S. Valentin. Simulating wireless and mobile networks in omnet++ the mixim vision. In Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops, Simutools '08, pages 71:1--71:8, Belgium, 2008. ICST. Google ScholarDigital Library
- W. Ku and R. Zimmermann. Nearest neighbor queries with peer-to-peer data sharing in mobile environments. Pervasive and Mobile Computing, 4(5):775--788, 2008. Google ScholarDigital Library
- J. Kulik, W. Heinzelman, and H. Balakrishnan. Negotiation-based protocols for disseminating information in wireless sensor networks. Wirel. Netw., 8:169--185, March 2002. Google ScholarDigital Library
- S. Lim, W. Lee, G. Cao, and C. R. Das. A novel caching scheme for improving internet-based mobile ad hoc networks performance. Ad Hoc Networks, 4(2):225--239, 2006. Google ScholarDigital Library
- Y. Luo, O. Wolfson, and B. Xu. The mobi-dik approach to searching in mobile ad hoc network databases. In X. Shen, editor, Handbook of Peer-to-Peer Networking, volume 9 of Springer Science+Business Media, LLC 2010, pages 1105--1123. Springer Berlin/Heidelberg, 2010.Google Scholar
- P. Nilesh, M. Anirban, G. Vikram, R. Shankar, and S. Madria. Ecotop: An economic model for dynamic processing of top-k queries in mobile-p2p networks. In J. Yu, M. Kim, and R. Unland, editors, Database Systems for Advanced Applications, volume 6588 of Lecture Notes in Computer Science, pages 251--265. Springer Berlin/Heidelberg, 2011. Google ScholarDigital Library
- A. B. of Statistics. National regional profile: Inner melbourne statistical subdivision. http://www.abs.gov.au.Google Scholar
- Option. Power considerations for 2g & 3g modules in mid designs. http://www.option.com/en/newsroom/media-center/white-papers/.Google Scholar
- K. Park and P. Valduriez. Energy efficient data access in mobile p2p networks. Knowledge and Data Engineering, IEEE Transactions on, PP(99):1, 2010. Google ScholarDigital Library
- S. Press. Third generation (3g) wireless technology brief. http://www.silicon-press.com/briefs/brief.3g/index.html.Google Scholar
- H. Pucha, S. M. Das, and Y. C. Hu. Ekta: an efficient dht substrate for distributed applications in mobile ad hoc networks. In Mobile Computing Systems and Applications, 2004. WMCSA 2004. Sixth IEEE Workshop on, pages 163--173, December 2004. Google ScholarDigital Library
- A. Visvanathan, J. Youn, and J. Deogun. Hierarchical data dissemination scheme for large scale sensor networks. In Communications, 2005. ICC 2005. 2005 IEEE International Conference on, volume 5, pages 3030--3036 Vol. 5, may 2005.Google ScholarCross Ref
- A. Waluyo, B. Srinivasan, and D. Taniar. Global index for multi channel data dissemination in mobile databases. In A. Yazici and C. Sener, editors, Computer and Information Sciences - ISCIS 2003, volume 2869 of Lecture Notes in Computer Science, pages 212--219. Springer Berlin/Heidelberg, 2003.Google Scholar
- A. Waluyo, B. Srinivasan, D. Taniar, and W. Rahayu. Incorporating global index with data placement scheme for multi channels mobile broadcast environment. In L. Yang, M. Amamiya, Z. Liu, M. Guo, and F. Rammig, editors, Embedded and Ubiquitous Computing -- EUC 2005, volume 3824 of Lecture Notes in Computer Science, pages 755--764. Springer Berlin/Heidelberg, 2005. Google ScholarDigital Library
- A. Waluyo, D. Taniar, W. Rahayu, and B. Srinivasan. Mobile service oriented architectures for nn-queries. Journal of Network and Computer Applications, 32(2):434--447, 2009. Google ScholarDigital Library
- B. Xu, F. Vafaee, and O. Wolfson. In-network query processing in mobile p2p databases. In Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS '09, pages 207--216, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- J. Yin and G. Cao. Supporting cooperative caching in ad hoc networks. Mobile Computing, IEEE Transactions on, 5(1):77--89, January 2006. Google ScholarDigital Library
- X. Yu, K. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on, pages 631--642, April 2005. Google ScholarDigital Library
Index Terms
- A pure P2P paradigm for query processing in mobile ad-hoc networks
Recommendations
A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks
Together with advanced 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 ...
Reputation based selfishness prevention techniques for mobile ad-hoc networks
Mobile ad-hoc networks require nodes to cooperate in the relaying of data from source to destination. However, due to their limited resources, selfish nodes may be unwilling to forward packets, which can deteriorate the multi-hop connectivity. Different ...
Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks
The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object ...
Comments