Optimising expanding ring search for multi-hop wireless networks

Hassan, Jahan; Jha, Sanjay

doi:10.1109/glocom.2004.1378120

Cited by 28 publications

(22 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hassan and Jha [7] explored to find an optimum TTL threshold L that would minimize the expected bandwidth cost of ERS. They give the following experimental results; search threshold L of 3 is optimum for three categories of networks, that is, large networks with small radius, medium networks with large radius and medium networks with small radius.…”

Section: Related Workmentioning

confidence: 99%

An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks

Hong

Lee

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. AODV routing protocol is intended for use by mobile nodes in adhoc wireless networks. Even though it performs well in static and low-mobility environments, the performance degrades rapidly with increasing mobility. Our primary concern is to enhance the performance of AODV by reducing the volume of the control packets like RREQ and RREP during the route discovery process effectively due to the node mobility. The propagation delays of the all possible links vary according to changes in its topology. Carefully adjusting the values of these network parameters can reduce the occurrences of the control packets. Thus, we propose a novel method of smoothly adjusting them based on AIAD (additive increase additive decrease) under a consideration of current network status. We have tested our proposed method with both the conventional AODV and the method using timestamp based on the three performance metrics; i.e., node mobility, node velocity, and node density, to compare their performances.

show abstract

Section: Related Workmentioning

confidence: 99%

An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks

Hong

Lee

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…they are not organized and independent. Therefore, the search algorithms are less efficient in this family, including Flooding [2,3], Expanding Ring Search [2,3,6,7], Random Walks [2,3,5], etc. Because each node has little information about the resources shared by other nodes, when a node issues a search request, it has to query more nodes to hit the target with higher probability.…”

Section: Introductionmentioning

confidence: 99%

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

Sun

Huang

et al. 2006

Proceedings of the 1st International Conference on Scalable Information Systems - InfoScale '06

View full text Add to dashboard Cite

The resource discovery is a critical component of the P2P file-sharing network. However, because of the huge overhead of locating operation or management, neither the traditional methods, such as Flooding, EPS and Random Walks, provide high performance for this process, nor do the recent ones such as Chord, CAN, and so on. To conquer this problem, locality of the underlying network should be taken into account when constructing the P2P networks. It can shorten the length of routes in network layer and reduce the bandwidth consumed when locating the resource. Meanwhile, semantic overlay is another powerful way to organize the P2P nodes. In the semantic overlay, the nodes with semantically similar content are "clustered" together, which can facilitate the resource discovery. Based on these two characters, we propose a new architecture of resource discovery which incorporates the underlying locality into the semantic overlays using decentralized group concept. The query is processed in the group one by one and the major management operations are in the group. In this way, the globe status maintenance can be avoided. The mathematical analysis and simulation results also show that the performance of new mechanism has been enhanced largely, including average diameter, average management overhead, average searching overhead, and so on.

show abstract

“…Expanding ring algorithm ( Hassan & Jha, 2004) is an extension of the flooding search algorithm. It performs successive flooding searches with an incremental TTL.…”

Section: Uninformed Search Methodsmentioning

confidence: 99%

“…If the TTL is defined very low, on the other hand, one may fail to find resources although they exist in the network. Therefore, many algorithms and approaches have emerged to enhance P2P search performance, for example, UbiSrvInt (Yuan & Chen, 2007), Freenet (Clarke, Sandberg, Wiley, & Hong, 2001), modified breath-first search (BFS) (Kalogeraki et al, 2002;Tsoumakos et al, 2006Tsoumakos et al, , 2003, iterative deepening (Lv et al, 2002;Yang et al, 2002Yang et al, , 2003, expanding ring (Hassan & Jha, 2004), random walk (Gkantsidis, Mihail, & Saberi, 2004), interest cluster (Tong et al, 2005;Borch, 2005;Cohen, Fiat, & Kaplan, 2003), trust-based recommendation (Griffiths, 2006;Li & Kao, 2009), distributed hash table (DHT) Gummadi et al, 2003, JXTA (Juxtapose) (Nottelmann & Fischer, 2007), and grid architecture (Tsai & Hung, 2009). However, as more information is added into the Internet in an increasingly rapid speed, how to facilitate P2P search performance always deserves emphasis and research.…”

Section: Introductionmentioning

confidence: 99%