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

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Silva, É. R., & Guardieiro, P. R. (2012). An analysis of genetic algorithm based anycast routing in delay and disruption tolerant networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7677 LNCS, pp. 98–105). https://doi.org/10.1007/978-3-642-35380-2_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free