IEICE TRANSACTIONS on Communications
Scalable and Efficient Ant-Based Routing Algorithm for Ad-Hoc Networks
Summary :
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since they do not involve extra message exchanges to maintain paths when network topology changes, they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently. As the number of nodes increases, however, the number of ants (i.e., mobile agents or control messages) also increases, which means that existing algorithms have poor scalability. In this paper, we propose a scalable ant-based routing algorithm that keeps the overhead low while keeping paths short. Our algorithm uses a multistep TTL (Time To Live) scheme, an effective message migration scheme, and an efficient scheme for updating the probability of packet forwarding. Simulation experiments have confirmed that our proposed algorithm can establish shorter paths than the conventional ant-based algorithm with the same signaling overhead.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.4 pp.1231-1238
- Publication Date
- 2006/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.4.1231
- Type of Manuscript
- PAPER
- Category
- Network
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
Yoshitaka OHTAKI, Naoki WAKAMIYA, Masayuki MURATA, Makoto IMASE, "Scalable and Efficient Ant-Based Routing Algorithm for Ad-Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 4, pp. 1231-1238, April 2006, doi: 10.1093/ietcom/e89-b.4.1231.
Abstract: Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since they do not involve extra message exchanges to maintain paths when network topology changes, they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently. As the number of nodes increases, however, the number of ants (i.e., mobile agents or control messages) also increases, which means that existing algorithms have poor scalability. In this paper, we propose a scalable ant-based routing algorithm that keeps the overhead low while keeping paths short. Our algorithm uses a multistep TTL (Time To Live) scheme, an effective message migration scheme, and an efficient scheme for updating the probability of packet forwarding. Simulation experiments have confirmed that our proposed algorithm can establish shorter paths than the conventional ant-based algorithm with the same signaling overhead.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.4.1231/_p
Copy
@ARTICLE{e89-b_4_1231,
author={Yoshitaka OHTAKI, Naoki WAKAMIYA, Masayuki MURATA, Makoto IMASE, },
journal={IEICE TRANSACTIONS on Communications},
title={Scalable and Efficient Ant-Based Routing Algorithm for Ad-Hoc Networks},
year={2006},
volume={E89-B},
number={4},
pages={1231-1238},
abstract={Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since they do not involve extra message exchanges to maintain paths when network topology changes, they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently. As the number of nodes increases, however, the number of ants (i.e., mobile agents or control messages) also increases, which means that existing algorithms have poor scalability. In this paper, we propose a scalable ant-based routing algorithm that keeps the overhead low while keeping paths short. Our algorithm uses a multistep TTL (Time To Live) scheme, an effective message migration scheme, and an efficient scheme for updating the probability of packet forwarding. Simulation experiments have confirmed that our proposed algorithm can establish shorter paths than the conventional ant-based algorithm with the same signaling overhead.},
keywords={},
doi={10.1093/ietcom/e89-b.4.1231},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - Scalable and Efficient Ant-Based Routing Algorithm for Ad-Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1231
EP - 1238
AU - Yoshitaka OHTAKI
AU - Naoki WAKAMIYA
AU - Masayuki MURATA
AU - Makoto IMASE
PY - 2006
DO - 10.1093/ietcom/e89-b.4.1231
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2006
AB - Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since they do not involve extra message exchanges to maintain paths when network topology changes, they are suitable for mobile ad-hoc networks where nodes move dynamically and topology changes frequently. As the number of nodes increases, however, the number of ants (i.e., mobile agents or control messages) also increases, which means that existing algorithms have poor scalability. In this paper, we propose a scalable ant-based routing algorithm that keeps the overhead low while keeping paths short. Our algorithm uses a multistep TTL (Time To Live) scheme, an effective message migration scheme, and an efficient scheme for updating the probability of packet forwarding. Simulation experiments have confirmed that our proposed algorithm can establish shorter paths than the conventional ant-based algorithm with the same signaling overhead.
ER -
English
