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

Yang, Dong; Xia, Huang; Xu, Erfei; Jing, Dongliang; Zhang, Hailin

doi:10.3390/s18113657

Cited by 23 publications

(12 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yang et al, [10] had further proposed an Improved Energy and Mobility Ant Colony Optimization (IEMACO) based routing algorithm. The algorithm initially accelerates its speed of convergence for that of the routing algorithm and this will reduce the route discovery packets by means of an introduction of a new offset coefficient for the probability of such transmission.…”

Section: Related Workmentioning

confidence: 99%

Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

Indhumathi¹,

V.²

2019

IJITEE

View full text Add to dashboard Cite

The Mobile Ad hoc Networks (MANETs) have been emerging as a technology offering many advantages to the users as regards cost and ease. The MANET is the collection of the connected mobile nodes and the connection is by the wireless links forming a temporary topology of network operating without centralized administration or the base station. Routing indicates a method by which information gets forwarded from transmitters to recipients. This is a strategy which guarantees the connection between two of the nodes in this network. For this work, there was a routing algorithm that was proposed for an efficient determination of an optimal path from the source to the destination in the MANETs. The Ad hoc On-Demand Distance Vector Routing (AODV) based protocol has been a routing protocol that has been designed for operating the MANET. This algorithm had been designed by means of using the TABU Search (TS) and the Shuffled Frog Leaping Algorithm (SFLA) which has been a metaheuristic algorithm that is a representation. The TABU_SFLA proposed had carried out two other operations generated in the neighbourhood for determining the optimal path and to minimize the time of execution. The results were compared to prove that the proposed TABU_SFLA was able to outperform all other algorithms that were well-suited for adapting the problem of routing optimization.

show abstract

Section: Related Workmentioning

confidence: 99%

Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

Indhumathi¹,

V.²

2019

IJITEE

View full text Add to dashboard Cite

show abstract

“…They also developed a source-routing protocol that achieved better scalability and lowers consumed power. Also, the authors of [16] introduced mobility-energy improved ant colony optimization routing method. The method speeded up the routing algorithm and reduced the route discovery packets.…”

Section: Introductionmentioning

confidence: 99%

Optimal resource allocation for route selection in ad-hoc networks

Farhan¹,

Croock²

2021

TELKOMNIKA

View full text Add to dashboard Cite

Nowadays, the selection of the optimum path in mobile ad hoc networks (MANETS) is being an important issue that should be solved smartly. In this paper, an optimal path selection method is proposed for MANET using the Lagrange multiplier approach. The optimization problem considers the objective function of maximizing bit rate, under the constraints of minimizing the packet loss, and latency. The obtained simulation results show that the proposed Lagrange optimization of rate, delay, and packet loss algorithm (LORDP) improves the selection of optimal path in comparison to ad-hoc ondemand distance vector protocol (AODV). We increased the performance of the system by 10.6 Mbps for bit rate and 0.133 ms for latency.

show abstract

“…In [13], introduced a trust-based and secure QoS routing method that depended on relieving nodes with various packet forwarding misbehavior and path discovery to guarantee reliable communication with QoS variables. Also, in [14] introduced an ant colony optimization routing method to improved mobility and energy. The method reduced the route discovery packets and speeded up the interchange of the routing algorithm using an offset value of the transition probability.…”

Section: Introductionmentioning

confidence: 99%

Optimized routing algorithm for maximizing transmission rate in D2D network

Farhan¹,

Croock²

2021

IJEECS

View full text Add to dashboard Cite

Wireless devices have been equiping extensive services over recent years. Since most of these devices are randomly distributed, a fundamental trade-off to be addressed is the transmission rate, latency, and packet loss of the ad hoc route selection in device to device (D2D) networks. Therefore, this paper introduces a notion of weighted transmission rate and total delay, as well as the probability of packet loss. By designing optimal transmission algorithms, this proposed algorithm aims to select the best path for device-to-device communication that maximizes the transmission rate while maintaining minimum delay and packet loss. Using the Lagrange optimization method, the lagrangian optimization of rate, delay, and the probability of packet loss algorithm (LORDP) is modeled. For practical designation, we consider the fading effect of the wireless channels scenario. The proposed optimal algorithm is modeled to compute the optimal cost objective function and represents the best possible solution for the corresponding path. Moreover, a simulation for the optimized algorithm is presented based on optimal cost objective function. Simulation results establish the efficiency of the proposed LORDP algorithm.Wireless devices have been equiping extensive services over recent years. Since most of these devices are randomly distributed, a fundamental trade-off to be addressed is the transmission rate, latency, and packet loss of the ad hoc route selection in device to device (D2D) networks. Therefore, this paper introduces a notion of weighted transmission rate and total delay, as well as the probability of packet loss. By designing optimal transmission algorithms, this proposed algorithm aims to select the best path for device-to-device communication that maximizes the transmission rate while maintaining minimum delay and packet loss. Using the Lagrange optimization method, the lagrangian optimization of rate, delay, and the probability of packet loss algorithm (LORDP) is modeled. For practical designation, we consider the fading effect of the wireless channels scenario. The proposed optimal algorithm is modeled to compute the optimal cost objective function and represents the best possible solution for the corresponding path. Moreover, a simulation for the optimized algorithm is presented based on optimal cost objective function. Simulation results establish the efficiency of the proposed LORDP algorithm

show abstract

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

Cited by 23 publications

References 32 publications

Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

Optimal resource allocation for route selection in ad-hoc networks

Optimized routing algorithm for maximizing transmission rate in D2D network

Contact Info

Product

Resources

About