On the optimization trade-offs of expanding ring search

Authors:
Jahan Hassan;Sanjay Jha
Affiliations:
School of Information Technologies, The University of Sydney, Sydney, NSW, Australia;School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 4
Cited 5

Building shared trees using a one-to-many joining mechanism

ACM SIGCOMM Computer Communication Review
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Routing in ad hoc mobile networks: on-demand and hierarchical strategies

Routing in ad hoc mobile networks: on-demand and hierarchical strategies
Wireless broadband in a box

IEEE Spectrum

Resource discovery in locality-aware group-based semantic overlay of peer-to-peer networks

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Enhanced blocking expanding ring search in mobile ad hoc networks

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Iterative expanding search in multi-agent systems

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Optimal internet auctions with costly communication

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.