Skip to main content
Log in

MANET adaptive structured P2P overlay

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

This paper presents an efficient structured P2P overlay over MANET which better matches to the physical network in term of routing. This feature is achieved by locally building up the minimum-spanning tree (MST) at each peer using the information of the peer’s logical neighbors which are either directly connected (1-hop) or 2-hops away. Using this interconnection structure among the peers, we design a new algorithm to distribute the contents information in the overlay by partitioning the identifier (ID) space among the peers. In this algorithm, each peer maintains a disjoint portion of the ID space. The ID space at a peer may be non-contiguous and each contiguous part is consecutive to the ID space of its directly connected neighbor peers. To route the file-lookup query, each peer builds up a binary search tree (BST) using the knowledge of the ID space of itself and of its directly connected neighbor peers. Simulation results show that our approach outperforms the existing approaches in term of routing overhead, average file-discovery delay, false-negative ratio and average path-stretch value.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. www.isi.edu/nsnam

  2. http://net.cs.uni-bonn.de/wg/cs/applications/bonnmotion/

References

  1. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 01 conference, San Diego, California, USA

  2. Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM international conference on distributed systems platforms (Middleware), Germany

  3. Pourebrahimi B, Bertels KLM, Vassiliadis S (2005) A survey of peer-to-peer networks. In: Proceedings of the 16th annual workshop proRisc

  4. Ripeanu M, Foster I, Iamnitchi A (2002) Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design. IEEE Int Comput J 6(1):85–93 (special issue on peer-to-peer networking)

    Google Scholar 

  5. Meshkova E, Riihijrvi J, Petrova M, Mhnen P (2008) A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput Networks 52(11):2097–2128. ISSN:1389-1286

    Article  Google Scholar 

  6. Oliveira LB, Siqueira IG, Loureiro AF (2005) On the performance of ad hoc routing protocols under a peer-to-peer application. J Parallel Distrib Comput 65(11):1337–1347

    Article  Google Scholar 

  7. da Hora DN, Macedo DF, Oliveira LB, Siqueira IG, Loureiro AAF, Nogueira JM, Pujolle G (2009) Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks. Comput Commun 32(13–14):1445–1459

    Article  Google Scholar 

  8. Kummer R, Kropf P, Felber P (2006) Distributed lookup in structured peer-to-peer ad-hoc networks. In: Proceeding of the OTM conferences, vol 2, pp 1541–1554

  9. Li M, Chen E, Sheu PC-y (2006) A chord-based novel mobile peer-to-peer file sharing protocol. In: Proceeding of 8th asia-pacific web conference, Harbin, China, 16–18 January 2006

  10. Hwang RH, Hoh CC (2009) Cross-layer design of P2P file sharing over mobile ad hoc networks. Telecommun Syst 42:47–61. doi:10.1007/s11235-009-9168-7

    Article  Google Scholar 

  11. Sozer H, Tekkalmaz M, Korpeoglu I (2009) A peer-to-peer file search and download protocol for wireless ad hoc networks. Comput Commun 32(1):41–50, Elsevier

    Article  Google Scholar 

  12. Lee U, Park JS, Lee SH, Ro WW, Pau G, Gerla M (2008) Efficient peer-to-peer file sharing using network coding in MANET. J Commun Netw 10(4):422–429

    Google Scholar 

  13. Shin M, Arbaugh WA (2009) Efficient peer-to-peer lookup in multi-hop wireless networks. In: KSII transactions on internet and information systems, vol 3, pp 5–25

  14. Shah N, Qian D (2010) An efficient structured P2P overlay over MANET. In: MobiDE, ninth international ACM workshop on data engineering for wireless and mobile access (in conjunction with SIGMOD/PODS 2010), Indianapolis, Indiana, USA

  15. Clausen T, Jacquet P (2003) Optimized link-state routing protocol. In: IETF RFC-3626

  16. Perkins C, Belding-Royer E, Das S (2003) Ad hoc on-demand distance vector (AODV) routing. In: RFC 3561

  17. Deng J, Zuyev S (2008) On search sets of expanding ring search in wireless networks. Ad Hoc Networks 6(7):1168–1181

    Article  Google Scholar 

  18. Macedo DF, dos Santos AL, Nogueira JM, Pujolle G (2011) Fuzzy-based load self-configuration in mobile P2P services. Comput Networks 55(8):1834–1848

    Article  Google Scholar 

  19. Liang J-C, Chen J-C, Zhang T (2011) An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks. Wirel Netw 17(2):437–452

    Article  MathSciNet  Google Scholar 

  20. Lee S-B, Wong SHY, Lee K-W, Lu S (2011) Content management in a mobile ad hoc network: beyond opportunistic strategy. In: Infocom, Shanghai, China

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nadir Shah.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shah, N., Qian, D. & Wang, R. MANET adaptive structured P2P overlay. Peer-to-Peer Netw. Appl. 5, 143–160 (2012). https://doi.org/10.1007/s12083-011-0115-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-011-0115-5

Keywords

Navigation