Advertisement

An Agent Using Matrix for Backward Path Search on MANET

  • SungSoo Lee
  • ZhiPeng Liu
  • ChongGun Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4953)

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 networks is to search path from a source to a destination with an efficient routing method, which is also an important issue for delay-sensitive real-time application. A topology of the nodes interconnections in an ad hoc network can be modeled as an adjacency matrix. In this paper, we present a knowledge discovery agent to collect topology information and derive the adjacency matrix. Based on a sequence matrix calculation, we propose an effective routing algorithm Matrix- Based Backward path Search (MBBS) for route discovery from a destination to a source. The performance of MBBS and that of Breadth First Search (BFS) algorithm are compared. The research result proves that MBBS is more efficient in recognizing the route.

Keywords

a knowledge discovery agent Ad hoc network adjacency matrix connectivity matrix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lu, Y., Wang, W., Bhargava, Y.Z.B.: Study of Distance Vector Routing Protocols for Mobile ad hoc networks. In: Proceedings of the First IEEE International Conference (2003)Google Scholar
  2. 2.
    Zhang, J., Seah, W.K.G.: Topology-based Capacity Analysis for Ad Hoc Networks with End-to-End Delay Constraints. In: Proc. of IEEE 6th CAS Symposium on Emerging Technologies: Mobile and Wireless Communications, Shanghai, China, pp. 541–544 (2004)Google Scholar
  3. 3.
    Li, N., Guo, Y., Zheng, S., Tian, C., Zheng, J.: A Matrix-Based Fast Calculation Algorithm for Estimating Network Capacity of MANETs. In: ICW/ICHSN/ICMCS/SENET 2005, pp. 407–412 (2005)Google Scholar
  4. 4.
    Miller, L.E.: Multihop connectivity of arbitrary networks (March 2001), http://w3.antd.nist.gov/wctg/netanal/ConCalc.pdf
  5. 5.
    Kim, H.-K., Kim, C., Lee, S.: Design of Knowledge Discovery Agent for a Bit-Map on Ad Hoc Mobile Networks. In: Nguyen, N.T., Grzech, A., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2007. LNCS (LNAI), vol. 4496, pp. 738–746. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Vasudevan, S., Kurose, J., Towsley, D.: Design and Analysis of a Agent Election Algorithm for Mobile Ad Hoc Networks, UMass Computer Science Technical Report 03-20Google Scholar
  7. 7.
    Vasudevan, S., Kurose, J., Towsley, D.: Design and Analysis of a Agent Election Algorithm for Mobile Ad Hoc Networks. In: Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP), pp. 350–360 (2004)Google Scholar
  8. 8.
    Lee, S., Muhammad, R.M., Kim, C.: A Leader Election Algorithm within candidates on Ad Hoc Mobile Networks. In: Lee, Y.-H., Kim, H.-N., Kim, J., Park, Y.W., Yang, L.T., Kim, S.W. (eds.) ICESS 2007. LNCS, vol. 4523, Springer, Heidelberg (2007)Google Scholar
  9. 9.
    Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: Proceedings of ACM SIGMOMM (1994)Google Scholar
  10. 10.
    Clausen, T., Jacquet, P.: A Optimized link state routing protocol. RFC3626, Experimental (October 2003)Google Scholar
  11. 11.
    Chakeres, I.M., Belding-Royer, E.M.: The utility of hello messages for determining link connectivity. In: The 5th International Symposium on vol. 2 (October 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • SungSoo Lee
    • 1
  • ZhiPeng Liu
    • 1
  • ChongGun Kim
    • 1
  1. 1.Department of Computer EngineeringYeungnam University 

Personalised recommendations