Abstract
The goal of this paper is to make the similarities and differences of Peer-to-Peer (P2P) and Mobile Ad Hoc (MANET) networks clear. Thus we want to show the synergetic potential hidden in these two decentralized and self organizing networks. As well as both networks are established on a different physical layer, both networks hold similarities concerning their routing and network management principles. The reason therefore is, that both of them have to solve a similar goal, namely to provide networking functionalities in a completely unmanaged and decentralized environment. One of the most interesting tasks in these networks is thus how queries are guided through the network. Therefore we concentrate in this work on the different routing algorithms employed in Peer-to-Peer and mobile ad hoc networks. Finally, the similarities of both networks can be used, to bring up the synergetic effects of looking at both networks at the same time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Atkinson, S. Kent. “Security Architecture for the Internet Protocol”. RFC2401. November 1998
O. Bertsekas, R. Gallager, Data Networks, 2nd Edition, Prentice Hall Inc., 1992
The Bluetooth Specification, see http://www.bluetooth.com/dev/specifications.asp
http://www.fasttrack.nu/index_int.html. January 2002
M. Frodigh, P. Johansson, P. Larsson, “Wireless ad hoc networking: The art of networking without a network” Ericsson Review, No. 4, pp. 248–263, 2000.
The Gnutella Protocol Specification v0.4. http://dss.clip2.com/GnutellaProtocol04.pdf. August 2000.
Z. Haas, M. Pearlman, “The Performance of Query Control Schemes for the Zone Routing Protocol”, IEEE/ACM Transactions on Networking, Vol. 9, No. 4, August 2001
J. Jubin, J. Tornow. “The DARPA Packet Radio Network Protocols”, in Proceedings of the IEEE volume 75,1, pages 21–32, Jan 1987
A. Langley. “Freenet”. ”. Appeared in “Peer-to-Peer Harnessing the Power of Disruptive Computing”. Editor: A. Oram. Publisher: O’Reilly & Associates, Incorporated. March 2001
B. Leiner, D. Nielson, “Issues in Packet Radio Network Design, Proceedings of the IEEE Special issue on “Packet Radio Networks”, 75,1:6–20, 1987
Limewire. “Current Network Size”. http://www.limewire.com/historical_size.html. January 2002
The Napster Protocol. http://opennap.sourceforge.net/napster.txt. September 2001
C. Perkins, “Highly Dynamic Destination Sequence Distance Vector Routing (DSDV) for Mobile Computers”, ACM SIGCOMM’94, 1994
C. Perkins, E. Royer, “Ad hoc On demand Distance Vector Routing”, Proceeding of 2nd IEEE Workshop on Mobile Computing Systems and Applications, February 1999
Christpher Rohrs. “Query Routing for the Gnutella Network”. http://www.limewire.com/developer/query_routing/keyword%20routing.htm. December 2001.
S. Saroiu, P. K. Gummadi, S. D. Gribble. “A Measurement Study of Peer-to-Peer File Sharing Systems” Technical Report # UW-CSE-01-06-02. July 2001
R. Schollmeier. “A definition of Peer-to-Peer Networking towards a Delimitation against Classical Client-Server Concepts”. Proceedings of WATM-Eunice 2001. pp. 131–138. 2001.
The IEEE 802.11 Standards, see http://grouper.ieee.org/groups/802/11/
P. Johansson et al. “Scenario Based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks”, Mobicom’ 99, 1999 Seatle, USA
J. Broch et al., “A Performance Comaprison of Multi-Hop Wireless Ad hoc Network Routing Protocols”, MobiCom’ 98, 1998, Dallas, USA
I. Stoica et al “Chord. A scalable peer-to-peer lookup service for Internet applications. Technical Report TR-819, MIT, March 2001
D: Karger et al “Consistent hashing and random trees: Distriubuted caching protocols for relieving hot spots on the World Wide Web”, Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, TX, May 1997), pp. 654–663
P. Druschel, “Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (Elmau/Oberbayern, Germany, May 2001), pp. 65–70
S. Ratnasamy “A scalable content-addressable network” in Proc. ACM SIGCOMM (San Diego, CA, August 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schollmeier, R., Gruber, I., Finkenzeller, M. (2002). Routing in Mobile Ad-hoc and Peer-to-Peer Networks A Comparison. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds) Web Engineering and Peer-to-Peer Computing. NETWORKING 2002. Lecture Notes in Computer Science, vol 2376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45745-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-45745-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44177-9
Online ISBN: 978-3-540-45745-9
eBook Packages: Springer Book Archive