RBR: refinement-based route maintenance protocol in wireless ad hoc networks

Liu, Jain-Shing; Lin, Chun-Hung Richard

doi:10.1016/j.comcom.2004.11.008

Cited by 12 publications

(10 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By restricting the bypass to a very small topological radius, routings overheads are minimized considerably. Other proposed studies aim to change AODV protocol to make it more efficient in relation to performance metrics such as throughput or overhead by utilizing the information from the neighbours to prevent breaks or provide spare routes [19], using formation of clusters [20] or creating a path densely populated with nodes [21]. Although the above studies have proposed new schemes for route recovery of AODV algorithm in case of broken links, none of them made a comparative study between the mechanism already implemented in the original AODV RFC [3] and possible impacts on different degrees of mobility, traffic load and number of source-destination pairs.…”

Section: Related Workmentioning

confidence: 99%

Comparative study of AODV route repair mechanism with impact on node mobility and traffic load in Wireless Mesh Networks

Suhaimi

Mamat

Azzuhri

2010

2010 Australasian Telecommunication Networks and Applications Conference

View full text Add to dashboard Cite

Wireless Mesh Networks (WMNs) have become one of the popular key technology and solution for the new wireless implementation especially for wireless end user. One of the widely used routing protocols in WMNs is Ad-Hoc OnDemand Distance Vector (AODV) protocols. In this paper, we investigate the performance of AODV in situations of link failures due to mobility of nodes and consequent route recovery mechanism using ns2 simulators. We defined a different set of threshold for routing protocols to do local repair based on the link breaks location with respect to the total number of hops from source to destination. Packet Delivery Ratio (PDR) and Normalized Routing Load (NRL) or overhead were used as performance metrics in our simulations. For link-failure detection, HELLO message and Link Layer Feedback (LLF) were used separately in the simulations. Simulations were done by varying the number of sourcedestination pair and speed of the mobile node.

show abstract

Section: Related Workmentioning

confidence: 99%

Comparative study of AODV route repair mechanism with impact on node mobility and traffic load in Wireless Mesh Networks

Suhaimi

Mamat

Azzuhri

2010

2010 Australasian Telecommunication Networks and Applications Conference

View full text Add to dashboard Cite

show abstract

“…Ref. [5] describes a route shortening scheme A-PR 2 that is similar to our active shortening scheme, but the exchange of control packets between the related nodes in A-PR 2 may increase the network traffic. Besides, the stale information in Overhear Table in [5] may not indicate the latest correct network topology, and therefore, the shortening scheme does not always ensure valid short route.…”

Section: A Overview Of the Proposed Automatic Route Shorteningmentioning

confidence: 99%

“…Whereas [5] provides no simulation result to verify the performance of A-PR 2 , we conduct some simulation studies on our two route shortening strategies and the simulation results are shown and analyzed in Section V.…”

Section: A Overview Of the Proposed Automatic Route Shorteningmentioning

confidence: 99%

“…However, the problem of this scheme lies in the detection of received power which is influenced by various factors such as fading, multipath effects and similar random transient phenomena, leading to the false detection and thus bringing unnecessary control packet broadcast in the network. Another example of the proactive route recovery is the Refinement-Based Route maintenance protocol (RBR) [5]. This protocol takes advantage of the promiscuously overheard information and starts a route recovery with pre-emptive local RREQ broadcasting.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks

Liang

Taenaka

Ogawa

et al. 2011

2011 Tenth International Symposium on Autonomous Decentralized Systems

View full text Add to dashboard Cite

In this paper, we propose a relay recovery route maintenance protocol for ad hoc networks to combine the benefits of both proactive and reactive route recovery strategies and to minimize their drawbacks. In our proposal, one or more substitute routes usually become ready for the recovery of every link in a route before its break, while the route recovery process actually starts only when the upstream node of a link confirms the link break. Since this scheme does not broadcast any control packet, it can effectively recover a broken link without heavy control overhead traffic. Also, it helps reduce the time delay due to the recovery, since substitute routes are already available when the upstream node initiates the route recovery process. We further propose two automatic route shortening schemes to optimize the route during successful packet forwarding without causing extra control overhead. We have implemented our proposed schemes based on AODV and compared their performance with competitive schemes including original AODV. Simulation results demonstrate that our proposal definitely reduces the time delay and control overhead traffic in route repairing process, and that the route shortening schemes further leads to shorter time delay and average route length.

show abstract

“…The metric is used to reduce control overhead and routelength repairing processes. Another active monitoring of control message has been reported in [8], where network information is provided by the neighboring node. Scalability control in local-link repair has been demonstrated in [9], used to find alternative routes for next-to-next node, in the event of broken link.…”

Section: Introductionmentioning

confidence: 99%

Towards a Better Approach for Link Breaks Detection and Route Repairs Strategy in AODV Protocol

Azzuhri

Noor

Jamaludin

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

This paper describes a parameterized approach to the Ad Hoc On-Demand Distance Vector (AODV) routing protocol using a network-simulator 2 (ns2). By utilizing two AODV’s protocol functions, which are HELLO messages and local route repair, we explore the more flexible approach on these two important functions, rather than a fixed setting within the default AODV protocol. HELLO message is used to detect the broken link, while the local route repair in AODV is used to fix and discover alternative routes in the event of route failure. In this paper, two functions to optimize AODV performance have been utilized. The first is link break detection time (Llb), using the HELLO message to detect link failure, and the second is link break position parameter (Lbp) for AODV’s local route repair. The results show that the default AODV setting does not yield the best results for most defined network scenarios. In some cases, improvement compared to the default setting can be as high as 38%, for local route repair strategies. This paper presents a potential flexible and parameterized approach for dealing with link breaks and route repairing strategies for AODV protocol.

show abstract

RBR: refinement-based route maintenance protocol in wireless ad hoc networks

Cited by 12 publications

References 21 publications

Comparative study of AODV route repair mechanism with impact on node mobility and traffic load in Wireless Mesh Networks

Comparative study of AODV route repair mechanism with impact on node mobility and traffic load in Wireless Mesh Networks

Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks

Towards a Better Approach for Link Breaks Detection and Route Repairs Strategy in AODV Protocol

Contact Info

Product

Resources

About