Abstract
A main nature of ad hoc mobile networks is frequent change on their topology that is the source of many problems to be solved. AODV is an on-demand routing protocol for decreasing maintenance overhead on ad hoc networks. But some path breaks can cause significant overhead and transmission delays. If the maintenance overhead of routing table can be reduced, table-driven routing methods could be an efficient substitution. In this paper, we propose a knowledge discovery agent for an effective routing method that is using the simple bit-map topology information. The agent node gathers topology knowledge and creates topology bit-map information. All paths for source to destination can easily be calculated by the bit-map. All the other nodes on the network maintain the bit-map distributed from agent and uses it for routing. Correctness of the proposed agent method is verified by computer simulations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lu, Y., Wang, W., Zhong, Y., Bhargava, B.: Study of Distance Vector Routing Protocols for Mobile ad hoc networks. In: Proceedings of the First IEEE International Conference (2003)
Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing(DSDV) for Mobile Computers. In: Proceedings of ACM SIGMOMM (1994)
Clausen, T., Jacquet, P.: Optimized link state routing protocol. RFC3626, Experimental (Oct. 2003)
Ogier, R.G., Lewis, M.G., Templin, F.L.: Topology Broadcast Based on Reverse-Path Forwarding. draft-ietf-manet-tbrpf-08.txt (Apr. 2003)
Wu, M., Kim, Y.: C. Kim“A Path Fault Avoided Routing in Ad Hoc Networks. Journal of KIPS, 879–888 (Dec. 2004)
Kim, C., Talipov, E., Ahn, B.: A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks. In: Zhou, X., Sokolsky, O., Yan, L., Jung, E.-S., Shao, Z., Mu, Y., Lee, D.C., Kim, D.Y., Jeong, Y.-S., Xu, C.-Z. (eds.) EUC Workshops 2006. LNCS, vol. 4097, pp. 522–531. Springer, Heidelberg (2006)
Perkins, C., Nokia Research Center, Belding-Royer, E.: Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561 (2003)
Johnson, D.B., Maltz, D.A., Hu, Y.-C.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). IETF Mobile Ad Hoc Networks Working Group, Internet Draft, work in progress, 15 Apr. (2003)
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-20
Chakeres, I.M., Belding-Royer, E.M.: The utility of hello messages for determining link connectivity. In: The 5th International Symposium on Wireless Personal Multimedia Communications, Oct. 2002, vol. 2 (2002)
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)
Nasipuri, A., Castaneda, R., Dasl, S.R.: Performance of Multipath Routing for On-demand Protocols in Mobile Ad hoc Networks. Mobile Networks and Applications 6(4), 339–349 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H., Lee, S., Kim, C. (2007). 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) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2007. Lecture Notes in Computer Science(), vol 4496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72830-6_77
Download citation
DOI: https://doi.org/10.1007/978-3-540-72830-6_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72829-0
Online ISBN: 978-3-540-72830-6
eBook Packages: Computer ScienceComputer Science (R0)