This paper investigates a replica-constrained spray and wait routing algorithm in Delay-Tolerant Network(DTN)and in view of the disadvantages of the spray and wait routing algorithm
it introduces a node-density adaptive routing algorithm. This algorithm adaptively distributes message replicas according to the node density of current area and improves the wait stage of the spray and wait routing algorithm so that the messages are carried by active nodes.The simulation results show that compared with BSW algorithm and the classical Epidemic algorithm
the proposed algorithm can effectively reduce transmission delay and improve the success rate of message delivery.