A Routing Protocol Based on Adjacency Matrix in Ad Hoc Mobile Networks

Ad hoc network is self-organized network which distinguished by the randomly changing topology. So the routing protocol for ad hoc wireless network must be adaptive to frequent topology changes caused by the nodes mobility. But if every node maintains the whole topology information, the routing update must involve a huge state propagation control overhead. For this problem, on-demand routing protocols mainly execute the path-finding and communication process only when it is required, in which the maintenance overhead can be decreased efficiently. Since each new connection requires a new route discovery process, the on-demand routing mechanism can bring about a high delay for connection setup and bandwidth consumption. In this paper, we propose a routing protocol based on adjacency matrix. The agent node gathers topology knowledge and creates the adjacency matrix for topology. All available routes from a source to a destination can be calculated using the adjacency matrix, which is updated periodically or on-demand. All the nodes in the network maintain the adjacency matrix distributed from the agent. The efficiency and performance of the proposed routing protocol are verified by computer simulations.