A performance comparison of multi-hop wireless ad hoc network routing protocols

Broch, J.; Maltz, David A.; Johnson, David B.; Hu, Yih-Chun; Jetcheva, Jorjeta G.

doi:10.1145/288235.288256

Cited by 3,425 publications

(2,126 citation statements)

References 7 publications

Supporting

Mentioning

2,087

Contrasting

Unclassified

Order By: Relevance

“…On-demand algorithms, such as Ad-Hoc On-Demand Distance Vector Routing (AODV) [37] and Dynamic Source Routing (DSR) [38], are purely reactive: nodes only gather routing information when a data session to a new destination starts, or when a route that is in use fails. Reactive algorithms are generally more scalable since they greatly reduce the overhead [39], but they can suffer from oscillations in performance because they are never prepared for disruptive events. In practice, many algorithms are hybrid algorithms (e.g.…”

Section: Manet Routingmentioning

confidence: 99%

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Ducatelle

Gambardella

Kurant

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in the presence of false and missing alarms. Next, we present two efficient algorithms for mapping an IP network on an optical network in such a way that it is protected against failures at the optical layer. The first algorithm offers a method to formally verify the existence of a solution, contrary to all other heuristics known to date. The second algorithm is a heuristic search that takes capacity constraints in account. Both algorithms are shown to be faster by orders of magnitude than existing solutions. Finally, we develop a new routing algorithm for wireless mobile ad hoc networks, adopting ideas from the Ant Colony Optimization metaheuristic. The routing scheme can adapt to network and traffic changes and uses multipath routing and an efficient local repair mechanism to improve failure resilience.

show abstract

Section: Manet Routingmentioning

confidence: 99%

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Ducatelle

Gambardella

Kurant

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We choose an area that is three times larger [10,11] to avoid the formation of chain-like backbones, which would tend to favour backbone approaches. We verified that chain-like backbones were typically not created by evaluating the backbone topology produced when nodes are not mobile.…”

Section: Simulation Settings 41 the Scenariosmentioning

confidence: 99%

“…It is standard practice to evaluate these algorithms using long-term, constant-bit-rate traffic [4,5,8,[10][11][12]. A key characteristic of this workload is that route discovery is infrequent with its cost amortized over a large number of data packets sent using each route.…”

Section: Introductionmentioning

confidence: 99%

Routing Transient Traffic in Mobile Ad Hoc Networks

Cai

Feeley

Hutchinson

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Recent research shows that the traffic in public wireless networks is mostly transient and bursty. There is good reason to believe that ad-hoc traffic will follow the same pattern as its popularity grows. Unfortunately transient traffic generates route discoveries much more frequently than the well-studied long-term, constant-bit-rate traffic, causing network congestion problems for existing routing protocols. This paper describes the design of a new routing algorithm, called ECBR, that uses hybrid backbone routing in a manner that is well suited to workloads that include transient traffic. Our simulation results show that ECBR outperforms one of the main reactive algorithms (i.e., DSR). We also explain three key features of our algorithm and demonstrate their roles in substantially improving the performance compared to existing backbone routing techniques.

show abstract

“…We used a real-world road map of a section Houston close to Rice University. 1 The area of the section is roughly a square with a side of length 1200 meters. The area of concern may be regarded residential with perpendicular street intersections and a low speed limit shown in Figure 3.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…It is important to use realistic mobility models so that the evaluation results will have a close correlation to the performance when actually deployed. However, the most commonly used mobility model is the Random Waypoint Mobility (RWM) [1], which though being simple and easy to simulate is not very realistic. Recently though, various mobility models have been proposed which attempt to better capture mobility traces than RWM.…”

Section: Introductionmentioning

confidence: 99%