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...

Celý popis

Podrobná bibliografie

Vydáno v:	Annual Joint Conference of the IEEE Computer and Communications Societies s. 1099 - 1108
Hlavní autoři:	Xu, Wenzheng, Peng, Dezhong, Liang, Weifa, Jia, Xiaohua, Xu, Zichuan, Zhou, Pan, Wu, Weigang, Chen, Xiang
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 02.05.2022
Témata:	approximation algorithms Conferences Internet maximum connected coverage problem Optimization Relays submodular function maximization UAV communication networks
ISSN:	2641-9874
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!