Sweep Coverage approach with A-means clustering algorithm
Jiliu Zhou · Jisuanji yingyong yanjiu · 2012
The key issue of sweep coverage scheme is to schedule the sensor' s mobility effectively in real scene. In this work,this paper proposed a novel Sweep Coverage approach with A-means ( self-adaptive K-means algorithm) clustering algorithmnamed CBSC. The simulation results show that the CBSC achieves better performance than existing approaches in real scene.