J4 ›› 2015, Vol. 37 ›› Issue (06): 1087-1092.
• 论文 • Previous Articles Next Articles
LIU Yujun,WANG Minghui,CAI Meng,CHEN Kun
Received:
Revised:
Online:
Published:
Abstract:
We analyze the approaches and causes of information leakage during information transmission in Adhoc networks, design an Adhoc 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
LIU Yujun,WANG Minghui,CAI Meng,CHEN Kun. A routing algorithm for information leakage reduction in Ad-hoc networks[J]. J4, 2015, 37(06): 1087-1092.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2015/V37/I06/1087