The industrial factory is one of the challenging environments for future wireless communication systems, where the goal is to produce products with low cost in short time. This high level of network performance is achieved by distributing massive MIMO that provides indoor networks with joint beamforming that enhances 5G network capacity and user experience as well. Judging from the importance of this topic, this study introduces a new optimization problem concerning the investigation of multi-beam antenna (MBA) coverage possibilities in 5G network for indoor environments, named Base-station Beams Distribution Problem (BBDP). This problem has an extensive number of parameters and constrains including user’s location, required data rate and number of antenna elements. Thus, BBDP can be considered as NP-hard problem, where complexity increases exponentially as its dimension increases. Therefore, it requires a special computing method that can handle it in a reasonable amount of time. In this study, several differential evolution (DE) variants have been suggested to solve the BBDP problem. The results show that among all DE variants the self-adaptive DE (jDE) can find feasible solutions and outperform the classical ones in all BBDP scenarios with coverage rate of 85% and beam diameter of 500 m.
Cloud Computing is a mass platform to serve high volume data from multi-devices and numerous technologies. Cloud tenants have a high demand to access their data faster without any disruptions. Therefore, cloud providers are struggling to ensure every individual data is secured and always accessible. Hence, an appropriate replication strategy capable of selecting essential data is required in cloud replication environments as the solution. This paper proposed a Crucial File Selection Strategy (CFSS) to address poor response time in a cloud replication environment. A cloud simulator called CloudSim is used to conduct the necessary experiments, and results are presented to evidence the enhancement on replication performance. The obtained an
... Show MoreThe aim of robot path planning is to search for a safe path for the mobile robot. Even though there exist various path planning algorithms for mobile robots, yet only a few are optimized. The optimized algorithms include the Particle Swarm Optimization (PSO) that finds the optimal path with respect to avoiding the obstacles while ensuring safety. In PSO, the sub-optimal solution takes place frequently while finding a solution to the optimal path problem. This paper proposes an enhanced PSO algorithm that contains an improved particle velocity. Experimental results show that the proposed Enhanced PSO performs better than the standard PSO in terms of solution’s quality. Hence, a mobile robot implementing the proposed algorithm opera
... Show MoreEnhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras
... Show MoreIn this paper a decoder of binary BCH code is implemented using a PIC microcontroller for code length n=127 bits with multiple error correction capability, the results are presented for correcting errors up to 13 errors. The Berkelam-Massey decoding algorithm was chosen for its efficiency. The microcontroller PIC18f45k22 was chosen for the implementation and programmed using assembly language to achieve highest performance. This makes the BCH decoder implementable as a low cost module that can be used as a part of larger systems. The performance evaluation is presented in terms of total number of instructions and the bit rate.
This work presents the simulation of a Low density Parity Check (LDPC) coding scheme with
multiuserMulti-Carrier Code Division Multiple Access (MC-CDMA) system over Additive White
Gaussian Noise (AWGN) channel and multipath fading channels. The decoding technique used in
the simulation was iterative decoding since it gives maximum efficiency with ten iterations.
Modulation schemes that used are Phase Shift Keying (BPSK, QPSK and 16 PSK), along with the
Orthogonal Frequency Division Multiplexing (OFDM). A 12 pilot carrier were used in the estimator
to compensate channel effect. The channel model used is Long Term Evolution (LTE) channel with
Technical Specification TS 25.101v2.10 and 5 MHz bandwidth including the chan
This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a
... Show MoreCoronavirus disease (Covid-19) has threatened human life, so it has become necessary to study this disease from many aspects. This study aims to identify the nature of the effect of interdependence between these countries and the impact of each other on each other by designating these countries as heads for the proposed graph and measuring the distance between them using the ultrametric spanning tree. In this paper, a network of countries in the Middle East is described using the tools of graph theory.
The interests toward developing accurate automatic face emotion recognition methodologies are growing vastly, and it is still one of an ever growing research field in the region of computer vision, artificial intelligent and automation. However, there is a challenge to build an automated system which equals human ability to recognize facial emotion because of the lack of an effective facial feature descriptor and the difficulty of choosing proper classification method. In this paper, a geometric based feature vector has been proposed. For the classification purpose, three different types of classification methods are tested: statistical, artificial neural network (NN) and Support Vector Machine (SVM). A modified K-Means clustering algorithm
... Show MoreGeodesy is concerned with the relative positioning of points and the gravity field of the earth. For this task, a well-defined coordinate system is needed on which measurements are normally tied to a set of reference points called a geodetic datum (geoid or ellipsoid). The Global Positioning System GPS gives accurately the three-dimensional position of a point (latitude, longitude, and ellipsoidal height) and can measure under all weather conditions. The coordinates of the GPS reference to the World Geodetic System1984 (WGS 84), a global ellipsoid having its origin as the mass center of the earth, and height, referenced to the surface of the ellipsoid . In this research , using RTK-DGPS technique Data collection for study local and level
... Show MoreAccording to the theory of regular geometric functions, the relevance of geometry to analysis is a critical feature. One of the significant tools to study operators is to utilize the convolution product. The dynamic techniques of convolution have attracted numerous complex analyses in current research. In this effort, an attempt is made by utilizing the said techniques to study a new linear complex operator connecting an incomplete beta function and a Hurwitz–Lerch zeta function of certain meromorphic functions. Furthermore, we employ a method based on the first-order differential subordination to derive new and better differential complex inequalities, namely differential subordinations.