Optimizing FANET Routing Using a Hybrid Approach of Firefly Algorithm and ACO-Lévy Flight

Nath, Subhrapratim; Paul, Abhijit; Banerjee, Rupam; Bhaumik, Swarnabja; Sing, Jamuna Kanta; Sarkar, Subir Kumar

doi:10.1109/vlsidcs47293.2020.9179956

Cited by 10 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to improve the selection of available routes, authors [37] have developed a reliable and energy effective algorithm based on the concept of Learning Automata (LA) theory. Nath et al [38] has suggested a hybrid ACO and Ant Bee Colony optimization technique for the successful cluster head selection that overcomes the mutual limitations of ACO and ABC. The problems associated with the stagnation of the ACO intensification process are prevented by the use of exploration agents.…”

Section: Related Workmentioning

confidence: 99%

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Anubha¹,

Bedi²,

Khan³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Mobile adhoc networks have grown in prominence in recent years, and they are now utilized in a broader range of applications. The main challenges are related to routing techniques that are generally employed in them. Mobile Adhoc system management, on the other hand, requires further testing and improvements in terms of security. Traditional routing protocols, such as Adhoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), employ the hop count to calculate the distance between two nodes. The main aim of this research work is to determine the optimum method for sending packets while also extending life time of the network. It is achieved by changing the residual energy of each network node. Also, in this paper, various algorithms for optimal routing based on parameters like energy, distance, mobility, and the pheromone value are proposed. Moreover, an approach based on a reward and penalty system is given in this paper to evaluate the efficiency of the proposed algorithms under the impact of parameters. The simulation results unveil that the reward penalty-based approach is quite effective for the selection of an optimal path for routing when the algorithms are implemented under the parameters of interest, which helps in achieving less packet drop and energy consumption of the nodes along with enhancing the network efficiency.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Anubha¹,

Bedi²,

Khan³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…SPIDER [183] is one of the countless variant of Bio inspired P2P overlays, like Ant colonies [184,185], bee swarms [186]. It is a P2P structured overlay that is based on the spider web overlay who aims to emphasize the possible actions in this overlay like joining, leaving and lookups.…”

Section: Bio-inspired P2p Overlaysmentioning

confidence: 99%

“…For instance, designing a new type of blockchain for secure message dissemination over VANET. Set of UAVs hovers over VANETs to bridge communication gaps between vehicles [180,184,185,186,187] Enhancing P2P overlays with machine learning techniques…”

Section: Blockchain P2p Overlaysmentioning

confidence: 99%