DynaMO: A Topology-Aware P2P Overlay Network for Dynamic, Mobile Ad-Hoc Environments
Due to the key differences between wired and ad-hoc wireless networks, traditional networking services and techniques are not always easily portable from an infrastructure based network to a wireless environment. One of the most prominent examples is the TCP transport protocol, which performs only poorly in wireless ad-hoc networks. The Peer-to-Peer (P2P) overlay networks recently developed all target the Internet where a lot of performance issues can be neglected or can be completely ignored. In addition, assumptions made for infrastructure based networks cannot be made in an ad-hoc environment, such as a fixed set of nodes which are always available. This article presents a P2P network tailored towards mobile ad-hoc environments. It utilizes proximity information to efficiently generate an overlay structure which reflects the underlying physical network topology. This way, physical routing path lengths stretched by the overlay routing process are reduced. As a novelty it does not rely on a fixed set of nodes and adapts to changes in the physical network topology. A prominent property of the overlay construction process is that the communication overhead is reduced to a minimum. Additionally, the P2P network presented maintains an even Overlay ID distribution which is deliberately given up by some solutions previously developed for wired networks. The basis of this new overlay network is Pastry, a P2P substrate based on the concept of a distributed hash table. Two different bootstrap strategies were developed and analyzed, both explicitly designed to work in dynamic and mobile networks such as ad-hoc networks.
Unable to display preview. Download preview PDF.
- M. Castro et al., Exploiting network proximity in peer-to-peer overlay networks, in: Internat. Work-shop on Future Directions in Distributed Computing (FuDiCo) (2002).Google Scholar
- D.B. Johnson and D.A. Maltz, Dynamic source routing in ad-hoc wireless networks, in: Mobile Com-puting, Vol. 353, eds. Imielinski and Korth (Kluwer Academic, Dordrecht, 1996).Google Scholar
- Omnet++, Discrete event simulation system, http://www.omnetpp.org (2003).Google Scholar
- C.E. Perkins, Ad-hoc on-demand distance vector routing, http://people.nokia.net/charliep/ (2003).Google Scholar
- S. Ratnasamy et al., A scalable content-addressable network, in: Proc. of ACM SIGCOMM (2001).Google Scholar
- S. Ratnasamy et al., Topologically-aware overlay construction and server selection, in: IEEE INFO-COM (2002).Google Scholar
- J. Ritter, Why Gnutella cannot scale, no, really, http://www.darkridge.com/jpr5/doc/ gnutella.html (2001).Google Scholar
- A. Rowstron and P. Druschel, Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems, in: Internat. Conf. on Distributed Systems Platforms, Middleware (2001).Google Scholar
- I. Stoica et al., Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proc. of ACM SIGCOMM (2001).Google Scholar
- The Gnutella protocol specification v0.4, www9.limewire.com/developer/gnutella_ protocol_0.4.pdf (2001).Google Scholar
- M. Waldvogel and R. Rinaldi, Efficient topology-aware overlay network, in: SIGCOMM/CCR 2003.Google Scholar
- Z. Xu, C. Tang and Z. Zhang, Building topology-aware overlays using global soft-state, in: ICDSC'2003.Google Scholar
- B.Y. Zhao, J.D. Kubiatowicz and A.D. Joseph, Tapestry: An infrastructure for fault-resilient wide-area location and routing, Technical Report UCB//CSD–01–1141, Berkeley (2001).Google Scholar