- means the termination by time iterations or thecondition is achieved.
Representation and Encoding-
Encoding is one of theproblems that are found when GA is used for getting asolution. Encoding depends on the problem that GA is applied.In this paper, the genes are represented by the tree junction,and the network is represented by a tree network . Thelength of every chromosome is the same using this codingmethod and the genetic operations are achieved in the treejunction. The encoding procedure represents in Figure 3 as asample network which node
is the source node and t is thedestination node.
is generated randomly by choosingfeasible points in the gene coding that forms a path.Population size refers to the number of chromosomes thatidentified in one generation. GA has a few probabilities toexecute the crossover when there are a few chromosomeswhich a small part of the search is observed. Moreover, GAwill slow down if there are numerous chromosomes. In ourproposal, the size of the initial population depends on thenumber of the outgoing links from the source.Figure 4. Proposed Algorithm flowchart
Fitness function Evaluation-
The correlation of fitness value toevery solution is accomplished during of a fitness function.The fitness function that is utilized in this paper to find thefaceable paths is given in equation 2.
is the total number of constraints presumed,
is the maximum compatible constraint valueidentified for the application, and
is the link weights whichis static and depends on the physical proprieties of the link.The initial population with the fitness value will compute foreach chromosome.
- Chromosomes are chosen from theinitial population to be parents. Depending on Darwin’sevolution theory, the best Chromosomes should be alive andgenerate offspring. Many methods are available for selectingthe chromosomes such as elitism selection, steady stateselection, tournament selection, roulette wheel selection, etc.In this paper, we prefer to use the elitism selection method.Elitism is the method which copies the best chromosomes tonew population. The operation of genetic is done by selectingthe chromosomes, sorting them depend on the fitness value inthe initial population, and then choosing the first two at the topof the list.
Crossover and Mutation
- are two fundamental factors of GA,which is considered the main performance of GA. Theseoperations will be implemented by encoding that depends onthe problem that will be solved by GA . We prefer in thispaper to use a single point crossover at the tree junction togenerate new offspring. The mutation point chosen is thepoints that cause the infringement of satisfaction of constraint.The proposed method is divided into two parts: Preprocessingpart and processing part as the following:
: In this part, a short message sendsthrough the faceable (available) paths from the initial point(client) to the target point (server), including the time and thelength of a message. A wireless network is connected bymulti-hops and routers as shown in Figure 3. Then, geneticalgorithm is used to find the available paths to the server thatis considered the central point for communications. After that,those paths will store in Tabu list, which determines theefficient paths by Tabu search technique in the processingpart.
: The efficient path will be chosen from Tabulist in this part. After receiving the message, the informationthat is included in the message will be used as attributes andrestrictions in the fitness function to decide the efficient path,using the fitness function in equation 2.
We need fitness to select and evaluate the parent and childto know what the best path for the next generation and toexclude the worst one. Fitness function will depend on thecount of hops, delay, bandwidth chromosome, and Jitter delay.The most common parameters that used in the fitness functionare path number, hop number, delay, Jitter delay, bandwidth,and efficient path, which denoted by
Evaluate the fitnessSelect individuals
List of FaceablepathFaceablepathTabusearch listYesNoTabualgorithm
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 2, February 2011138 http://sites.google.com/site/ijcsis/ISSN 1947-5500