An intelligent routing protocol for delay tolerant networks using genetic algorithm

Authors:
Saeid Akhavan Bitaghsir;Faramarz Hendessi
Affiliations:
Department of Science & Engineering, Sharif University of Tech., Iran;Department of Electrical & Engineering, Isfahan University of Tech., Isfahan, Iran
Venue:
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Year:
2011

Citing 5
Cited 0

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Practical Genetic Algorithms with CD-ROM

Practical Genetic Algorithms with CD-ROM
Geographic routing in city scenarios

ACM SIGMOBILE Mobile Computing and Communications Review
Review: Unicast routing protocols for vehicular ad hoc networks: A critical comparison and classification

Pervasive and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the dynamic topology of vehicular ad hoc networks, routing of packets in these networks faces a lot of difficulties. The situation will become more challenging when we have to deal with Delay Tolerant Networks (DTN) which are also sparse and partitioned and we need to use some vehicles to store the packets and carry them from one partition to another. Despite all these difficulties, by looking through movements of vehicles in an urban environment, we can find out that the topology of the network does not change in a pure random way and we can bring the traffic models of streets into account for having better routing performance. In this paper we proposed an intelligent routing protocol for delay tolerant networks using genetic algorithm as the learning method for choosing the best vehicle to carry the packets from one partition to another.