A Hypothesis for Ad-Hoc Routing Algorithm Improvement

Abstract

In this article, a new approach to reducing the complexity of routing algorithms is discussed to improve routing in ad hoc networks. To avoid duplicating the routing process for each data transfer, nodes create binary matrices for each base station and update them when the routing is complete. Routing may be made much simpler using the method given here.