An efficient genetic algorithm for anycast routing in delay/disruption tolerant networks

Authors:
Ederson R. Silva;Paulo R. Guardieiro
Affiliations:
Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, MG, Brazil;Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, MG, Brazil
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 1

Group multicast routing problem: A genetic algorithms based approach

Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges

IEEE Communications Surveys & Tutorials
A multiobjective hybrid genetic algorithm for the capacitatedmultipoint network design problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Building a reference combinatorial model for MANETs

IEEE Network: The Magazine of Global Internetworking

An analysis of genetic algorithm based anycast routing in delay and disruption tolerant networks

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Delay/Disruption tolerant networks (DTNs) have the capacity to interconnect devices and areas that are underserved by traditional networks. Anycast routing can be used for many applications in DTNs, and is useful when nodes wish to send messages to at least one, and preferably only one, of the members in a destination group. In this letter, an anycast routing algorithm for DTNs based on genetic algorithms (GAs) is presented. The GA is applied to find the appropriate path combination to comply with the delivery needs of a group of anycast sessions simultaneously. The proposed GA-based solution uses the concept of subpopulation to produce the next generation population, a limited number of solutions to be evaluated, and yields minimum delay to achieve a specified rate of delivery. Via simulations we show that this scheme can produce good results.