基于邻居节点平均距离的网络覆盖判别模型  

A coverage discrimination model based on the average distance of neighbor nodes

作　　者：郑策策[1] 马福昌[1] 

机构地区：[1]太原理工大学新型传感器与智能控制教育部重点实验室,山西太原030024

出　　处：《光通信研究》2013年第5期60-62,共3页Study on Optical Communications

基　　金：教育部科学技术研究重点项目(210270)

摘　　要：在SITE(信息技术与工程学院)算法基础上,提出了ADDM(基于邻居节点平均距离的网络覆盖判别模型)算法,通过计算所有邻居节点与本节点的平均距离和交叠区域的圆心角来判别该节点是否为冗余节点。理论分析与仿真实验表明,ADDM算法较大地改善了SITE算法,成功解决了SITE算法没有考虑距离大于感知半径的节点对覆盖冗余贡献的问题,从而用更少的节点实现了区域的覆盖,节省了网络节点的活动数目,延长了网络的生存时间。On the basis of the SITE algorithm,this paper proposes a node coverage discrimination model based on the average distance of neighbor nodes （ADDM）for wireless sensor networks,which discriminate whether a certain node is redundant or not by computing the average distance between this node and all the neighbor nodes and the central angle of the overlapping are-a.Theoretical analysis and simulation results show that the ADDM improves the SITE algorithm,overcomes its failure to con-sider the contribution of those nodes with distances longer than radius of perception in covering redundant nodes,thus realizing the regional coverage with fewer nodes,reducing the number of active network nodes and prolonging the network life time.

关 键 词：无线传感器网络 平均距离 SITE算法 覆盖判别 

分 类 号：TN926[电子电信—通信与信息系统]