There has been a growing interest in the use of chaotic techniques for enabling secure communication in recent years. This need has been motivated by the emergence of a number of wireless services which require the channel to provide very low bit error rates (BER) along with information security. This paper investigates the feasibility of using chaotic communications over Multiple-Input Multiple-Output (MIMO) channels by combining chaos modulation with a suitable Space Time Block Code (STBC). It is well known that the use of Chaotic Modulation techniques can enhance communication security. However, the performance of systems using Chaos modulation has been observed to be inferior in BER performance as compared to conventional communication

This study focused on spectral clustering (SC) and three-constraint affinity matrix spectral clustering (3CAM-SC) to determine the number of clusters and the membership of the clusters of the COST 2100 channel model (C2CM) multipath dataset simultaneously. Various multipath clustering approaches solve only the number of clusters without taking into consideration the membership of clusters. The problem of giving only the number of clusters is that there is no assurance that the membership of the multipath clusters is accurate even though the number of clusters is correct. SC and 3CAM-SC aimed to solve this problem by determining the membership of the clusters. The cluster and the cluster count were then computed through the cluster-wise J

With the development of modern mass media and the prevalence of use continues to both researchers and practitioners their efforts to understand how the media affect Hzha on both the individual and the institutions, society and culture as a whole, which means that the need to develop models and theories explain and predict the effects of the use of such means, therefore, the study of modern technologies of communication and information as an area of ​​research has become mature to establish the intellectual base cohesive, but they are not mature enough, which calls for more research developments therefore become social networking sites online, (Facebook, and YouTube, and straining) known today as the new social media, which is witness

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

<p><span>This research deals with the feasibility of a mobile robot to navigate and discover its location at unknown environments, and then constructing maps of these navigated environments for future usage. In this work, we proposed a modified Extended Kalman Filter- Simultaneous Localization and Mapping (EKF-SLAM) technique which was implemented for different unknown environments containing a different number of landmarks. Then, the detectable landmarks will play an important role in controlling the overall navigation process and EKF-SLAM technique’s performance. MATLAB simulation results of the EKF-SLAM technique come with better performance as compared with an odometry approach performance in terms of measuring the

This paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of AC