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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annual Joint Conference of the IEEE Computer and Communications Societies S. 1099 - 1108
Hauptverfasser: Xu, Wenzheng, Peng, Dezhong, Liang, Weifa, Jia, Xiaohua, Xu, Zichuan, Zhou, Pan, Wu, Weigang, Chen, Xiang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 02.05.2022
Schlagworte:
approximation algorithms
Conferences
Internet
maximum connected coverage problem
Optimization
Relays
submodular function maximization
UAV communication networks
ISSN:2641-9874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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 UAV from its served users need to be sent to the Internet through relays of other UAVs. Motivated by this application, in this paper we study a more generalized problem - the h-hop independently submodular maximization problem, where the MCCP problem is one of its special cases with h = 4. We propose a \frac{{1 - 1/e}}{{2h + 3}}-approximation algorithm for the h-hop independently submodular maximization problem, where e is the base of the natural logarithm. Then, one direct result is a \frac{{1 - 1/e}}{{11}}-approximate solution to the MCCP problem with h = 4, which significantly improves its currently best \frac{{1 - 1/e}}{{32}}-approximate solution. We finally evaluate the performance of the proposed algorithm for the MCCP problem in the application of deploying UAV networks, and experimental results show that the number of users served by deployed UAVs delivered by the proposed algorithm is up to 12.5% larger than those by existing algorithms.
AbstractList 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 UAV from its served users need to be sent to the Internet through relays of other UAVs. Motivated by this application, in this paper we study a more generalized problem - the h-hop independently submodular maximization problem, where the MCCP problem is one of its special cases with h = 4. We propose a \frac{{1 - 1/e}}{{2h + 3}}-approximation algorithm for the h-hop independently submodular maximization problem, where e is the base of the natural logarithm. Then, one direct result is a \frac{{1 - 1/e}}{{11}}-approximate solution to the MCCP problem with h = 4, which significantly improves its currently best \frac{{1 - 1/e}}{{32}}-approximate solution. We finally evaluate the performance of the proposed algorithm for the MCCP problem in the application of deploying UAV networks, and experimental results show that the number of users served by deployed UAVs delivered by the proposed algorithm is up to 12.5% larger than those by existing algorithms.
Author Liang, Weifa
Jia, Xiaohua
Xu, Zichuan
Zhou, Pan
Peng, Dezhong
Xu, Wenzheng
Wu, Weigang
Chen, Xiang
Author_xml – sequence: 1
  givenname: Wenzheng
  surname: Xu
  fullname: Xu, Wenzheng
  email: wenzheng.xu3@gmail.com
  organization: Sichuan University,College of Computer Science,Chengdu,P. R. China
– sequence: 2
  givenname: Dezhong
  surname: Peng
  fullname: Peng, Dezhong
  email: pengdz@scu.edu.cn
  organization: Sichuan University,College of Computer Science,Chengdu,P. R. China
– sequence: 3
  givenname: Weifa
  surname: Liang
  fullname: Liang, Weifa
  email: weifa.liang@cityu.edu.hk
  organization: City University of Hong Kong,Department of Computer Science,Hong Kong,P. R. China
– sequence: 4
  givenname: Xiaohua
  surname: Jia
  fullname: Jia, Xiaohua
  email: csjia@cityu.edu.hk
  organization: City University of Hong Kong,Department of Computer Science,Hong Kong,P. R. China
– sequence: 5
  givenname: Zichuan
  surname: Xu
  fullname: Xu, Zichuan
  email: z.xu@dlut.edu.cn
  organization: Dalian University of Technology,School of Software,Dalian,P. R. China
– sequence: 6
  givenname: Pan
  surname: Zhou
  fullname: Zhou, Pan
  email: panzhou@hust.edu.cn
  organization: Huazhong University of Science and Technology,School of Cyber Science and Engineering,Wuhan,China
– sequence: 7
  givenname: Weigang
  surname: Wu
  fullname: Wu, Weigang
  email: wuweig@mail.sysu.edu.cn
  organization: Sun Yat-sen University,Guangzhou,China,510006
– sequence: 8
  givenname: Xiang
  surname: Chen
  fullname: Chen, Xiang
  email: chenxiang@mail.sysu.edu.cn
  organization: Sun Yat-sen University,Guangzhou,China,510006
BookMark eNotj9FKwzAYhaMouE6fwJv6AJ1_kr9pcinFaWFziO56ZE3qIm1a2lScT2_F3ZzD-Q4cOBG58K23hNxRWFAK6r54WW7yzRqllLBgwNhCZUqoNDsjERUixVQyhudkxgTSRMkMr0g0DJ8AIDMmZuR1rb9d436c_4gPyaHt4sIb29lJfKiP8du4b1oz1rqPl6Mvg2v9EG-nto_z1ns7kS8Xjn9hCL12PlyTy0rXg705-Zxsl4_v-XOy2jwV-cMqcQx4SDTVlcISaVYhQ1OWyho0XCNSs5d7KilTBgWUtBIcQaRA0xQ1ZGAl59LwObn933XW2l3Xu0b3x93pPv8F7nxTPg
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/INFOCOM48880.2022.9796957
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1665458224
9781665458221
EISSN 2641-9874
EndPage 1108
ExternalDocumentID 9796957
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  funderid: 10.13039/501100001809
– fundername: City University of Hong Kong
  funderid: 10.13039/100007567
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i203t-a1af94c417f424dcc9ed4d3a441db8b18129d460c1f63406501554a070e8338d3
IEDL.DBID RIE
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000936344400111&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:23:52 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-a1af94c417f424dcc9ed4d3a441db8b18129d460c1f63406501554a070e8338d3
PageCount 10
ParticipantIDs ieee_primary_9796957
PublicationCentury 2000
PublicationDate 2022-May-2
PublicationDateYYYYMMDD 2022-05-02
PublicationDate_xml – month: 05
  year: 2022
  text: 2022-May-2
  day: 02
PublicationDecade 2020
PublicationTitle Annual Joint Conference of the IEEE Computer and Communications Societies
PublicationTitleAbbrev INFOCOM
PublicationYear 2022
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0008726
Score 2.2354867
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 1099
SubjectTerms approximation algorithms
Conferences
Internet
maximum connected coverage problem
Optimization
Relays
submodular function maximization
UAV communication networks
Title Maximizing h-hop Independently Submodular Functions Under Connectivity Constraint
URI https://ieeexplore.ieee.org/document/9796957
WOSCitedRecordID wos000936344400111&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61iOjFRyu-ieDRbXeT7CY5Fxd76ENQ6K1k86ALtlvarai_3iRdVgUv3jKBEJhM5pHMzAfAXSJkjBWmAckUtgGKRoEgyASYSCGNwkQp4cEm6HDIJhM-boD7uhZGa-2Tz3THDf1fvirkxj2VdTnlCY_pDtihNNnWatVal1GU7IHbqodmtz9MR73RwIonC20UiFCnWvwLRcUbkfTwf9sfgfZ3NR4c13bmGDT04gQc_Ggk2AJPA_Gez_NPS8BZMCuWsF_D25avH9Cqh3mhXMYpTK0h87IGPeQR9Jkucosh4Yi1B40o2-AlfXjuPQYVWEKQoxCXgYiE4USSiBqCiJKSa0UUFtbdURnLnCHniiShjEyCiXPMnCch7I3XzIapCp-C5qJY6DMAWWhiFYcyS7QmWEbMIE6YjEONTSQJOQctx5zpctsPY1rx5eLv6Uuw7_jvkwTRFWiWq42-BrvyrczXqxt_iF-PIZ9w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1ZSwMxEB5qFY8Xj1a8XcFHt91NstdzcWmx3Vao0LeS5qALtlvarai_3iRdVgVffMsEAmEymSOZmQ_g3qfMwxwHNplwrAIUgWxKkLQxYZRJjgnn1IBNBEkSjkbRoAIPZS2MEMIkn4mGHpq_fJ6xtX4qa0ZB5EdesAXbGjmrqNYq9W4YIH8X7ooums1OEvdb_Z4S0NBRcSBCjWL5LxwVY0biw_9t4Ajq3_V41qC0NMdQEfMTOPjRSrAGzz36ns7ST0VYU3uaLaxOCXCbv35YSkHMMq5zTq1YmTIjbZYBPbJMrgvboEhoYmVgI_I6vMSPw1bbLuAS7BQ5OLepS2VEGHEDSRDhjEWCE46pYhWfhBNtyiNOfIe50sdEu2bal6DqzotQBaocn0J1ns3FGVihIz3uOWziC0Ewc0OJIhIyzxFYuoyQc6hp5owXm44Y44IvF39P38Jee9jrjrud5OkS9vVZmJRBdAXVfLkW17DD3vJ0tbwxB_oFDOiiuQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Annual+Joint+Conference+of+the+IEEE+Computer+and+Communications+Societies&rft.atitle=Maximizing+h-hop+Independently+Submodular+Functions+Under+Connectivity+Constraint&rft.au=Xu%2C+Wenzheng&rft.au=Peng%2C+Dezhong&rft.au=Liang%2C+Weifa&rft.au=Jia%2C+Xiaohua&rft.date=2022-05-02&rft.pub=IEEE&rft.eissn=2641-9874&rft.spage=1099&rft.epage=1108&rft_id=info:doi/10.1109%2FINFOCOM48880.2022.9796957&rft.externalDocID=9796957