Paper Info
Title
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 is impeded by radio interference between proximate paths.
Year
DOI
Venue
2007
10.1007/978-3-540-89524-4_32
ICOIN
Keywords
Field
DocType
irregular network structure,idealised shortest-path,shortest-path routing,network scenario,provable congestion performance,traffic load ideally,traffic load,wireless multihop network,dsr protocol,shortest-path algorithm,balanced multipath source routing,source routing,shortest path
Multipath routing,Dynamic Source Routing,Computer science,Static routing,Enhanced Interior Gateway Routing Protocol,DSRFLOW,Computer network,Wireless Routing Protocol,Distributed computing,Zone Routing Protocol,Routing protocol
Conference
Volume
ISSN
Citations 
5200
0302-9743
2
PageRank 
References 
Authors
0.39
5
4
Name
Order
Citations
PageRank
Shreyas Prasad1212.35
André Schumacher2717.26
Harri Haanpää3336.37
Pekka Orponen466076.80