IEICE TRANSACTIONS on Communications
A Multi-Agent System for Dynamic Network Routing
Summary :
Single-hop communication methods of the current wireless network cannot meet new demands in new domains, especially ITS (Intelligent Transport Systems). Even though the ad-hoc network architecture is expected to solve this problem, but the nature of a dynamic topology makes this routing hard to be realized. This paper introduces a new ad-hoc routing algorithm, which is inspired by [1]. 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. In this paper, we consider that algorithm without increasing network load. We propose multiple entries for each destination 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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E84-B No.10 pp.2721-2728
- Publication Date
- 2001/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (IEICE/IEEE Joint Special Issue on Autonomous Decentralized Systems and Systems' Assurance)
- Category
- Mobile Agent
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ryokichi ONISHI, Saneyasu YAMAGUCHI, Hiroaki MORINO, Hitoshi AIDA, Tadao SAITO, "A Multi-Agent System for Dynamic Network Routing" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 10, pp. 2721-2728, October 2001, doi: .
Abstract: Single-hop communication methods of the current wireless network cannot meet new demands in new domains, especially ITS (Intelligent Transport Systems). Even though the ad-hoc network architecture is expected to solve this problem, but the nature of a dynamic topology makes this routing hard to be realized. This paper introduces a new ad-hoc routing algorithm, which is inspired by [1]. 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. In this paper, we consider that algorithm without increasing network load. We propose multiple entries for each destination 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_10_2721/_p
Copy
@ARTICLE{e84-b_10_2721,
author={Ryokichi ONISHI, Saneyasu YAMAGUCHI, Hiroaki MORINO, Hitoshi AIDA, Tadao SAITO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Multi-Agent System for Dynamic Network Routing},
year={2001},
volume={E84-B},
number={10},
pages={2721-2728},
abstract={Single-hop communication methods of the current wireless network cannot meet new demands in new domains, especially ITS (Intelligent Transport Systems). Even though the ad-hoc network architecture is expected to solve this problem, but the nature of a dynamic topology makes this routing hard to be realized. This paper introduces a new ad-hoc routing algorithm, which is inspired by [1]. 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. In this paper, we consider that algorithm without increasing network load. We propose multiple entries for each destination 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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Multi-Agent System for Dynamic Network Routing
T2 - IEICE TRANSACTIONS on Communications
SP - 2721
EP - 2728
AU - Ryokichi ONISHI
AU - Saneyasu YAMAGUCHI
AU - Hiroaki MORINO
AU - Hitoshi AIDA
AU - Tadao SAITO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2001
AB - Single-hop communication methods of the current wireless network cannot meet new demands in new domains, especially ITS (Intelligent Transport Systems). Even though the ad-hoc network architecture is expected to solve this problem, but the nature of a dynamic topology makes this routing hard to be realized. This paper introduces a new ad-hoc routing algorithm, which is inspired by [1]. 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. In this paper, we consider that algorithm without increasing network load. We propose multiple entries for each destination 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.
ER -
English
