Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2008.15-C.6.531

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

Lee, Sung-Soo (영남대학교 컴퓨터공학과)
Kim, Jeong-Mi (영남대학교 컴퓨터공학과)
Park, Hee-Joo (영남대학교 컴퓨터공학과)
Kim, Chong-Gun (영남대학교 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartC / v.15C, no.6, 2008 , pp. 531-538 More about this Journal
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.
Keywords
Ad Hoc Networks; Leader Election; Adjacency Matrix; Path Search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Weiss. M. A, “Data Structures and Algorithm Analysis,” 2nd edition, Addison Wesley Longman, 1997
2 The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/, 2006
3 Ning Li, Yan Guo, Shaoren Zheng, Chang Tian and Jun Zheng, “A Matrix-Based Fast Calculation Algorithm for Estimating Network Capacity of MANETs,” ICW/ICHSN/ICMCS/SENET pp.407-412, 2005   DOI
4 L. E. Miller, “Multihop connectivity of arbitrary networks,” http://w3.antd.nist.gov/wctg/netanal/ConCalc.pdf, March, 2001
5 SungSoo Lee, HangKon Kim and ChongGun Kim, “A Knowledge Discovery Agent for a Topology Bit-map in Ad Hoc Mobile Networks,” Journal of Universal Computer Science, Vol.14, No.7, pp.1105-1117, http://www.jucs.org/jucs_14_7/a_knowledge_discovery_agent, 2008
6 Chonggun Kim, Elmurod Talipov and Byoungchul Ahn, “A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks,” EUC Workshops 2006, LNCS 4097, pp.522- 531, 2006   DOI   ScienceOn
7 Vasudevan, S., Kurose, J and Towsley, D., “Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks”. Proceedings of the 12th IEEE International Conference on Network Protocols(ICNP), pp.350-360, 2004   DOI
8 Sungsoo Lee, Rahman M. Muhammad and Chonggun Kim, “A Leader Election Algorithm within candidates on Ad Hoc Mobile Networks,” International Conference on Embedded Software and Systems (ICESS-07), LNCS4523, 2007   DOI   ScienceOn
9 J. Zhang and W. K. G. Seah, “Topology-based Capacity Analysis for Ad Hoc Networks with End-to-End Delay Constraints,” Proc. of IEEE 6th CAS Symposium on Emerging Technologies: Mobile and Wireless Communications, Shanghai, China, pp.541-544, 2004
10 HangKon Kim, SungSoo Lee and ChongGun Kim, “Design of Knowledge Discovery Agent for a Bit-Map on Ad Hoc Mobile Networks,” KES-AMSTA 2007, pp.738-746, 2007   DOI   ScienceOn