TY - GEN

T1 - Approximations for minimum connected sensor cover

AU - Wu, Lidong

AU - Du, Hongwei

AU - Wu, Weili

AU - Li, Deying

AU - Lv, Jing

AU - Lee, Wonjun

PY - 2013

Y1 - 2013

N2 - Given a requested area, the Minimum Connected Sensor Cover problem is to find a minimum number of sensors such that their communication ranges induce a connected graph and their sensing ranges cover the requested area. Several polynomial-time approximation algorithms have been designed previously in the literature. Their best known performance ratio is O(r lnn) where r is the link radius of the sensor network and n is the number of sensors. In this paper, we will present two polynomial-time approximation algorithms. The first one is a random algorithm, with probability 1-ε, producing an approximation solution with performance ratio O(log3 n log log n), independent from r. The second one is a deterministic approximation with performance ratio O(r), independent from n.

AB - Given a requested area, the Minimum Connected Sensor Cover problem is to find a minimum number of sensors such that their communication ranges induce a connected graph and their sensing ranges cover the requested area. Several polynomial-time approximation algorithms have been designed previously in the literature. Their best known performance ratio is O(r lnn) where r is the link radius of the sensor network and n is the number of sensors. In this paper, we will present two polynomial-time approximation algorithms. The first one is a random algorithm, with probability 1-ε, producing an approximation solution with performance ratio O(log3 n log log n), independent from r. The second one is a deterministic approximation with performance ratio O(r), independent from n.

UR - http://www.scopus.com/inward/record.url?scp=84883085328&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883085328&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2013.6566910

DO - 10.1109/INFCOM.2013.6566910

M3 - Conference contribution

AN - SCOPUS:84883085328

SN - 9781467359467

T3 - Proceedings - IEEE INFOCOM

SP - 1187

EP - 1194

BT - 2013 Proceedings IEEE INFOCOM 2013

T2 - 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013

Y2 - 14 April 2013 through 19 April 2013

ER -