Investigation of Chord Protocol in Peer to Peer-Wireless Mesh Network with Mobility

File sharing in networks is generally achieved using Peer-to-Peer (P2P) applications. Structured P2P approaches are widely used in adhoc networks due to its distributed and scalability features. Efficient mechanisms are required to handle the huge amount of data distributed to all peers. The intrinsic characteristics of P2P system makes for easier content distribution when compared to client-server architecture. All the nodes in a P2P network act as both client and server, thus, distributing data takes lesser time when compared to the client-server method. CHORD protocol is a resource routing based where nodes and data items are structured into a 1- dimensional ring. The structured lookup algorithm of Chord is advantageous for distributed P2P networking applications. However, structured approach improves lookup performance in a high bandwidth wired network it could contribute to unnecessary overhead in overlay networks leading to degradation of network performance. In this paper, the performance of existing CHORD protocol on Wireless Mesh Network (WMN) when nodes are static and dynamic is investigated.




References:
[1] M. Kelaskar, V. Matossian, P. Mehra, D. Paul, and M. Parashar, “A
Study of Discovery Mechanisms for Peer-to-Peer Applications.
[2] Mohamed Hefeeda, “Peer-to-Peer Systems”. School of Computing
Science, Simon Fraser University, Canada.
[3] Stratis Ioannidis, Peter Marbach. “On the Design of Hybrid Peer-to-Peer
Systems” (J). ACM SIGMETRICS Performance Evaluation Review,
2008, 36(1): 157-168.
[4] Bartosz Biskupski, Jim Dowling, “Jan Sacha. Properties and
Mechanisms of Self-Organizing MANET and P2P Systems”. ACM
Transactions on Autonomous and Adaptive Systems (TAAS), 2007,
2(1): 1-34.
[5] Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma and Steven
Lim, “A Survey and Comparison of Peer-to-Peer Overlay Network
Schemes, IEEE Communications Survey and Tutorial”, March 2004.
[6] Ian F. Akyildiz, Xudong Wang, Weilin Wang, “Wireless Mesh
Networks: A Survey, Computer Networks” 47 (2005) 445–487.
[7] J. Jun, M.L. Sichitiu, “The Nominal Capacity of Wireless Mesh
Networks, IEEE Wireless Communications” 10 (5) (2003) 8–14.
[8] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M.
Frans Kaashoek, Frank Dabek, Hari Balakrishnan, “Chord: A Scalable
Peer-to-peer Lookup Protocol for Internet Applications University of
California”.
[9] Xianghan Zheng and Vladimir Oleshchuk, “Improvement of Chord
Overlay for P2Psip-Based Communication Systems, International
Journal of Computer Networks & Communications (IJCNC)”, Vol. 1,
No.3, October 2009.
[10] Jani, H. and C. Gonzalo, “Evaluation of DHTs from the Viewpoint of
Interpersonal Communications, in Proceedings of the 6th International
Conference on Mobile and Ubiquitous Multimedia.” 2007, ACM: Oulu,
Finland.
[11] Karger, D. R., & Ruhl, M. (2005) “Diminished Chord: A Protocol for
Heterogeneous Subgroup Formation in Peer-to-Peer Networks. In Peerto-
Peer Systems III” (pp. 288-297). Springer Berlin Heidelberg.
[12] Zöls, S., Schollmeier, R., Kellerer, W., & Tarlano, A. (2005). “The
Hybrid Chord Protocol: A Peer-to-Peer Lookup Service for Context-
Aware Mobile Applications. In Networking-ICN” 2005 (pp. 781-792).
Springer Berlin Heidelberg.
[13] Burresi, S., Canali, C., Renda, M. E., & Santi, P. (2008, March).
“MeshChord: a Location-Aware, Cross-Layer Specialization of Chord
for Wireless Mesh Networks (Concise Contribution). In Pervasive
Computing and Communications”, 2008. PerCom 2008. Sixth Annual
IEEE International Conference on (pp. 206-212). IEEE.
[14] Novak, D. & Zezula, P. (2006, May). “M-Chord: A Scalable Distributed
Similarity Search Structure. In Proceedings of the 1st International
Conference on Scalable Information Systems” (p. 19). ACM.
[15] Thaalbi, M., Meddahi, A., Bejaoui, T. & Tabbane, N. (2011, October).
“An Enhanced Chord-Based P2P Lookup Protocol for Mobile Ad Hoc
Networks. In Wireless Days (WD)”, 2011 IFIP (pp. 1-5). IEEE.