Robust path routing protocol in mobile ad hoc networks

We propose a novel routing protocol to establish a robust path which has the strongest local backup capability. To obtain this capability, every mobile host (MH) maintains its local connectivity by collecting the information within its two hop neighbors. We also design two mathematical models to evaluate the degree of connectivity between a MH and its two hop neighbors. Our protocol has the following characters: (1) the broken path can be recovered immediately, therefore our protocol is suitable for real time applications, (2) the packet loss rate and the required control packets are both decreased significantly in high mobility environment. All of these characters are important to the Mobile Ad Hoc Networks.