Abstract
In decentralized and unstructured networks, such as peer-to-peer and Ad-hoc wireless networks, broadcasting of queries is frequently used for obtaining required information. However, because of the inherent overhead of broadcasting in terms of bandwidth, energy, and processing power consumption, various techniques are used to minimize those overhead. Expanding Ring Search (ERS) is one such technique. Although ERS helps to reduce the overhead of broadcasting, it does not reduce the expected locating time. In this paper, we analyze the locating time and overhead that are two contradicting metrics of ERS performance.
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
The gnutella protocol specification v0.4 (2000), http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf
Carlberg, K., Crowcroft, J.: Building shared trees using a one-to-many joining mechanism. ACM Computer Communication Review, 5–11 (1997)
Hassan, J., Jha, S.: Optimising Expanding Ring Search for Multi-Hop Wireless Networks. In: Proceedings of IEEE GLBECOM (2004)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Mobile Computing, vol. 353. Kluwer Academic Publishers, Dordrecht (1996)
Schrick, B., Riezenman, M.: Wireless broadband in a box. IEEE Spectrum (6), 34–43 (2002)
Perkins, C.E., Royer, E., Das, S.: Ad hoc On-Demand Distance Vector (AODV) Routing, IETF Request For Comment (July 2003), www.ietf.org/rfc/rfc3561.txt
Palmer, C.R., Steffan, J.G.: Generating network topologies that obey power laws. In: Proceedings of IEEE GLOBECOM (November 2000)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of the International Conference on Supercomputing (June 2002)
Royer, E.: Routing in Ad-hoc Mobile Networks: On-Demand and Hierarchical Strategies, Ph.D Thesis, University of California at Santa Barbara (December 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassan, J., Jha, S. (2004). On the Optimization Trade-Offs of Expanding Ring Search. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-30536-1_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24076-1
Online ISBN: 978-3-540-30536-1
eBook Packages: Computer ScienceComputer Science (R0)