Maximizing h-hop Independently Submodular Functions Under Connectivity Constraint

This study is motivated by the maximum connected coverage problem (MCCP), which is to deploy a connected UAV network with given K UAVs in the top of a disaster area such that the number of users served by the UAVs is maximized. The deployed UAV network must be connected, since the received data by a...

Full description

Bibliographic Details

Published in:	Annual Joint Conference of the IEEE Computer and Communications Societies pp. 1099 - 1108
Main Authors:	Xu, Wenzheng, Peng, Dezhong, Liang, Weifa, Jia, Xiaohua, Xu, Zichuan, Zhou, Pan, Wu, Weigang, Chen, Xiang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 02.05.2022
Subjects:	approximation algorithms Conferences Internet maximum connected coverage problem Optimization Relays submodular function maximization UAV communication networks
ISSN:	2641-9874
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!