Longest life routing protocol (LLRP) for ad hoc networks with highly mobile nodes

Node mobility in ad hoc networks makes the problem of efficiently routing packets quite difficult. Several authors have developed routing protocols for these types of networks but the performance of these protocols suffers if the nodes in the network move at high speeds. We present a protocol that explicitly takes into account the mobility patterns of nodes to construct routes that last for long periods of time. We show that this protocol has the same routing overhead as other on-demand protocols while ensuring that the number of packets lost due to old or improper routes is minimized. The LLRP protocol is shown to be suited for small to medium sized networks (50-100 nodes) where the nodes move at high speeds and the time to link failure is small. We validate our protocol via numerous simulations and compare it against one other popular on-demand routing protocol