Synthesizing Robust Communication Networks for Unmanned Aerial Vehicles With Resource Constraints Academic Article uri icon

abstract

  • Copyright © 2015 by ASME. In this article, we address the problem of synthesizing communication networks for unmanned aerial vehicles (UAVs) in the presence of resource constraints. UAVs can be deployed as backbone nodes in ad hoc networks that can be central to civilian and military applications. The cost of operation of the network depends on the resources that are used such as the total power consumption associated with the network and the number of communication links in the network. The objective of the problem is to synthesize a communication network that maximizes connectivity subject to the cost of operation being within the specified budget for the resources. It is known that algebraic connectivity is a measure of robust connectivity and hence, it is chosen as an objective for optimization. We pose the network synthesis problem as a mixed-integer semidefinite program (MISDP): (1) provide an algorithm for computing optimal solutions using cutting plane methods; (2) develop lower bounds by posing the problem as a binary semidefinite program; and (3) construct feasible solutions using heuristics and estimate their quality. The network synthesis problem is a nondeterministic polynomial-time (NP)-hard problem. We provide some computational results to corroborate the performance of the proposed algorithms.

author list (cited authors)

  • Nagarajan, H., Rathinam, S., & Darbha, S.

citation count

  • 5

publication date

  • June 2015