(1 + ϵ)2-and Polynomial-Time Approximation Algorithms for Network Lifetime Maximization With Relay Hop Bounded Connected Target Coverage in WSNs

Scheduling sensor activity to prolong the network lifetime while guaranteeing coverage and connectivity is a fundamental and critical issue in handling wireless sensor networks. Although many efforts have been made in this area, none of the prior works considers the relay hop bound constraint. As a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE sensors journal Ročník 21; číslo 7; s. 9577 - 9599
Hlavní autoři:	Le Nguyen, Phi, Ji, Yusheng, Pham, Minh Khiem, Le, Hieu, Nguyen, Thanh Hung
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Approximation Approximation algorithms Complexity Connectivity Heuristic algorithms lifetime maximization Linear programming Mathematical analysis Maximization Network latency Optimization Partitioning algorithms Polynomials PTAS Relay relay hop bound constraint Relays Scheduling Sensors Time complexity Wireless networks Wireless sensor network Wireless sensor networks
ISSN:	1530-437X, 1558-1748
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!

Buďte první, kdo okomentuje tento záznam!