Cargando…

Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks

The mobile ad hoc network (MANET) is a multi-hop, non-central network composed of mobile terminals with self-organizing features. Aiming at the problem of extra energy consumption caused by node motion in MANETs, this paper proposes an improved energy and mobility ant colony optimization (IEMACO) ro...

Descripción completa

Detalles Bibliográficos
Autores principales: Yang, Dong, Xia, Hongxing, Xu, Erfei, Jing, Dongliang, Zhang, Hailin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6263912/
https://www.ncbi.nlm.nih.gov/pubmed/30373294
http://dx.doi.org/10.3390/s18113657
_version_ 1783375377402429440
author Yang, Dong
Xia, Hongxing
Xu, Erfei
Jing, Dongliang
Zhang, Hailin
author_facet Yang, Dong
Xia, Hongxing
Xu, Erfei
Jing, Dongliang
Zhang, Hailin
author_sort Yang, Dong
collection PubMed
description The mobile ad hoc network (MANET) is a multi-hop, non-central network composed of mobile terminals with self-organizing features. Aiming at the problem of extra energy consumption caused by node motion in MANETs, this paper proposes an improved energy and mobility ant colony optimization (IEMACO) routing algorithm. Firstly, the algorithm accelerates the convergence speed of the routing algorithm and reduces the number of route discovery packets by introducing an offset coefficient of the transition probability. Then, based on the energy consumption rate, the remaining lifetime of nodes (RLTn) is considered. The position and velocity information predicts the remaining lifetime of the link (RLTl). The algorithm combines RLTn and RLTl to design the pheromone generation method, which selects the better quality path according to the transition probability to ensure continuous data transmission. As a result, the energy consumption in the network is balanced. The simulation results show that compared to the Ad Hoc on-demand multipath distance vector (AOMDV) algorithm with multipath routing and the Ant Hoc Max-Min-Path (AntHocMMP) algorithm in consideration of node energy consumption and mobility, the IEMACO algorithm can reduce the frequency of route discovery and has lower end-to-end delay as well as packet loss rate especially when nodes move, and can extend the network lifetime.
format Online
Article
Text
id pubmed-6263912
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-62639122018-12-12 Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks Yang, Dong Xia, Hongxing Xu, Erfei Jing, Dongliang Zhang, Hailin Sensors (Basel) Article The mobile ad hoc network (MANET) is a multi-hop, non-central network composed of mobile terminals with self-organizing features. Aiming at the problem of extra energy consumption caused by node motion in MANETs, this paper proposes an improved energy and mobility ant colony optimization (IEMACO) routing algorithm. Firstly, the algorithm accelerates the convergence speed of the routing algorithm and reduces the number of route discovery packets by introducing an offset coefficient of the transition probability. Then, based on the energy consumption rate, the remaining lifetime of nodes (RLTn) is considered. The position and velocity information predicts the remaining lifetime of the link (RLTl). The algorithm combines RLTn and RLTl to design the pheromone generation method, which selects the better quality path according to the transition probability to ensure continuous data transmission. As a result, the energy consumption in the network is balanced. The simulation results show that compared to the Ad Hoc on-demand multipath distance vector (AOMDV) algorithm with multipath routing and the Ant Hoc Max-Min-Path (AntHocMMP) algorithm in consideration of node energy consumption and mobility, the IEMACO algorithm can reduce the frequency of route discovery and has lower end-to-end delay as well as packet loss rate especially when nodes move, and can extend the network lifetime. MDPI 2018-10-28 /pmc/articles/PMC6263912/ /pubmed/30373294 http://dx.doi.org/10.3390/s18113657 Text en © 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Yang, Dong
Xia, Hongxing
Xu, Erfei
Jing, Dongliang
Zhang, Hailin
Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks
title Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks
title_full Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks
title_fullStr Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks
title_full_unstemmed Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks
title_short Energy-Balanced Routing Algorithm Based on Ant Colony Optimization for Mobile Ad Hoc Networks
title_sort energy-balanced routing algorithm based on ant colony optimization for mobile ad hoc networks
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6263912/
https://www.ncbi.nlm.nih.gov/pubmed/30373294
http://dx.doi.org/10.3390/s18113657
work_keys_str_mv AT yangdong energybalancedroutingalgorithmbasedonantcolonyoptimizationformobileadhocnetworks
AT xiahongxing energybalancedroutingalgorithmbasedonantcolonyoptimizationformobileadhocnetworks
AT xuerfei energybalancedroutingalgorithmbasedonantcolonyoptimizationformobileadhocnetworks
AT jingdongliang energybalancedroutingalgorithmbasedonantcolonyoptimizationformobileadhocnetworks
AT zhanghailin energybalancedroutingalgorithmbasedonantcolonyoptimizationformobileadhocnetworks