Abstract: Aiming at bad performance of robustness of shortest path anycast routing algorithm in highly dynamic networks as an example of wireless Ad hoc network, an anycast routing protocol based on density and distance was proposed. In the protocol, routing target selection was determined by both the distance factor and anycast members surroundings(i. e. density) of the target. Routing towards a dense anycast member population increased the probability that a packet eventually reaches any anycast member because packets could more easily be re-routed to neighboring anycast members when the targeted one became unrcachable,making this protocol's performance greater at robustness. In this protocol,parameter k adjusts the weight of distance and density hence influences respective selection priority of each anycast member. So, the protocol is characteristic of adaptable. Simulation was performed to evaluate this protocol. According to network status(link downtime and moving node speed)，by adjusting parameter k, routing robustness androuting efficiency are better balanced.

Key words: Density, Distance, Anycast, Routing protocol