H-hop independently submodular maximization problem with curvature  

作　　者：Yang Lv Chenchen Wu Dachuan Xu Ruiqi Yang 

机构地区：[1]Beijing Institute for Scientific and Engineering Computing,Beijing University of Technology,Beijing 100124,China [2]College of Science,Tianjin University of Technology,Tianjin 300382,China

出　　处：《High-Confidence Computing》2024年第3期75-81,共7页高置信计算（英文）

基　　金：supported by Beijing Natural Science Foundation Project(Z220004);the Natural Science Foundation of China(12371320);the Natural Science Foundation of China(12101587);China Postdoctoral Science Foundation(2022M720329)。

摘　　要：The Connected Sensor Problem(CSP)presents a prevalent challenge in the realms of communication and Internet of Things(IoT)applications.Its primary aim is to maximize the coverage of users while maintaining connectivity among K sensors.Addressing the challenge of managing a large user base alongside a finite number of candidate locations,this paper proposes an extension to the CSP:the h-hop independently submodular maximization problem characterized by curvatureα.We have developed an approximation algorithm that achieves a ratio of 1−e−α/(2h+3)α.The efficacy of this algorithm is demonstrated on the CSP,where it shows superior performance over existing algorithms,marked by an average enhancement of 8.4%.

关 键 词：Internet of things UAV communication Approximation algorithms 

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置]