Abstract
This letter jointly investigates the trajectory and radio resource optimization for multiple unmanned aerial vehicles (UAVs) to fully deliver critical data in vehicular networks during disaster situations. We aim to minimize the number of deployed UAVs to fully serve all vehicles. The formulated problem is generally NP-hard. To solve it, we employ a sequence of convex approximates. Then, we develop an efficient algorithm to sequentially solve this problem. Our numerical results demonstrate the effectiveness of our proposed design and show that during the mission time, the UAVs adapt their velocities in order to fulfill the requirement of each vehicle.
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.
