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

Authors:
Éderson R. Silva;Paulo R. Guardieiro
Affiliations:
Faculty of Electrical Engineering, Federal University of Uberlandia, Uberlandia, MG, Brazil;Faculty of Electrical Engineering, Federal University of Uberlandia, Uberlandia, MG, Brazil
Venue:
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Year:
2012

Citing 8
Cited 0

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Group multicast routing problem: A genetic algorithms based approach

Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient genetic algorithm for anycast routing in delay/disruption tolerant networks

IEEE Communications Letters
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
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications
Building a reference combinatorial model for MANETs

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Populations in developing countries, especially in regions that lack telecommunications infrastructure, usually do not have access to the information technology. Instead, Delay-/Disruption-Tolerant Networks (DTNs) have the capacity to interconnect areas that are underserved by traditional networks. 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 a destination group. In this paper, aiming an efficient routing, it is analyzed a Genetic Algorithm (GA) based anycast routing algorithm. Simulation experiments show that the proposed algorithm can produce good results in typical scenarios including delays and disconnections in message delivery.