Reducing Latency and Overhead of Route Repair with Controlled Flooding

Costa, Luís Henrique M. K.; Amorim, Marcelo Dias de; Fdida, Serge

doi:10.1023/b:wine.0000028539.73976.64

Cited by 22 publications

(27 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [7], authors have proposed to create backup routes around the main original route by using a controlled flooding framework (AODV-CF). Hence, an alternate route is immediately available without the need to re-flood the network.…”

Section: Local Route Repairmentioning

confidence: 99%

On-Demand Routing Protocol with Tabu Search Based Local Route Repair in Mobile Ad Hoc Networks

Sayad

Aı̈ssani

Bouallouche-Medjkoune

2015

Wireless Pers Commun

View full text Add to dashboard Cite

This paper tackles the routing issue in mobile ad hoc networks by introducing a novel approach. The most challenging issue, when designing a routing protocol in this context, is the mobility of nodes, which engenders frequent links breakage. Therefore, most of research effort in this field should be conducted in this sense so that routing protocol will not be affected by route failures caused by link disconnections. The proposed routing protocol, called on-demand routing protocol with tabu search based local route repair, uses an intelligent technique to locally repair the failed routes. The idea is to connect the two parts of the failed route using minimum overhead and without generating loops. Hence, when a route is failed, a special packet containing a tabu list of upstream nodes (nodes of the first part the route) is launched with a minimum time-to-leave value. The motivation on using a local route repair approach rather than a new route discovery process is to save delay and to reduce control packet overhead, which leads to less network contention and less packets drop. However, this technique can lead longer routes between nodes, consequently, network performances will be worsened. To avoid this kind of situation, destination node invalidates the route when the number of repairs overtakes a given limit. Simulation results demonstrate that our proposed protocol achieves better in terms of communication delay, packet delivery ratio and control packet overhead than existing AODV-BFABL, DSR and AOMDV.

show abstract

Section: Local Route Repairmentioning

confidence: 99%

On-Demand Routing Protocol with Tabu Search Based Local Route Repair in Mobile Ad Hoc Networks

Sayad

Aı̈ssani

Bouallouche-Medjkoune

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…AODV, one of the most popular ad hoc routing protocols, implements both of the two schemes. Other examples are controlled flooding [15], height-based recovery [8], witness-aided recovery [9] and neighbor aware source routing [14].The problem of reactive route recovery is the unavoidable time delay caused by the reactive route discovery procedure and the large control overhead resulted by the broadcasting scheme.…”

Section: Related Workmentioning

confidence: 99%

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

“…This strategy, however, incurs in route discovery latency and cannot guarantee that overhead is indeed lower than in the proactive case. If route failures often happen, then overhead becomes high because route discovery procedures are repeatedly triggered [8,9,10,11].…”

Section: Introductionmentioning

confidence: 99%

A routing protocol suitable for backhaul access in wireless mesh networks

2012

Self Cite

View full text Add to dashboard Cite

This work proposes the Wireless-mesh-network Proactive Routing (WPR) protocol for wireless mesh networks, which are typically employed to provide backhaul access. WPR computes routes based on link states and, unlike current routing protocols, it uses two algorithms to improve communications in wireless mesh networks taking advantage of traffic concentration on links close to the network gateways. WPR introduces a controlled-flooding algorithm to reduce routing control overhead by considering the network topology similar to a tree. The main goal is to improve overall efficiency by saving network resources and avoiding network bottlenecks. In addition, WPR avoids redundant messages by selecting a subset of one-hop neighbors, the AMPR * Corresponding author.Email addresses: miguel@gta.ufrj.br (Miguel Elias M. Campista), luish@gta.ufrj.br (Luís Henrique M. K. Costa), otto@gta.ufrj.br (Otto Carlos M. B. Duarte) Preprint submitted to Computer NetworksAugust 4, 2011 (Adapted MultiPoint Relay), needed to reach all two-hop ones. We first analyze the proposed algorithms compared with the algorithms used by OLSR for the same tasks in terms of running time, optimality, and number of routing messages. Results show that the algorithms proposed by WPR are more efficient than the algorithms used by OLSR in running time and number of routing messages. In addition, we also perform simulations to evaluate the performance of WPR. Results reveal that the aggregated throughput of WPR outperforms OLSR by up to 27% using a combination of web and backbone internal traffic despite our design assumption of traffic convergence toward gateways.

show abstract

Reducing Latency and Overhead of Route Repair with Controlled Flooding

Cited by 22 publications

References 22 publications

On-Demand Routing Protocol with Tabu Search Based Local Route Repair in Mobile Ad Hoc Networks

On-Demand Routing Protocol with Tabu Search Based Local Route Repair in Mobile Ad Hoc Networks

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

A routing protocol suitable for backhaul access in wireless mesh networks

Contact Info

Product

Resources

About