ARMPP: An Ant-based Routing Algorithm with Multi-phase Pheromone and Power-saving in Mobile Ad Hoc Networks

被引:4
|
作者
Miyashita, Shohei [1 ]
Li, Yamin [2 ]
机构
[1] Hosei Univ, Grad Sch CIS, Tokyo 1848584, Japan
[2] Hosei Univ, Fac Comp & Informat Sci, Tokyo 1848584, Japan
关键词
mobile ad hoc networks; routing algorithm; power-saving; ant colony optimization;
D O I
10.1109/CANDAR.2015.50
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes an ant-based routing algorithm with multi-phase pheromone and power-saving (ARMPP) for enhancing the adaptability and stability of mobile ad hoc networks (MANETs). The routing algorithm is based on the ant colony optimization framework that is a kind of swarm intelligence and inspired from the ant's life. MANETs are dynamic, self-configured, self-built, and infrastructure-less networks. In MANETs, a link disruption resulting from the dynamic topology deteriorates the performance of network, and the increment of energy consumption brings reduction of the network lifetime because almost all nodes operate on a battery. The goal of this paper is to enhance the adaptability and stability in reacting to the mobility of nodes, that is, to variate the network topology timely and to maximize the lifetime of the network. We propose a two-stage construction method of pheromone and a new pheromone update method. In simulation experiments, we compare ARMPP with reference algorithms of ad hoc on-demand distance vector (AODV) and destination-sequenced distance vector routing (DSDV). The simulation results show that our algorithm can achieve better performance than those algorithms in the measures of the adaptability and stability.
引用
收藏
页码:154 / 160
页数:7
相关论文
共 50 条
  • [11] On the congestion and shortcut problems of ant-based routing for mobile ad hoc networks
    Liu, RT
    Guo, W
    Zheng, XQ
    Tian, YC
    [J]. 2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 324 - 328
  • [12] Ant-Based Balancing Energy Routing Protocol for Mobile Ad Hoc Networks
    Zhou, Jipeng
    Lu, Jianzhu
    Li, Jin
    [J]. JOURNAL OF INTERNET TECHNOLOGY, 2013, 14 (05): : 835 - 842
  • [13] A Survey of Ant-Based Routing Algorithms for Mobile Ad-hoc Networks
    Shokrani, Hamideh
    Jabbehdari, Sam
    [J]. PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING SYSTEMS, 2009, : 323 - 329
  • [14] WEIGHTED PROBABILITY ANT-BASED ROUTING (WPAR) IN MOBILE AD HOC NETWORKS
    Abkenar, Gholamhasan Sajedy
    Dana, Arash
    Shokouhifar, Mohammad
    [J]. 2011 24TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2011, : 826 - 831
  • [15] MAntS-Hoc:: A Multi-agent Ant-based system for routing in mobile ad Hoc networks
    Carrillo, L
    Marzo, JL
    Vilà, P
    Mantilla, U
    [J]. RECENT ADVANCES IN ARTIFICIAL INTELLIGENCE RESEARCH AND DEVELOPMENT, 2004, 113 : 285 - 292
  • [16] Scalable and efficient ant-based routing algorithm for ad-hoc networks
    Ohtaki, Y
    Wakamiya, N
    Murata, M
    Imase, M
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2006, E89B (04) : 1231 - 1238
  • [17] A new routing scheme concerning power-saving in mobile ad-hoc networks
    Ryu, JH
    Cho, DH
    [J]. ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS, 2000, : 1719 - 1722
  • [18] Energy Saving and Load Balancing in Wireless Ad Hoc Networks through Ant-based Routing
    De Rango, Floriano
    Tropea, Mauro
    [J]. PROCEEDINGS OF THE INTERNATIONAL SYMPOSIUM ON PERFORMANCE EVALUATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, 2009, 41 (04): : 117 - 124
  • [19] Ant-Based Stable Disjoint Path Routing Algorithm in wireless ad hoc networks
    Wu, Zhengyu
    Cui, Lin
    Dong, Xiangjun
    [J]. ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2007, : 678 - +
  • [20] A power-saving algorithm and a power-aware routing scheme for IEEE 802.11 ad hoc networks
    Pogkas, N
    Papadopoulos, G
    [J]. CHALLENGES IN AD HOC NETWORKING, 2006, 197 : 51 - +