Datagram Loss Reduction in FANET using Dijkstra Algorithm

Abstract

In recent years lot of research has been done on the mobile adhoc networks so the new research area flying adhoc networks has attracted many researchers. Flying adhoc network is new concept to Mobile adhoc network and Vehicular adhoc network which tackles the situations that Mobile adhoc network and Vehicular adhoc network cannot do. Instead of one large Unmanned aerial vehicle, multi Unmanned aerial vehicles are used which forms an adhoc network which is called Flying adhoc network. Due to the topology change and high mobility of the nodes it is a challenge to apply suitable routing protocol for communication among the Unmanned aerial vehicles. For communication among the Unmanned aerial vehicles routing protocols are used. There are various routing protocols but few can implement the applications of Flying adhoc network in real world scenario. The applications of Flying adhoc network have not been used widely because there is no protocol for connection establishment of Flying adhoc netwrok and there are lot of hurdles in deploying Flying adhoc network. In this dissertation we discussed the feasibility of deploying Flying adhoc network in real world environment.A dynamic network topology is created.The base station and Unmanned aerial vehicles are created dynamically. For communication among the Unmanned aerial vehicles shortest path is calculated using Dijkstra Algorithm. Base Station sends the Internet Protocol of neighbours to all the nodes in the network. Through this the communication among Unmanned aerial vehicles can take place.