Coverage has direct effect on the network performance, thus it considered as the measure of quality of service in WSNs. The deployment strategy of sensor nodes in the sensor field is the most critical factor related to the network coverage. So, in this paper a centralized deployment algorithm based on immune optimization algorithm is proposed to improve the coverage of mobile sensor networks. The proposed algorithm redeploys the random deployed sensor nodes to maximize the coverage area based on a probabilistic sensing model. Moreover, the proposed algorithm limits the moving distance of mobile sensor nodes to reduce the dissipated energy in mobility and to ensure the connectivity among the sensor nodes. The performance of the proposed algorithm is compared with the CSAPO algorithm using MATLAB simulation. Simulation results show that the proposed algorithm outperforms the CSAPO algorithm in terms of the network coverage, mobility cost and convergence speed.

Coverage has direct effect on the network performance, thus it considered as the measure of quality of service in WSNs. The deployment strategy of sensor nodes in the sensor field is the most critical factor related to the network coverage. So, in this paper a centralized deployment algorithm based on immune optimization algorithm is proposed to improve the coverage of mobile sensor networks. The proposed algorithm redeploys the random deployed sensor nodes to maximize the coverage area based on a probabilistic sensing model. Moreover, the proposed algorithm limits the moving distance of mobile sensor nodes to reduce the dissipated energy in mobility and to ensure the connectivity among the sensor nodes. The performance of the proposed algorithm is compared with the CSAPO algorithm using MATLAB simulation. Simulation results show that the proposed algorithm outperforms the CSAPO algorithm in terms of the network coverage, mobility cost and convergence speed.

Coverage has direct effect on the network performance, thus it considered as the measure of quality of service in WSNs. The deployment strategy of sensor nodes in the sensor field is the most critical factor related to the network coverage. So, in this paper a centralized deployment algorithm based on immune optimization algorithm is proposed to improve the coverage of mobile sensor networks. The proposed algorithm redeploys the random deployed sensor nodes to maximize the coverage area based on a probabilistic sensing model. Moreover, the proposed algorithm limits the moving distance of mobile sensor nodes to reduce the dissipated energy in mobility and to ensure the connectivity among the sensor nodes. The performance of the proposed algorithm is compared with the CSAPO algorithm using MATLAB simulation. Simulation results show that the proposed algorithm outperforms the CSAPO algorithm in terms of the network coverage, mobility cost and convergence speed.

One of the primary objectives of Wireless Sensor Network (WSN) is to provide full coverage of a sensing field as long as possible. The deployment strategy of sensor nodes in the sensor field is the most critical factor related to the network coverage. However, the traditional deployment methods can cause coverage holes in the sensing field. Therefore, this paper proposes a new deployment method based on Multi-objective Immune Algorithm (MIA) and binary sensing model to alleviate these coverage holes. MIA is adopted here to maximize the coverage area of WSN by rearranging the mobile sensors based on limiting their mobility within their communication range to preserve the connectivity among them. The performance of the proposed algorithm is compared with the previous algorithms using Matlab simulation for different network environments with and without obstacles. Simulation results show that the proposed algorithm improves the coverage area and the mobility cost of WSN.

One of the primary objectives of Wireless Sensor Network (WSN) is to provide full coverage of a sensing field as long as possible. The deployment strategy of sensor nodes in the sensor field is the most critical factor related to the network coverage. However, the traditional deployment methods can cause coverage holes in the sensing field. Therefore, this paper proposes a new deployment method based on Multi-objective Immune Algorithm (MIA) and binary sensing model to alleviate these coverage holes. MIA is adopted here to maximize the coverage area of WSN by rearranging the mobile sensors based on limiting their mobility within their communication range to preserve the connectivity among them. The performance of the proposed algorithm is compared with the previous algorithms using Matlab simulation for different network environments with and without obstacles. Simulation results show that the proposed algorithm improves the coverage area and the mobility cost of WSN.

One of the primary objectives of Wireless Sensor Network (WSN) is to provide full coverage of a sensing field as long as possible. The deployment strategy of sensor nodes in the sensor field is the most critical factor related to the network coverage. However, the traditional deployment methods can cause coverage holes in the sensing field. Therefore, this paper proposes a new deployment method based on Multi-objective Immune Algorithm (MIA) and binary sensing model to alleviate these coverage holes. MIA is adopted here to maximize the coverage area of WSN by rearranging the mobile sensors based on limiting their mobility within their communication range to preserve the connectivity among them. The performance of the proposed algorithm is compared with the previous algorithms using Matlab simulation for different network environments with and without obstacles. Simulation results show that the proposed algorithm improves the coverage area and the mobility cost of WSN.

Energy hole problem is a critical issue for data gathering in wireless sensor networks. Sensors near the static sink act as relays for far sensors and thus will deplete their energy very quickly, resulting energy holes in the sensor field. Exploiting the mobility of a sink has been widely accepted as an efficient way to alleviate this problem. However, determining an optimal moving trajectory for a mobile sink is a non-deterministic polynomial-time hard problem. Thus, this paper proposed a mobile sink-based adaptive immune energy-efficient clustering protocol (MSIEEP) to alleviate the energy holes. A MSIEEP uses the adaptive immune algorithm (AIA) to guide the mobile sink-based on minimizing the total dissipated energy in communication and overhead control packets. Moreover, AIA is used to find the optimum number of cluster heads (CHs) to improve the lifetime and stability period of the network. The performance of MSIEEP is compared with the previously published protocols; namely, low-energy adaptive clustering hierarchy (LEACH), genetic algorithm-based LEACH, amend LEACH, rendezvous, and mobile sink improved energy-efficient PEGASIS-based routing protocol using MATLAB. Simulation results show that MSIEEP is more reliable and energy efficient as compared with other protocols. Furthermore, it improves the lifetime, the stability, and the instability periods over the previous protocols, because it always selects CHs from high-energy nodes. Moreover, the mobile sink increases the ability of the proposed protocol to deliver packets to the destination.

Energy hole problem is a critical issue for data gathering in wireless sensor networks. Sensors near the static sink act as relays for far sensors and thus will deplete their energy very quickly, resulting energy holes in the sensor field. Exploiting the mobility of a sink has been widely accepted as an efficient way to alleviate this problem. However, determining an optimal moving trajectory for a mobile sink is a non-deterministic polynomial-time hard problem. Thus, this paper proposed a mobile sink-based adaptive immune energy-efficient clustering protocol (MSIEEP) to alleviate the energy holes. A MSIEEP uses the adaptive immune algorithm (AIA) to guide the mobile sink-based on minimizing the total dissipated energy in communication and overhead control packets. Moreover, AIA is used to find the optimum number of cluster heads (CHs) to improve the lifetime and stability period of the network. The performance of MSIEEP is compared with the previously published protocols; namely, low-energy adaptive clustering hierarchy (LEACH), genetic algorithm-based LEACH, amend LEACH, rendezvous, and mobile sink improved energy-efficient PEGASIS-based routing protocol using MATLAB. Simulation results show that MSIEEP is more reliable and energy efficient as compared with other protocols. Furthermore, it improves the lifetime, the stability, and the instability periods over the previous protocols, because it always selects CHs from high-energy nodes. Moreover, the mobile sink increases the ability of the proposed protocol to deliver packets to the destination.

Energy hole problem is a critical issue for data gathering in wireless sensor networks. Sensors near the static sink act as relays for far sensors and thus will deplete their energy very quickly, resulting energy holes in the sensor field. Exploiting the mobility of a sink has been widely accepted as an efficient way to alleviate this problem. However, determining an optimal moving trajectory for a mobile sink is a non-deterministic polynomial-time hard problem. Thus, this paper proposed a mobile sink-based adaptive immune energy-efficient clustering protocol (MSIEEP) to alleviate the energy holes. A MSIEEP uses the adaptive immune algorithm (AIA) to guide the mobile sink-based on minimizing the total dissipated energy in communication and overhead control packets. Moreover, AIA is used to find the optimum number of cluster heads (CHs) to improve the lifetime and stability period of the network. The performance of MSIEEP is compared with the previously published protocols; namely, low-energy adaptive clustering hierarchy (LEACH), genetic algorithm-based LEACH, amend LEACH, rendezvous, and mobile sink improved energy-efficient PEGASIS-based routing protocol using MATLAB. Simulation results show that MSIEEP is more reliable and energy efficient as compared with other protocols. Furthermore, it improves the lifetime, the stability, and the instability periods over the previous protocols, because it always selects CHs from high-energy nodes. Moreover, the mobile sink increases the ability of the proposed protocol to deliver packets to the destination.

This paper presents the design of Ultra-Wideband Low Noise Amplifier (UWB LNA) beside the illustration of wideband amplifiers design using 3D inductors. The proposed UWB LNA whose bandwidth extends from 2.5 GHz to 16 GHz is designed using a symmetric 3D RF integrated inductor. This UWB LNA has a gain of 11 ± 1.0 dB and a NF less than 3.3 dB. Good input and output impedance matching and good isolation are achieved over the operating frequency band. The proposed UWB LNA is driven from a 1.8V supply. The UWB LNA is designed and simulated in standard TSMC 0.18 µm CMOS technology process.