Routing Algorithms in All-Mobile Wireless Networks

Abstract

In networks with mobile radio nodes in which connectivity varies, rapidly with time, it is necessary to develop algorithms for identifying, and maintaining paths between communicating pairs of nodes. Motivated by, earlier work that accomplishes such a task for data gram packet service, we develop a similar algorithm for connection-oriented service. The algorithm establishes circuit routes for initial connection based on a mechanism of short packets exchange and takes advantage of the possibility to convert a connectivity change into a ``soft'' failure to maintain and re-route on-going sessions. In this paper we give a presentation of the algorithm which is currently undergoing extensive simulation-based evaluation. <ul><i> A copy of this report has been published in the proceedings of <br> The 1st Annual Advanced Telecommunications/Information Distribution Research Program Conference, January 21-22, 1997. </i></ul>