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
来源
PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR) | 2015年
关键词
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
相关论文
共 18 条
  • [1] Abkenar GS, 2011, CAN CON EL COMP EN, P826, DOI 10.1109/CCECE.2011.6030571
  • [2] [Anonymous], 2010, Modeling and Tools for Network Simulation, DOI DOI 10.1007/978-3-642-12331-3_2
  • [3] AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks
    Di Caro, G
    Ducatelle, F
    Gambardella, LM
    [J]. EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2005, 16 (05): : 443 - 455
  • [4] Di Caro G, 1997, Tech. Rep., Tech. Report IRIDIA/97-12
  • [5] Dorigo M., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1470, DOI 10.1109/CEC.1999.782657
  • [6] ARA -: The ant-colony based routing algorithm for MANETs
    Günes, M
    Sorges, U
    Bouazizi, I
    [J]. 2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS OF THE WORKSHOPS, 2002, : 79 - 85
  • [7] Haas ZJ, 1997, 1997 IEEE 6TH INTERNATIONAL CONFERENCE ON UNIVERSAL PERSONAL COMMUNICATIONS RECORD, CONFERENCE RECORD, VOLS 1 AND 2, P562, DOI 10.1109/ICUPC.1997.627227
  • [8] Probability routing algorithm for mobile ad hoc networks resources management
    Hussein, SH
    Saadawi, TN
    Lee, MJ
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (12) : 2248 - 2259
  • [9] Jacquet P, 2001, IEEE INMIC 2001: IEEE INTERNATIONAL MULTI TOPIC CONFERENCE 2001, PROCEEDINGS, P62, DOI 10.1109/INMIC.2001.995315
  • [10] Johnson D.B., 1996, Mobile Computing, P153, DOI DOI 10.1007/978-0-585-29603-65