Mobile ad hoc P2P file sharing

被引:27
作者
Duran, A [1 ]
Shen, CC [1 ]
机构
[1] Univ Pittsburgh, Dept Math, Pittsburgh, PA 15260 USA
来源
2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: BROADBAND WIRELESS - THE TIME IS NOW | 2004年
关键词
D O I
10.1109/WCNC.2004.1311528
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We propose two efficient search schemes that us query messages filtering/gossiping and adaptive hop-limited search, respectively, for peer-to-peer (P2P) file sharing over mobile ad hoc networks. While the former does network-wide flooding of query messages and is suitable for the applications requiring file update, the latter uses local broadcast transmission and exploits the degree of replication. We compare the first scheme with a Gnutella-like P2P file sharing system [1] in a MANET environment via simulation, and show that the proposed schemes offers less transmission overhead and better scalability. We also qualitatively compare both proposed schemes with ORION [2].
引用
收藏
页码:114 / 119
页数:6
相关论文
共 12 条
[1]  
[Anonymous], P 2 IEEE C PEER TO P
[2]  
[Anonymous], P WORKSH MOB AD HOC
[3]  
CAMP T, 2001, P IEEE INT C COMM IC
[4]  
GOLD R, 2001, P 8 IEEE WORKSH FUT
[5]  
HAAS ZJ, 2002, IEEE INFOCOM
[6]  
KLINGBERG T, 2002, GNUTELLA 0 6 DRAFT
[7]   Flooding in wireless ad hoc networks [J].
Lim, H ;
Kim, C .
COMPUTER COMMUNICATIONS, 2001, 24 (3-4) :353-363
[8]   Adaptive clustering for mobile wireless networks [J].
Lin, CHR ;
Gerla, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1997, 15 (07) :1265-1275
[9]  
RATNASAMY S, 2002, ROUTING ALGORITHMS D
[10]  
SCHOLLMEIER R, 2002, INT WORKSH PEER TO P