Advertisement

Mobility Pattern Based Chord (MP-Chord) for Enhanced Lookup Performance in Mobile P2P Networks

  • Mahendra SinghEmail author
  • Chiranjeev Kumar
  • Prem Nath
Article
  • 3 Downloads

Abstract

The peer-to-peer (P2P) systems are mainly designed for wired networks. These networks suffer from many challenges like malicious content distribution, free riding, whitewashing, poor search scalability, lack of a robust trust model, etc. The churn of the nodes makes topology management and searching resource more puzzling. When P2P protocols are implemented for mobile networks, it adds more challenges, specially the mobility management of the mobile users, intermittent connection, and limited bandwidth. Chord based protocols are widely deployed in the P2P networks but Chord can’t perform well in the mobile P2P networks due to mobility of the users. The frequent join and depart of the mobile users creates Chord lookup failure and induces more cost to maintain the finger table. The mobility pattern of the mobile users can be considered to enhance of the Chord lookup performance for mobile P2P networks. It has been observed that most of the mobile users in the urban cities follow fixed mobility pattern which can be utilized to enhance the Chord performance. We have proposed a Mobility Pattern based Chord (MP-Chord) scheme for structured mobile P2P networks. We have presented analytical modelling and performance analysis of the proposed scheme and existing schemes and found that the proposed scheme performs better than the existing Chord-based schemes for mobile P2P networks.

Keywords

MP-Chord Mobile P2P networks Mobility pattern Finger table 

Notes

References

  1. 1.
    The Napster homepage. https://en.wikipedia.org/wiki/Napster. Accessed 11 May 2019.
  2. 2.
    Open Source Community. The free network project - rewiring the internet. http://freenet.sourceforge.net/. Accessed 13 Aug 2019.
  3. 3.
  4. 4.
    BitTorrent. http://www.bittorrent.com/. Accessed 13 Aug 2019.
  5. 5.
    Hari, B., Frans, M., & David, K. (2003). Looking up data in P2P system. Communication of the ACM, 46, 43–48.Google Scholar
  6. 6.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., et al. (2003). Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networks, 11(1), 17–32.CrossRefGoogle Scholar
  7. 7.
    Rowstron, A., & Druschel, P. (2001). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany (pp. 329–350).Google Scholar
  8. 8.
    Zhao, B. Y., Kubiatowicz, J. D. Joseph, A. D., & Bartlett, P. (2001). Tapestry: An infra-structure for fault-resilient wide-area location and routing. Computer Science Division, University California, Berkeley, CA, Technical Report UCBI/CSD-01-1141, 2001. http://discus.anu.edu.au/ml/index.html.
  9. 9.
    Dabek, F. (2005). A distributed hash table. Ph.D. dissertation, Massachusetts Institute of Technology (MIT), Cambridge, MA.Google Scholar
  10. 10.
    Huang, C.-M., Hsu, T.-H., & Hsu, M.-F. (2007). Network-aware P2P file sharing over the wireless mobile networks. IEEE Journal on Selected Areas in Communication, 25(1), 204–210.CrossRefGoogle Scholar
  11. 11.
    Nath, P., & Kumar, C. (2014). Adaptive mobility anchor point to reduce regional registration and packets delivery costs. Computers and Electrical Engineering, 40(4), 1329–1343.CrossRefGoogle Scholar
  12. 12.
    Si, P., Yu, F. R., Ji, H., & Leung, V. C. M. (2010). Distributed multisource transmission in wireless mobile peer-to-peer networks: A restless-bandit approach. IEEE Transactions on Vehicular Technology, 59(1), 420–430.CrossRefGoogle Scholar
  13. 13.
    Park, K., & Valduriez, P. (2011). Energy efficient data access in mobile P2P networks. IEEE Transactions on Knowledge and Data Engineering, 23(11), 1619–1634.CrossRefGoogle Scholar
  14. 14.
    Dao, L. H., & Kim, J. (2006). AChord: Topology-aware Chord in anycast-enabled networks. In Proceedings of IEEE ICHIT, Gwangju, Korea (pp. 334–341).Google Scholar
  15. 15.
    Chao, F., Zhang, H., Du, X., & Zhang, C. (2011). Improvement of structured P2P routing algorithm based on NN-Chord. In Proceedings 7th International Conference on WiCOM, Zhengzhou, China (pp. 1–5).Google Scholar
  16. 16.
    Woungang, I., Tseng, F.-H., Lin, Y.-H., Chou, L.-D., Chao, H.-C., & Obaidat, M. S. (2015). MR-Chord: Improved chord lookup performance in structured mobile P2P networks. IEEE Systems Journal, 9(3), 743–751.CrossRefGoogle Scholar
  17. 17.
    Wu, Y. C., Liu, C. M., & Wang, J. H. (2008). Enhancing the performance of locating data in Chord-based P2P systems. In Proceedings 14th IEEE ICPADS, Melbourne, VIC, Australia (pp. 841–846).Google Scholar
  18. 18.
    Liu, C. L., Wang, C. Y., & Wei, H. Y. (2010). Cross-layer Mobile Chord P2P protocol design for VANET. International Journal of Ad Hoc Ubiquitous Computing, 6(3), 150–163.CrossRefGoogle Scholar
  19. 19.
    Hailun, X., Ning, W., & Zhimin, Z. (2013). Neighbour peer selection scheme based on effective capacity for mobile peer-to-peer streaming. China Communications, 10, 89–98.CrossRefGoogle Scholar
  20. 20.
    Fanelli, M., Foschini, L., Corradi, A., & Boukerche, A. (2013). Self-adaptive context data distribution with quality guarantees in mobile P2P networks. IEEE Journal on Selected Areas in Communication/Supplement, 31(9), 115–131.CrossRefGoogle Scholar
  21. 21.
    Chen, S., Qiao, Y., Chen, S., & Li, J. (2013). Estimating the cardinality of a mobile peer-to-peer network. IEEE Journal on Selected Areas in Communication, 31(9), 359–368.CrossRefGoogle Scholar
  22. 22.
    Wang, S., Liu, M., Cheng, X., Li, Z., Huang, J., & Chen, B. (2013). Opportunistic routing in intermittently connected mobile P2P networks. IEEE Journal on Selected Areas in Communication/Supplement, 31(9), 369–378.CrossRefGoogle Scholar
  23. 23.
    Shen, H., Li, Z., & YuTo, L. (2015). A P2P-based market-guided distributed routing mechanism for high-throughput hybrid wireless networks. IEEE Transactions on Mobile Computing, 14(2), 245–260.CrossRefGoogle Scholar
  24. 24.
    Hu, Y. C., Das, S. M., & Pucha, H. (2005). Peer-to-Peer overlay abstractions in MANETs. In J. Wu (Ed.), Theoretical and algorithmic aspects of sensor, ad-hoc wireless and peer-to-peer networks (pp. 858–871). Boca Raton: CRC Press.Google Scholar
  25. 25.
    Perkins, C., Belding-Royer, E., & Das, S. (2003). RFC3561: Ad hoc on-demand distance vector (AODV) routing. http://www.ietf.org/rfc/rfc3561.txt. Accessed 13 Aug 2019.
  26. 26.
    Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless networks. In T. Imielinski & H. Korth (Eds.), Mobile computing (pp. 153–181). Norwell, MA: Kluwer.CrossRefGoogle Scholar
  27. 27.
    Pollini, G. P., & Chih-Lin, I. (1997). A profile-based location strategy and its performance. IEEE Journal in Selected Areas Communications, 15(8), 1415–1424.CrossRefGoogle Scholar
  28. 28.
    Ma, W., & Fang, Y. (2004). Dynamic hierarchical mobility management strategy for mobile IP networks. IEEE Journal on Selected Areas in Communications, 22(4), 664–676.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology (ISM)DhanbadIndia
  2. 2.Department of Computer EngineeringMizoram UniversityAizawlIndia

Personalised recommendations