The majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution variants have been adopted to solve the 5G RNP problem. Experimental results have shown that the constrained DE/best/1/bin has achieved best results over other variants in terms of deployment cost, coverage rate and quality of service (QoS).
The present study investigated the use of pretreated fish bone (PTFB) as a new surface, natural waste and low-cost adsorbent for the adsorption of Methyl green (MG, as model toxic basic dye) from aqueous solutions. The functional groups and surface morphology of the untreated fish bone (FB) and pretreated fish bone were characterized using Fourier transform infrared (FTIR), scanning electron microscopy (SEM) and Energy dispersive X-ray spectroscopy (EDS),respectively. The effect of operating parameters including contact time, pH, adsorbent dose, temperature, and inorganic salt was evaluated. Langmuir, Freundlich and Temkin adsorption isotherm models were studied and the results showed that the adsorption of basic dye followed Freundlich iso
... Show MoreThe present study investigated the use of pretreated fish bone (PTFB) as a new surface, natural waste and low-cost adsorbent for the adsorption of Methyl green (MG, as model toxic basic dye) from aqueous solutions. The functional groups and surface morphology of the untreated fish bone (FB) and pretreated fish bone were characterized using Fourier transform infrared (FTIR), scanning electron microscopy (SEM) and Energy dispersive X-ray spectroscopy (EDS), respectively. The effect of operating parameters including contact time, pH, adsorbent dose, temperature, and inorganic salt was evaluated. Langmuir, Freundlich and Temkin adsorption isotherm models were studied and the results showe
Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
Directional Compact Geographic Forwarding (DCGF) routing protocol promises a minimal overhead generation by utilizing a smart antenna and Quality of Service (QoS) aware aggregation. However, DCGF was tested only in the attack-free scenario without involving the security elements. Therefore, an investigation was conducted to examine the routing protocol algorithm whether it is secure against attack-based networks in the presence of Denial-of-Service (DoS) attack. This analysis on DoS attack was carried out using a single optimal attacker, A1, to investigate the impact of DoS attack on DCGF in a communication link. The study showed that DCGF does not perform efficiently in terms of packet delivery ratio and energy consumption even on a sin
... Show More This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s