H-hop independently submodular maximization problem with curvature - 文章详情页

作者：

Lv, Yang (Lv, Yang.) | Wu, Chenchen (Wu, Chenchen.) | Xu, Dachuan (Xu, Dachuan.) | Yang, Ruiqi (Yang, Ruiqi.)

收录：

EI Scopus

摘要：

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　[Formula　presented].　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%.　©　2024　The　Author(s)

关键词：

Internet of things Approximation algorithms Unmanned aerial vehicles (UAV)

作者机构：

[ 1 ] [Lv, Yang]Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing; 100124, China
[ 2 ] [Wu, Chenchen]College of Science, Tianjin University of Technology, Tianjin; 300382, China
[ 3 ] [Xu, Dachuan]Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing; 100124, China
[ 4 ] [Yang, Ruiqi]Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing; 100124, China

通讯作者信息：

电子邮件地址：

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至