A simple coverage-evaluating approach for wireless sensor networks with arbitrary sensing areas
暂无分享,去创建一个
We present a simple and fast deterministic solution to the area coverage problem in wireless sensor networks. The task is to determine whether all points in a region are covered by a given set of sensors, where each sensor may have any arbitrary sensing shape. We transform the area coverage problem to the intersection points' coverage problem, which is simpler and more suitable for evaluating the area coverage problem than previous approaches in our view.
[1] Yu-Chee Tseng,et al. The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.
[2] L. Santaló. Integral geometry and geometric probability , 1976 .
[3] Guoliang Xing,et al. Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.
[4] Ivan Stojmenovic,et al. Localized Sensor Area Coverage with Low Communication Overhead , 2008, IEEE Trans. Mob. Comput..