By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Silva, E.R. ; Fac. of Electr. Eng., Fed. Univ. of Uberlandia, Uberlandia, Brazil ; Guardieiro, P.R.

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.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 4 )