Scalable and Efficient Ant-Based Routing Algorithm for Ad-Hoc Networks

Search this Article

Author(s)

    • OHTAKI Yoshitaka
    • Graduate School of Information Science and Technology, Osaka University
    • WAKAMIYA Naoki
    • Graduate School of Information Science and Technology, Osaka University
    • MURATA Masayuki
    • Graduate School of Information Science and Technology, Osaka University
    • IMASE Makoto
    • Graduate School of Information Science and Technology, Osaka University

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.

Journal

  • IEICE Trans. on Commun.

    IEICE Trans. on Commun. 89(4), 1231-1238, 2006-04-01

    The Institute of Electronics, Information and Communication Engineers

References:  13

Cited by:  13

Codes

  • NII Article ID (NAID)
    110007502958
  • NII NACSIS-CAT ID (NCID)
    AA10826261
  • Text Lang
    ENG
  • Article Type
    Journal Article
  • ISSN
    09168516
  • Data Source
    CJP  CJPref  NII-ELS 
Page Top