抄録
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.
| 元の言語 | English |
|---|---|
| ページ（範囲） | 2721-2728 |
| ページ数 | 8 |
| ジャーナル | IEICE Transactions on Communications |
| 巻 | E84-B |
| 発行部数 | 10 |
| 出版物ステータス | Published - 2001 10 |
| 外部発表 | Yes |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
これを引用
A multi-agent system for dynamic network routing. / Onishi, Ryokichi; Yamaguchi, Saneyasu; Morino, Hiroaki; Aida, Hitoshi; Saito, Tadao.
：: IEICE Transactions on Communications, 巻 E84-B, 番号 10, 10.2001, p. 2721-2728.研究成果: Article
}
TY - JOUR
T1 - A multi-agent system for dynamic network routing
AU - Onishi, Ryokichi
AU - Yamaguchi, Saneyasu
AU - Morino, Hiroaki
AU - Aida, Hitoshi
AU - Saito, Tadao
PY - 2001/10
Y1 - 2001/10
N2 - 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.
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.
KW - Ad-hoc network
KW - Ant colony
KW - Mobile agent
KW - Multi-hop communication
KW - Wireless network
UR - http://www.scopus.com/inward/record.url?scp=0035483697&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035483697&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0035483697
VL - E84-B
SP - 2721
EP - 2728
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
SN - 0916-8516
IS - 10
ER -