A Delay Demand-based Anonymous Communication Mechanism

A new anonymous communication mechanism DDACM (delay demand-based anonymous communication mechanism) has been proposed in this paper. In DDACM, rerouting path can be setup according to the initiator´s delay-demand, which can guarantee the initiator´s anonymity. Hops between two peers are used as the metric of choosing rerouting node. Peers can find hops to neighbors through broadcasting TTL packets and record the neighbors with n hops as its n-hops group. Initiator´s delay demand is described as DelayD being carried in the rerouting request. Every node receiving the request will randomly choose a neighbor from its 0 to DelayD-hops groups and forward the request with probability P_f. So, the delay between every two forwarders will be limited in DelayD hops and the total delay of rerouting path will be decreased. The anonymity and delay performance of DDACM have analyzed in this paper. Mathematic analysis and simulation results indicate that DDACM can keep almost the same anonymity with the typical anonymous communication system Crowds and decrease the transmit delay obviously.