Balanced Multipath Source Routing

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 i...

• Type: Conference
• Year: 2007
• Where: ICOIN
• Authors: Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen
• Keywords: ICOIN 2007, Provable Congestion Performance, Shortest-path Routing, Traffic Load, Wireless Networks