The multi-agent system for dynamic network routing

The single-hop communication method of the current wireless network cannot meet new demands in the domain such as intelligent transport systems (ITS) and Home LAN. Even though the ad-hoc network architecture is expected to solve this problem, the nature of a dynamic topology makes this routing hard to realize. This paper introduces a new ad-hoc routing algorithm, which is inspired by the cooperating mobile agents for dynamic network routing of Miner et al. (see Software agents for future communicating systems, p.287-304, Springer, 1999). In their system, some control agents explore the network and update routing tables on their own knowledge. Using these routing tables, other agents deliver messages. They considered the feasibility of the agent-based routing system, but did not refer to an efficient algorithm. We consider that algorithm without increasing the network load. We propose multiplying each entry in the routing table to store much more information from agents and evaluating them to make better use of information, which succeeded in raising the network connectivity by about 40% by simulation