Back to Search
Start Over
H-hop independently submodular maximization problem with curvature
- Source :
- High-Confidence Computing, Vol 4, Iss 3, Pp 100208- (2024)
- Publication Year :
- 2024
- Publisher :
- Elsevier, 2024.
-
Abstract
- 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%.
Details
- Language :
- English
- ISSN :
- 26672952
- Volume :
- 4
- Issue :
- 3
- Database :
- Directory of Open Access Journals
- Journal :
- High-Confidence Computing
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.776f3f72da6547919b5e38ed27d34723
- Document Type :
- article
- Full Text :
- https://doi.org/10.1016/j.hcc.2024.100208