In this article, a novel technique is proposed, namely rank-based multi-objective antlion optimization (RMOALO), and applied to optimize the performance of the energy harvesting cognitive radio network (EHCRN). The original selection method in multi-objective antlion optimizer (MOALO) is suitably changed to improve the algorithm, thus reaching the optimal solution for the problem. The proposed technique shows considerable performance improvement over the method used in the multi-objective antlion optimizer (MOALO). The performance of the proposed RMOALO is demonstrated on five benchmark mathematical functions and compared to multi-objective particle swarm optimization (MOPSO), multi-objective moth flame optimization (MOMFO), MOALO-Tournament, and MOALO-Roulette. The simulation results show an improved convergence of RMOALO and find the optimal solution to the throughput maximization problem. We show that RMOALO provides 16.33 % improved average throughput with the optimal value of sensing duration for the varying amount of harvested energy compared to MOPSO, MOMFO, MOALO-Roulette, and MOALO-Tournament.

No abstract

Energy efficiency and throughput are concerns for energy-harvesting cognitive radio networks. However, attaining the maximum level of both requires optimization of sensing duration, harvested energy, and transmission time. To obtain the optimal values of these multiple parameters and to maximize the average throughput and energy efficiency, a new hybrid technique for multi-objective optimization is proposed. This hybrid optimization algorithm incorporates a Shapley value and a game theoretic concept into metaheuristics. Here, particle swarm optimization grey wolf optimization (PSOGWO) is selected as the source for the advanced hybrid algorithm. The concept of the unbiased nature of wolves is also added to PSOGWO to make it more efficient. Multi-objective optimization is formulated by taking a deep look into combined spectrum sensing and energy harvesting in a cognitive radio network (CSSEH). The Pareto optimal solutions for the multi-objective optimization problem of energy efficiency and throughput can be obtained using PSOGWO by updating the velocity with the weights. In the proposed Shapley hybrid multi-objective optimization algorithm, we used Shapley values to set up the weights that, in turn, updated the velocities of the particles. This updated velocity increased the ability of particles to reach a global optimum rather than becoming trapped in local optima. The solution obtained with this hybrid algorithm is the Shapley–Pareto optimal solution. The proposed algorithm is also compared with state-of-the-art PSOGWO, unbiased PSOGWO, and GWO. The results show a significant level of improvement in terms of energy efficiency by 3.56% while reducing the sensing duration and increasing the average throughput by 21.83% in comparison with standard GWO.

Route redistribution (RR) has become an integral part of IP network design as the result of a growing need for disseminating certain routes across routing protocol boundaries. While RR is widely used and resembles BGP in several non-trivial aspects, surprisingly, the safety of RR has not been systematically studied much by the networking community. This paper presents the study of the model in opnet for understanding the route redistribution in a network comprising of different AS. The behaviour of routing protocols EIGRP, OSPF, BGP is studied. The performance of each routing protocol is different from each other. Each of them has different architecture, adaptability, routing algorithms, processing delays and convergence capabilities. Among different routing protocols, EIGRP and OSPF have been considered as the pre-eminent routing protocols for the real-time application. To select a right protocol, several parameters such as network convergence time, bandwidth, scalability are considered. This paper reports a simulation based study between EIGRP, BGP and OSPF. In order to evaluate the performance of EIGRP and BGP three network scenarios are configured viz route redistribution, FFC with route redistribution and to fasten the BGP process the header changes are done.