Enhancing the performance of Optimized Link State Routing Protocol using HPSO and Tabu Search Algorithm
نویسندگان
چکیده
This study aims at enhancing the Performance of Optimized Link State Protocol (OLSR) using Swarm Intelligence and Tabu Search Algorithm. It proposes OLSR modifications using Swarm Intelligence and Hybrid Particle Swarm Optimization (HPSO) by use of Tabu Search Algorithm (TSA). The OLSR Routing Protocol is used for the study of Mobile Ad hoc Networks (MANET) using Multimedia and Video Streamed Traffic. Simulations were done using OPNET simulator. The jitter time, data drop and end to end delay are lowered and the throughput of the network is improved. The results obtained using the TSPSO method show that when compared to the traditional OLSR, there is a decrease of 25.83 % in jitter time, 25.76% in data drop, 25.63 % in end to end delay. However there is a decrease in only 3.45 % in jitter time, 3.22 % in data drop and 2.91 % in end to end delay when PSO Algorithm is used. Also it is observed that when compared to the traditional OLSR there is an increase of 34.32 % in throughput obtained by TSPSO method and increase of 31.32 % when PSO Algorithm is used. Thus the efficiency of the proposed method is increased.
منابع مشابه
Performance Evaluation of OLSR Using Swarm Intelligence and Hybrid Particle Swarm Optimization Using Gravitational Search Algorithm
The aim of this research is to evaluate the performance of OLSR using swarm intelligence and HPSO with Gravitational search algorithm to lower the jitter time, data drop and end to end delay and improve the network throughput. Simulation was carried out for multimedia traffic and video streamed network traffic using OPNET Simulator. Routing is exchanging of information from one host to another ...
متن کاملComparative Performance Analysis of AODV,DSR, TORA and OLSR Routing Protocols in MANET Using OPNET
Mobile Ad Hoc Networks (MANETs) are receiving a significant interest and are becoming very popular in the world of wireless networks and telecommunication. MANETs consist of mobile nodes which can communicate with each other without any infrastructure or centralized administration. In MANETs, the movement of nodes is unpredictable and complex; thus making the routing of the packets challenging....
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کامل