Download now Free registration required
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or standard support services. The topology of the ad hoc network may change rapidly and unexpectedly. One of the most problems encountered in these networks, is finding the Shortest Path (SP) between source and destination nodes within a specified time so as to satisfy the Quality of Service (QoS). In this paper a genetic algorithm for solving the shortest path routing problem is presented. The algorithm has to find the shortest path between the source and destination nodes. The developed genetic algorithm is compared with the Dynamic Source Routing (DSR) Protocol approach to solve routing problem.
- Format: PDF
- Size: 245.6 KB