Volunteer nodes of ant colony optimization routing for minimizing delay in peer to peer MANETs

Alleema, N. Noor; Kumar, Dinesh

doi:10.1007/s12083-019-00772-w

Cited by 15 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed algorithm dynamically determines network heuristic parameters for selecting the suitable node for each cluster to allow faster formation of clusters and selection of head. Also in [67] Alleema and Kumar tried to reduced overhead and delay in Peer to Peer MANETs through introducing Volunteer Nodes of Ant Colony Optimization Routing (VNACO). In the proposed protocol the peer node can volunteer to transmit data between source and destination nodes based on her aptitude that is calculated by iterating node connectivity, transmission processing time, node energy and available bandwidth.…”

Section: Related Workmentioning

confidence: 99%

Elephant Herding Optimization Ad Hoc On-Demand Multipath Distance Vector Routing Protocol for MANET

Sarhan

2021

IEEE Access

View full text Add to dashboard Cite

Energy consumption always represents a challenge in the ad hoc networks which spurred the researchers to benefit from the bio-inspired algorithms and their fitness functions to evaluate nodes energy through the path discovery stage. In this paper we propose energy efficient routing protocol based on the well-known Ad Hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol and a bio-inspired algorithm called Elephant Herding Optimization (EHO). In the proposed EHO-AOMDV the overall consumed energy of nodes is optimized by classifying nodes into two classes, while paths are discovered from the class of the fittest nodes with sufficient energy for transmission to reduce the probability of path failure and the increasing number of dead nodes through higher data loads. The EHO updating operator updates classes based on separating operator that evaluates nodes based on residual energy after each transmission round. Experiments were conducted using Ns-3 with five evaluation metrics routing overhead, packet delivery ratio, average energy consumption, end-to-end delay and number of dead nodes and four implemented protocols the proposed protocol , AOMDV and two bio-inspired protocols ACO-FDRPSO and FF-AOMDV. Results indicated that the proposed EHO-AOMDV attained higher packet delivery ratio with less routing overhead, average energy consumption and number of dead nodes over the state of art while in the end-to-end delay AOMDV has outperformed the proposed protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

Elephant Herding Optimization Ad Hoc On-Demand Multipath Distance Vector Routing Protocol for MANET

Sarhan

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…E A is the total initial energy of all the nodes on K th route and E k is computed in section 3.2. b) Bandwidth (B) [48]: Bandwidth is defined as the net bit rate, channel capacity or maximum throughput of a logical or physical communication system. The bandwidth B k ij between two nodes i and j can be defined as…”

Section: Definitionsmentioning

confidence: 99%

ACOLBR: ACO Based Load Balancing Routing In MANET

Dholey

Sinha

2021

Preprint

View full text Add to dashboard Cite

Real-time data transmission is one of the objectives of MANET (mobile ad-hoc network) to handle emergencies like a forest fire, flood, and earthquake. In this scenario, quick delivery of data is itself a challenging task for MANET and there is a possibility of load imbalance due to packet transmission in between source-destination pairs via the shortest path due to congestion or control overhead. In this paper, a novel routing protocol, called ACOLBR (ACO based load balancing routing), is design to control the congestion and balancing the load among the multiple paths in between source to destination. The similarity between the environment of Ant Colony and the MANET inspires the authors to apply ACO (Ant colony optimization) technique during routing in MANET to control congestion and balance the load in the network. In our proposal, two colonies of ants (red/blue) carry their packets based on the network condition. A decision variable is designed to select red/blue ant for transferring packets based on different network parameters such as bandwidth, energy, mobility, and distance. The selection of red ant means the route where the concentration of red pheromone is maximum and reverse is true for blue ant. This protocol is also concerns about the link failure during packet transmission in a route. Simulation results using OMNET++ show that ACOLBR outperforms ARA, ANTHOCNET, FACO, AODV, DSDV, DSR, CA-ARTT, and MOAODV in terms of load balancing efficiently in the route for data transmission in between source to destination.

show abstract

“…In this section, the simulation of the proposed HBCRFDT-GORS technique and existing VNACO [1], KF-MAC [2] are implemented using the NS2.34 network simulator. In order to conduct the simulation, mobile nodes are deployed in the square area (1100 𝑚 * 1100 𝑚).…”

Section: Simulation Settingmentioning

confidence: 99%

“…The volunteer Nodes of Ant Colony Optimization Routing (VNACO) technique was introduced in [1] with the aim of minimizing both the delay and routing overhead while distributing the data from source to destination. The designed VNACO technique increases the throughput and reduces the routing overhead but the higher delivery ratio was not achieved.…”

Section: Introductionmentioning

confidence: 99%

Hybridization of Brownboost and Random Forest Tree with Gradient Free Optimization for Route Selection

Tamilselvi¹,

Ravi²

2021

IJC

View full text Add to dashboard Cite

MANETs are self-organizing network architectures of mobile nodes. Due to node mobility, wireless network topologies dynamically various over time. A novel link stability estimation technique called Hybridization of Brownboost Cluster and Random Forest Decision Tree with Optimized Route Selection (HBCRFDT-GORS) technique is introduced for increasing the reliable data delivery by eliminating the stale routes in MANET. Brown Boost technique is applied to find the route paths having the smaller number of hop counts to perform the data transmission. After that, the status of the mobile nodes in the selected route paths is determined based on the residual energy and signal strength. Then, a random forest decision tree is applied to correctly identify the stale routes by finding the link failure due to the selfish node and the corruptive node along the route path. Then the broken link is removed from the route path. After eliminating the stale route from the path, the HBCRFDT-GORS technique finds the alternative optimal route through the gradient free optimization. The proposed HBCRFDT-GORS technique performs stale route elimination and improves reliable data delivery from source to destination. Simulation is conducted on different performance metrics such as routing overhead, packet delivery ratio, packet drop rate, and delay with respect to the number of data packets. The Network simulation results indicate that the HBCRFDT-GORS technique is improving the data delivery and and minimizing the delay as well as reducing the packet losses when compared to the baseline approaches.

show abstract

Volunteer nodes of ant colony optimization routing for minimizing delay in peer to peer MANETs

Cited by 15 publications

References 23 publications

Elephant Herding Optimization Ad Hoc On-Demand Multipath Distance Vector Routing Protocol for MANET

Elephant Herding Optimization Ad Hoc On-Demand Multipath Distance Vector Routing Protocol for MANET

ACOLBR: ACO Based Load Balancing Routing In MANET

Hybridization of Brownboost and Random Forest Tree with Gradient Free Optimization for Route Selection

Contact Info

Product

Resources

About