4.7 Article

Constrained Utility Maximization in Dual-Functional Radar-Communication Multi-UAV Networks

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 69, Issue 4, Pages 2660-2672

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2020.3044616

Keywords

Sensors; Radar; Downlink; Unmanned aerial vehicles; Radar detection; Optimization; Power control; Multi-UAV network; dual-functional radar-communication; user association; power control; joint communication and radar sensing

Funding

  1. National Natural Science Foundation of China [61871032]

Ask authors/readers for more resources

This paper investigates the network utility maximization problem in a dual-functional radar-communication multi-UAV network, proposing a computationally practical method to solve this NP-hard problem by decomposing it into three sub-problems and introducing three mechanisms based on spectral clustering, coalition game, and successive convex approximation. The proposed algorithm significantly improves the minimum user data rate and fairness of the network while increasing network utility with lower power consumption and similar localization accuracy compared to conventional techniques.
In this paper, we investigate the network utility maximization problem in a dual-functional radar-communication multi-unmanned aerial vehicle (multi-UAV) network where multiple UAVs serve a group of communication users and cooperatively sense the target simultaneously. To balance the communication and sensing performance, we formulate a joint UAV location, user association, and UAV transmission power control problem to maximize the total network utility under the constraint of localization accuracy. We then propose a computationally practical method to solve this NP-hard problem by decomposing it into three sub-problems, i.e., UAV location optimization, user association and transmission power control. Three mechanisms are then introduced to solve the three sub-problems based on spectral clustering, coalition game, and successive convex approximation, respectively. The spectral clustering result provides an initial solution for user association. Based on the three mechanisms, an overall algorithm is proposed to iteratively solve the whole problem. We demonstrate that the proposed algorithm improves the minimum user data rate significantly, as well as the fairness of the network. Moreover, the proposed algorithm increases the network utility with a lower power consumption and similar localization accuracy, compared to conventional techniques.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available