Abstract

In recent years, unmanned aerial vehicles (UAVs) have gained popularity in various applications and services in both the military and civilian domains. Compared with the single-UAV scenario, flying ad hoc networks (FANETs) consisting of ground stations (GSs) and UAVs have the advantages of flexible configuration and wide coverage. However, due to significant mobility and highly dynamic topology, designing reliable and efficient routing protocols for FANETs is a challenging task. In this paper, we consider a network that comprises multiple flying UAVs and GSs to transfer messages by multi-hop relaying. We propose a routing protocol, named course-aware opportunistic routing for FANETs (CORF). The UAVs cooperatively exchange aeronautical data with others. The source UAV node (SUN) calculates the transfer probabilities to different neighbors by jointly considering the positions of its neighbors and the destination node. Based on the direction information and the transfer probabilities, the SUN selects the next-hop relay nodes among the neighbor UAVs and GSs. This process continues until the destination node receives the message. The simulation results demonstrate that, the proposed CORF protocol achieves significant performance superiority as compared with the traditional protocols in terms of message delivery rate and network latency.

Highlights

  • In recent years, the rapid development of sensors, embedded devices, and navigation systems such as GPS has enabled the wide application of unmanned aerial vehicles (UAVs) in military and civilian domains [1]–[2]

  • The source UAV node (SUN) selects the next-hop relay nodes among the neighbor UAVs and ground stations (GSs) by the course information and transfer probability

  • In course-aware opportunistic routing for FANETs (CORF), the SUN selects the hop considering the courses of neighbor UAV nodes (NUNs), CORF can utilize the aeronautical data among UAVs and the mobility of UAVs to improve the performance of routing

Read more

Summary

A Course-Aware Opportunistic Routing Protocol for FANETs

YIXIN HE 1, XIAO TANG 1, (Member, IEEE), RUONAN ZHANG 1, (Member, IEEE), XIAOJIANG DU 2, DEYUN ZHOU1, AND MOHSEN GUIZANI 3, (Fellow, IEEE).

INTRODUCTION
RELATED WORK
COURSE INFORMATION
DIRECTION CALCULATION
TRANSFER PROBABILITY
Findings
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.