(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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE sensors journal Vol. 21; no. 7; pp. 9577 - 9599
Main Authors:	Le Nguyen, Phi, Ji, Yusheng, Pham, Minh Khiem, Le, Hieu, Nguyen, Thanh Hung
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!