A multi-agent system for dynamic network routing

Ryokichi Onishi, Saneyasu Yamaguchi, Hiroaki Morino, Hitoshi Aida, Tadao Saito

Research output: Contribution to journalArticle

7 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)2721-2728
Number of pages8
JournalIEICE Transactions on Communications
VolumeE84-B
Issue number10
Publication statusPublished - 2001 Oct
Externally publishedYes

Fingerprint

Network routing
Multi agent systems
Routing algorithms
Ad hoc networks
Network architecture
Wireless networks
Topology
Control systems
Communication

Keywords

  • Ad-hoc network
  • Ant colony
  • Mobile agent
  • Multi-hop communication
  • Wireless network

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Onishi, R., Yamaguchi, S., Morino, H., Aida, H., & Saito, T. (2001). A multi-agent system for dynamic network routing. IEICE Transactions on Communications, E84-B(10), 2721-2728.

A multi-agent system for dynamic network routing. / Onishi, Ryokichi; Yamaguchi, Saneyasu; Morino, Hiroaki; Aida, Hitoshi; Saito, Tadao.

In: IEICE Transactions on Communications, Vol. E84-B, No. 10, 10.2001, p. 2721-2728.

Research output: Contribution to journalArticle

Onishi, R, Yamaguchi, S, Morino, H, Aida, H & Saito, T 2001, 'A multi-agent system for dynamic network routing', IEICE Transactions on Communications, vol. E84-B, no. 10, pp. 2721-2728.
Onishi R, Yamaguchi S, Morino H, Aida H, Saito T. A multi-agent system for dynamic network routing. IEICE Transactions on Communications. 2001 Oct;E84-B(10):2721-2728.
Onishi, Ryokichi ; Yamaguchi, Saneyasu ; Morino, Hiroaki ; Aida, Hitoshi ; Saito, Tadao. / A multi-agent system for dynamic network routing. In: IEICE Transactions on Communications. 2001 ; Vol. E84-B, No. 10. pp. 2721-2728.
@article{868fdae2cad94380ab3dfaab293d1590,
title = "A multi-agent system for dynamic network routing",
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 = "Ad-hoc network, Ant colony, Mobile agent, Multi-hop communication, Wireless network",
author = "Ryokichi Onishi and Saneyasu Yamaguchi and Hiroaki Morino and Hitoshi Aida and Tadao Saito",
year = "2001",
month = "10",
language = "English",
volume = "E84-B",
pages = "2721--2728",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

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 -