Energy Efficient and Effect of Mobility on ACDTN Routing Protocol based on Ant Colony

被引:0
|
作者
Ababou, Mohamed [1 ]
El kouch, Rachid [1 ]
Bellafkih, Mostafa [1 ]
Ababou, Nabil [2 ]
机构
[1] INPT, RAI2S, Rabat, Morocco
[2] Univ Sci Mohamed 1, LaRI, FSO, Oujda, Morocco
来源
PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT 2015) | 2015年
关键词
Store and forward; networks; energy; routing protocol; DTN; ACDTN; epidemic; spray and wait; PRoPHET;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Delay Tolerant Network is a network that supports the intermittent connections between nodes, there is either no end to end connection between the source and the destination or the connections are infrequent and very short in terms of delay. It was thanks to the mechanism store and forward and node mobility that the nodes can store messages received and wait for an opportunity to transmit them. As traditional routings which are based on the principle of end-to-end are no longer adapted with this type of environment, different routings have been proposed for DTN environment, in order to increase delivery rate of messages with minimal overhead as the Epidemic routing, Spray and Wait and PRoPHET, etc. In this paper, we propose a new routing protocol named ACDTN, inspired from the collective behavior in ants colonies, to find the hops that are more likely to approach the message to it final destination, by combining the information on the time and the geographical coordinates of appointment places (visibility) and the encounters frequency between nodes (pheromone) to compute the transition probability. The new proposed approach has proven through several simulations: an energy efficient and an improvement in the lifetime of nodes compared to the routing protocols, Epidemic, Spary and Wait and PRoPHET, Making it a good candidate for DTN network.
引用
收藏
页码:335 / 340
页数:6
相关论文
共 50 条
  • [31] Mobility Supported Energy Efficient Routing Protocol for IoT based Healthcare Applications
    Lazarevska, Maja
    Farahbakhsh, Reza
    Shakya, Nikesh Man
    Crespi, Noel
    2018 IEEE CONFERENCE ON STANDARDS FOR COMMUNICATIONS AND NETWORKING (IEEE CSCN), 2018,
  • [32] Fuzzy Ant Colony Based Routing Protocol For delay tolerant network
    Mohamed, Ababou
    Bellafkih, M.
    El Kouch, R.
    2015 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS: THEORIES AND APPLICATIONS (SITA), 2015,
  • [33] A Routing Protocol Based on Ant Colony Algorithm for Wireless Sensor Networks
    Sun Lijuan
    Yang Guannan
    Guo Jian
    Xu Wenjun
    Wang Ruchuan
    CHINESE JOURNAL OF ELECTRONICS, 2010, 19 (04): : 589 - 593
  • [34] Modified Ant Colony Optimization (ACO) Based Routing Protocol for MANET
    Banerjee, Saptarshi
    Majumdar, Arnab
    Saha, Himadri Nath
    Dey, Ratul
    2015 INTERNATIONAL CONFERENCE AND WORKSHOP ON COMPUTING AND COMMUNICATION (IEMCON), 2015,
  • [35] Energy efficient multipath ant colony based routing algorithm for mobile ad hoc networks
    Sharma, Arush S.
    Kim, Dongsoo S.
    AD HOC NETWORKS, 2021, 113 (113)
  • [36] Low-Energy Secure Routing Protocol for WSNs Based on Multiobjective Ant Colony Optimization Algorithm
    Wang, Xueli
    JOURNAL OF SENSORS, 2021, 2021
  • [37] An Ant Colony Algorithm for efficient ship routing
    Tsou, Ming-Cheng
    Cheng, Hung-Chih
    POLISH MARITIME RESEARCH, 2013, 20 (03) : 28 - 38
  • [38] Ant Colony Optimization and Excess Energy Calculations Based Fast Converging Energy Efficient Routing Algorithm for WSNs
    Jain, Aarti
    Pathak, Anuj
    WIRELESS PERSONAL COMMUNICATIONS, 2019, 109 (04) : 2305 - 2328
  • [39] Ant Colony Optimization and Excess Energy Calculations Based Fast Converging Energy Efficient Routing Algorithm for WSNs
    Aarti Jain
    Anuj Pathak
    Wireless Personal Communications, 2019, 109 : 2305 - 2328
  • [40] MAZACORNET: Mobility Aware Zone based Ant Colony Optimization Routing for VANET
    Rana, Himani
    Thulasiraman, Parimala
    Thulasiram, Ruppa K.
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 2948 - 2955