One of the main design aspects of Wireless Sensor Networks (WSNs) is the deployment strategy of the sensors. In general, WSN deployment methods fall under two categories: planned deployment and random deployment. In this paper, we focus on planned deployment which is defined as selectively deciding the locations of the sensors to optimize one or more design objectives of the WSN under some given constraints. There have been a large number of studies which proposed algorithms for solving the planned deployment problem. In this paper, we present a novel classification of the algorithms proposed in the literature for planned deployment of WSNs, based on the mathematical approach used for modeling and solving the deployment problem. Four distinct mathematical approaches are presented: Genetic Algorithms, Computational Geometry, Artificial Potential Fields and Particle Swarm Optimization. For each approach, we provide a discussion of its background and basic mathematical foundation. We then review the algorithms which belong to each approach and provide a comparison between them in terms of their objectives, assumptions and performance. Based on our extensive survey, we discuss the strengths and limitations of the four approaches and compare them in terms of the different WSN design factors.

Classification of Wireless Sensor Networks Deployment Techniques

Wireless sensor networks (WSNs) have gained wide attention from researchers in the last few years because it has a vital role in countless applications. The main function of WSN is to process extracted data and to transmit it to remote locations. A large number of sensor nodes are deployed in the monitoring area. Therefore, deploying the minimum number of nodes that maintain full coverage and connectivity is of immense importance for research. Hence, coverage and connectivity issues, besides maximizing the network lifetime, represented the main concern to be considered in this paper. The key point of this paper is to classify different coverage techniques in WSNs into three main parts: coverage based on classical deployment techniques, coverage based on meta-heuristic techniques, and coverage based on self-scheduling techniques. Moreover, multiple comparisons among these techniques are provided considering their advantages and disadvantages. Additionally, performance metrics that must be considered in WSNs and comparison among different WSNs simulators are provided. Finally, open research issues, as well as recommendations for researchers, are discussed.

/pdf/deployment-techniques-in-wireless-sensor-networks-coverage-33sqyeldy1.pdf

Deployment Techniques in Wireless Sensor Networks, Coverage and Connectivity: A Survey

Wireless sensor networks (WSNs) have been considered as one of the fine research areas in recent years because of vital role in numerous applications. To process the extracted data and transmit it to the various location, a large number of nodes must be deployed in a proper way because deployment is one of the major issues in WSNs. Hence, the minimum number of node deployment to attain full coverage is of enormous significance for research. The prime agenda of the presented paper is to categorize various coverage techniques into four major parts: computational geometry-based techniques, force-based techniques, grid-based techniques, and metaheuristic-based techniques. Additionally, several comparisons amid these schemes are provided in view of their benefits and drawbacks. Our discussion weighs on the classification of coverage, practical challenges in the deployment of WSNs, sensing models, and research issues in WSNs. Moreover, a detailed analysis of performance metrics and comparison among various WSNs simulators is listed. In conclusion, standing research issues along with potential work guidelines are discussed.

Deployment techniques in wireless sensor networks: a survey, classification, challenges, and future research issues

Wireless sensor network (WSN) is one of the interesting issues in the information technology domain. It is used in various fields such as medicine, agriculture, meteorology, etc. that eases lots of difficult tasks to do but have some challenges too. Deployment is the greatest challenge in WSN that affects other features like coverage, connectivity, energy efficient and lifetime. Despite the importance of the deployment problem in WSN, to the best of our knowledge, there isn't any systematic literature review to give us systematical analyses the state-of-the mechanisms in this field. Therefore, this study reviewed the deployment mechanisms which have been used in WSN systematically. The deployment mechanisms can be classified into two main categories: deterministic and nondeterministic. Also, this study represents a comparison of the important techniques of the selected articles in each category to offer a guideline for further studies and new challenges. We also have noted some open issues for future research.

Deployment Strategies in the Wireless Sensor Networks: Systematic Literature Review, Classification, and Current Trends

Efficient deployment algorithms are developed in this paper to increase the coverage area in a network of wireless mobile sensors. The proposed strategies iteratively compute the new candidate position of each sensor based on the existing coverage holes. These holes are obtained using a Voronoi diagram for the case of sensors with the same sensing ranges, and a multiplicatively weighted Voronoi (MW-Voronoi) diagram for the case of sensors with different sensing ranges. Each sensor is driven by some virtual forces which are applied to it from the vertices and boundaries of its Voronoi cell. These forces are obtained in such a way that when the sensor is relocated, the covered area of the corresponding cell increases. Simulation results demonstrate the efficacy of the proposed strategies, and their superiority to existing algorithms.

Distributed Deployment Algorithms for Coverage Improvement in a Network of Wireless Mobile Sensors: Relocation by Virtual Force

The effectiveness of wireless sensor networks (WSN) depends on the coverage and connectivity provided by node deployment, which is one of the key topics in WSN. In this paper, a modified virtual force-based node self-deployment algorithm for nodes with mobility is proposed. In the virtual force-based approach, all nodes are seen as points subject to repulsive and attractive force exerted among them, nodes can move according to the calculated force. In the proposed approach, Delaunay triangulation is formed with these nodes, adjacent relationship is defined if two nodes are connected in the Delaunay diagram. Force can only be exerted from those adjacent nodes within the communication range. Simulation results showed that the proposed approach has higher coverage rate and faster convergence time than traditional virtual force algorithm.

A Novel Virtual Force Approach for Node Deployment in Wireless Sensor Network

In wireless sensor networks (WSN), sensor deployment is one of the main topics for enhancing the sensor’s coverage rate. In this paper, by modifying updating equation of onlooker bee and scout bee of original artificial bee colony (ABC) algorithm, a sensor deployment algorithm based on the modified ABC algorithm is proposed. Some new parameters such as forgetting and neighbor factor for accelerating the convergence speed and probability of mutant for maximizing the coverage rate are introduced. Simulation results showed that comparing with the deployment method based on original ABC and particle swarm optimization (PSO) algorithm, the proposed approach can achieve a better performance in coverage rate and convergence speed while needing a less total moving distance of sensors.

https://journals.sagepub.com/doi/pdf/10.1155/2013/497264

A Faster Convergence Artificial Bee Colony Algorithm in Sensor Deployment for Wireless Sensor Networks

The effectiveness of wireless sensor networks (WSN) depends on the regional coverage provided by node deployment, which is one of the key topics in WSN. Virtual force-based algorithms (VFA) are popular approaches for this problem. In VFA, all nodes are seen as points subject to repulsive and attractive force exerted among them and can move according to the calculated force. In this paper, a sensor deployment algorithm for mobile WSN based on van der Waals force is proposed. Friction force is introduced into the equation of force, the relationship of adjacency of nodes is defined by Delaunay triangulation, and the force calculated produce acceleration for nodes to move. An evaluation metric called pair correlation function is introduced here to evaluate the uniformity of the node distribution. Simulation results and comparisons have showed that the proposed approach has higher coverage rate, more uniformity in configuration, and moderate convergence time compared to some other virtual force algorithms.

/pdf/a-node-deployment-algorithm-based-on-van-der-waals-force-in-31a11fbcce.pdf

A Node Deployment Algorithm Based on Van Der Waals Force in Wireless Sensor Networks

Robotic sensor deployment is fundamental for the effec‐ tiveness of wireless robot sensor networks-a good deploy‐ ment algorithm leads to good coverage and connectivity with low energy consumption for the whole network. Virtual force-based algorithms (VFAs) is one of the most popular approaches to this problem. In VFA, sensors are treated as points subject to repulsive and attractive forces exerted among them-sensors can move according to imaginary force generated in algorithms. In this paper, a virtual spring force-based algorithm with proper damping is proposed for the deployment of sensor nodes in a wireless sensor network (WSN). A new metric called Pair Correlation Diversion (PCD) is introduced to evaluate the uniformity of the sensor distribution. Numerical simula‐ tions showed that damping can affect the network cover‐ age, energy consumption, convergence time and general topology in the deployment. Moreover, it was found that damping effect (imaginary friction force) has significant influence on algortithm outcomes. In addition, when working under approximate critical-damping condition, the proposed approach has the advantage of a higher coverage rate, better configurational uniformity and less energy consumption.

https://journals.sagepub.com/doi/pdf/10.5772/58427

A Deployment Method Based on Spring Force in Wireless Robot Sensor Networks

The effectiveness of wireless sensor networks(WSN) depends on the coverage and connectivity provided by node deployment, which is one of the key topics in WSN. In this paper, a virtual force-based self-deployment algorithm for nodes with mobility using a force model similar to van der Waals force is proposed. In the proposed approach, all nodes are seen as points subject to repulsive and attractive force exerted among them, nodes can move according to the calculated force. Simulation results and comparisons have showed that the proposed approach has higher coverage rate, faster convergence time and less energy consuming than traditional virtual force algorithm.

Xiangyu Yu

Papers

A Novel Virtual Force Approach for Node Deployment in Wireless Sensor Network

A Faster Convergence Artificial Bee Colony Algorithm in Sensor Deployment for Wireless Sensor Networks

A Node Deployment Algorithm Based on Van Der Waals Force in Wireless Sensor Networks

A Deployment Method Based on Spring Force in Wireless Robot Sensor Networks

A Van der Waals Force-Like Node Deployment Algorithm for Wireless Sensor Network