1st International ICST Conference on Communications and Networking in China

Research Article

A Delay Demand-based Anonymous Communication Mechanism

  • @INPROCEEDINGS{10.1109/CHINACOM.2006.344659,
        author={YANG  Luming and WANG Weiping and DUAN  Guihua and SONG  Hong },
        title={A Delay Demand-based Anonymous Communication Mechanism},
        proceedings={1st International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2007},
        month={4},
        keywords={anonymous communication; P2P system; rerouting mechanism; performance analysis},
        doi={10.1109/CHINACOM.2006.344659}
    }
    
  • YANG Luming
    WANG Weiping
    DUAN Guihua
    SONG Hong
    Year: 2007
    A Delay Demand-based Anonymous Communication Mechanism
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2006.344659
YANG Luming1,*, WANG Weiping1,*, DUAN Guihua1,*, SONG Hong 1,*
  • 1: College of Information Science & Engineering, Central South University, Changsha Hunan China.
*Contact email: yang@mail.csu.edu.cn, wpwang@mail.csu.edu.cn, dgh1010@163.com, songhong@mail.csu.edu.cn

Abstract

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 Pf. 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.