A Study of Routing based on Adjacency Matrix in Ad hoc Networks

Abstract

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix.In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search. (a) 0 0 0 2 2 2 1 1 0

A cost matrix agent for shortest path routing in ad hoc networks

“…The node which receives the query message transmits a reply message to its parent node when it receives the reply message from all neighbor nodes or the wait time is completed. The wait time of nodes is shown at Lee et al, 2008. When the node transmits a reply message, it forms the adjacency-cost matrix, based on its information about the neighbor node and on the collected information about the neighbor node till then and transmits the adjacency-cost matrix to its parent node. Fig.…”