基于冲突测度的自组网脆弱点发现算法  

Connectedness of Network Links Based on Interference Measure in Self-Configure Networks

作　　者：王巍[1,2] 杨红娃[1,2] 潘高峰[1,2] 

机构地区：[1]通信信息控制和安全技术重点实验室,浙江嘉兴314033 [2]中国电子科技集团公司第三十六研究所,浙江嘉兴314033

出　　处：《通信对抗》2011年第1期39-42,共4页Communication Countermeasures

摘　　要：在无中心自组织的无线多跳网络中，网络连通性问题作为研究的重点引起广大研究人员的关注。首先介绍了邻近图，并在相关邻近图的基础上引入了冲突测度理论，然后利用基于RNG的冲突测度理论对自组网的链路连通性进行研究，通过仿真说明此方法可以有效评估网络拓扑中节点和边对整个网络的链路连通性的影响。In the wireless mufti-hop self-configure networks without center, the link connectness has become a major problem. In this paper, the proximity graphs is introduced firstly, and the theory of interference measure is described based on the relative neighborhood graph （RNG）. And the link connectedness of self-configure networks is discussed by the proposed method. The relations of nodes and edges with the connectedness of whole network is shown by the emulation experiments.

关 键 词：自组网 邻近图 冲突测度 链路连通性 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]