Load-balancing in MANET shortest-path routing protocols
β Scribed by Oussama Souihli; Mounir Frikha; Mahmoud Ben Hamouda
- Book ID
- 104000137
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 970 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1570-8705
No coin nor oath required. For personal study only.
β¦ Synopsis
Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, heavily-loaded nodes may make up a bottleneck that lowers the network performances by congestion and larger delays. Regrettably, load-balancing is a critical deficiency in MANET shortest-path routing protocols, as nodes at the center of the network are much heavily-loaded than the others. Thus, we propose, in this paper, load-balancing mechanisms that push the traffic further from the center of the network. Basically, we provide novel routing metrics that take into account nodes degree of centrality, for both proactive and reactive routing protocols. Simulations show that the proposed mechanisms improve the load distribution and significantly enhance the network performances in terms of average delay and reliability.
π SIMILAR VOLUMES
We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in Ε½ . O C q D q log N steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for
## Abstract Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees (SPT) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low perβdestination cost of such tree