A Wireless Sensor Network (WSN) consists of spatially distributed autonomous sensors with sensing, computation and wireless communication capabilities. Each sensor generally has the task to monitor, measure ambient conditions, and disseminate the collected data towards a base station. One of the key points in the design stage of a WSN that is related to the sensing attribute is the coverage of the sensing field. The coverage issue in WSNs depends on many factors, such as the network topology, sensor sensing model, and the most important one is the deployment strategy. The sensor nodes can be deployed either deterministically or randomly. Random deployment of the sensor nodes can cause coverage holes formulation; therefore, in most cases, random deployment is not guaranteed to be efficient for achieving the required coverage. In this case, the mobility feature of the nodes can be utilized in order to maximize the coverage. This is Non-deterministic Polynomial-time hard (NP-hard) problem. So in this paper, the Immune Algorithm (IA) is used to relocate the mobile sensor nodes after the initial configuration to maximize the coverage area with the moving dissipated energy minimized. The performance of the proposed algorithm is compared with the previous algorithms using Matlab simulation. Simulation results show that the proposed algorithm improves the network coverage and the redundant covered area with minimum moving consumption energy.

This paper presents a new Genetic Algorithm-based Energy-Efficient adaptive clustering hierarchy Protocol (GAEEP) to efficiently maximize the lifetime and to improve the stable period of Wireless Sensor Networks (WSNs). The new protocol is aimed at prolonging the lifetime of WSNs by finding the optimum number of cluster heads (CHs) and their locations based on minimizing the energy consumption of the sensor nodes using genetic algorithm. The operation of the GAEEP is broken up into rounds, where each round begins with a set-up phase, when the base station finds the optimum number of CHs and assigns members nodes of each CH, followed by a steady-state phase, when the sensed data are transferred to CHs and collected in frames; then these frames are transferred to the base station. The performance of the GAEEP is compared with previous protocols using Matlab simulation. Simulation results show that GAEEP protocol improves the network lifetime and stability period over previous protocols in both homogeneous and heterogeneous cases. Moreover, GAEEP protocol increases the reliability of clustering process because it expands the stability period and compresses the instability period.

This paper presents a new Genetic Algorithm-based Energy-Efficient adaptive clustering hierarchy Protocol (GAEEP) to efficiently maximize the lifetime and to improve the stable period of Wireless Sensor Networks (WSNs). The new protocol is aimed at prolonging the lifetime of WSNs by finding the optimum number of cluster heads (CHs) and their locations based on minimizing the energy consumption of the sensor nodes using genetic algorithm. The operation of the GAEEP is broken up into rounds, where each round begins with a set-up phase, when the base station finds the optimum number of CHs and assigns members nodes of each CH, followed by a steady-state phase, when the sensed data are transferred to CHs and collected in frames; then these frames are transferred to the base station. The performance of the GAEEP is compared with previous protocols using Matlab simulation. Simulation results show that GAEEP protocol improves the network lifetime and stability period over previous protocols in both homogeneous and heterogeneous cases. Moreover, GAEEP protocol increases the reliability of clustering process because it expands the stability period and compresses the instability period.

This paper presents a new Genetic Algorithm-based Energy-Efficient adaptive clustering hierarchy Protocol (GAEEP) to efficiently maximize the lifetime and to improve the stable period of Wireless Sensor Networks (WSNs). The new protocol is aimed at prolonging the lifetime of WSNs by finding the optimum number of cluster heads (CHs) and their locations based on minimizing the energy consumption of the sensor nodes using genetic algorithm. The operation of the GAEEP is broken up into rounds, where each round begins with a set-up phase, when the base station finds the optimum number of CHs and assigns members nodes of each CH, followed by a steady-state phase, when the sensed data are transferred to CHs and collected in frames; then these frames are transferred to the base station. The performance of the GAEEP is compared with previous protocols using Matlab simulation. Simulation results show that GAEEP protocol improves the network lifetime and stability period over previous protocols in both homogeneous and heterogeneous cases. Moreover, GAEEP protocol increases the reliability of clustering process because it expands the stability period and compresses the instability period.

In this paper autonomous and nonautonomous modified hyperchaotic complex L¨ usystemsare proposed. Our systems have been generated by using state feedback and complex periodic forcing. The basic properties of these systems are studied. Parameters range for hyperchaotic attractors to exist are calculated. These systems have very rich dynamics in a wide range of parameters. The analytical results are tested numerically and excellent agreement is found. A circuit diagram is designed for one of these hyperchaotic complex systems and simulated using Matlab/Simulink to verify the hyperchaotic behavior.

In this paper autonomous and nonautonomous modified hyperchaotic complex L¨ usystemsare proposed. Our systems have been generated by using state feedback and complex periodic forcing. The basic properties of these systems are studied. Parameters range for hyperchaotic attractors to exist are calculated. These systems have very rich dynamics in a wide range of parameters. The analytical results are tested numerically and excellent agreement is found. A circuit diagram is designed for one of these hyperchaotic complex systems and simulated using Matlab/Simulink to verify the hyperchaotic behavior.

In this paper autonomous and nonautonomous modified hyperchaotic complex L¨ usystemsare proposed. Our systems have been generated by using state feedback and complex periodic forcing. The basic properties of these systems are studied. Parameters range for hyperchaotic attractors to exist are calculated. These systems have very rich dynamics in a wide range of parameters. The analytical results are tested numerically and excellent agreement is found. A circuit diagram is designed for one of these hyperchaotic complex systems and simulated using Matlab/Simulink to verify the hyperchaotic behavior.

In this paper, a new ECG compression method called Wavelet Threshold Based Immune Algorithm (WTBIA) is proposed. This method based on finding the best threshold level for each wavelet subband using Immune Algorithm (IA). The WTBIA algorithm consists of three main steps: 1) Applying 1-D Discrete Wavelet Transform (DWT) on ECG signal; 2) Thresholding of wavelet coefficients in each subband; and 3) Minimization of the Percent Root mean square Difference (PRD) and maximization of the Compression Ratio (CR) using IA. The main advantage of this method is finding the best threshold level for each subband based on the required CR and PRD. The compression algorithm was implemented and tested upon records selected from the MIT-BIH arrhythmia database [6] using different wavelets such as Haar, Daubechies, Coiflet, Symlet and Biorthogonal. Simulation results show that the proposed algorithm leads to high CR associated with low distortion level relative to previously reported compression algorithms.

In this paper, a new ECG compression method called Wavelet Threshold Based Immune Algorithm (WTBIA) is proposed. This method based on finding the best threshold level for each wavelet subband using Immune Algorithm (IA). The WTBIA algorithm consists of three main steps: 1) Applying 1-D Discrete Wavelet Transform (DWT) on ECG signal; 2) Thresholding of wavelet coefficients in each subband; and 3) Minimization of the Percent Root mean square Difference (PRD) and maximization of the Compression Ratio (CR) using IA. The main advantage of this method is finding the best threshold level for each subband based on the required CR and PRD. The compression algorithm was implemented and tested upon records selected from the MIT-BIH arrhythmia database [6] using different wavelets such as Haar, Daubechies, Coiflet, Symlet and Biorthogonal. Simulation results show that the proposed algorithm leads to high CR associated with low distortion level relative to previously reported compression algorithms.

In this paper, a new ECG compression method called Wavelet Threshold Based Immune Algorithm (WTBIA) is proposed. This method based on finding the best threshold level for each wavelet subband using Immune Algorithm (IA). The WTBIA algorithm consists of three main steps: 1) Applying 1-D Discrete Wavelet Transform (DWT) on ECG signal; 2) Thresholding of wavelet coefficients in each subband; and 3) Minimization of the Percent Root mean square Difference (PRD) and maximization of the Compression Ratio (CR) using IA. The main advantage of this method is finding the best threshold level for each subband based on the required CR and PRD. The compression algorithm was implemented and tested upon records selected from the MIT-BIH arrhythmia database [6] using different wavelets such as Haar, Daubechies, Coiflet, Symlet and Biorthogonal. Simulation results show that the proposed algorithm leads to high CR associated with low distortion level relative to previously reported compression algorithms.