Disjoint routes for on demand routing protocols in ad hoc networks

Wireless mobile networks are characterized by stochastic topology variations. Sudden movements of mobile hosts in and out of each other´s range impose limitations on the system performance. Routing protocols have been proposed for producing stable routes. All these protocols address the issue of route stability rather than connection stability. This paper proposes a new protocol for enhancing stability of connections rather than routes, without increasing the related overhead. The new protocol is based on the employment of a number of disjoint paths in each route discovery phase. Its performance is evaluated by simulations in the Java programming language that present adaptability to increased mobility