A scalable location-aware peer-to-peer system for MANET

Many peer to peer (P2P) systems have been proposed in wired networks. However, they are not directly applicable to wireless networks because of mobility and the lacking of routing mechanism. In this paper, we propose scalable, self-organizing, self-addressing, self-routing and location-a ware peer-to-peer system, abbreviated as SLAP, for mobile wireless ad hoc network (MANET). SLAP solves highly traffic overhead problem. The self-organization mechanism automatically organizes nodes into a tree-based overlay network for scalability. Through the novel addressing scheme, it enables nodes to be roughly aware of its physical location in the underlying network when they have joined in network. Next, the self-routing mechanism in SLAP is based on the longest-prefix matching and soft state routing cache methods to avoid massive control overheads of flooding and reduce length of routing paths, respectively. On final issue, the sharing mechanism proposed in this paper is based on distributed hash function over tree overlay structure. We have implemented a prototyping system to demonstrate the feasibility and efficiently of the SLAP. Simulations show that the SLAP gives promising results

[1]  Ben Y. Zhao,et al.  Tapestry: a fault-tolerant wide-area application infrastructure , 2002, CCRV.

[2]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[3]  Peter Druschel,et al.  Storage management and caching in PAST , 2001 .

[4]  Oliver P. Waldhorst,et al.  A distributed search service for peer-to-peer file sharing in mobile applications , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[5]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[6]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[7]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[8]  Hasan Sözer.  A PEER-TO-PEER FILE SHARING SYSTEM FOR WIRELESS AD-HOC NETWORKS , 2004 .

[9]  Henning Schulzrinne,et al.  Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices , 2001, MobiHoc '01.

[10]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[11]  Michalis Faloutsos,et al.  PeerNet: Pushing Peer-to-Peer Down the Stack , 2003, IPTPS.

[12]  Michalis Faloutsos,et al.  Scalable ad hoc routing: the case for dynamic addressing , 2004, IEEE INFOCOM 2004.

[13]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[14]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[15]  Ramesh Govindan,et al.  Internet path inflation due to policy routing , 2001, SPIE ITCom.

[16]  Mario Gerla,et al.  GloMoSim: A Scalable Network Simulation Environment , 2002 .

[17]  Oliver P. Waldhorst,et al.  A special-purpose peer-to-peer file sharing system for mobile ad hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[18]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[19]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[20]  Karl Aberer,et al.  Improving Data Access in P2P Systems , 2002, IEEE Internet Comput..