On Self Adaptive Routing in Dynamic Environments- An Evaluation and Design Using a Simple, Probabilistic Scheme

Recently the authors have seen an emergent trend of self adaptive routing in both Internet and wireless ad hoc networks. Although there are previous methods for computing the traffic equilibria of self adaptive routing (e.g., selfish routing), these methods use computationally demanding algorithms and require that a precise analytical model of the network be given. Also, it remains an open question how to design an adaptive routing scheme which ensures convergence to traffic equilibria in practice. In this paper the authors propose a simple, efficient, distributed probabilistic routing scheme for self adaptive routing in dynamic, realistic environments.

Provided by: Yale University Topic: Mobility Date Added: Jan 2011 Format: PDF

Find By Topic