• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2015, Vol. 37 ›› Issue (06): 1087-1092.

• 论文 • Previous Articles     Next Articles

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

LIU Yujun,WANG Minghui,CAI Meng,CHEN Kun   

  1. (Department of Information Engineering,Academy of Armored Force Engineering,Beijing 100072,China)
  • Received:2014-05-19 Revised:2014-09-26 Online:2015-06-25 Published:2015-06-25

Abstract:

We analyze the approaches and causes of information leakage during information transmission 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 probability 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 results prove the superiority of the proposed route algorithm in information leakage.

Key words: information leakage;weighted graph;location routing;authentication;un-trusted user