Mobile ad hoc P2P file sharing

Wc propose two efficient search schemes that use 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 [T. Klingberg and R. Manfredi, 2002] 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 [A. Klemm et al., Mar. 2003].