Mobility Pattern Based Chord (MP-Chord) for Enhanced Lookup Performance in Mobile P2P Networks
- 4 Downloads
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.
KeywordsMP-Chord Mobile P2P networks Mobility pattern Finger table
- 1.The Napster homepage. https://en.wikipedia.org/wiki/Napster. Accessed 11 May 2019.
- 2.Open Source Community. The free network project - rewiring the internet. http://freenet.sourceforge.net/. Accessed 13 Aug 2019.
- 3.https://en.wikipedia.org/wiki/Gnutella. Accessed 13 Aug 2019.
- 4.BitTorrent. http://www.bittorrent.com/. Accessed 13 Aug 2019.
- 5.Hari, B., Frans, M., & David, K. (2003). Looking up data in P2P system. Communication of the ACM, 46, 43–48.Google Scholar
- 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.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.Dabek, F. (2005). A distributed hash table. Ph.D. dissertation, Massachusetts Institute of Technology (MIT), Cambridge, MA.Google Scholar
- 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.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
- 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
- 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.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.