Browse > Article
http://dx.doi.org/10.12673/jant.2011.15.6.1015

Cluster-based P2P scheme considering node mobility in MANET  

Wu, Hyuk (한국항공대학교 항공전자 및 정보통신공학부)
Lee, Dong-Jun (한국항공대학교 항공전자 및 정보통신공학부)
Abstract
Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.
Keywords
Clustering; MANET; Mobility; Mobile;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 J. S. Han, K. J. Lee, J. W. Song, and S. B. Yang, "Mobile Pee-to-Peer systems using Super Peers for Mobile Environments", ICOIN'2008, pp. 1-4, Jan. 2008.
2 A. K. H. Leung, and Y. K. Kwok, "An Efficient and Practical Greedy Algorithm for Server-Peer selection in Wireless Peer-to-Peer File Sharing Networks", MSN 2005, LNCS 3794, pp. 1016-1025, 2005.
3 D. Puppin, S. Moncelli, R. Baraglia, N. Tonellotto, and F. Silvestri, "A Grid Information Service Based on Peer-to-Peer", Euro-Par 2005, LNCS 3648, pp. 454-464, 2005.
4 Gnutella Forums, http://www.gnutelliums.com/.
5 S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network", Proc. ACM SIGCOMM Conf. 2001, pp. 161-172, 2001.
6 I. Stoica, R. Morris, D. Karger, M. Kaashoek, and Balakrishnan, H, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications", Proc. ACM SIGCOMM Conf. 2001, pp. 149-160, 2001.
7 A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Largescale Peer-to-Peer Systems," in IFIP/ACM Int'l Conf. on Distr. Systems Platforms (Middleware) 2001, pp. 329-350, 2001.
8 B. Yang and H. G. Molina, "Designing a Super-Peer Network", Proc. of ICDE 2003.
9 J. H. Kim, J. W. Song, T. H. Kim, J. H. Lee, K. J. Lee, J. S. Han and S. B. Yang, "Reliability Schemes for P2P Systems in Dynamic Mobile Environments", Computer Science and its Applications, CSA '08. pp. 338-342, 2008.
10 L. Viennot, P. Jacquet and T. H. Clausen, "Analyzing control traffic overhead versus mobility and data traffic activity in mobile ad-hoc network protocols", Wireless networks, vol. 10, pp. 447-455, 2004.
11 D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, "On generating all maximal independent sets", Information Processing Letters 27, 1988.
12 J. H. Im, and D. J. Lee, "Optimal number of 1-hop neighbor nodes considering routing overhead in ad hoc networks," In Proceedings of IEEE PIMRC, 2009.
13 J. Y. Yu, P. H. J. Chong. "A survey of clustering schemes for mobile ad hoc network", IEEE Communications Surveys & Tutorials, 2005.
14 B. Jabbari, "Teletraffic aspects of evolving and next-generation wireless communication networks," IEEE Personal Communications, vol. 3, pp. 4-9, Dec. 1996.
15 H, Wu and D.J. Lee, "Optimal cluster formation in Cluster-based mobile P2P algorithm", Journal of Korea Navigation Institute, vol. 15, no. 2, pp. 204-212, 2011.