Balanced Multipath Source Routing

Authors:
Shreyas Prasad;André Schumacher;Harri Haanpää;Pekka Orponen
Affiliations:
Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland FI-02015;Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland FI-02015;Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland FI-02015;Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland FI-02015
Venue:
Information Networking. Towards Ubiquitous Networking and Services
Year:
2008

Citing 3
Cited 0

Randomized rounding without solving the linear program

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Performance of multipath routing for on-demand protocols in mobile ad hoc networks

Mobile Networks and Applications
Performance Study of a Multipath Routing Method for Wireless Mobile Ad Hoc Networks

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, starting with an approximate optimisation method that guarantees a provable congestion performance bound, and then designing a distributed implementation by modifying the DSR protocol. In this paper, the performance of the resulting Balanced Multipath Source Routing (BMSR ) protocol is validated in a number of simulated networking scenarios. In particular, we study the effect of irregular network structure on the performance of the protocol, and compare it to the performance of DSR and an idealised shortest-path routing algorithm in setups with several source-destination pairs. For all network scenarios we consider, BMSR outperforms DSR significantly. BMSR is also shown to be more robust than the shortest-path algorithm, in that it can distribute the traffic load more evenly in cases where shortest-path routing is impeded by radio interference between proximate paths.