Efficient bidirectional anonymous routing protocol for wireless Ad Hoc networks
一个高效的双向无线Ad Hoc网络匿名路由协议

A lightweight anonymous routing protocol was presented, which was based on reactive source routing. It enables complete anonymity of identity, route and topology defined in ASR, using Bloom Filter. The main computationally intensive operation in use is hashing and it does not need to use any public key operation. Without eroding the topology anonymity, it actualizes hop control to avoid the excessive propagation of route requests in order to enhance the efficiency of the network. In addition, the anonymous links established in this protocol are bidirectional, which also helps to reduce the overhead of the anonymous protocols. Detailed analysis and simulation show that the new protocol achieves good anonymity and efficiency.