Multipath Routing with Directed Acyclic Graphs in MANETs

Provided by: Creative Commons
Topic: Networking
Format: PDF
An approach for resilient multipath routing with independent directed acyclic graphs is presented in this paper and developed polynomial time algorithms to construct node independent and link independent DAGs using all possible edges in the network. In this multiple pairs of colored trees approaches to prove the validity of the algorithm. The IDAGs approach performs significantly better than the independent trees approach in terms of increasing number of paths offered, reducing the probability of a two-link failure disconnecting a node from the destination and average link load.

Find By Topic