Skip to main content
SpringerLink
Log in

A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

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 centralized systems, for example single point of failure and bottleneck issues, but more importantly harnesses power of peers’ collaboration. In this research, we propose a pure mobile P2P query processing scheme which primarily focuses on the search and validation algorithm for kNN queries. The proposed scheme is designed for pure mobile P2P environments with the absence of the base station support. Compared with centralized and hybrid systems, our system can reduce energy consumption more than six times by making use of data sharing from peers in a reasonable mean latency of processing time for networks with high density of moving objects as can be seen in the simulation results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. ABS (2009) National regional profile: inner melbourne (statistical subdivision). http://www.abs.gov.au

  2. Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD Record 19:322–331

    Article  Google Scholar 

  3. Benetis R, Jensen CS, Karciauskas G, Saltenis S (2002) Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings of international symposium on database engineering and applications, pp 44–53

  4. Cheung KL, Fu AW (1998) Enhanced nearest neighbour search on the r-tree. SIGMOD Record 27:16–21

    Article  Google Scholar 

  5. Chow C, Leong HV, Chan ATS (2007) Grococa: group-based peer-to-peer cooperative caching in mobile environment. IEEE J Sel Areas Commun 25(1):179–191

    Article  Google Scholar 

  6. Ciou Y, Leu F, Huang Y, Yim K (2011) A handover security mechanism employing the diffie-hellman key exchange approach for the ieee802.16e wireless networks. Mob Inform Syst 7(3):241–269

    Google Scholar 

  7. Datta A, Quarteroni S, Aberer K (2004) Autonomous gossiping: a self-organizing epidemic algorithm for selective information dissemination in wireless mobile ad-hoc networks. In: Bouzeghoub M, Goble C, Kashyap V, Spaccapietra S (eds) Semantics of a networked world, lecture notes in computer science, vol 3226, Springer, Berlin / Heidelberg, pp 126–143

    Google Scholar 

  8. Delot T, Ilarri S, Cenerario N, Hien T (2011) Event sharing in vehicular networks using geographic vectors and maps. Mob Inform Syst 7:21–44. http://dl.acm.org/citation.cfm?id=1971892.1971894

  9. Delot T, Mitton N, S I, Hien T (2011) Geovanet: a routing protocol for query processing in vehicular networks. Mob Inform Syst 7(4):329–359

    Google Scholar 

  10. Denko MK, Tian J (2006) Cooperative caching with adaptive prefetching in mobile ad hoc networks. In: Proceedings of IEEE international conference on wireless and mobile computing, networking and communications, pp 38–44

  11. Dittrich J, Blunschi L, Vaz Salles M (2009) Indexing moving objects using short-lived throwaway indexes. In: Advances in spatial and temporal databases, lecture notes in computer science, vol 5644. Springer, Berlin / Heidelberg, pp 189–207

  12. Du Y, Gupta SK, Varsamopoulos G (2009) Improving on-demand data access efficiency in manets with cooperative caching. Ad Hoc Netw 7(3):579–598

    Article  Google Scholar 

  13. Ghadiri N, Baraani-Dastjerdi A, Ghasem-Aghaee N, Nematbakhsh MA (2011) Optimizing the performance and robustness of type-2 fuzzy group nearest-neighbor queries. Mob Inform Syst 7:123–145

    Google Scholar 

  14. Goyal M, Xie W, H H (2011) Ieee 802.15.4 modifications and their impact. Mob Inform Syst 7:69–92

    Google Scholar 

  15. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. SIGMOD Record 14:47–57

    Article  Google Scholar 

  16. Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24:265–318

    Article  Google Scholar 

  17. Huang Y, Garcia-Molina H (2004) Publish/subscribe in a mobile environment. Wireless Netw 10:643–652

    Article  Google Scholar 

  18. Karp B, Kung HT (2000) Gpsr: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th annual international conference on mobile computing and networking, MobiCom ’00. ACM, New York, pp 243–254

  19. Kim Y, Shim Y, Lee K (2011) A cluster-based web service discovery in manet environments. Mob Inform Syst 7:299–315

    Google Scholar 

  20. Köpke A, Swigulski M, Wessel K, Willkomm D, Haneveld PTK, Parker TEV, Visser OW, Lichte HS, Valentin S (2008) 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. ICST, Belgium, pp 71:1–71:8

  21. Ku W, Zimmermann R (2008) Nearest neighbor queries with peer-to-peer data sharing in mobile environments. Pervasive Mob Comput 4(5):775–788

    Article  Google Scholar 

  22. Kulik J, Heinzelman W, Balakrishnan H (2002) Negotiation-based protocols for disseminating information in wireless sensor networks. Wireless Netw 8:169–185

    Article  MATH  Google Scholar 

  23. Lehikoinen J, Salminen I, Aaltonen A, Huuskonen P, Kaario J (2006) Meta-searches in peer-to-peer networks. Pers Ubiquit Comput 10:357–367

    Article  Google Scholar 

  24. Li Y, Chen H, Xie R, Wang JZ (2011) Bgn: a novel scatternet formation algorithm for bluetooth-based sensor networks. Mob Inform Syst 7:93–106

    Google Scholar 

  25. Lim S, Lee W, Cao G, Das CR (2006) A novel caching scheme for improving internet-based mobile ad hoc networks performance. Ad Hoc Netw 4(2):225–239

    Article  Google Scholar 

  26. Luo Y, Wolfson O, Xu B (2008) Mobile local search via p2p databases. In: Proceedings of 2nd IEEE international interdisciplinary conference on portable information devices, pp 1–6

  27. Luo Y, Wolfson O, Xu B (2010) The mobi-dik approach to searching in mobile ad hoc network databases. In: Shen X (eds) Handbook of peer-to-peer networking, Springer Science+Business Media, LLC 2010, vol 9. Springer, Berlin, pp 1105–1123

    Google Scholar 

  28. Mauve M, Widmer A, Hartenstein H (2001) A survey on position-based routing in mobile ad hoc networks. IEEE Netw 15(6):30–39

    Article  Google Scholar 

  29. Melbourne-Hotel-Map (2011) Interactive hotel map. http://melbournehotelmap.com/

  30. Option\(^{\circledR}\) Power considerations for 2g & 3g modules in mid designs (2008). http://www.option.com/en/newsroom/media-center/white-papers/

  31. Padhariya N, Mondal A, Goyal V, Shankar R, Madria SK (2011) Ecotop: an economic model for dynamic processing of top-k queries in mobile-p2p networks. In: Yu J, Kim M, Unland R (eds) Database systems for advanced applications, lecture notes in computer science, vol 6588. Springer, Berlin, pp 251–265

    Google Scholar 

  32. Park K, Valduriez P (2010) Energy efficient data access in mobile p2p networks. IEEE Trans Knowl Data Eng 99:1

    Google Scholar 

  33. Pucha H, Das SM, Hu YC (2004) Ekta: an efficient dht substrate for distributed applications in mobile ad hoc networks. In: Proceedings of sixth IEEE workshop on mobile computing systems and applications, pp 163–173

  34. Safar M, El-Amin D, Taniar D (2011) Optimized skyline queries on road networks using nearest neighbors. Pers Ubiquit Comput 15(8):845–856

    Article  Google Scholar 

  35. Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. SIGMOD Record 29:331–342

    Article  Google Scholar 

  36. Si A, Leong HV (1997) Adaptive caching and refreshing in mobile databases. Pers Ubiquit Comput 1:156–170

    Google Scholar 

  37. Silicon-Press (2011) Third generation (3g) wireless technology brief. http://www.silicon-press.com/briefs/brief.3g/index.html

  38. Visvanathan A, Youn J, Deogun J (2005) Hierarchical data dissemination scheme for large scale sensor networks. In: Processings of 2005 IEEE international conference on communications, vol 5, pp 3030–3036

  39. Waluyo A, Srinivasan B, Taniar D (2003) Global index for multi channel data dissemination in mobile databases. In: Yazici A, Sener C (eds) Computer and information sciences-ISCIS 2003, lecture notes in computer science, vol 2869. Springer, Berlin, pp 212–219

    Chapter  Google Scholar 

  40. Waluyo A, Srinivasan B, Taniar D, Rahayu W (2005) Incorporating global index with data placement scheme for multi channels mobile broadcast environment. In: Yang L, Amamiya M, Liu Z, Guo M, Rammig F (eds) Embedded and ubiquitous computing EUC 2005, lecture notes in computer science, vol 3824. Springer, Berlin, pp 755–764

    Chapter  Google Scholar 

  41. Waluyo A, Taniar D, Rahayu W, Srinivasan B (2009) Mobile service oriented architectures for nn-queries. J Netw Comput Appl 32(2):434–447

    Article  Google Scholar 

  42. Wolfson O, Xu B, Yin H, Cao H (2006) Search-and-discover in mobile p2p network databases. In: Proceedings of the 26th IEEE international conference on distributed computing systems, p 65

  43. Xu B, Vafaee F, Wolfson O (2009) 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. ACM, New York, pp 207–216

  44. Xu B, Wolfson O (2005) Data management in mobile peer-to-peer networks. In: Ng W, Ooi B, Ouksel A, Sartori C (eds) Databases, information systems, and peer-to-peer computing, lecture notes in computer science, vol 3367. Springer, Berlin, pp 1–15

    Chapter  Google Scholar 

  45. Xu Y, Heidemann J, Estrin D (2001) Geography-informed energy conservation for ad hoc routing. In: Proceedings of the 7th annual international conference on mobile computing and networking, MobiCom ’01. ACM, New York, pp 70–84

  46. Yin J, Cao G (2006) Supporting cooperative caching in ad hoc networks. IEEE Trans Mobile Comput 5(1):77–89

    Article  Google Scholar 

  47. Yu X, Pu K, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: Data engineering, 2005. ICDE 2005. Proceedings of 21st international conference on, pp 631–642. doi:10.1109/ICDE.2005.92

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology, Monash University, Clayton, VIC, 3800, Australia

    Thao P. Nghiem, Agustinus Borgy Waluyo & David Taniar

Authors
  1. Thao P. Nghiem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Agustinus Borgy Waluyo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Taniar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thao P. Nghiem.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nghiem, T.P., Waluyo, A.B. & Taniar, D. A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks. Pers Ubiquit Comput 17, 973–985 (2013). https://doi.org/10.1007/s00779-012-0545-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-012-0545-y

Keywords

Search

Navigation