资 源 简 介
we study the coverability of WSNs through computational geometry theories. We combine existing computational geometry techniques such as the Voronoi diagram and Delaunay triangulation with graph theoretical algorithmic techniques.
Although the worst-case coverage and best-case coverage problems have been studied previously, they lack algorithms to further evaluate the coverability of WSNs.
Based on previous studies cite{meguerdichian2001coverage}, we propose five algorithms to evaluate the coverage performance, enabling direct application of search techniques in the resulting graph representation.
Moreover, an approximate algorithm to realize weighted Voronoi diagram (WVD) is illustrated, which is utilized to demonstrate the heterogeneous characteristic of sensor nodes, that is, diverse capability.
