一种无线Ad Hoc网络动态混淆匿名算法

无线Ad Hoc网络的特殊性决定了它要受到多种网络攻击的威胁，现有的加密和鉴别机制无法解决流量分析攻击.在比较了抗流量分析的匿名技术基础上，提出混淆技术可以满足无线Ad Hoc网络的匿名需求，但现有的混淆算法在Ad Hoc网络下却存在安全与效率的问题.提出了一种动态混淆的RM(pseudo-random mix)算法，该算法主要对混淆器的管理部分进行重新设计. RM算法根据混淆缓冲区的情况进行决策，当缓冲区未满时采用时延转发方式，缓冲区满后采用随机数转发方式，这样既保证了无线Ad Hoc节点的匿名性，同时又解决了停等算法的丢包现象.对RM算法的安全性和效率进行了分析，仿真结果与理论分析相一致，表明RM算法在无线Ad Hoc网络下具有较好的自适应性和实用价值.

A Dynamic Mix Anonymity Algorithm for Wireless Ad Hoc Networks

A wireless ad hoc network is subject to various security attacks.The encryption and authentication methods protect communication partners from disclosure of their secret messages but cannot prevent traffic analysis.It is argued that the mix method is better for wireless ad hoc networks after exploring the approaches to preventing traffic analysis through hiding the source and destination of packets,however,the security and efficiency are mission-critical and challenging to the present mix algorithm for ad hoc networks.In this paper,a pseudo-random mix(RM)-based anonymity algorithm is presented for ad hoc networks by redesigning the buffer manager.The RM algorithm delays a message by time stamps when the mix buffer is not full,otherwise it forwards a message by a random number.The RM algorithm not only guarantees the anonymity of an anonymous communication system,but also solves the problem of discarding packet in the stop and go algorithm.The analysis shows that the RM algorithm has desirable security property and it can evidently improve the efficiency of an anonymous system.The simulation shows that the RM algorithm is better than those known algorithms in adaptability and utility for wireless ad hoc networks.