Approximation algorithms for sweep coverage in wireless sensor networks

Abstract

Coverage is one of the most important issues in wireless sensor networks WSNs and it is a well studied research area To ensure coverage a set of sensors continuously monitor the subject to be covered Sweep coverage is a recent development for the applications of WSNs where periodic monitoring by a set of mobile sensors is sufficient instead of continuous one like traditional coverage In this thesis we remark on the flaw of the approximation algorithms Mo Li Wei Fang Cheng Kebin Liu Yu