Authors: Yingfan L Du Lidong Wu
Publish Date: 2016/04/13
Volume: 10, Issue: 6, Pages: 1299-1303
Abstract
Given a target region Ω and a set of n homogeneous sensors we study the problem of finding a minimum subset of sensors such that they induce a connected graph and cover Ω We present a new method to replace the target region Ω by a set of target points mathcal P In addition we will give a new analysis for some existing approximation algorithms of the above minimum connected sensor cover problem The new analysis will give better approximation performance ratios
Keywords: