The traveling salesman problem is addressed in this paper by introducing a distributed multi-ant colony algorithm that is implemented on a Raspberry Pi cluster. The implementation of a master and eight workers, each running on Raspberry Pi nodes, is the central component of this novel technique. Each worker is responsible for managing their own colony of ants, while the master coordinates communications among workers’ nodes and assesses the most optimal approach. To put the newly built cluster through its paces, several datasets of traveling salesman problem are used to test the created cluster. The findings of the experiment indicate that a single board computer cluster, which makes use of multi-ant colony algorithm, is a viable alternative for distributed computing. This approach's extensibility options are extensively discussed as well.
The Frequency-hopping Spread Spectrum (FHSS) systems and techniques are using in military and civilianradar recently and in the communication system for securing the information on wireless communications link channels, for example in the Wi-Fi 8.02.X IEEE using multiple number bandwidth and frequencies in the wireless channel in order to hopping on them for increasing the security level during the broadcast, but nowadays FHSS problem, which is, any Smart Software Defined Radio (S-SDR) can easily detect a wireless signal at the transmitter and the receiver for the hopping sequence in both of these, then duplicate this sequence in order to hack the signal on both transmitter and receiver messages using the order of the se
... Show MoreThe logistic regression model is an important statistical model showing the relationship between the binary variable and the explanatory variables. The large number of explanations that are usually used to illustrate the response led to the emergence of the problem of linear multiplicity between the explanatory variables that make estimating the parameters of the model not accurate.
... Show MoreThis paper aimed to determine the Optimal Reliable Frequency (ORF) that can maintain certain connection link between different transmitter/receiver stations laid over the Iraqi territory. Three different transmitting sites were chosen as tested stations located in the northern, central, and southern regions of Iraq. These sites are Mosul, Baghdad, and Basra, respectively. In this study, the years 2009 and 2014, which represent the minimum and maximum years of solar cycle 24, were chosen to examine the effect of low and high solar activity on the determined ORF. The datasets of the Best Usable Frequency (BUF) were calculated using the ASAPS international communication model. An analytical study was made on the generated BUF parameter data
... Show MoreIn the contemporary world, the security of data and privacy policies are major concerns in cloud computing. Data stored on the cloud has been claimed to be unsafe and liable to be hacked. Users have found it difficult to trust their data in the cloud. Users want to know that their data is accessible from anywhere and that an unauthorized user will not be able to access it. Another area of concern is the authentication of users over the cloud. There are a number of security concerns with Cloud Computing which include Distributed Denial of Service, Data leakage, and many more, just to mention a few. In this paper, an Elliptic Curve Cryptography (ECC) algorithm is used for the encryption and decryption of the information stored on
... Show MoreIn this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.
In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c
... Show More