Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 375-382 |
| Number of pages | 8 |
| ISBN (Print) | 0769510655, 9780769510651 |
| DOIs | |
| Publication status | Published - 2001 |
| Externally published | Yes |
| Event | 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001 - Dallas, United States Duration: 2001 Mar 26 → 2001 Mar 28 |
Other
| Other | 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001 |
|---|---|
| Country | United States |
| City | Dallas |
| Period | 01/3/26 → 01/3/28 |
Fingerprint
ASJC Scopus subject areas
- Business, Management and Accounting (miscellaneous)
- Artificial Intelligence
- Computer Networks and Communications
- Computer Science Applications
Cite this
The multi-agent system for dynamic network routing. / Onishi, R.; Yamaguchi, S.; Morino, Hiroaki; Aida, H.; Saito, T.
Proceedings - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 375-382 917442.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - The multi-agent system for dynamic network routing
AU - Onishi, R.
AU - Yamaguchi, S.
AU - Morino, Hiroaki
AU - Aida, H.
AU - Saito, T.
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84964057651&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964057651&partnerID=8YFLogxK
U2 - 10.1109/ISADS.2001.917442
DO - 10.1109/ISADS.2001.917442
M3 - Conference contribution
SN - 0769510655
SN - 9780769510651
SP - 375
EP - 382
BT - Proceedings - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001
PB - Institute of Electrical and Electronics Engineers Inc.
ER -