降低Ad hoc网络信息泄露的路由算法  

A routing algorithm for information leakage reduction in Ad-hoc networks

作　　者：刘玉军[1] 汪明辉[1] 蔡猛[1] 陈坤[1] 

机构地区：[1]装甲兵工程学院信息工程系,北京100072

出　　处：《计算机工程与科学》2015年第6期1087-1092,共6页Computer Engineering & Science

基　　金：军内科研计划资助项目

摘　　要：分析了Ad-hoc网络信息传输过程中信息泄露的途径和原因,提出了Ad-hoc网络信息泄露模型,设计了一种降低信息泄露的路由算法RARIL。该算法在加权图模型的基础上,加入节点位置信息和身份认证,减少组外节点和组内非信任节点窃听信息,优先信任节点转发信息,降低信息泄露概率。通过计算非信任节点信息泄露概率,选择信息泄露概率最小的节点作为转发节点,组建可控转发节点集合,保证集合中转发节点的信息泄露概率最小。最后,根据算法设计约束条件,以算法性能的主要影响因素设定算法评估指标,通过仿真比较路由算法在降低信息泄露方面的优越性。We analyze the approaches and causes of information leakage during information transmis- sion in Ad-hoc networks, design an Ad-hoc network model based on the leaked information, and propose a routing algorithm for information leakage reduction. Based on the weighted graph model, we add the node location information and authentication in order to reduce information eavesdropping by external users and un-trusted users within the group, and to make the information forwarding of trusted users the priority, thus reducing the probability of information leakage. After calculating the leakage probabil- ity of the un-trusted nodes, we select the node with minimum probability of information leakage as the forwarding node, and we build a controllable forwarding node set to ensure the minimum probability of information leakage. Finally, according to the constraints of algorithm design, we take the main factors that impact the algorithm performance as the performance evaluation indicators, and the simulation re- sults prove the superiority of the proposed route algorithm in information leakage.

关 键 词：信息泄露 加权图 位置路由 身份认证 非信任节点 

分 类 号：TN918.91[电子电信—通信与信息系统]