Sciweavers

Share
CJ
2011

Dynamic Multipath Allocation in Ad Hoc Networks

7 years 10 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/…) from a source to a destination travel in two or more maximal disjoint paths. Observe that the need to find a set of maximal disjoint paths can be relaxed by finding a set of paths S wherein only bottlenecked links are bypassed. In the proposed model we assume that there is only one edge along a path in S as a bottleneck and show that by selecting random paths in S the probability that bottlenecked edges get bypassed is high. We have extended the MRA protocol to use multipath routing by maintaining a set of random routing trees from which random paths can be easily selected. Random paths are allocated/released by threshold rules monitoring the session quality. The simulations show that: 1) session QoS is significantly improve, 2) the fact that many sessions use multiple paths in parallel does not depredate...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
Added 25 Aug 2011
Updated 25 Aug 2011
Type Journal
Year 2011
Where CJ
Authors Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
Comments (0)
books