Journal
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS
Volume 74, Issue 1-2, Pages 455-464Publisher
SPRINGER
DOI: 10.1007/s10846-013-9939-y
Keywords
MANET; UAV; Linear programming; Quadratic programming; Optimization; Neighborhood search heuristic
Funding
- A. R. Sanchez School of Business Research Grant
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available