Research of Multi-Path Routing Protocol Based on Parallel Ant Colony Algorithm Optimization in Mobile Ad Hoc Networks

Liu, Chengyong; Yang, Xiang

doi:10.1109/itng.2008.79

Cited by 14 publications

(6 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In these services, parallel metaheuristics are efficient methods to compute large scheduling in reduced execution times (Alba et al., ; Nesmachnow et al., , , ; Xhafa and Abraham, ). Software engineering and software development, a field in which parallel metaheuristics have just started to show their usefulness for exploring large search spaces, such as in the optimization of dynamic data types and memory managers in embedded systems (Risco‐Martin et al., , ), and in software testing (Alba and Chicano, ). Telecommunications, a field that has grown at a fast pace in recent years, posing difficult challenges to the research community due to the large size of the infrastructures, the need for real‐time results, etc. Parallel metaheuristics have shown a great impact on addressing these challenges by providing accurate and efficient solutions to the related optimization problems in network design (Alba and Chicano, ; Nesmachnow et al., ; Pedemonte and Cancela, ; Ribeiro and Rosseti, ), network routing (Durillo et al., ; Liu et al., ; Segura et al., ; Zhu et al., ), and network planning, especially in modern networks technologies such as cellular (Alba and Chicano, ; Talbi et al., ), mobile ad‐hoc networks (Liu et al., ), vehicular networks, sensor networks, and peer‐to‐peer (Luna et al., ; Nesmachnow et al., ).…”

Section: Modern Applications Solved By Parallel Metaheuristicsmentioning

confidence: 99%

Parallel metaheuristics: recent advances and new trends

Alba

Luque

Nesmachnow

2012

Int Trans Operational Res

269

118

View full text Add to dashboard Cite

The field of parallel metaheuristics is continuously evolving as a result of new technologies and needs that researchers have been encountering. In the last decade, new models of algorithms, new hardware for parallel execution/communication, and new challenges in solving complex problems have been making advances in a fast manner. We aim to discuss here on the state of the art, in a summarized manner, to provide a solution to deal with some of the growing topics. These topics include the utilization of classic parallel models in recent platforms (such as grid/cloud architectures and GPU/APU). However, porting existing algorithms to new hardware is not enough as a scientific goal, therefore researchers are looking for new parallel optimization and learning models that are targeted to these new architectures. Also, parallel metaheuristics, such as dynamic optimization and multiobjective problem resolution, have been applied to solve new problem domains in past years. In this article, we review these recent research areas in connection to parallel metaheuristics, as well as we identify future trends and possible open research lines for groups and PhD students.

show abstract

Section: Modern Applications Solved By Parallel Metaheuristicsmentioning

confidence: 99%

Parallel metaheuristics: recent advances and new trends

Alba

Luque

Nesmachnow

2012

Int Trans Operational Res

269

118

View full text Add to dashboard Cite

show abstract

“…If the common nodes failed, multiple paths will simultaneously breaking. In order to effectively establish multiple node disjoint paths and avoid consuming too much network resources, PL_AOMDV introduce the following theorem [9,10].…”

Section: ⅱ Establishment Of Pl_aomdv Independent Pathsmentioning

confidence: 99%

An Ad Hoc Network Load Balancing Energy-Efficient Multipath Routing Protocol

Kong

Yao

2014

JSW

View full text Add to dashboard Cite

Multipath routing protocol establishes multiple transmission paths between source node and destination node, which can not only transmit data in parallel, but also one as main path and others as backup paths. The paper proposed a multipath routing protocol PL_AOMDV with power controlling and load balancing based on AOMDV. In order to implement load balancing and prolong network lifetime, it allocates traffic bandwidth based on node remaining power and load status along the path. Appropriate power is used to transmit data packets. As Ad hoc network is complicated and changeable, the proposed protocol conducts periodical routing maintenance to adjust bandwidth allocation of traffic in time. Simulation experiment results show that the improved PL_AOMDV protocol achieves better performance in the aspects of load balancing and average node lifetime.

show abstract

“…The above two algorithms are, however not suitable for WSN. In [16] an ACO algorithm (PACO) was used to search for multipaths between source nodes and the base station in MANETs. Although the PACO improved the efficiency of data transmission, the number of required ants was greater, resulting in higher energy consumption at the start-up stage.…”

Section: Ant Colony Based Routing Algorithmsmentioning

confidence: 99%

Energy-efficient and location-aware ant colony based routing algorithms for wireless sensor networks

Dominguez

Cruz-Cortés

2011

Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

In recent years, advances in miniaturization, low-power circuit design, simple, low power, yet reasonably efficient wireless communication equipment, and improved small-scale energy supplies have combined with reduced manufacturing costs to make a new technological vision possible, Wireless Sensor Networks (WSN). As WSN are still a young research field, much activity is still on-going to solve many open issues. One is the data routing problem. As the size of the network increases, this problem becomes more complex due the amount of sensor nodes in the network. The meta-heuristic Ant Colony Optimization (ACO) has been proposed to solve this issue. ACO based routing algorithms can add a significant contribution to assist in the maximisation of the network lifetime and in the minimisation of the latency in data transmissions, but this is only possible by means of an adaptable and balanced algorithm that takes into account the WSN main restrictions, for example, memory and power supply. A comparison of two ACO based routing algorithms for WSN is presented, taking into account current amounts of energy consumption under a WSN scenario proposed in this work. Furthermore, a new routing algorithm is defined.

show abstract

Research of Multi-Path Routing Protocol Based on Parallel Ant Colony Algorithm Optimization in Mobile Ad Hoc Networks

Cited by 14 publications

References 3 publications

Parallel metaheuristics: recent advances and new trends

Parallel metaheuristics: recent advances and new trends

An Ad Hoc Network Load Balancing Energy-Efficient Multipath Routing Protocol

Energy-efficient and location-aware ant colony based routing algorithms for wireless sensor networks

Contact Info

Product

Resources

About