Delay and disruption tolerant networks (DTNs) have the capacity of providing data communication to remote and rural areas where current networking technology does not work well. In such challenging areas characterized by long duration partition, routing is a common problem. Anycast routing can be used for many applications in DTNs, and it is useful when nodes wish to send messages to at least one, and preferably only one, of the members in an anycast destination group. In this chapter, an anycast routing algorithm for DTNs based on genetic algorithms (GAs) is presented and analyzed. The GA is applied to find the appropriate combination of each path to comply with the delivery needs of the group of anycast sessions simultaneously. The routing algorithm based on GAs under consideration uses the concept of subpopulation to produce the next generation of the population, a limited number of solutions to be evaluated, and yields minimum delay in achieving a specified rate of delivery. Simulation results show that the studied GA-based anycast routing algorithm can produce good results.
Latency and Lifetime Optimization for k-Anycast Routing Algorithm in Wireless Sensor Networks
