A Genetic Algorithm for Delay-Constrained Unicast Source Routing in Ad Hoc Wireless Mobile Network

The
computation of a unicast delay–constrained route is important specially when
the constraints of the ad hoc network nature are considered. The process of
computing this route is very   exhaustive
for routers. The need to compute routes with a heuristic method is extremely
interesting. 

In this
paper, a genetic algorithm was proposed to deal with the imprecision
information of the ad hoc networks and compute a route solving unicast routing
problem with a bit-encoding representation of chromosomes. When the proposed
algorithm is compared to the traditionally depth-first and backtracking
technique, results show better time performance. However, when the proposed
algorithm was compared to another heuristic algorithms of multicasting, the
results are promising.

@INPROCEEDINGS{mhmhsg2,
  author = {Mohamed Hashem and Mohamed Hamdy and Said Ghoniemy},
  title = {A Genetic Algorithm for Delay-Constrained Unicast Source Routing
	in Ad Hoc Wireless Mobile Network},
  booktitle = {The first International Conference on Intelligent Computing and Information
	Systems (ICICIS 2002)},
  year = {2002},
  address = {Cairo, Egypt}
}