Greedy Game Algorithms for Solving SET <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Cover Problem in HWSNs

Greedy Game Algorithms for Solving SET <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-Cover Problem in HWSNs

Coverage is a fundamental problem in heterogeneous wireless sensor networks (HWSNs). Lifetime of the HWSNs is another important problem in this area. The K-Cover problem can solve both the coverage and lifetime issues. Especially, the lifetime of HWSNs can be prolonged by solving the SET K-Cover pro...

Full description

Bibliographic Details
Main Authors: Wenjie Yan, Mengjing Cao, Youxi Wu, Jun Zhang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Greedy game algorithms (GGAs)
SET <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">K</italic>-Cover
heterogeneous wireless sensor networks (HWSNs)
Nash equilibrium
Online Access:https://ieeexplore.ieee.org/document/8471098/

Internet

https://ieeexplore.ieee.org/document/8471098/

Similar Items