The Coverage Force Algorithm for Heterogeneous Wireless Sensor Networks
Qin Ning-ning①,Zhang Lin②,Xu Bao-guo①
①The School of Communication and Control Enfineering, Jiangnan University, Wuxi 214122, China; ②The Department of Electronic Engineering, Tsinghua University, Beijing 100084, China
摘要 对于普遍存在的异构传感器网络,目前尚缺乏有力的方法解决其覆盖势力的剖分问题。对此,该文提出一种本地化的覆盖势力剖分算法—CFA(Coverage Force Algorithm)。该算法根据节点感应能力的差异,构建基于感应异构性的“通用Voronoi”图,能有效对网络中异构节点的覆盖势力范围进行剖分。实验证明,CFA算法解决了异构网络覆盖性能分析问题,和传统的Voronoi图方法相比,具有广普性和本地化的特点。
Abstract:The Heterogeneous Wireless Sensor Networks (HWSN), which is more univeral, shows a lack of the study for coverage force sections. Therefore a novel localized method for analyzing the distribution of coverage force—the Coverage Force Algorithm (CFA) is presented. Depending on sensors’ own sensing abilities in HWSN, CFA can obtain the General Voronoi diagram and achieve section of coverage force for each node. Fortunately, simulations confirm that the CFA is able to solve the problem of analyzing coverage performance in HWSN. Compared to the traditional Voronoi diagram, the propsed algorithm shares the localized and general feature.