中文摘要：

提出一种可根据用户延迟需求而建立的匿名策略DDSACS．该策略采用TTL探测成员间的延迟代价，在匿名转发时，根据发送者提出的延迟需求参数DelayD从其1到DelayD跳的邻居中选择下一跳转发节点，随路减少DelayD直至等于零．模拟实验结果表明，该匿名通信机制在等同平均转发路径长度情况下匿名性能略优于Crowds策略，并能极大地降低通信时延，且具有可扩展性．

英文摘要：

A new anonymous communication mechanism DDSACS （Delay Demand-Satisfied Anonymous Communication Strategy） has been proposed in this paper, in which rerouting path can be setup according to the initiator＇ s delay-demand for guaranteeing 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 and the parameter DelayD will be decreased while rerouting. Every node receiving the request will randomly choose a neighbor from its 0 to DelayD-hops groups and forward the request with probability Pf and the parameter DelayD. 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 DDSACS have analyzed in this paper. Simulation results indicate that DDSACS is slightly better in anonymity performance than the typical anonymous communication anonymous communication system Crowds. Also DDSACS ean decrease the transmit delay obviously and is scalable.