The multi-agent system for dynamic network routing

R. Onishi; S. Yamaguchi; Hiroaki Morino; H. Aida; T. Saito

doi:10.1109/ISADS.2001.917442

The multi-agent system for dynamic network routing

R. Onishi, S. Yamaguchi, Hiroaki Morino, H. Aida, T. Saito

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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	https://doi.org/10.1109/ISADS.2001.917442
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

ASJC Scopus subject areas

Business, Management and Accounting (miscellaneous)
Artificial Intelligence
Computer Networks and Communications
Computer Science Applications

Access to Document

10.1109/ISADS.2001.917442

Fingerprint Dive into the research topics of 'The multi-agent system for dynamic network routing'. Together they form a unique fingerprint.

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

Onishi, R, Yamaguchi, S, Morino, H, Aida, H & Saito, T 2001, The multi-agent system for dynamic network routing. in Proceedings - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001., 917442, Institute of Electrical and Electronics Engineers Inc., pp. 375-382, 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001, Dallas, United States, 01/3/26. https://doi.org/10.1109/ISADS.2001.917442

@inproceedings{df87cad0549640d98b8379e51f99fd83,

title = "The multi-agent system for dynamic network routing",

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.",

author = "R. Onishi and S. Yamaguchi and Hiroaki Morino and H. Aida and T. Saito",

year = "2001",

doi = "10.1109/ISADS.2001.917442",

language = "English",

isbn = "0769510655",

pages = "375--382",

booktitle = "Proceedings - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "5th International Symposium on Autonomous Decentralized Systems, ISADS 2001 ; Conference date: 26-03-2001 Through 28-03-2001",

}

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

AN - SCOPUS:84964057651

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.

T2 - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001

Y2 - 26 March 2001 through 28 March 2001

ER -