FUSION ROUTING ALGORITHM FOR AERIAL WIRELESS NETWORK
Author(s):
ELAMARAN, GAYATHIRI.E, MUKUNDHAN.Te, VISHNU.CH
Keywords:
ACO, FANET, Greedy Algorithm, QoS Routing
Abstract
Flying Ad-Hoc Networks (FANETs) are designed for providing seam- less connectivity between mobile devices in both air and ground level communications. The problem of neighbor discovery and data exchange relies on the availability and distribution of the infrastructure units. This limits the available routes in communicating the neighbors in mobile environments. This project introduces a novel quality of service (QoS) routing for improving the efficiency of FANETs. In this routing, the conventional ant colony optimization (ACO) and greedy methods are integrated for providing improved routing. ACO agents are responsible for discovering optimal routes to the destination whereas the greedy method filters the QoS defacing factors for improving the routing solution. The ant agents identify local solutions through periodic pheromone update and generate maximum possible solutions. In the greedy filtering process, the QoS factors are identified and the best-afford nodes are used for routing and transmission. The delay and congestion factors are used for determining best-afford route using the greedy process. The number of ACO solutions is refined based on the QoS output in the destination that makes up the best solution. The above processes are recurrent until the transmission between the source and destination is successful with better QoS.
Article Details
Unique Paper ID: 151458
Publication Volume & Issue: Volume 8, Issue 1
Page(s): 140 - 147
Article Preview & Download
Share This Article
Conference Alert
NCSST-2021
AICTE Sponsored National Conference on Smart Systems and Technologies
Last Date: 25th November 2021
SWEC- Management
LATEST INNOVATION’S AND FUTURE TRENDS IN MANAGEMENT