Scalable ad-hoc network routing based on the distance-matrix shortest path routing

We present a scalable distance-matrix routing algorithm for clusters of nodes. These clusters are defined by GPS coordinates similar to hierarchical routing and geography based routing. We show that the computation and storage requirement of this distance-matrix routing algorithm is scalable and is substantially reduced for large number of mobile nodes. Optimality of routing is maintained. The effect of geographic proximity is shown to reduce computation, message exchange, and route storage requirements. Also, the reduced number of iterations required also improves on the stability of Bellman-Ford type distributed routing algorithms. We plan to implement an IP routing protocol using existing IP router software such as RIP, allowing such mature software to scale up to much larger number of nodes, to handle node mobility, and to perform many ad-hoc network features.