任意感知模型的传感器网络覆盖度判定算法

覆盖问题是无线传感器中的一个基本问题,反映了网络所提供的"感知"服务质量,为解决任意感知模型的无线传感器网络覆盖度判定问题,结合区域封闭性和计算几何的相关知识,本文提出了将复杂的区域覆盖问题转化为易于解决的点覆盖问题。在此基础上,给出了基于覆盖交点集合的判断算法,即找到任意两个传感器感知区域边界线之间以及每个传感器与覆盖区域边界线之间的所有交点,其中位于覆盖区域内或者边界上交点的最小覆盖度即为传感器网络的覆盖度。

Degrees of the Wireless Sensor Network with Arbitrary Sensing Areas

The coverage is a fundamental research issue in WSN because it can be considered as the measure of QoS of the sensing function for a sensor network. In order to evaluate the coverage degrees of the wireless sensor network with arbitrary sensing areas,we transform the area coverage problem to the intersection points’ coverage problem based on regional closeness and computational geometry techniques. An algorithm for calculating the coverage degrees is proposed by analyzing the set of intersection (SI) inside or onto the boundary of the coverage region,and SI includes:(1) the intersecting points or the two end points of the intersecting lines of any two boundaries of sensors; or (2) the intersecting points or the two end points of the intersecting lines between any boundary of a sensor and the boundary of  the coverage region. The coverage degrees of wireless sensor networks are identical to the minimal coverage degrees among SI.