Abstract
Routing optimization for FANETs is a kind of NP-hard problem in the field of combinatorial optimization that is simple to model but difficult to solve. The quality of routing has a direct impact on the network quality of FANETs, and the design of routing protocols becomes a very challenging topic. In this paper, we study the characteristics of dynamic routing, combine the characteristics of FANETs themselves, and use the energy of nodes, bandwidth, link stability, etc., as the metric of routing and use a Boltzmann machine for routing search to form an optimized dynamic routing protocol. The NS3 simulator is used to compare and study the traditional MANET dynamic routing methods AODV and DSR, and the simulation results show that the routes obtained by using the Boltzmann machine search are better than those of AODV and DSR in many aspects, such as end-to-end average delay, average route survival time and control overhead.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
