A multi-agent system for dynamic network routing

Single-hop communication methods of the current wireless network cannot mee t new demands in new domains, especially ITS (Intelligent Transport Systems ). Even though the ad-hoc network architecture is expected to solve this pr oblem, but the nature of a dynamic topology makes this routing hard to be r ealized. This paper introduces a new ad-hoc routing algorithm, which is ins pired by [1]. In their system, some control agents explore the network and update routing tables on their own knowledge. Using these routing tables, o ther agents deliver messages. They considered the feasibility of the agent- based routing system, but did not refer to an efficient algorithm. In this paper, we consider that algorithm without increasing network load. We propo se multiple entries for each destination in the routing table to store much more information from agents and evaluating them to make better use of inf ormation, which succeeded in raising the network connectivity by about 40% by simulation.