Sciweavers

Share
INFOCOM
2012
IEEE

Constant-approximation for target coverage problem in wireless sensor networks

6 years 9 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the field? This is a well-known problem, called Maximum Lifetime Coverage Problem (MLCP), which has been studied extensively in the literature. It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The bestknown approximation algorithm has performance ratio 1 + ln
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where INFOCOM
Authors Ling Ding, Weili Wu, James Willson, Lidong Wu, Zaixin Lu, Wonjun Lee
Comments (0)
books