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


KIPS Transactions on Computer and Communication Systems, Vol. 15, No. 6, pp. 531-538, Dec. 2008
10.3745/KIPSTC.2008.15.6.531,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. S. Lee, J. M. Kim, H. J. Park and C. G. Kim, "A Study of Routing based on Adjacency Matrix in Ad hoc Networks," KIPS Journal C (2001 ~ 2012) , vol. 15, no. 6, pp. 531-538, 2008. DOI: 10.3745/KIPSTC.2008.15.6.531.

[ACM Style]
Sung Soo Lee, Jeong Mi Kim, Hee Joo Park, and Chong Gun Kim. 2008. A Study of Routing based on Adjacency Matrix in Ad hoc Networks. KIPS Journal C (2001 ~ 2012) , 15, 6, (2008), 531-538. DOI: 10.3745/KIPSTC.2008.15.6.531.