On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A Race-Free Bandwidth Reservation Protocol for QoS Routing in Mobile Ad Hoc Networks
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
On optimality of single-path routes in massively dense wireless multi-hop networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
An on-demand, link-state, multi-path QoS routing in a wireless mobile ad-hoc network
Computer Communications
| Hi-index | 0.00 |
Reservation-based wireless TDMA networks can provide deterministic quality-of-service guarantees to multi-hop data flows. The challenge is to route the flows and schedule appropriate transmission slots in a resource-efficient way. In this paper, we study the fundamental question whether multi-path routing, i.e. concurrent use of multiple paths for transmission of data belonging to the same flow, may yield better solutions to the joint routing and slot scheduling problem than single-path routing approaches. To answer this question, we first define an accurate network model. We then devise a branch-and-bound algorithm that computes optimal multi-path and single-path solutions to the joint routing and slot scheduling problem. We apply the algorithm to a large number of scenarios in randomly generated networks and compare optimal network load and end-to-end delay metric values in order to quantify the benefit of multi-path routing over the single-path approach. Our results show that in the studied settings, it is quite rare for multi-path solutions to surpass the optimal single-path solution. Multi-path routing should therefore not be considered an option to improve performance in reservation-based TDMA networks with random topologies.