Sciweavers

Share
CIIT
2004

Scalable ant-based routing algorithm for ad-hoc networks

12 years 3 months ago
Scalable ant-based routing algorithm for ad-hoc networks
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 and it reduces the scalability of algorithms. In this paper, we propose a scalable ant-based routing algorithm that makes 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 overh...
Yoshitaka Ohtaki, Naoki Wakamiya, Masayuki Murata,
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where CIIT
Authors Yoshitaka Ohtaki, Naoki Wakamiya, Masayuki Murata, Makoto Imase
Comments (0)
books