From battlefields to urban grids: New research challenges in ad hoc wireless networks
Pervasive and Mobile Computing
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
A branch-and-price approach to p-median location problems
Computers and Operations Research
Minimum disruption service composition and recovery in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Vehicular networks and the future of the mobile internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Facility location problems: A parameterized view
Discrete Applied Mathematics
Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP
Journal of Intelligent and Robotic Systems
On the lifetime of node-to-node communication in wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Special issue on micro-UAV perception and control
Autonomous Robots
Markov Chain Analysis of Self-organizing Mobile Nodes
Journal of Intelligent and Robotic Systems
Survey Flying Ad-Hoc Networks (FANETs): A survey
Ad Hoc Networks
Hi-index | 0.00 |
This paper considers the problem of employing multiple unmanned aerial vehicles (UAVs) to the mobile ad hoc network (MANET) as relay backbone nodes to construct the backbone network, to improve the network connectivity, and to address many issues in the MANET such as linkage, capacity, load balance, and reliability. With considering the dynamic nature of the problem, this study provides several linear location problem models and their extensions to accommodate these issues. Due to the size of linear location models associated with a large number of constraints, the problem becomes computational challenging even with modest size of nodes. To overcome the computational barrier, we recast these location problem models using a quadratic unconstrained binary optimization (QUBO) framework and solve these QUBO models with a Tabu search heuristic with preprocessing. The analysis of the solutions that are produced by QUBO together with the comparisons made with the linear model highlight both the attractiveness and robustness of the proposed approach. The results of this study provide support to future advanced routing protocol development.