JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

12

Design a Hybrid System Geno-Neuro-Fuzzy Controller for Dynamic Load Balancing in Wireless Ad- hoc Networks
Hussein A.Lafta Assistant Prof., Babylon University, Iraq

Abstract - Congestion at the link and in the nodes is the main cause of a large delay in the ad hoc networks, where band width is limited. Balancing the work among the network nodes will be one of the best solutions. Once, the source node may be has selected a set of paths to destination, it can send data to a destination along unloaded path nodes. Load balanced routing aims to move traffic from the areas that are above the optimal load to less loaded areas, so that the entire network achieves better performance. If the traffic is not distributed evenly, then some areas in a network are under heavy load while some are lightly loaded or idle. Therefore good load balancing algorithms must be fast and should not add heavy cost, because complexity of these algorithms in communication channels incurs ambiguity, causes uncertainty in decision making. A novel approach based on artificial intelligence field such as neural networks, fuzzy logic, and genetic algorithm is suggested in this work. The integration of these subsystems gives a system benefits from the advantages of each subsystem and encroaches on the disadvantages. All the parameters of the controller is tuned and learned by genetic algorithm. This controller is based on back propagation neural network. This can eliminate laborious design steps such as manual tuning, of the membership functions and selection of the fuzzy rules and weights of neural network, which give the neural network a greater ability to generalize
and accelerate the convergence process and prevent the network to get stuck in a local minimum. Key words: fuzzy system, neural networks, genetic algorithm, loads balancing, ad hoc networks.

1. Introduction Mobile ad hoc networks (MANETs) are formed dynamically by an autonomous system of mobile nodes that are connected via wireless links without using the existing network infrastructure or centralized administration. The nodes are free to move randomly and organize themselves arbitrarily; thus, the networks wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. Mobile ad hoc networks are infrastructure-less networks since they do not require any fixed infrastructure, such as a base station, for their operation. In general, routes between nodes in an ad hoc network may include multiple hops, and hence it is appropriate to call such networks as multi-hop wireless ad hoc networks. Each node will be able to communicate directly with any other node that resides within its transmission range. For communicating with nodes that reside beyond this range[9], [11],[13] ,[40],[44],[49].

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

13

Load balancing is a technique for distributing traffic load from the source to the destination get optimal resource utilization, throughput. Load balancing attempts to maximize system throughput by migrating tasks from the overloaded nodes to other lightly loaded nodes to improve the overall system performance. Load balancing is important since node with high loads will deplete their resources quickly, thereby increasing the probability of network failure. Therefore good load balancing algorithms must be fast and should not add heavy cost, because complexity of these algorithms in communication channels incurs ambiguity, causes uncertainty in decision making. To solve this problem, artificial intelligence field such as neural networks, fuzzy logic, and genetic algorithm are suggested in this work, because they dont use any mathematical model of the system. Neural Network uses input-output relations of the system, Fuzzy Logic uses heuristic knowledge about the system based on the operator experience, and genetic algorithm is used for search and optimization [6], [7], [10], [17],[26], [29]. 2 Related Works. Many studies have focused on developing mechanisms for the load balancing problem in mobile wireless ad hoc networks. Load-Balanced Ad Hoc Routing (LBAR) protocol is proposed in [20]. LBAR is very similar to AODV, except that while forwarding the route request (RREQ) messages each node appends its current activity status to the RREQ. The destination uses this extra information in order to relay the RREP message along the path with least load so that the load is evenly spread across the nodes. In [8], the authors propose load balancing algorithm for wireless access networks. The algorithm maintains a load-balanced backbone tree rooted at the access point. The access point is responsible for updating the backbone tree and information about load distribution is required at the access point. Also it is assumed in [37] that nodes have multiple-antennas, so wireless connections between neighbors is modeled as isolated point-topoint links, which makes the topology very similar to the wired-networks. In [12], the authors propose a mechanism of load balancing in ad hoc wireless networks that relies on dissipation of load distribution information throughout the network. If a node is overloaded (serving more load than the average load in the network), then it queries it neighborhood for under loaded nodes, and transfers its load to the under loaded node. However the dissipation of load information increases the overhead and may cause instability. In [33], the authors study that how alternate path routing, which is a popular load balancing mechanism in wired networks, performs in a wireless ad hoc network. It is observed that the interference, caused by channel sharing, significantly reduces the performance of APR in wireless ad hoc networks. An analytical model of load distribution in multi-path routing is presented in [48]. It is shown that the multi-path routing does not provide any benefits in ad hoc networks, unless the number of paths is large. In [14] the authors show that multipath routing may achieve significant improvement over single path routing provided the various paths involved in multipath routing are sufficiently disjoint. They use the number of interfering links existing between the nodes of two paths as the measure of correlation between the paths and choose the paths with minimum interference correlation. It is shown in [30] that optimum load balancing is a NP-hard problem even for a simple network topology. In Dynamic Load Aware Routing (DLAR) protocol [2],[3], [15],[41] routing load of a route has been considered as the primary route selection metric. The load of a route is defined as the summation of the load of nodes on the route, and the load of a node is defined as the number of packets buffered in the queue of the node. To utilize the most up-to-date load information when

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

14

selecting routes and to minimize the overlapped routes, which cause congested bottlenecks, DLAR prohibits intermediate nodes from replying to route request messages. Another network protocol for efficient data transmission in mobile ad hoc networks is Load Aware Routing in Ad hoc (LARA) [46] networks protocol. In LARA, during the route discovery procedure, the destination node selects the route taking into account both the number of hops and traffic cost of the route. The traffic cost of a route is defined as the sum of the traffic queues of each of the nodes and its neighbors and the hop costs on that particular route. Thus, the delay suffered by a packet at a node is dependent not only on its own interface queue but also on the density of nodes. In routing with load balancing scheme (LBAR) [20], the destination collects as much information as possible to choose the optimal route in terms of minimum nodal activity (i.e the number of active routes passing by the node). By gathering the nodes activity degrees for a given route the total route activity degree is found. Load Sensitive Routing (LSR) protocol [27] is based on DSR. In LSR the load information depends on two parameters: total path load and the standard deviation of the total path load. Since destination node do not wait for all possible routes, the source node can quickly obtain the route information and it quickly responds to calls for connections. Correlated Load-Aware Routing (CLAR) [25] protocol is an on-demand routing protocol. In CLAR, traffic load at a node is considered as the primary route selection metric and depends on the traffic passing through this node as well as the number of sharing nodes. Alternate Path Routing (APR) protocol [32] provides load balancing by distributing traffic among a set of diverse paths. By using the set of diverse paths, it also provides route failure protection. Reference [6] gives a comparative study of some of the load balanced ad hoc routing protocol. The references [43], [7], [34] select the path that consumes the least energy to transmit a single packet from source to[9] destination, aiming at minimizing the total energy consumption along the path. The second one [10],[29] intends to protect the overused nodes against breakdown, aiming at maximizing the whole network lifetime. In [2] the authors presented approach based on fuzzy logic for implementing dynamic load balancing algorithm, their algorithm takes into account uncertainty and inconsistency and shows better response time than round robin and randomize algorithms. The author in [4] was proposed a fuzzy dynamic Load balancing Algorithm for Homogenous Distributed Systems by all nodes in the network. The proposed algorithm utilizes fuzzy logic in dealing with inaccurate load information, making load distribution decisions, and maintaining overall system stability. In terms of control, he proposes a approach that specifies how, when, and by which node the load balancing is implemented. His approach is called centralized but distributed. 3. Fuzzy logic Fuzzy logic has The ability to deal with uncertainty, ambiguity and vagueness [3], [5], [16], [23],[45]. Fuzzy logic is reliable if the mathematical model of the system to be controlled is unavailable, and for nonlinear, time varying systems. The knowledge is represented linguistically in the form of fuzzy production rules (if-then) to emulate human expert. Figure (1) shows the structure of a fuzzy system. The structure is made of the following components: 1-Input fuzzifier interface consists of fuzzification unit which converts the inputs (crisp value) to the system into membership degree (fuzzy input) by using suitable membership functions. 2- Knowledge base comprises of a data base and fuzzy rule base which characterizes the desired output response applied by means of a set of control rules. Fuzzy rules are linguistic type of IFTHEN statements involving fuzzy sets, fuzzy logic, and fuzzy inference. Linguistic rules

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

15

describing the control system consist of two parts: an antecedent and a consequent block. They are usually of the form: IF X1 is Ai1 AND X2 is Ai2 AND Xn is Ai n THEN Y1 is Bi1. Where X1 X2 are inputs, Y1 is the output and Ain is the input membership function and Bi1 is the output membership function. 3- Inference mechanism (rules propagation) is the kernel of Fuzzy Logic system which has the capacity of simulating the human decision making mechanism based on fuzzy concepts and fuzzy control actions. 4-Output defuzzifier interface consists of defuzzification unit which converts membership grades of outputs (fuzzy output) into a crisp value( crisp out put).

Figure (1): Fuzzy Logic System Architecture Designing of a fuzzy controller requires a number of trial and error iterations, and even then, it is very difficult to ensure that the designed controller is an optimal one. Developing a rule base is one of the most time consuming part of designing a fuzzy logic system. 4. Genetic Algorithms Genetic Algorithms (GAs) are search algorithms based on mechanics of natural selection and natural genetics .Usually it is very difficult to transform human knowledge and experience into a rule base of fuzzy logic controller. Genetic Algorithms, have been used tune membership functions (optimal shapes, ranges and number of member functions) and for automatic and online rule learning because of their robustness and ability to provide global solutions. The standard genetic algorithm proceeds as follows: an initial population of individuals is generated at random or heuristically. Every evolutionary step, known as a generation, the individuals in the current population are decoded and evaluated according to some predefined quality criterion, referred to as the fitness, or fitness function. To form a new population (the next generation), individuals are selected according to their fitness. Many selection procedures are currently in use, one of the simplest being fitness-proportionate selection, where individuals are selected with a probability proportional to their relative fitness. This ensures that the expected number of times an individual is chosen is approximately proportional to its relative performance in the population. Thus, high-fitness (good) individuals stand a better chance of reproducing, while low-fitness ones are more likely to disappear.

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

16

Selection alone cannot introduce any new individuals into the population, i.e. it cannot find new points in the search space. These are generated by genetically inspired operators, of which the most well-known are crossover and mutation. Crossover is performed with probability pc (the crossover probability or crossover rate) between two selected individuals, called parents, by exchanging parts of their genomes (i.e. encodings) to form two new individuals, called offspring. In its simplest form, substrings are exchanged after a randomly selected crossover point. This operator tends to enable the evolutionary process to move toward promising regions of the search space. The mutation operator is introduced to prevent premature convergence to local optima by randomly sampling new points in the search space. It is carried out by flipping bits at random; with some (usually small) probability pm. Genetic algorithms are stochastic iterative processes that are not guaranteed to converge. The termination condition may be specified as some fixed maximal number of generations or as the attainment of an acceptable fitness level[16] [19]. 3. Neural Networks Neural Network involving mapping of input-output vectors for cases where no theoretical model works satisfactorily. An artificial neural network (ANN) [8],[18] is an informationprocessing paradigm inspired by the manner in which the heavily interconnected, parallel structure of the human brain processes information. They are collections of mathematical processing units that emulate some of the observed properties of biological nervous systems and draw on the analogies of adaptive biological learning. NNs are trainable systems whose learning abilities, tolerance to uncertainty and noise, and generalization capabilities are derived from their distributed network structure and knowledge representation. Learning of a NN typically implies adjustments of connection weights and biases so that the square error (between NN output and desired output) is minimized. However, NN is often called a black box, since, unlike fuzzy logic, it is difficult to interpret the knowledge stored by a NN. Knowledge in a NN is represented in the values of the weights and biases, which forms part of large and distributed network [5], [21]. In this work a hybrid system Fuzzy Genetic Neural (FGN) is used to design a controller to control the load of each node in the wireless ad hoc networks. Design a controller based on a fuzzy logic only is accompanied with problems regarding design of membership functions (type and number of membership functions, their shape and range etc.), and choosing appropriate fuzzy rules. Frequently, designing a fuzzy controller requires a number of trial and error iterations, and even then, it is very difficult to ensure that the designed controller is an optimal one. Learning how to construct an efficient fuzzy controller is, to a large extent, more of an art than a science. The rule base is an important component of a fuzzy controller that captures the operator knowledge about the system in the form of fuzzy rules. Developing a rule base is one of the most time consuming part of designing a fuzzy logic controller. Usually it is very difficult to transform human knowledge and experience into a rule base of fuzzy logic controller [1],[18],[22],[31], [42]. Moreover there is a need for developing efficient methods to tune membership functions i.e., to obtain optimal shapes, ranges and number of member functions etc. Genetic Algorithms, because of their robustness and ability to provide global solutions, have been used as a tool to identify parameters of fuzzy logic controller. Since GAs work on coding of the parameter set, and not on the derivative of a function, they are capable of solving a vast range of optimization problems including optimization of the rule set of a fuzzy logic controller. This work uses GA to optimize parameters of domain knowledge which consists of parameters of membership function (triangular membership function), the rule base and weights of neural

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

17

networks. Genetic algorithms can be combined with neural networks to enhance their performance by taking some of the guesswork out of optimally choosing neural network parameters, inputs etc. In general, genetic algorithms can be used in conjunction with neural networks in the following four ways. They can be used to choose the best inputs to the neural network, optimize the neural network parameters (such as the learning rates, number of hidden layer processing elements, etc.), train the actual network weights (rather than using back propagation), or to choose/modify the neural network architecture. In each of these cases, the neural network error is the fitness used to rank the potential solutions . 6. Design and Implementation of the proposed system The proposed system consists of three subsystems to calculate the load at the nodes in ad hoc wireless network, based on three measurements which are queue size (number of packets), throughput (node capacity to processes the arrival traffic at a time unit) of the node (Kbps), and traffic arrival rate to the node (Mbps) as shown in figure (2).
Arrival traffic Throughput Queue size Geno-Neuro- Fuzzy Controller Load at the node

Figure (2): Structure of the Proposed System Input linguistic variables to the proposed system are (Arrival Rate, Queue Size, and Throughput). The fuzzy sets of the linguistic variable Arrival Rate are (Low, Medium, High). The fuzzy sets of the linguistic variable Queue Size are (Low, Medium, High, Very high). The fuzzy sets of the linguistic variable Throughput are (Small, Medium, Large). Output linguistic variable to the proposed system is (Load of the node).The fuzzy sets of the linguistic variable load of the node are (Lightly, Medium, Heavy, Very heavy). Mamdani system is used to represent the fuzzy inference system in this work. To represent the above fuzzy sets trapezoidal memberships functions are used to calculated the member ship degree to each crisp value in the fuzzy sets by using genetic algorithm. Also genetic algorithm is used to generate optimal rules for the fuzzy logic system as follow: Generation of rules is done by using genetic algorithm. Genetic algorithm generates the rules by using one of the Michigan Approaches in offline and the resulted rules are used online in the decision making. So, genetic algorithm has two processes: Train and test. Fuzzy system for on-line learning of approximate fuzzy rules: New rules generated by the GA are placed in a so-called Limbo, an intermediary repository where rules are evaluated off-line before being applied to the real process. Only when a rule demonstrated its usefulness in the off-line evaluation, it is accepted and inserted into the

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

18

on-line FRB. The evaluation algorithm assigns strength to every classifier with a non-zero degree of activation. Training phase of genetic algorithm consists of the following steps: 1- Generate initial random population of rules with initial strength 0.5. 2- Evaluate each individual of population by get membership degree of every gene in the chromosome and then has strength of rule (individual) to represents fitness of rule. 3- Reproduction of rules. 4- Steady state replacement. 5- Evaluate new individuals. 6- Update of strength of every rule. 7- Repeat steps from 3 to 6 until the accepted rules according to the specific measures have got. Initial random population stage: Initial population of rules generate randomly, such that every individual in population represents rule with its inputs and outputs. Every input and output represents gene. Rules (individuals) are represented as approximate rules because of the uncertainty problem of knowledge and imprecision of data. FL is a form of logic whose underlying modes of reasoning are approximate. Its importance arises from the fact that most modes of human reasoning are approximate in nature. The length of chromosome is 4 as follows: 1) Gene1 has arrival represented by fuzzy set as follows: 1. Less set represents by 1 75 150. 2. Medium set represents by 75 150 225. 3. High set represents by 150 225 300. 2) Gene2 has queue size represented by fuzzy set as follows: 1. Low set represents by 1 20 40. 2. Medium set represents by 20 40 60. 3. High set represents by 40 60 80. 4. Very high set represents by 60 80 100.

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

19

3) Gene3 has throughput represented by fuzzy set. 1. Small set represents by 0.1 0.25 0.5. 2. Medium set represents by 0.25 0.5 0.75. 3. High set represents by 0.5 0.75 1. 4) Gene4 has load acts as fuzzy set as follows: 1. light set: 1 10 20. 2. Medium set: 10 20 30. 3. Heavy set: 20 30 40. 4. Very heavy set: 30 40 50. Fitness calculation stage: In this stage, the rules in limbo which are active by applying from the environment to get strength of rule which represents fitness of the rule and update its strength and other inactive rules in limbo has zero fitness. In this stage, there are two processes: 1- Active rules are fired. 2- These rules are used in crossover and mutation process to get new individuals and add to limbo. This individual replace by worst individual in limbo. Reproduction stage: Binary tournament selection is applied for the proposed population. Uniform crossover is applied to the parent active rules. Soft mutation adjusts the fuzzy membership function. Soft mutation modifies one of the characteristic points (a, b, c) of the triangle fuzzy set. Evaluation new individuals stage: This is done by check if it is active to get the strength of rule. Update of strength of every rule stage: In every generation, strength of rules is updated as follows: 1- Compute system's performance as follows:

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

20

If the loading resulted after defuzzification of active rules is the suitable to the state of inputs in the genes of rule then system's performance=1 Else System's performance=-1 End if 2- Check if the rule is active(truth value). 3- Compute adaption rate: If loading resulted from defuzzification is suitable to the state of throughput then Adaption rate=1 Else Adaption rate=0. End if 4- Compute evaluation of rule: Evaluation =fitness of rule i*system's performance. If evaluation >=0 then Strength of rulei=strength of rule+adaption rate *truth value of rule*(1-strength of rule). Else Strength of rulei=strength of rule+adaption rate *truth value of rule*strength of rule. End if . Rule parameters: 1. Rule Age (R.A.): Overall number of control steps since the rule was placed into the Limbo. 2. Rule Activations (R.Ac.): Number of control steps in which the rule would have fired in the on-line controller, i.e. the rule antecedent matches the current input state to a non-zero degree. 3. Equivalent Rule Evaluation (E.R.E.): Constant evaluation that the rule should have obtained to reach its present strength value after R.Ac, activations. It is computed as the value Er, starting from an initial strength SRA = 0.5, evolves to the current strength SRJ within R.Ac, time steps for TR = 1. Limbo parameters:

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

21

1. Limit Age (L.A.): Defines the maximum evaluation period. After L.A. control steps, the rule is removed from the Limbo, being either promoted to the FRB or discarded. 2. Minimum Rule Activations (M.R.Ac.): Minimum number of activations that are required for a rule to be considered for promotion from the Limbo to the FRB. 3. Minimum Equivalent Evaluation (M.E.E.): Minimum value of the E.R.E. that is required for a rule to be considered for promotion from the Limbo to the FRB. Entering the FRB: Considering these parameters, whenever the GA generates new rules that are added to the Limbo, the quality of the current rules in the Limbo is estimated. The worst performing rules are discarded, whereas the best performing rules are promoted to the on-line FLC according to the following performance criteria: 1. Rules whose evaluation period expired (R.A. > L.A.), and that were either mostly inactive (R.Ac. < M.R.Ac.) or obtained a poor evaluation (E.R.E. < M.E.E.) are removed from the Limbo and discarded. 2. Sufficiently tested rules that underwent a minimum number of activations (R.Ac. > M.R.Ac.) and obtained a good evaluation (E.R.E. > M.E.E.) are promoted to the on-line controller. The fuzzy rules obtained by the genetic algorithm are listed below.
if (Arrival time is less) and (Queue size is low) and (throughput is small) then (Load is lightly) if (Arrival time is less) and (Queue size is low) and (throughput is medium) then (Load is lightly) if (Arrival time is less) and (Queue size is medium) and (throughput is medium) then (Load is medium) if (Arrival time is less) and (Queue size is medium) and (throughput is small) then (Load is lightly) if (Arrival time is less) and (Queue size is high) and (throughput is small) then (Load is medium) if (Arrival time is less) and (Queue size is high) and (throughput is medium) then (Load is medium) if (Arrival time is less) and (Queue size is high) and (throughput is medium) then (Load is heavy) if (Arrival time is less) and (Queue size is high) and (throughput is large) then (Load is heavy) if (Arrival time is less) and (Queue size is V.high) and (throughput is medium) then (Load is heavy) if (Arrival time is less) and (Queue size is V.high) and (throughput is large) then (Load is heavy)

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

22

if (Arrival time is high) and (Queue size is low) and (throughput is small) then (Load is medium) if (Arrival time is high) and (Queue size is medium) and (throughput is small) then (Load is heavy) if (Arrival time is high) and (Queue size is high) and (throughput is small) then (Load is heavy) if (Arrival time is high) and (Queue size is V.high) and (throughput is small) then (Load is V.heavy) if (Arrival time is high) and (Queue size is medium) and (throughput is medium) then (Load is heavy) if (Arrival time is high) and (Queue size is medium) and (throughput is large) then (Load is heavy) if (Arrival time is high) and (Queue size is high) and (throughput is medium) then (Load is heavy) if (Arrival time is high) and (Queue size is high) and (throughput is large) then (Load is V.heavy) if (Arrival time is high) and (Queue size is V.high) and (throughput is medium) then (Load is V.heavy) if (Arrival time is high) and (Queue size is V.high) and (throughput is large) then (Load is V.heavy) if (Arrival time is medium) and (Queue size is low) and (throughput is small) then (Load is lightly) if (Arrival time is medium) and (Queue size is low) and (throughput is medium) then (Load is medium) if (Arrival time is medium) and (Queue size is medium) and (throughput is medium) then (Load is medium) if (Arrival time is medium) and (Queue size is medium) and (throughput is small) then (Load is medium) if (Arrival time is medium) and (Queue size is high) and (throughput is small) then (Load is medium) if (Arrival time is medium) and (Queue size is high) and (throughput is medium) then (Load is heavy) if (Arrival time is medium) and (Queue size is high) and (throughput is large) then (Load is V.heavy) if (Arrival time is medium) and (Queue size is V.high) and (throughput is small) then (Load is heavy) if (Arrival time is medium) and (Queue size is V.high) and (throughput is medium) then (Load is heavy) if (Arrival time is medium) and (Queue size is V.high) and (throughput is large) then (Load is V.heavy) >> A genetic algorithm is also used to generate the optimal fuzzy weights for training neural network. This increase the efficiency of the whole system ,and gives the neural, network a greater ability to generalize and accelerate the convergence process and reduces the error between desired output and actual output. The parameters of GA are: *Encoding method (gene value): Real

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

23

*Number of individuals per population (best population size) = 50 *Crossover type: UX *Mutation type: 1m *Selection method: Binary *Stopping condition: No. of generations=50 *parameter encoded in the chromosome: Random fuzzy weights for training the neural networks as shown in figure (3). *Fitness function: Error (Target- Actual) of back propagation neural network.

W11

W12

..

Wij

V11

V12

..

Vjk

Figure (3): The chromosome encoding method Wij: Weights of neural network from input layer to hidden layer. Three nodes for input layer (queue size , throughput , arrival traffic at a time unit) .Four nodes for hidden layer (best result obtain by selection four hidden nodes). Vjk: Weights of neural network from hidden layer to output layer. One output node (load at the node) is selected for output. Figures (4), (5),(6) show the best weights generated by genetic algorithm for training neural networks.

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

24

Figure (4): The generated weights by GA at first generation

Figure (5): The generated weights by GA at second generation

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

25

Figure (6): The generated weights by GA at last generation The best weights are obtained from figure (6), which are used for training the neural network. Neural network used in this research is a feed forward network consisting of three layers, the input layer and the hidden layer and output layer as mentioned. Using the antecedent part of fuzzy production rules as input and the conquest part of fuzzy production rules as target (training pattern to neural network deductive rules. The input layers nodes send its input values to the hidden layers nodes to calculate the net input at each node of the hidden layer netj as follow:

Input, output patterns, and weights in each unit are fuzzy values as defined in the following equation: Input units:-

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

26

Xpi represents fuzzy input pattern Hidden units:-

Output units:

In the table below, the first column represents the fuzzy input (queue size) to the neural network, the second column represent the throughput, the third column represents the arrival time, and the fourth column represents the load at the node ( the target) at the output of neural net. After training the neural network using the above algorithms, we get the output (load at the node) is low.
Queue size Throughput Arrival time Load at node 1 0 1 1 0 3 2 0 0 3 1 1 1 3 1 1 1 3 2 1 0 0 2 0 2 1 0 1 0 1 2 0 2 1 1 1 0 1 1 0 1 1 2 0 1 1 1 1 2 1 2 0 2 2 0 1 2 2 1 2 0 1 1 0 1 2 2 1 1 2 2 0 0 2 1 0 0 1 0 1 0 2 2 0

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

27

7. Conclusions and Future Works Genetic algorithm is used for the development of adaptive fuzzy logic control systems. This work presents a neuro-fuzzy logic controller where all its parameters (membership functions, rules, weighs) can be tuned and learned by genetic algorithms. The structure of this controller is based on back propagation neural network. Load balancing problem is critical issue in ad hoc network. Designing effective load balancing strategies is difficult because of the dynamic nature of this network. Load balanced routing aims to move traffic from the areas that are above the optimal load to less loaded areas, so that the entire network achieves better performance. If the traffic is not distributed evenly, then some areas in a network are under heavy load while some are lightly loaded or idle. There are various proposed algorithms for load balanced routing. There are several types of load balancing in ad hoc networks. One is based on Path in which the load is balanced by selecting node with less number of active routes. Another is based on Delay in which the load is balanced by attempting to avoid nodes with high delay. The third is based on Traffic, in which the load is balanced by attempting to distribute the traffic evenly among network nodes. The last one is the most effective type of load balancing. In this work the load on every node is computed and suggested a future work is to selects a less congestion route at the destination node by comparing the sum of traffic load of each route.

8. References [1]A. AL- Numman, 2009, "Fuzzy Neural Structure for System Identification ", Master thesis, Computer Science Department, College of Science, Basrah University. [2] A. Karimi, F. Zarafshan and A. Jantan, 2009, "A new Fuzzy Approach for Dynamic Load Balancing Algorthim", International Journal of Computer Science and Information Security, Vol. (6), No. (1). [3] A. Khan, H. Amin and Z. Rehman, 2011," Application of Expert System with Fuzzy Logic in TeachersPerformance Evaluation", International Journal of Advanced Computer Science and Applications (IJACSA), Vol. (2), No. (2). [4] A. M. Alakeel, 2012, "A Fuzzy Dynamic Load Balancing Algorithm for Homogenous Distributed Systems", Computers and Information Technology College, Tabuk University, Saudi Arabia. [5] A. Radhi, 2011, Power System Protection Using Fuzzy Petri Net", Ph. D. thesis, Electrical Engineering Department, Basrah University. [6]A. Rani and M. Dave, 2007 Performance evaluation of modified AODV for LOAD balancing, Journal of Computer Science, Vol. 3, pp. 863868. [7] A. Srinivas and E. Modiano, 2003 Minimum energy disjoint path routing in wireless ad-hoc networks, Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom), San Diego, CA, USA. New York, NY, pp. 122133, Sep 1419. [8] Bose, N.K., and Liang, P., 1996, Neural Network Fundamentals with Graphs, Algorithms and Applications, McGraw Hill Inc. [9] C. E. Perkins, 2001 "Ad Hoc Networking". Addison-Wesley. [10] C. K. Toh, 2001 Maximum battery life routing to support ubiquitous mobile computing in wireless ad-hoc net-works, IEEE Communications Magazine, Vol. 39, pp. 138147.

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

28

[11]D. B. Johnson and D. A. Maltz, 1999, The dynamic source routing protocol for mobile ad hoc networks, IETF Draft. [12] D. Turgut, B. Turgut, S. Das, and R. Elmasri, 2003, "Balancing loads in mobile ad hoc networks", In Proceedings of IEEE International Conference on Telecommunications (ICT). [13]E. M. Royer and C.K. Toh, 1999, "A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks," IEEE Personal Communications Magazine, pp. 4655. [14] E. P. C. Jones, M. Karsten, and P. A. S. Ward,"Multipath load balancing in multi-hop wireless networks". In To appear in Proc. of WiMob 2005 - IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. [15]. E. Perkins and E. M. Royer, and S. R. Das, 2000, Ad hoc on-demand distance vector routing, Internet Draft, draft-ietf-manet-aodv-05.txt. [16] F. Karray and C. Silva, 2004, "Soft Computing and Intelligent Systems Design", Additional student support, Person Education Limited, England. [17] Freebersyner and Leiner. , 2000," A DoD Perspective on Mobile Ad Hoc Networks". In C.E. Perkins (editor), Ad Hoc Networking, Addison Wesley. [18] G. Jandaghi, R. Tehrani, D. Hosseinpour,R. Gholipour and S. Shadkam , 2010, " Application of Fuzzy-neural networks in multi-ahead forecast of stock price ", African Journal of Business Management, Vol. (4), No. (60). [19] Goldberg, D., 1989, Genetic Algorithms in Search, Optimization & Machine Learning, Addison Wesley Longman, Inc. [20] H. Hassanein and A. Zhou, 2001,"Routing with load balancing in wireless ad hoc networks". In MSWIM 01: Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems, pages 8996, New York, NY, USA, ACM Press. [21] H. Ishibuchi, M. Nii, 2000, Neural Networksfor Soft Decision Making, Department of Industrial Engineering Osaka PrefectureUniversity, E-mail Hisaoi@ie.osakafuu.ac.jp. [22] H. Zhang and X. Dai, 2012," The Application of Fuzzy Neural Network in Medicine-A Survey ", International Conference on Biological and Biomedical Sciences Advances in Biomedical Engineering, Vol. (9). [23] Hisaoi, 2001, Fuzzy If-Then Rules, Department of Industrial Engineering, Osaka PrefectureUniversity, E-mail Hisaoi@ie.osakafuu. ac.jp [24] J. Mota, , 2011," Combining Heterogeneous Access Networks with Ad Hoc Networks for Cost-Effective Connectivity", Master thesis, Lisboa University of Technology, Lisbon. [25]J. W. Jung, D. I. Choi, K. Kwon, I. Chong, K. Lim, and H.-K. Kahng, 2004, A correlated load aware routing protocol in mobile ad hoc networks, ECUMN, LNCS 3262, pp. 227236. [26] Jubin and Tornow, 1987, "The DARPA Packet Radio Network Protocols", Proceedings of the IEEE Special Issue on Packet Radio Network. [27]K. Wu and J. Harms, 2001, Load sensitive routing for mobile ad hoc networks, Proc. IEEE ICCCN, Phoenix, AZ, pp. 540546. [28] Kun-Ming V. Yu, and Chih-Hsun Chou, A Fuzzy-Based Dynamic Load-Balancing Algorithm, Department of Computer Science and Information Engineering,Chung-Hua University,Hsin-Chu, Taiwan 300, R.O.C. [29] L. Y. Li, C. L. Li, and P. Y. Yuan, 200, An energy level based routing protocol in Ad-hoc networks, Proceedings of the IEEE/WIC/ACM International Conference of In-telligent Agent Technology (IAT06), Hong Kong, China. Los Alamitos, CA, pp. 306313.

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

29

[30] L. Zhang and J. Gao, 2004,"Load balanced short path routing in wireless networks". In INFOCOM. [31] M. Petrov, T. Ilkova, S. Tzonkov and U. Viesturs, 2005," Application of a Fuzzy Neural Network for Modeling of the Mass-Transfer Coefficient in a Stirred Tank Bioreactor", ISSN 1312 451X. [32]M. R. Pearlman, Z. J. Hass, P. Sholander, and S. S. Tabrizi, 2000, On the impact of alternate path routing for load balancing in mobile ad hoc networks, Proc. of First An-nual Workshop on Mobile and Ad Hoc Networking and Computing, Mobihoc, Boston, MA, USA, pp. 310. [33] M. R. Pearlman, Z. J. Haas, P. Sholander, and S. S. Tabriz, 2000,"On the impact of alternate path routing for load balancing in mobile ad hoc networks". In MobiHoc 00: Proceedings of the 1st ACM internationalsymposium on Mobile ad hoc networking & computing, pages 310,Piscataway, NJ, USA. IEEE Press. [34] M. Subbarao, 1999, Dynamic power-conscious routing for manets: An initial approach, Proceedings of the 50th IEEE Vehicular Technology Conference, VTC, Vol. 2, pp. 12321237, Sep 1922. [35] M. Zoulikha, O.Sofiane and S. Nassima, 2011, "Reactive Routing Protocol to Single Path with Load Balancing", International Journal of Computer Applications, Vol. (28), No. (3). [36] Mamdani, E.H. and Assilian, A. , 1975, An Experiment in Linguistic Synthesis with a Fuzzy Logic Controller, International Journal of Man Machine Studies, Vol. 7, No. 1, pp. 1-13. [37] P. H. Hsiao, A. Hwang, H. T. Kung, and D. Vlah, 2001, " Load balancing routing for wireless access networks". In INFOCOM, pages 986995. [38] P. Sivakumar and K. Swamy,2011,"A Distributed Load Balanced Routing Protocol for Real-Time Traffic in Mobile Ad Hoc Networks", European Journal of Scientific Research, Vol.(53), No.(4). [39] R. Kumar and R. Banu, 2010, Load balancing Approach for AOMDV in Ad hoc Networks", IJCA Special Issue on Mobile Ad hoc Network" (MANET). [40] R. Ramanathan and J. Redi, 2002, "A Brief Overview of Ad Hoc Networks:Challenges and Directions," IEEE Communication Magazine, vol. 40, no. 5. [41]S. J. Lee and M. Gerla, 2001, Dynamic load aware routing in ad hoc networks, Proc. ICC, Helinski, Finland, pp. 32063210. [42] S. Nejad, S. Mortazavi and B. Vahdat, 2011, " Fuzzy based Design and tuning of distributed systems load balancing controller", 5th Symposlum on Advanced in Science & Technology, Iran. [43]S. Singh, M. Woo, and C. Raghavendra, 1998, Power-aware routing in mobile ad-hoc networks, Proceedings of the 4th Annual ACM/IEEE International Conference on Mo-bile Computing and Networking (MobiCom), Dallas, TX, USA. New York, NY, pp. 181190. [44] Srikanth Krishnamurthy Prasant Mohapatra, 2005, "AD HOC NETWORKS,Technologies and Protocols",Springer Science+Business Media. [45] Takagi, T. and Sugeno, M. , 1985, Fuzzy Identification of Systems and its Application to Modeling and Control, IEEE Transactions on Systems, Man and Cybernetics, Vol. 15. [46]V. Saigal, A. K. Nayak, S. K. Pradhan, and R. Mall, 2004, Load balanced routing in mobile ad hoc networks, El-sevier Computer Communications, Vol. 27 pp. 295305,. [47] W. Wu , J. Cao , J. Yang and M. Raynal, 2007, Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks. IEEE Transactions on Computers, Vol. 56, No. 8. pp. 1055- 1070.

JOURNAL OF TELECOMMUNICATIONS, VOLUME 21, ISSUE 2, AUGUST 2013

30

[48] Y. Ganjali and A. Keshavarzian, 2004, " Load balancing in ad hoc networks: Single-path routing vs. multi-path routing". In INFOCOM. [49] http://en.wikipedia.org/wiki/Wireless_ad_hoc_network Hussein A.Lafta (Member IEEE) was born in Babylon-1960, Iraq. He received the B.Sc. degree in Control and systems Department from the University of Baghdad (1984)-Iraq, M.Sc. and Ph.D. degrees in Computer science from the University of Technology-Iraq in 1999 and 2004 respectively. Since 2004, he has been with the University of Babylon-Iraq, where he is lecturer in computer science Department. His research interests include, networs and intelligent system.