| Autor: |
Carbonell, Jaime G., Siekmann, Jörg, Nguyen, Ngoc Thanh, Grzech, Adam, Howlett, Robert J., Jain, Lakhmi C., HangKon Kim, SungSoo Lee, ChongGun Kim |
| Zdroj: |
Agent & Multi-Agent Systems: Technologies & Applications; 2007, p738-746, 9p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
