One of the most important and basic problems in Wireless Sensor Networks (WSNs) is the coverage
problem. The coverage problem in WSNs causes the security environments is supervised by the existing
sensors in the networks suitably. The importance of coverage in WSNs is so important that is one of the
quality of service parameters. If the sensors do not suitably cover the physical environments they will not
be enough efficient n supervision and controlling. The coverage in WSNs must be in a way that the energy
of the sensors would be the least to increase the lifetime of the network. The other reasons which had
increase the importance of the problem are the topologic changes of the network which are done by the
damage or deletion of some of the sensors and in some cases the network must not lose its coverage. SO, in
this paper we have hybrid the Particle Swarm Optimization (PSO) and Differential Evolution (DE)
algorithms which are the Meta-Heuristic algorithms and have analyzed the area coverage problem in
WSNs. Also a PSO algorithm is implemented to compare the efficiency of the hybrid model in the same
situation. The results of the experiments show that the hybrid algorithm has made more increase in the
lifetime of the network and more optimized use of the energy of the sensors by optimizing the coverage of
the sensors in comparison to PSO.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
Increasing the Network life Time by Simulated Annealing Algorithm in WSN wit...ijasuc
Since we are not able to replace the battery in a wireless sensor networks (WSNs), the issues
of energy and lifetime are the most important parameters. In asymmetrical networks, different sensors
with various abilities are used. Super nodes, with higher power and wider range of communication in
comparison with common sensors, are used to cause connectivity and transmit data to base stations in
these networks. It is crucial to select the parameters of fit function and monitoring sensors optimally in a
point covering network. In this paper, we utilized an algorithm to select monitoring sensors. The
selection is done by using a novel algorithm that used by simulated annealing. This selection takes
remained energy into consideration. This method increases lifetime, decreases and balances energy
consumption as confirmed by simulation results.
DISTRIBUTED COVERAGE AND CONNECTIVITY PRESERVING ALGORITHM WITH SUPPORT OF DI...IJCSEIT Journal
Given a 3D space where should be supervised and a group of mobile sensor actor nodes with limited
sensing and communicating capabilities, this paper aims at proposing a distributed self-deployment
algorithm for agents to cover the space as much as possible by considering non-uniform sensing coverage
degree constraint of environment while preserving connectivity. The problem is formulated as coverage
maximization subject to connectivity and sensing coverage degree constraint. Considering a desired
distance between neighbouring nodes, an error function which depends on pairwise distance between
nodes is described. The maximization is encoded to an error minimization problem that is solved using
gradient descent algorithm and will yield in moving sensors into appropriate positions. Simulation results
are presented in two different conditions that importance of sensing coverage degree support of
environment is very high and is low.
Comparative Analysis of Different Deployment Techniques in Wireless Sensor Ne...IJEACS
In this communication era, wireless sensor network places a vital role. Wireless sensor network comprises of various types of sensor networks. Deployment of sensor nodes in wireless sensor network is a major concern to optimal result. There are various techniques in deploying the wireless sensor node. Among those some of the methods are, randomized method of deployment, grid based deployment, contour based deployment and projection based deployment. In this paper we are comparing all above methods and we show that projection based method out performs the rest of all othermethods.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AN ENERGY EFFICIENT DISTRIBUTED PROTOCOL FOR ENSURING COVERAGE AND CONNECTIVI...ijasuc
As wireless sensor networks (WSNs) continue to attract more and more researchers attention, new ideas for
applications are continually being developed, many of which involve consistent coverage with good
network connectivity of a given area of interest. For the successful operation of the wireless Sensor
Network, the active sensor nodes must maintain both coverage and also connectivity. These are two closely
related essential prerequisites and they are also very important measurements of quality of service (QoS)
for wireless sensor networks. This paper presents the design and analysis of novel protocols that can
dynamically configure a sensor network to result in guaranteed degrees of coverage and connectivity. This
protocol is simulated using NS2 simulated and compared against a distributed probabilistic coveragepreserving configuration protocol (DPCCP) with SPAN [1] protocol in the literature and show that it
activates lesser number of sensor nodes, consumes much lesser energy and maximises the network lifetime
significantly.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
Increasing the Network life Time by Simulated Annealing Algorithm in WSN wit...ijasuc
Since we are not able to replace the battery in a wireless sensor networks (WSNs), the issues
of energy and lifetime are the most important parameters. In asymmetrical networks, different sensors
with various abilities are used. Super nodes, with higher power and wider range of communication in
comparison with common sensors, are used to cause connectivity and transmit data to base stations in
these networks. It is crucial to select the parameters of fit function and monitoring sensors optimally in a
point covering network. In this paper, we utilized an algorithm to select monitoring sensors. The
selection is done by using a novel algorithm that used by simulated annealing. This selection takes
remained energy into consideration. This method increases lifetime, decreases and balances energy
consumption as confirmed by simulation results.
DISTRIBUTED COVERAGE AND CONNECTIVITY PRESERVING ALGORITHM WITH SUPPORT OF DI...IJCSEIT Journal
Given a 3D space where should be supervised and a group of mobile sensor actor nodes with limited
sensing and communicating capabilities, this paper aims at proposing a distributed self-deployment
algorithm for agents to cover the space as much as possible by considering non-uniform sensing coverage
degree constraint of environment while preserving connectivity. The problem is formulated as coverage
maximization subject to connectivity and sensing coverage degree constraint. Considering a desired
distance between neighbouring nodes, an error function which depends on pairwise distance between
nodes is described. The maximization is encoded to an error minimization problem that is solved using
gradient descent algorithm and will yield in moving sensors into appropriate positions. Simulation results
are presented in two different conditions that importance of sensing coverage degree support of
environment is very high and is low.
Comparative Analysis of Different Deployment Techniques in Wireless Sensor Ne...IJEACS
In this communication era, wireless sensor network places a vital role. Wireless sensor network comprises of various types of sensor networks. Deployment of sensor nodes in wireless sensor network is a major concern to optimal result. There are various techniques in deploying the wireless sensor node. Among those some of the methods are, randomized method of deployment, grid based deployment, contour based deployment and projection based deployment. In this paper we are comparing all above methods and we show that projection based method out performs the rest of all othermethods.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Effective range free localization scheme for wireless sensor networkijmnct
Location aware sensors can be used in many areas such as military and civilian applications. Wireless
Sensor Networks help to identify the accurate location of the event. In this paper a cost effective schema for
localization has been proposed. It uses two beacon nodes to identify the location of unknown nodes. It
also uses flooding and estimating method to accurately identify the location of other nodes. Available area
is divided into zones and beacons are provided for each zone. Beacon nodes are placed in appropriate
locations normally two in a zone to provide location information. Using the two nodes location of unknown
nodes can be calculated accurately.
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...csandit
Wireless Sensor Networks (WSNs) are experiencing a revival of interest and a continuous advancement in various scientific and industrial fields. WSNs offer favorable low cost and readily deployable solutions to perform the monitoring, target tracking, and recognition of physical events. The foremost step required for these types of ad-hoc networks is to deploy all the sensor nodes in their positions carefully to form an efficient network. Such network should satisfy the quality of service (QoS) requirements in order to achieve high performance levels. In
this paper we address the coverage requirement and its relation with WSN nodes placement problems. In fact, we present a new optimization approach based on the Flower Pollination Algorithm (FPA) to find the best placement topologies in terms of coverage maximization. We have compared the performance of the resulting algorithm, called FPACO, with the original practical swarm optimization (PSO) and the genetic algorithm (GA). In all the test instances, FPACO performs better than all other algorithms.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
Sensors Scheduling in Wireless Sensor Networks: An Assessmentijtsrd
The wireless sensor networks WSN is a combination of a large number of low power, short lived, unreliable sensors. The main challenge of wireless sensor network is to obtain long system lifetime. Many node scheduling algorithms are used to solve this problem. This method can be divided into the following two major categories first is round based node scheduling and second is group based node scheduling. In this paper many node scheduling algorithm like one phase decomposition model, Tree Based distributed wake up scheduling and Clique based node scheduling Algorithm are analyzed. Manju Ghorse | Dr. Avinash Sharma "Sensors Scheduling in Wireless Sensor Networks: An Assessment" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29560.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/29560/sensors-scheduling-in-wireless-sensor-networks-an-assessment/manju-ghorse
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Mobile Coordinated Wireless Sensor Networks with Fault-Tolerance for Structur...rahulmonikasharma
This paper introduces the Structural health monitoring (SHM) using Mobile Access Coordinated Wireless Sensor Network (MA-WSN) energy - efficient scheme for time sensitive applications. In Sensor Networks with Mobile Access points (SENMA), the mobile access points (MAs) traverse the network to collect information directly from each sensor. To organize disjoint nodes forming into small groups in high energy level, sensors are used in clustering methods, where each cluster has a coordinator referred as Cluster Head (CH). Early detection of failure CHs will reduce the data loss and provide possible minimal recovery efforts. Failure CHs are unable to connect to automatically organized another cluster head of access node and this access node collect and transfer data directly. So a new technique has been proposed in this paper which improves the life time of sensor nodes or it minimizes the maximum energy used by the sensor for transmitting data to the base station and also ensures monitoring quality. The performance of the proposed placement method has been tested by NS2 simulations and the result is compared with the sensor placement using effective independence method. This method obtains almost the same placement quality as that provided by using effective independence method, but with improvement in system life time.
A HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
A genetic algorithm approach for predicting ribonucleic acid sequencing data ...TELKOMNIKA JOURNAL
Malaria larvae accept explosive variable lifecycle as they spread across numerous mosquito vector stratosphere. Transcriptomes arise in thousands of diverse parasites. Ribonucleic acid sequencing (RNA-seq) is a prevalent gene expression that has led to enhanced understanding of genetic queries. RNA-seq tests transcript of gene expression, and provides methodological enhancements to machine learning procedures. Researchers have proposed several methods in evaluating and learning biological data. Genetic algorithm (GA) as a feature selection process is used in this study to fetch relevant information from the RNA-Seq Mosquito Anopheles gambiae malaria vector dataset, and evaluates the results using kth nearest neighbor (KNN) and decision tree classification algorithms. The experimental results obtained a classification accuracy of 88.3 and 98.3 percents respectively.
Performance analysis of adaptive noise canceller for an ecg signalRaj Kumar Thenua
In numerous applications of signal processing, communications and biomedical we are faced with the necessity to remove noise and distortion from the signals. Adaptive filtering is one of the most important areas in digital signal processing to remove background noise and distortion. In last few years various adaptive algorithms are developed for noise cancellation. In this paper we present an implementation of LMS (Least Mean Square), NLMS (Normalized Least Mean Square) and RLS (Recursive Least Square) algorithms on MATLAB platform with the intention to compare their performance in noise cancellation. We simulate the adaptive filter in MATLAB with a noisy ECG signal and analyze the performance of algorithms in terms of MSE (Mean Squared Error), SNR Improvement, computational complexity and stability. The obtained results shows that RLS has the best performance but at the cost of large computational complexity and memory requirement.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Effective range free localization scheme for wireless sensor networkijmnct
Location aware sensors can be used in many areas such as military and civilian applications. Wireless
Sensor Networks help to identify the accurate location of the event. In this paper a cost effective schema for
localization has been proposed. It uses two beacon nodes to identify the location of unknown nodes. It
also uses flooding and estimating method to accurately identify the location of other nodes. Available area
is divided into zones and beacons are provided for each zone. Beacon nodes are placed in appropriate
locations normally two in a zone to provide location information. Using the two nodes location of unknown
nodes can be calculated accurately.
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...csandit
Wireless Sensor Networks (WSNs) are experiencing a revival of interest and a continuous advancement in various scientific and industrial fields. WSNs offer favorable low cost and readily deployable solutions to perform the monitoring, target tracking, and recognition of physical events. The foremost step required for these types of ad-hoc networks is to deploy all the sensor nodes in their positions carefully to form an efficient network. Such network should satisfy the quality of service (QoS) requirements in order to achieve high performance levels. In
this paper we address the coverage requirement and its relation with WSN nodes placement problems. In fact, we present a new optimization approach based on the Flower Pollination Algorithm (FPA) to find the best placement topologies in terms of coverage maximization. We have compared the performance of the resulting algorithm, called FPACO, with the original practical swarm optimization (PSO) and the genetic algorithm (GA). In all the test instances, FPACO performs better than all other algorithms.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
Sensors Scheduling in Wireless Sensor Networks: An Assessmentijtsrd
The wireless sensor networks WSN is a combination of a large number of low power, short lived, unreliable sensors. The main challenge of wireless sensor network is to obtain long system lifetime. Many node scheduling algorithms are used to solve this problem. This method can be divided into the following two major categories first is round based node scheduling and second is group based node scheduling. In this paper many node scheduling algorithm like one phase decomposition model, Tree Based distributed wake up scheduling and Clique based node scheduling Algorithm are analyzed. Manju Ghorse | Dr. Avinash Sharma "Sensors Scheduling in Wireless Sensor Networks: An Assessment" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29560.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/29560/sensors-scheduling-in-wireless-sensor-networks-an-assessment/manju-ghorse
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Mobile Coordinated Wireless Sensor Networks with Fault-Tolerance for Structur...rahulmonikasharma
This paper introduces the Structural health monitoring (SHM) using Mobile Access Coordinated Wireless Sensor Network (MA-WSN) energy - efficient scheme for time sensitive applications. In Sensor Networks with Mobile Access points (SENMA), the mobile access points (MAs) traverse the network to collect information directly from each sensor. To organize disjoint nodes forming into small groups in high energy level, sensors are used in clustering methods, where each cluster has a coordinator referred as Cluster Head (CH). Early detection of failure CHs will reduce the data loss and provide possible minimal recovery efforts. Failure CHs are unable to connect to automatically organized another cluster head of access node and this access node collect and transfer data directly. So a new technique has been proposed in this paper which improves the life time of sensor nodes or it minimizes the maximum energy used by the sensor for transmitting data to the base station and also ensures monitoring quality. The performance of the proposed placement method has been tested by NS2 simulations and the result is compared with the sensor placement using effective independence method. This method obtains almost the same placement quality as that provided by using effective independence method, but with improvement in system life time.
A HYBRID FUZZY SYSTEM BASED COOPERATIVE SCALABLE AND SECURED LOCALIZATION SCH...ijwmn
Localization entails position estimation of sensor nodes by employing different techniques and mathematical computations. Localizable sensors also form an inherent part in the functioning of IoT devices and robotics. In this article, the author extends1 a novel scheme for node localization implemented using a hybrid fuzzy logic system to trace the node locations inside the deployment region, presented by the
Abhishek Kumar et. al. The results obtained were then optimized using Gauss Newton Optimization to improve the localization accuracy by 50% to 90% vis-à-vis weighted centroid and other fuzzy based localization algorithms. This article attempts to scale the proposed scheme for large number of sensor nodes to emulate somewhat real world scenario by introducing cooperative localization in previous presented work. The study also analyses the effectiveness of such scaling by comparing the localization accuracy. In next section, the article incorporates security in the proposed cooperative localization approach to detect malicious nodes/anchors by mutual authentication using El Gamel digital Signature scheme. A detailed study of the impact of incorporating security and scaling on average processing time and localization coverage has also been performed. The processing time increased by a factor of 2.5s for 500 nodes (can be attributed to more number of iterations and computations and large deployment area with small radio range of nodes) and coverage remained almost equal, albeit slightly low by a factor of 1% to 2%. Apart from these, the article also discusses the impact of adding extra functionalities in the proposed hybrid fuzzy system based localization scheme on processing time and localization accuracy.Lastly, this study also briefs about how the proposed scalable, cooperative and secure localization scheme tackles the type of attacks that pose threat to localization.
A genetic algorithm approach for predicting ribonucleic acid sequencing data ...TELKOMNIKA JOURNAL
Malaria larvae accept explosive variable lifecycle as they spread across numerous mosquito vector stratosphere. Transcriptomes arise in thousands of diverse parasites. Ribonucleic acid sequencing (RNA-seq) is a prevalent gene expression that has led to enhanced understanding of genetic queries. RNA-seq tests transcript of gene expression, and provides methodological enhancements to machine learning procedures. Researchers have proposed several methods in evaluating and learning biological data. Genetic algorithm (GA) as a feature selection process is used in this study to fetch relevant information from the RNA-Seq Mosquito Anopheles gambiae malaria vector dataset, and evaluates the results using kth nearest neighbor (KNN) and decision tree classification algorithms. The experimental results obtained a classification accuracy of 88.3 and 98.3 percents respectively.
Performance analysis of adaptive noise canceller for an ecg signalRaj Kumar Thenua
In numerous applications of signal processing, communications and biomedical we are faced with the necessity to remove noise and distortion from the signals. Adaptive filtering is one of the most important areas in digital signal processing to remove background noise and distortion. In last few years various adaptive algorithms are developed for noise cancellation. In this paper we present an implementation of LMS (Least Mean Square), NLMS (Normalized Least Mean Square) and RLS (Recursive Least Square) algorithms on MATLAB platform with the intention to compare their performance in noise cancellation. We simulate the adaptive filter in MATLAB with a noisy ECG signal and analyze the performance of algorithms in terms of MSE (Mean Squared Error), SNR Improvement, computational complexity and stability. The obtained results shows that RLS has the best performance but at the cost of large computational complexity and memory requirement.
Similar to A new approach for area coverage problem in wireless sensor networks with hybrid particle swarm optimization and differential evolution algorithms
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
NETWORK PERFORMANCE ENHANCEMENT WITH OPTIMIZATION SENSOR PLACEMENT IN WIRELES...ijwmn
From one side, sensor manufacturing technology and from other side wireless communication technology
improvement has an effect on the growth and deployment of Wireless Network Sensor (WSN). The
appropriate performance of WSN has abundant necessity which has dependent on the different parameters
such as optimize sensor placement and structure of network sensor. The optimized placement in WSN not
only would optimize number of sensors, but also help to reach to the more precise information. Therefore
different solutions are proposed to reduce cost and increase life time of sensor networks that most of them
are concentrated in the field of routing and information transmission. In this paper, places which they need
new sensors placement or sensor movements are determined and then with applying these changes,
performance of WSN will calculate. To achieve the optimum placement, the network should evaluate
precisely and effective criteria on the performance should extract. Therefore the criteria should be ranked
and after weighting with using AHP algorithms, with use of Geographical Information System (GIS), these
weighted criteria will combined and in the locations which WSN doesn’t have enough performance, new
sensor placement will create. New proposed method, improve 21.11% performance of WSN with sensor
placement in the low performance locations. Also the number of added sensor is 26.09% which is lowest
number of added sensors in comparison with other methods.
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK IJCNCJournal
Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of the most important challenges associated with WSN is to monitor all targets in a given area while maximizing network lifetime. In wireless communication, energy consumption is proportional to the breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive in nature and can be modified in order to save power while achieving maximum time of monitoring to increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20% as compared to other recent techniques in the case of a small network while achieving an 8% improvement for the case of a large networks.
Adaptive Sensor Sensing Range to Maximise Lifetime of Wireless Sensor NetworkIJCNCJournal
Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of the most important challenges associated with WSN is to monitor all targets in a given area while maximizing network lifetime. In wireless communication, energy consumption is proportional to the breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive in nature and can be modified in order to save power while achieving maximum time of monitoring to increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20% as compared to other recent techniques in the case of a small network while achieving an 8% improvement for the case of a large networks.
Energy efficient sensor selection in visual sensor networks based on multi ob...ijcsa
In this paper, we investigate the problem of visual coverage in visual sensor networks (VSNs). It is required to select a subset of sensor nodes to provide a visual coverage over the monitoring region at each point of time. In contrast with the pervious works which considered only single metric for sensor selection method, in this study we assumed the sensor selection as multi-criteria problem. For the purpose of maximizing the network lifetime, we consider three metrics a) visual coverage ratio, i.e., percentage of monitoring region which is fully covered by camera sensors, b) number of selected sensors, i.e., number of active sensors for covering the desired region, and c) overlapping coverage ratio, i.e., percentage of monitoring region which is covered by more than one camera sensor. Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is used to solve the problem. Besides, impact of steady state selection and generational selection method is studied on the network lifetime. Simulation results show the superiority of multi-objective optimization. NSGA-II results not only longer network lifetime but also fewer number of active sensor and lower overlapping ratio at each point of time.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
ENERGY EFFICIENT APPROACH BASED ON EVOLUTIONARY ALGORITHM FOR COVERAGE CONTRO...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this paper, we address the problem of network coverage and connectivity and propose an energy efficient approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the sensor nodes can have different sensing ranges and transmission ranges .The proposed algorithm is simulated and it' efficiency
is demonstrated via different experiments.
High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problemijasuc
Target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the
network while continuously monitoring a set of targets. A sensor covers targets which are within the
sensing range. For a set of sensors and a set of targets, the sensor-target coverage relationship is
assumed to be known. A sensor cover is a set of sensors that covers all the targets. The target coverage
problem is to determine a set of sensor covers with maximum aggregated lifetime while constraining the
life of each sensor by its initial battery life. The problem is proved to be NP-complete and heuristic
algorithms to solve this problem are proposed. In the present study, we give a unified interpretation of
earlier algorithms and propose a new and efficient algorithm. We show that all known algorithms are
based on a common reasoning though they seem to be derived from different algorithmic paradigms. We
also show that though some algorithms guarantee bound on the quality of the solution, this bound is not
meaningful and not practical too. Our interpretation provides a better insight to the solution techniques.
We propose a new greedy heuristic which prioritizes sensors on residual battery life. We show
empirically that the proposed algorithm outperforms all other heuristics in terms of quality of solution.
Our experimental study over a large set of randomly generated problem instances also reveals that a very
naïve greedy approach yields solutions which is reasonably (appx. 10%) close to the actual optimal
solutions.
Concepts and evolution of research in the field of wireless sensor networksIJCNCJournal
The field of Wireless Sensor Networks (WSNs) is experiencing a resurgence of interest and a continuous evolution in the scientific and industrial community. The use of this particular type of ad hoc network is becoming increasingly important in many contexts, regardless of geographical position and so, according to a set of possible application. WSNs offer interesting low cost and easily deployable solutions to perform a remote real time monitoring, target tracking and recognition of physical phenomenon. The uses of these sensors organized into a network continue to reveal a set of research questions according to particularities target applications. Despite difficulties introduced by sensor resources constraints, research contributions in this field are growing day by day. In this paper, we present a comprehensive review of most recent literature of WSNs and outline open research issues in this field.
Survey of Wireless Sensor Network Applicationijsrd.com
Sensor networks offer a powerful combination of distributed sensing, computing and communication. They lend themselves to countless applications and, at the same time, offer numerous challenges due to their peculiarities, primarily the stringent energy constraints to which sensing nodes are typically subjected. The distinguishing traits of sensor networks have a direct impact on the hardware design of the nodes at least four levels: power source, processor, communication hardware, and sensors. Various hardware platforms have already been designed to test the many ideas spawned by the re-search community and to implement applications to virtually all fields of science and technology. We are convinced that CAS will be able to provide a substantial contribution to the development of this exciting field. A wireless sensor network (WSN) has important applications such as remote environmental monitoring and target tracking. This has been enabled by the availability, particularly in recent years, of sensors that are smaller, cheaper, and intelligent. These sensors are equipped with wireless interfaces with which they can communicate with one another to form a network. The design of a WSN depends significantly on the application, and it must consider factors such as the environment, the application's design objectives, cost, hardware, and system constraints. The goal of our survey is to present a comprehensive review of the recent literature since the publication of [I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks, IEEE Communications Magazine, 2002]. Following a top-down approach, we give an overview of several new applications and then review the literature on various aspects of WSNs. We classify the problems into three different categories: (1) Internal platform and underlying operating system, (2) Communication protocol stack, and (3) Network services, provisioning, and deployment. We review the major development in these three categories and outline new challenges.
Design and Implementation a New Energy Efficient Clustering Algorithm Using t...ijmnct
Wireless Sensor Networks are consist of small battery powered devices with limited energy resources.Once
deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy
source is not feasible. Hence, one of the most important issues that need to be enhanced in order to
improve the life span of the network is energy efficiency. to overcome this demerit many research have
been done. The clustering is the one of the representative approaches. In this paper, we introduce a
dynamic clustering algorithm using Fuzzy Logic and genetic algorithm. In fact, using fuzzy system design
and system optimization by genetic algorithm is presented approach to select the best cluster head in
sensor networks. Using random data set has been addressed to evaluate of fuzzy-genetic system presented
in this paper and finally, MSE rate or mean error of sending the messages using proposed fuzzy system in
comparison with LEACH method is calculated in select the cluster head. The results of evaluations is
representative of a reduction the MSE metric in proposed method in comparison with LEACH method for
select the cluster head. Reduce of MSE directly is effective on energy consumption and lifetime of wireless
sensor network and can cause the reduce energy consumption and increase network lifetime.
Cds based energy efficient topology control algorithm in wireless sensor net...eSAT Journals
Abstract Wireless Sensor Networks (WSNs) are a self organized network which consists of large number of sensor nodes that collects the data in a various environment [1, 2]. The sensors work on battery that have limited lifetime so it is a challenge to create an energy efficient network that can reduce the energy consumption and interference in the network graph and thereby extend the network lifetime [2]. For saving energy and extending network lifetime the topology is a well-known technique in WSNs and the widely used topology control strategy is the construction of Connected Dominating Set (CDS) [3, 4]. In this paper, we construct a CDS based energy efficient topology control algorithm i.e. GCDSTC for WSNs. The performance analysis includes the study of GCDSTC algorithm in terms of complexity and compares it with EBTC (Energy Balanced Topology Control) algorithm. The simulation results indicate that the GCDSTC algorithm reduce the energy consumption and interference in the network graph, in order to enhance the network lifetime. Keywords: Wireless Sensor Network (WSN), Connected Dominating Set (CDS), Topology Control (TC), etc.
Bottleneck Detection Algorithm to Enhance Lifetime of WSNjosephjonse
In recent years, a wireless sensor network is gaining much more importance due to its immense contribution in numerous applications. Deployment of sensor nodes that would reduce computation, minimize cost and gaining high degree of network connectivity is an challenging task. Random deployment of sensor nodes causes the wireless sensor networks to face topological weaknesses such as communication bottlenecks, network partitions and sensing holes. These problems lead to uneven energy utilization, reduction in reliability of network and reduction in network lifetime. Bottleneck detection algorithm is proposed to identify bottleneck and minimal bottleneck zones in network. Additional sensor node deployment strategy is used in bottleneck detection algorithm to extend network lifetime. Random additional sensor node deployment and Targeted additional sensor node deployment are proposed to enhance network lifetime. Deployment strategies are compared with respect to network parameters such as throughput, packet delivery fraction and network lifetime.
BOTTLENECK DETECTION ALGORITHM TO ENHANCE LIFETIME OF WSNijngnjournal
In recent years, a wireless sensor network is gaining much more importance due to its immense
contribution in numerous applications. Deployment of sensor nodes that would reduce computation,
minimize cost and gaining high degree of network connectivity is an challenging task. Random deployment
of sensor nodes causes the wireless sensor networks to face topological weaknesses such as communication
bottlenecks, network partitions and sensing holes. These problems lead to uneven energy utilization,
reduction in reliability of network and reduction in network lifetime. Bottleneck detection algorithm is
proposed to identify bottleneck and minimal bottleneck zones in network. Additional sensor node
deployment strategy is used in bottleneck detection algorithm to extend network lifetime. Random
additional sensor node deployment and Targeted additional sensor node deployment are proposed to
enhance network lifetime. Deployment strategies are compared with respect to network parameters such as
throughput, packet delivery fraction and network lifetime.
Similar to A new approach for area coverage problem in wireless sensor networks with hybrid particle swarm optimization and differential evolution algorithms (20)
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
The Art of the Pitch: WordPress Relationships and Sales
A new approach for area coverage problem in wireless sensor networks with hybrid particle swarm optimization and differential evolution algorithms
1. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
A NEW APPROACH FOR AREA COVERAGE
PROBLEM IN WIRELESS SENSOR NETWORKS WITH
HYBRID PARTICLE SWARM OPTIMIZATION AND
DIFFERENTIAL EVOLUTION ALGORITHMS
Isa Maleki1, Seyyed Reza Khaze2, Marjan Mahmoodi Tabrizi3, Ali Bagherinia4
1,2,4
Department of Computer Engineering, Dehdasht Branch, Islamic Azad University,
Dehdasht, Iran
3
Department of Computer Engineering, Science and Research Branch, Islamic Azad
University, West Azerbaijan, Iran
ABSTRACT
One of the most important and basic problems in Wireless Sensor Networks (WSNs) is the coverage
problem. The coverage problem in WSNs causes the security environments is supervised by the existing
sensors in the networks suitably. The importance of coverage in WSNs is so important that is one of the
quality of service parameters. If the sensors do not suitably cover the physical environments they will not
be enough efficient n supervision and controlling. The coverage in WSNs must be in a way that the energy
of the sensors would be the least to increase the lifetime of the network. The other reasons which had
increase the importance of the problem are the topologic changes of the network which are done by the
damage or deletion of some of the sensors and in some cases the network must not lose its coverage. SO, in
this paper we have hybrid the Particle Swarm Optimization (PSO) and Differential Evolution (DE)
algorithms which are the Meta-Heuristic algorithms and have analyzed the area coverage problem in
WSNs. Also a PSO algorithm is implemented to compare the efficiency of the hybrid model in the same
situation. The results of the experiments show that the hybrid algorithm has made more increase in the
lifetime of the network and more optimized use of the energy of the sensors by optimizing the coverage of
the sensors in comparison to PSO.
KEYWORDS
Wireless Sensor Networks, Coverage Problem, Particle Swarm Optimization, Differential Evolution
1. INTRODUCTION
WSNs are used in research, operation and business fields vastly. The WSNs include many sensors
which are applicable in the supervision and security environments [1]. WSNs are able to
supervise the aimed environments and control them and process the gathered information. In
WSNs we must consider the coverage and energy use problems to increase the lifetime of the
network so the data sending and lifetime of the network would not face considerable decrease [2].
The energy use and network coverage are very important factors in designing the WSNs. And
according to the environmental situation of these networks, it is not possible to change the battery
of the thousands of the sensors [3, 4]. So, the coverage problem in WSNs is in direct relation to
the increase of the lifetime of the sensors. The best situation for the WSNs is the time that all
nodes are located in a suitable sensor radius distance. And this means that the network has the
DOI : 10.5121/ijmnct.2013.3606
61
2. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
longest lifetime [5]. So, to increase the lifetime of the network, the sensor distribution must be
steady.
The most important factor for developing and scaling the WSNs is to consider the coverage
problem and decreasing the energy use of the sensors [6]. To increase the serious factors in WSNs
it is possible to name these fields [7, 8, and 9]: First the redundant sensors must be deactivated to
save their energy. When the redundant sensors are deactivated, the active sensors gather the
information and send them to the Base Station (BS). It means that if just the active sensors gather
the information, surely the energy use will decrease. So, the coverage must be in a way that all
active sensors be able to overall points and also the minimum number of the sensors will be used
[10]. Second, we must set the coverage area according to the size of the neighbor sensors and then
the distance to the neighbor sensor is needed to sense and transfer the information. So, coverage
problem is the most important and basic case in creation of the WSNs. Different classifications
are identified for coverage in the sensor networks any of which affect the problem from another
point of view.
•
Area Coverage: The most important problem in area coverage is the coverage kind of an
area by the sensors. The main goal of area coverage in WSNs is to cover and supervise en
environment completely [11]. Any point of under coverage environment in area coverage
must be covered at least by one sensor. In [12] the under coverage area is assumed as a
circle and all points under coverage are covered by K sensors. In [13] two K joints and K
coverage states are studied among the sensors and there is no relation between the under
coverage points and the sensors are diffused randomly in the environment. When an area
is covered, any point must be covered by a group of the sensors. So, in this method of
coverage we consider a place coordinates and distribute the sensors randomly or manual
to cover the aimed environment totally. In area coverage the best coverage takes place
when the aimed area is covered by the least number of the sensors completely [14, 15].
Area coverage is often used for the areas in which the probability of events exists in all
coordinates. Also the existence of the redundant sensors in this model cause the multi
coverage which lead to the high density of the network. In Figure (1) the area coverage is
shown.
Figure 1. Area coverage
•
Point Coverage: The goal is to cover a specific point of the environment in this method.
And these points are diffused in the area [16]. It is possible to say that this method is a
sub set of the area coverage method. So, if the total area is not covered by the sensors just
some points are covered and this means the point coverage. In point coverage just the
points which are applicative are covered. So, in point coverage some of the goals are
identified by some specific points which must be controlled are considered. Medium
numbers of the sensors are diffused around the goals and then are activated according to
specific scheduling in relation to specific responsibilities and send the gathered
information to the BS [17]. In Figure (2) the point coverage is shown.
62
3. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
Figure 2. Point coverage
•
Barrier Coverage: the total area is not covered by the sensors in barrier coverage. The
barrier coverage is a suitable model for penetration diagnosis applications. In this model
the coverage operations take place in a way that if the penetration takes place from the
width of the under coverage area, the sensors must diagnose them [18]. In barrier
coverage the goals are controlled at least by one sensor and all existing goals in that area
are under control of that area [19, 20]. In Figure (3) the barrier coverage is shown.
Figure 3. Barrier coverage
Now, the population algorithms based on swarm search are used for optimization. An important
class of these algorithms are aspired the natural processes and the behavior of the creatures. These
algorithms are inspired by the swarm behavior of the animals like the insects and are applicative
in optimization problems vastly [21, 22]. In other words the group behavior is used as a powerful
tool for solving the optimization problems. In this paper the problem of area coverage in WSNs is
studied which is one of the most important factors in increasing the lifetime of the network using
the hybrid of PSO and DE algorithms.
This paper is organized as follows: in Section 2, we have introduce the related works; in Section
3, meta-heuristic algorithms are introduced; in Section 4, the proposed model is described; in
Section 5, the evaluation and results of the proposed model are presented and at finally in Section
6, we have presented the conclusion and future works to be done.
2. RELATED WORKS
One of the most important research fields in wireless communications, is WSNs. WSNs includes
a set of the sensors which are diffused in supervising environments and process the sensed data
and finally send the favorite information to the BS. Many different methods are presented for
improving the coverage problem till now any of which has caused many advances in the coverage
and its quality in the WSNs.
Using the Multi-Objective Particle Swarm Optimization (MPSO) in coverage problem for energy
efficiency and the increase of the lifetime of the WSNs is studied in [23]. The main goal of
MPSO is to find the best position for the sensors for better coverage. According to the results of
63
4. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
the experiments it is possible to say that MPSO is efficient in coverage and increasing the lifetime
of the network. In [24] studied the K-coverage problem in WSNs using the Harmony Search
(HS). In this reference it is said that the two coverage and energy efficiency are very important
parameters in wireless sensor nodes distribution. In this reference the HS algorithm is used for
better joint of the sensors, K-coverage and minimizing the energy use. In K-coverage the area is
covered by k sensors. The results of the experiments in this reference show that the HS algorithm
is very efficient in coverage and minimizing the energy use of the sensors. In [25] a distributed
algorithm with efficient energy use and optimized coverage goal is proposed. In proposed
algorithm the sensors are divided into active and inactive subsets and create a graph model which
leads to the balance energy use of the sensors. In this reference, only the active sensors are used
for coverage and the rest of the sensors go deactivated. Turning off the unnecessary and
redundant sensors, the other sensors of the network use less energy and as a result the lifetime of
the network increases. The results of the simulations show that the efficiency of the suggested
algorithm is more than the under comparison algorithms and it is able to increase the lifetime of a
network up to multi times more.
In [26] has studied the positioning method of the sensors in WSNs according to the point
coverage. In point coverage which is shaped by some goal points, the establishment of the sensors
is very affective on the number of the needed sensors for coverage of the points. In this reference,
the point coverage takes place according to the position of the goal and angle of the goal points.
Z. Bin et al [27] use the Fish Swarm (FS) and PSO algorithms hybrid to study the WSNs
coverage problem. PSO algorithm is used in hybrid algorithm for more efficiency and FS for
covering the sensors. The results show that the hybrid algorithm is efficient enough in
deployment of the sensors of network and has improved the coverage problem. In some
researches [28], the sensing coverage of any sensor is set in a specified space for increasing the
efficiency of the energy of the sensors. In this reference, two heuristic algorithms are used for the
results of the experiences. The results of the experiments show that Greedy is more efficient in
energy consumption and network coverage in comparison to Linear Programming. The researches
of [29] proposed a heuristic algorithm to fully cover a region having arbitrary (opaque) obstacles,
which allow neither the sensor to be placed inside nor the signals to pass through. They first
deploy an optimal pattern for covering a plane over the region, and then locate and efficiently
cover the uncovered holes formed by the obstacles.
Reference [30] has presented a dynamic algorithm for area coverage problem in WSNs. In
coverage, the most important challenge is the distribution of the sensors and the lifetime of the
network. In this reference, the sensors are distributed according to the supervision area and the
shape the most important establishment. Also the sensors can dynamically have topological
changes in the environment. The most important specifications considered in this reference is the
energy used by the sensors. The results of the experiments show that the proposed algorithm is
more efficient than the other algorithms from establishment of the sensors point of view.
Researchers [31], use the Ant Colony Optimization (ACO) Algorithm in WSNs coverage
problem. The best radius for the sensors is identified using the ACO algorithm. When it is needed
to have an active network for long time and the sensing limits of the any sensor is identified or
when the quality and stability of supervision are the most important factors, the use of ACO
algorithm is suitable. They have evaluated the improvement of the energy use problem in sensor
networks using the area coverage and have showed that ACO is efficient in lifetime of the
network. According to the results of their simulation, ACO algorithm is efficient in lifetime of the
network.
Researchers [32] have used the heuristic algorithms for the coverage problem in large scales. For
optimization of coverage problem in large scales, the Greedy algorithm is utilized. The goal of
them is to use the heuristic algorithms to establish the sensors in the points of the spaces which
cover the network in the best manner and have the best lifetime. Any point could have many
redundant sensors and if they are active, more energy is used. So, the sensors which are not used
64
5. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
are deactivated by the Greedy algorithm a just the sensors which are in relation to the base station
are activated. The results of the experiments show that the Greedy algorithm is the best solution
for coverage problem of the sensors in large scale. X. Wang et al [33] have proposed a new
protocol based on the dynamic structure of the sensors for coverage problem. In the proposed
protocol, the sensors are activated or deactivated for energy saving. Also, the position of the
sensors is dynamically identified and any sensor can cover its radius well. They have proved that
the propose algorithm is more efficient in coverage. In [34] first studied the barrier coverage of
two-dimensional plane and two-dimensional strip sensor networks using percolation theory
results. The barrier coverage of a two-dimensional plane network is related to the existence of a
giant sensor cluster that percolates the network. However, the strength of the barrier coverage,
i.e., the number of disjoint barriers, was not obtained. For a two-dimensional strip network of
finite width, it is proved that there always exist crossing paths along which an intruder can cross
the strip undetected. Furthermore, the probability that an intruder is detected when crossing a strip
is characterized.
3. META-HEURISTIC ALGORITHMS
Meta-Heuristic algorithms are based on population to the optimization problems and are tools for
finding the near to optimized solutions. These algorithms utilize the diversity and cooperation
concepts and make the optimization space better in achieving the most optimized status. So, the
more the power of an algorithm in controlling the two parameters, the more algorithms is capable
in finding the most optimized stage. In this section we talk about PSO and DE algorithms which
are the most important population algorithms.
3.1. Particle Swarm Optimization
PSO algorithm was first introduced Kennedy and Eberhart in 1995 inspiring the social behavior
of the birds living in large and small groups [35]. PSO is a simulation of the social behavior of the
birds which search for food in and environment. None of the birds have information about the
place of the food but they know in each stage how far they are from the food. On this basis, the
best procedure to find food is to follow the nearest bird to the food.
PSO algorithm is a population algorithm in which a number of the particles which are the
solutions for a function or problem shape a population. A population of the particles moves in the
problem space and tries to find the most optimized answer in the searching space according to
their own experience and also the population’s. PSO algorithm is an optimization algorithm
which provides a search based on the population in which any particle changes its position by the
time. In PSO algorithm the particles move in a searching space of multi dimension including the
possible solutions. In this space an evaluation factor is defined and the quality evaluation of the
solutions of the problem takes place by it. Any change of a particle in a group is affected by the
self or other’s experience and the searching behavior of a particle is affected by the other
particles. This simple behavior causes finding optimized areas of the searching space. So, in PSO
algorithm, any particle which finds the optimized situation, informs the other particles in a
suitable manner and any particle decides for the cost function according to the achieved values
and searching takes place using the ex-knowledge of the particles. This cause the particles do not
get near each other more than the normal and solve the optimization problem effectively.
In PSO algorithm, first the group members are created randomly in problem space and the
searching process for the optimized answer starts. In the total structure, the search of any member
follows the other which is the most optimized suitable value of the function and it does not forget
its experience and follows the state in which he suitability function value was the most for itself.
So, in each repetition, any member changes its situation according to the two values, one of them
is the best situation of the member till then (pbest) and the other is the best situation the total
65
6. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
population has had till then. In fact it is the pbest in the total population (gbest). In concept, pbest
for any member is in fact the biologic memory of the member. gbest is the general knowledge of
the population and when the members change their situation according to gbest, in fact they try to
heighten the knowledge level up to the general knowledge of the population. From the concept
view, the best particle of the group relates all other particles to each other. The identification of
the next situation of any particle is done by the equations (1) and (2).
vi +1 = w.vi + c1 .r1 .( Pbesti − xi ) + c2 .r2 .( g besti − xi ),
( 1)
xi +1 = xi + vi +1
( 2)
In equation (1), c1 and c2 are the learning parameters. rand() is a function for producing the
random numbers in [0, 1]. xi is the present situation and vi is the moving speed of the members. W
is a control parameter which controls the present speed (vi) with the next one and creates a
balanced state between the ability of the algorithm in local and global searching and then reaches
the answer in a shorter time. So, for optimized operation of the algorithm in the searching space,
parameter w is introduced as follows [36, 37]:
w = wMax −
((wMax − wMin ) × i)
iMax
( 3)
In equation (3), imax shows the maximum number of the repetitions of the algorithm and parameter
i is the counter of the repetitions of finding optimized answer. In equation (3), the wmax and wmin
are the primary value and the final value of inertia weight in algorithm execution time,
respectively. Inertia weight value changes from 0.9 to 0.4 linearly in execution time of the
program. Large values of w lead to the global search and the small values lead to local search. To
balance the local and global search it is necessary to reduce the inertia weight in algorithm
execution time. So, by reducing the w, the search takes place locally and around the optimized
answer.
3.2. Differential Evolution
DE algorithm was innovated in 1995 by Storn and Price [38]. DE algorithm is a probable
searching which is based on population. This algorithm uses the distance and direction from the
existing population information to continue searching. He advantages of this algorithm are speed,
parameter setting, efficiency in finding the optimized solution, parallelization, high care and no
need for ordering and matrix coefficient. DE algorithm is able to search in direction of the
coordinates of the optimization variables and changing the coordinates for finding the optimized
solution. DE algorithm starts the evolution of the searching process from a random initial
population. Three mutation, crossover and selection controlling parameters include the
population, index coefficient and the crossover probability which are important in DE Algorithm.
DE algorithm stages include the followings:
•
Creating initial population: The initial population or the solution vectors are selected
randomly from the problem domain in DE algorithm. The solutions position vector is
introduced by equation (4).
X i = ( xi ,1 , xi , 2 ,..., xi , D )
( 4)
66
7. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
min
max
min
xik = xk + rand (0,1).( xk − xk )
with
i ∈ [1, Np], k ∈ [1, D]
( 5)
The selection of the random numbers xik from the problem domain takes place by equation (5). In
equation (5), D means the dimensions of the solutions. Np is the number of the initial population.
Rand (0, 1) function produces the random numbers (uniform distribution) in (0, 1). It is clear that
if the equation (5) is used, the values for xik is in [ ximax , ximin ] and the position vector of the
solutions would be one of the potential answers of the optimization problem.
•
Mutation: In mutation stage three vectors are selected randomly which differ each other.
For any x vector in population a new answer in each repetition is created according to
equation (6).
vi ,G+1 = xr1 ,G + F .( xr2 ,G − xr3 ,G )
( 6)
In equation (6), r1, r2 and r3 which are three non-equal random numbers are located in [1, Np]. G is
the number of the produced generations and F is a constant and real number which is often
considered 0.5.
•
Crossover: Crossover operator causes increase in diversity of the population. This
operator is similar to the crossover operator in genetic algorithm [39]. In this operator the
new vectors are created by hybrid of the x and v vectors as equation (7).
v ji , G +1 if (rj ≤ CR) or j = jrand
u ji ,G +1 =
x ji, G +1 otherwise
( 7)
In equation (7), parameter CR is located in [0, 1). Parameter rj is randomly created in [0, 1]. Also
the value is j=1, 2 … D.
•
Selection: To select the vectors of the highest propriety, the vectors created by the
mutation and crossover operators are compared to each other and any of them holding
more suitability is transferred to the next generation. The selection operator takes place
by equation (8).
xi ,G +1 = Fitness Value(ui ,G +1 , xi ,G )
( 8)
•
Stop: The searching process continues till the stopping factor of the algorithm is met.
Usually the stopping facto of the algorithm could be based on the non-changing propriety
of the best answer or algorithm repetition.
4. PROPOSED MODEL
The most important factor in WSNs is to minimize the energy use of the sensors and the coverage
problem. Sensors usually use a battery for providing the energy which is not chargeable or
changeable in many cases. So, the reduction of energy use in increase of the lifetime of the
sensors is very important. In coverage problem, the sensing radius of the sensors which shows the
capability of diagnosing the phenomena or physical signals by the sensors is very important.
67
8. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
Setting the parameter of sensing radius of the sensors is very important but the minimization of
the energy used by the nodes is also very important. Of the problems to be cited in WSN is the
distribution type of the sensors in an optimized coverage. In this paper a new hybrid model using
the PSO and DE algorithms for distribution of the sensors for area coverage is proposed. In
Figure (4) the hybrid algorithm flowchart is showed.
Figure 4. The hybrid algorithm flowchart
68
9. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
In Figure (5), the quasi code of the hybrid algorithm is shown.
1. Initialization Phase
1.1. Start
1.2. Initialize PSO & DE parameters
2. Coverage Phase
2.1. Loop
2.2. Run program for coverage
2.3. Obtains best coverage
●Randomly initialize all particle velocities
●for all particles
●Update V
●Update X
●Compute V and X of each particle
●Update gbest
●Update pbest
●Modification of each search particles
●Mutation vector particles
●Crossover vector particles
●Selection vector particles
2.4. Assign X & Y Coordinate to each sensor
2.5. Sensor (i) = Optimum Location (Xi, Yi)
2.6. Computes the Sensor Position
2.7. Evaluate Object Function for each sensor
2.8. While (Max Iteration)
Figure 5. The quasi code of the hybrid algorithm
In hybrid algorithm the most optimized points for n sensors are searched according to PSO
algorithm for covering p aimed points. Searching takes place based on the particles which are
near the goal and are able to cover the around suitably and then the mutation and crossover
operations on n sensor take place using DE algorithm. One of the most important goals of
mutation operation and crossover is finding more optimized points for the sensors. The hybrid
algorithm acts for increasing the lifetime of the network and reducing the energy use and covering
all points in an optimized manner. The particles in PSO algorithm is affected by the situation in
the neighbor. In hybrid model any particle has a two dimensional vector of x and y coordinates
which is in relation to the neighbor particles. In hybrid model any particle is longing for following
the best point in its neighborhood. In Figure (6) the position vector of the sensors is shown using
the PSO algorithm.
Figure 6. The position vector of the sensors
One of the most important parts in the hybrid algorithm is the evaluation of goal function. In goal
function evaluation the most important parameter is the overlap rate of the sensing radius of the
sensors. The sensing radius of the sensors must be set in a manner to create the best coverage. For
sensing radius coverage of two sensors in p1 and p2 the equation (9) is used. Equation (9) is
updated in each repetition using PSO algorithm and the most optimized points are found
according to the global knowledge.
d ( s1 , s2 ) = ( xp1 − xp2 ) 2 + ( yp1 − yp2 ) 2
(9)
In equation (9), if the sensors are located in non-optimized points, the position of the particles is
updated in hybrid algorithm and the most optimized points are found for the sensors. And the
69
10. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
sensors coverage is repeated till the optimized suitability is achieved. To calculate the energy use
of the sensors in this paper the [40] model is used. In this model the value of used energy for
receiving k bits of information is introduced by equation (10).
Rx = ε elec × k
(10)
The energy used for sending one message from a sensor to another sensor located in distance d, is
introduced by equation (11).
Tx = ε elec × k + ε amp × d 2 × k
In equations (10) and (11) the value of ε elec and ε amp are 50nJ
and 100 pJ
(11)
respectively.
bit
bit × m2
In Figure (7), simulation of area coverage problem in WSNs using the hybrid of the PSO and DE
algorithms in C#.NET 2008 programming environment is shown.
Figure 7. Simulation of area coverage problem in C#.NET 2008
5. EVALUATION AND RESULTS
In this section the coverage problem in WSNs which is introduced as one of the quality factors is
studied using the hybrid algorithm of PSO and DE. And also the sensing radius problem in
sensing coverage of the sensors and the lifetime of the sensors are studied. Simulation has taken
place in a 450*450 meter place. In hybrid algorithm there are many parameters which affect the
operation of the algorithm. In Table (1), P parameter is the number of the population (particles).
Parameter W is the inertia weight to balance the speed of the particles and the value of the C1 and
C2 parameters contributes the particles’ learning in finding the optimized points. Parameter F is a
constant positive and real number which is used for convergence rate of mutation. Pm parameter is
the rate of mutation, and parameter Pc is the crossover rate. Also the initial population in PSO and
hybrid algorithm is considered 1000.
70
11. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
Table 1. The value of the parameters
Parameters
P
C1
C2
W
F
Pm
Pc
Value
100
1.5
1.5
0.4
0.5
10
0.3
5.1. The Effect of the Number of the Sensors on the Lifetime of the Network
In this section the effect of the number of the sensors on the lifetime of the network is studied.
The radius area of any sensor is considered as 40. Figure (8) shows the effect of the number of the
sensors on the lifetime of the network is studied. As it is clear from Figure (8), the lifetime of the
network in hybrid algorithm linearly increases by the size of the networks.
Figure 8. Evaluation of lifetime of the network
5.2. The Effect the Sensing Radius of the Sensors on the Lifetime of the Network
In this section the effects of the sensing radius area of the sensors on the lifetime of the network
are evaluated. 50 sensors are considered for the results of the simulation. As it could be seen in
Figure (9), the hybrid algorithm is more efficient on the lifetime of the network. Because the
hybrid algorithm sets the radius of any sensor better and causes less energy waste in the coverage
area.
71
12. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
Figure 9. The effects of the sensing radius area of the sensors
If the distance of two sensors is high, more energy is used for the information transfer between
them. So, as it can be seen, the more sensors cover each other, the less the distance between the
two sensors and finally the less the used energy. The results of the simulations show that the
hybrid algorithm acts better than the PSO algorithm from convergence speed and reaching the
optimized answer points of view. The hybrid algorithm uses the mutation and crossover
parameters for better coverage for the sensors.
5.3. The Comparison of the Sensor Coverage Percent
Figure (10) shows the coverage percent comparison of the hybrid and PSO algorithms. As can be
seen in Figure (10), as the hybrid algorithm is more able to set the sensing area of the sensors, it
covers more efficient.
Figure 10. The comparison of the efficiency of the coverage in hybrid algorithm and PSO
6. CONCLUSION AND FUTURE WORKS
Coverage problem is one of the most important research fields of WSNs. Creating the optimized
coverage in WSNs it is possible to increase the lifetime of the network. In this paper we have
used a hybrid of the PSO and DE algorithms for area coverage in WSNs and to increase the
lifetime of the network. For this reason in hybrid algorithm the two factors of suitable distribution
of the sensors and the energy decrease which lead to increasing the lifetime of the network use are
considered. And to show the efficiency of the hybrid algorithm better, it is compared to PSO
72
13. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
algorithm and according to the results of the simulations, it can be said that the hybrid algorithm
is better. By this paper we hope that we will be able to find better solutions and more optimized
answers using other meta-heuristic algorithms for WSNs coverage problem.
REFERENCES
[1] I.F. Akyildiz, W. Su, Y. Sankarasubrmaniam, E. Cayirci, “A Survey on Sensor Networks”, IEEE
Communication Magazine, Vol. 40, Issue 8, pp. 102-114, IEEE, Aug 2002.
[2] M. Cardei, D. MacCallum, X. Cheng, M. Min, X. Jia, D. Li, D.Z. Du, “Wireless Sensor Networks with
Energy Efficient Organization,” Journal of Interconnection Networks, Vol. 3, pp. 213-229, March
2000.
[3] J. Yick, B. Mukherjee, D. Ghosal, “Wireless Sensor Network Survey,” Computer Networks, Vol. 52,
No. 12, pp. 2292-2330, 2008.
[4] C. Zhu, C. Zheng, L. Shu, G. Han, “A Survey on Coverage and Connectivity Issues in Wireless Sensor
Networks”, Journal of Network and Computer Applications, Vol. 35, Issue 2, pp. 619-632, Elsevier,
2012.
[5] E. Jain, Q. Liang, “Sensor Placement and Lifetime of Wireless Sensor Networks: Theory and
Performance Analysis”, In Proceedings of the IEEE Global Telecommunications Conference
(GLOBECOM ’05), USA, Vol. 1, pp. 173-177, IEEE, December 2005.
[6] Z. Liu, “Maximizing Network Lifetime for Target Coverage Problem in Heterogeneous Wireless
Sensor Networks”, In Proceedings of the 3rd International Conference on Mobile Ad-Hoc and Sensor
Networks (MSN ’07), pp. 457-468, Beijing, China, December 2007.
[7] X.Q. Wang, S.Q. Zhang, “Research on Efficient Coverage Problem of Node in Wireless Sensor
Networks”, International Conference on Mechatronics and Automation (ICIMA), Chengdu, pp. 9-13,
IEEE, 2009.
[8] X. Wang, F. Sun, X. Kong, “Research on Optimal Coverage Problem of Wireless Sensor Networks”,
International Conference on Communications and Mobile Computing, Yunnan, Vol. 1, pp. 548- 551,
IEEE, 2009.
[9] Z. Zhou, Z. Huang, Q. Liu, Y. Zhou, “A Study on the Coverage Problem in Wireless Sensor Network”,
International Conference on Wireless, Mobile and Multimedia Networks, Hangzhou, China, pp. 1-3,
IEEE, 2006.
[10] S. Slijepcevic, M. Potkonjak, “Power Efficient Organization of Wireless Sensor Networks”,
International Conference on Communications, Helsinki, Vol. 2, pp. 472-476, IEEE, 2001.
[11] H. Tan, X. Hao, Y. Wang, F. C.M. Lau, Y. Lv, “An Approximate Approach for Area Coverage in
Wireless Sensor Networks”, Procedia Computer Science, Vol. 19, pp. 240-247, Elsevier, 2013.
[12] C.F. Huang, Y.C. Tseng, “The Coverage Problem in Wireless Sensor Networks”, In International
Workshop on Wireless Sensor Networks and Applications, San Diego, California, USA, pp. 115-121,
2003.
[13] C.F. Huang, Y.C. Tseng, H.L. Wu, “Distributed Protocols for Ensuring both Coverage and
Connectivity of a Wireless Sensor Network”, In ACM Transaction on Sensor Networks, Vol. 3, No. 5,
March 2007.
[14] Kh.M. Alam, J. Kamruzzaman, G. Karmakar, M. Murshed, A.K.M. Azad, “QoS Support in Event
Detection in WSN through Optimal k-Coverage”, Procedia Computer Science, Vol. 4, pp. 499-507,
Elsevier, 2011.
[15] J. Yu, X. Deng, D. Yu, G. Wang, X. Gu, “CWSC: Connected K-coverage Working Sets Construction
Algorithm in Wireless Sensor Networks”, International Journal of Electronics and Communications,
Vol. 67, Issue 11, pp. 937-946, Elsevier, 2013.
[16] M. Cardei, M.T. Thai, Y. Li, W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor
Networks”, 24th Annual Joint Conference of the IEEE Computer and Communications Societies,
IEEE, Vol. 3, pp. 1976-1984, 2005.
[17] S. Yang, F. Dai, M. Cardei, J. Wu, F. Patterson, “On Connected Multiple Point Coverage in Wireless
Sensor Networks”, International Journal of Wireless Information Networks, Vol. 13, No. 4, pp. 289301, October 2006.
[18] A. Chen, S. Kumar, T.H. Lai, “Local Barrier Coverage in Wireless Sensor Networks”, IEEE
Transactions on Mobile Computing, Vol. 9, Issue 4, pp. 491-504, 2010.
[19] S. Kumar, T.H. Lai, A. Arora, “Barrier Coverage with Wireless Sensors”, Proceedings ACM
MobiCom, Cologne, Germany, 2005.
73
14. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
[20] B. Liu, O. Dousse, J. Wang, A. Saipulla, “Strong Barrier Coverage of Wireless Sensor Networks”,
Proceedings ACM MobiHoc, Hong Kong SAR, China, 2008.
[21] F.S. Gharehchopogh, I. Maleki, S.R. Khaze, “A New Optimization Method for Dynamic Travelling
Salesman Problem with Hybrid Ant Colony Optimization Algorithm and Particle Swarm
Optimization”, International Journal of Advanced Research in Computer Engineering & Technology
(IJARCET), Vol. 2, Issue 2, pp. 352-358, February 2013.
[22] F.S. Gharehchopogh, I. Maleki, B. Zebardast, “A New Solutions for Continuous Optimization
Functions by using Bacterial Foraging Optimization and Particle Swarm Optimization Algorithms”,
Elixir International Journal Computer Science and Engineering (Elixir Comp. Sci. & Engg.), Vol. 61,
pp. 16655-16661, July 2013.
[23] D.K. Chaudhary, R.L. Dua, “Application of Multi objective Particle Swarm Optimization to Maximize
Coverage and Lifetime of wireless Sensor Network”, International Journal Of Computational
Engineering Research, Vol. 2, Issue 5, pp. 1628-1633, 2012.
[24] S.E. Nezhad, H.J. Kamali, M.E. Moghaddam, “Solving K-Coverage Problem in Wireless Sensor
Networks Using Improved Harmony Search”, International Conference Broadband, on Wireless
Computing, Communication and Applications (BWCCA), Fukuoka, pp. 49-55,IEEE, 2010.
[25] A. Dhawan, S.K. Prasad, “A Distributed Algorithmic Framework for Coverage Problems in Wireless
Sensor Networks”, International Symposium on Parallel and Distributed Processing (IPDPS), Miami,
FL, pp. 1-8, IEEE, 2008.
[26] G. Fan, F. Liang, S. Jin, “An Efficient Approach for Point Coverage Problem of Sensor Network”,
International Symposium on Electronic Commerce and Security, Guangzhou City, pp. 124-128, IEEE,
2008.
[27] Z. Bin, M. Jianlin, L. Haiping, “A Hybrid Algorithm for Sensing Coverage Problem in Wireless
Sensor Networks”, International Conference on Cyber Technology in Automation, Control, and
Intelligent Systems (CYBER), Kunming, pp. 162-165, IEEE, 2011.
[28] M. Cardei, M. Thai, Y. Li, W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor Networks”,
In Proceedings of the 24th Annual Joint Conference IEEE Computer and Communication Society
(INFOCOM), Miami, USA, Vol. 3, pp. 1976-1984, IEEE, March 2005.
[29] H. Tan, Y. Wang, X. Hao, Q. S. Hua, F. Lau, “Arbitrary Obstacles Constrained Full Coverage in
Wireless Sensor Networks”, In: WASA, Vol. 6221, pp. 1-10, 2010.
[30] F.P. Quintao, F.G. Nakamura, G.R. Mateus, “Evolutionary Algorithm for the Dynamic Coverage
Problem Applied to Wireless Sensor Networks Design”, Congress on Evolutionary Computation, Vol.
2, pp. 1589-1596, IEEE, 2005.
[31] W.H. Liao, Y. Kao, R.T. Wu, “Ant Colony Optimization based Sensor Deployment Protocol for
Wireless Sensor Networks”, Expert Systems with Applications, Vol. 38, pp. 6599-6605, Elsevier Ltd,
2010.
[32] M.A. Jamali, N. Bakhshivand, M. Easmaeilpour, D. Salami, “An Energy-Efficient Algorithm for
Connected Target Coverage Problem in Wireless Sensor Networks”, 3rd International Conference on
Computer Science and Information Technology (ICCSIT), Chengdu, Vol. 9, pp. 249-254, IEEE, 2010.
[33] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, C. Gill, “Integrated Coverage and Connectivity
Configuration in Wireless Sensor Networks”, In Proceedings of the 1st international Conference on
Embedded Networked Sensor Systems, Los Angeles, California, USA, pp.28-39, 2003.
[34] B. Liu, D. Towsley, “A Study on the Coverage of Large-Scale Sensor Networks”, In The 1st IEEE
International Conference on Mobile Ad-hoc and Sensor Systems, 2004.
[35] J. Kennedy, R.C. Eberhart, “Particle Swarm Optimization”, In Proceedings of the IEEE International
Conference on Neural Networks, pp. 1942-1948, 1995.
[36] Y. Shi, R.C. Eberhart, “A Modified Particle Swarm Optimizer”, In Proceedings of the IEEE
International Conference on Evolutionary Computation, pp. 69-73, Anchorage, AK, 1998.
[37] Y. Shi, R.C. Eberhart, “Parameter Selection in Particle Swarm Optimization”, In Proceedings of the
5rd Evolutionary Computation (EP98), Springer-Verlag, pp. 591-600, San Diego, California, USA,
1998.
[38] R. Storn, K. Price, “Minimizing the Real Functions of the ICEC’96 Contest by Differential Evolution”,
International Conference on Evolutionary Computation, Nagoya, Japan, 1995.
[39] J. Holland, “Adaptation in Natural and Artificial Systems”, University of Michigan, Michigan, USA,
1975.
[40] W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, “Energy-Efficient Communication Protocols
for Wireless Microsensor Networks”, In Proceedings of the 33rd Hawaii International Conference on
System Sciences, pp. 1-10, IEEE, 2000.
74
15. International Journal of Mobile Network Communications & Telematics ( IJMNCT) Vol. 3, No.6, December 2013
Authors
Isa Maleki is a Lecturer and Member of The Research Committee of The Department of
Computer Engineering, Dehdasht Branch, Islamic Azad University, Dehdasht, Iran. He Also
Has Research Collaboration with Dehdasht Universities Research Association NGO. He is a
Member of Review Board in Several National Conferences. His Interested Research Areas Are
in the Software Cost Estimation, Machine Learning, Data Mining, Optimization and Artificial
Intelligence.
Seyyed Reza Khaze is a Lecturer and Member of the Research Committee of the Department
of Computer Engineering, Dehdasht Branch, Islamic Azad University, Dehdasht, Iran. He is a
Member of Editorial Board and Review Board in Several International Journals and National
Conferences. His Interested Research Areas Are in the Software Cost Estimation, Machine
Learning, Data Mining, Optimization and Artificial Intelligence.
Marjan Mahmoodi Tabrizi is a M.Sc. Student in Department of Computer Engineering,
Science and Research Branch, Islamic Azad University, West Azerbaijan, Iran. Her Interested
Research Areas Are in the Wireless Sensor Networks, Data Mining, Optimization and
Machine Learning.
Ali Bagherinia is a Lecturer and Member of the Research Committee of the Department of
Computer Engineering, Dehdasht Branch, Islamic Azad University, Dehdasht, Iran. He Has a
Currently Ph.D Candidate In Department Of Computer Engineering At Science And Research
Branch, Islamic Azad University, Iran. His Interested Research Areas Are in the Wireless
Sensor Networks, Data Mining, Optimization and Artificial Intelligence.
75