Split multipath routing with maximally disjoint paths in ad hoc networks
Hewlett-Packard (United States) · University of California, Los Angeles
Abstract
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols however, build and rely on a single route for each data session. Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process. In QoS routing for wired networks, multiple path routing is popularly used. Multiple routes are however, constructed using link-state or distance vector algorithms which are not well-suited for ad hoc networks. We propose an on-demand routing scheme…
Citation impact
- FWCI
- 43.43
- Percentile
- 100%
- References
- 22
Authors
2Topics & keywords
- Computer network
- Computer science
- Dynamic Source Routing
- Wireless Routing Protocol
- Link-state routing protocol
- Destination-Sequenced Distance Vector routing
- Multipath routing
- Optimized Link State Routing Protocol