Abstract: In sleep-wakcup scheduling Wireless Sensor Networks ( WSN)，anycast technique can significantly reduce time delay. However, previous research work only attends to optimizing the time delay during each hop, this scheme is not optimal even sometimes bad for end-to-end time delay. An optimal anycast routing algorithm for delay-sensitive WSN was proposed to solve the problem of end-to-end time delay. In the algorithm, base stations apply AODV-based multipath routing protocol to acctuire anycast routing information, then genetic algorithm is applied to search the optimal anycast paths between each nodes and bases stations, after that, base stations report the information to each nodes. Our algorithm has features of both global optimization and self-adaptivity of switching anycast paths. Experiment results show that our algorithm can reduce end-to-end time delay more efficiently in contrast to previous algorithms.

Key words: Wreless sensor networks, Anycast, Delay-sensitive, End-end delay, Genetic algorithm