Movement-Efficient Sensor Deployment in Wireless Sensor Networks With Limited Communication Range.

We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Three key factors in MWSNs, sensing quality, energy consumption, and connectivity, have attracted plenty of attention, but the interaction of these factors is not well studied. To take all the three factors into consideration, we model the sensor deployment problem as a constrained source coding problem. %, which can be applied to different coverage tasks, such as area coverage, target coverage, and barrier coverage. Our goal is to find an optimal sensor deployment (or relocation) to optimize the sensing quality with a limited communication range and a specific network lifetime constraint. We derive necessary conditions for the optimal sensor deployment in both homogeneous and heterogeneous MWSNs. According to our derivation, some sensors are idle in the optimal deployment of heterogeneous MWSNs. Using these necessary conditions, we design both centralized and distributed algorithms to provide a flexible and explicit trade-off between sensing uncertainty and network lifetime. The proposed algorithms are successfully extended to more applications, such as area coverage and target coverage, via properly selected density functions. Simulation results show that our algorithms outperform the existing relocation algorithms

Movement-efficient Sensor Deployment in Wireless Sensor Networks

We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Two key issues in MWSNs - energy consumption, which is dominated by sensor movement, and sensing coverage - have attracted plenty of attention, but the interaction of these issues is not well studied. To take both sensing coverage and movement energy consumption into consideration, we model the sensor deployment problem as a constrained source coding problem. %, which can be applied to different coverage tasks, such as area coverage, target coverage, and barrier coverage. Our goal is to find an optimal sensor deployment to maximize the sensing coverage with specific energy constraints. We derive necessary conditions to the optimal sensor deployment with (i) total energy constraint and (ii) network lifetime constraint. Using these necessary conditions, we design Lloyd-like algorithms to provide a trade-off between sensing coverage and energy consumption. Simulation results show that our algorithms outperform the existing relocation algorithms.Comment: 18 pages, 10 figure

Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network

Node placement is one of the fundamental issues that affects the performance of coverage and connectivity in Wireless Sensor Network (WSN). In a large scale WSN, sensor nodes are deployed randomly where they are scattered too close or far apart from each other. This random deployment causes issues such as coverage hole, overlapping and connectivity failure that contributes to the performance of coverage and connectivity of WSN. Therefore, node placement model is develop to find the optimal node placement in order to maintain the coverage and guaranteed the connectivity in random deployment. The performance of Extended Virtual Force-Based Algorithm (EVFA) and Cuckoo Search (CS) algorithm are evaluated and EVFA shows the improvement of coverage area and exhibits a guaranteed connectivity compared to CS algorithm. Both algorithms have their own strength in improving the coverage performance. The EVFA approach can relocate the sensor nodes using a repulsive and attractive force after initial deployment and CS algorithm is more efficient in exploring the search of maximum coverage area in random deployment. This study proposed Extended Virtual Force and Cuckoo Search (EVFCS) algorithm with a combination of EVFA and CS algorithm to find an optimal node placement. A series of experimental studies on evaluation of proposed algorithm were conducted within simulated environment. In EVFCS, the algorithm searches the best value of threshold distance and relocated the new position of sensor nodes. The result suggested 18.212m is the best threshold distance that maximizes the coverage area. It also minimizes the problems of coverage hole and overlapping while guaranteeing a reasonable connectivity quality. It proved that the proposed EVFCS outperforms the EVFA approach and achieved a significant improvement in coverage area and guaranteed connectivity. The implementation of the EVFCS improved the problems of initial random deployment

Resource Optimization in Wireless Sensor Networks for an Improved Field Coverage and Cooperative Target Tracking

There are various challenges that face a wireless sensor network (WSN) that mainly originate from the limited resources a sensor node usually has. A sensor node often relies on a battery as a power supply which, due to its limited capacity, tends to shorten the life-time of the node and the network as a whole. Other challenges arise from the limited capabilities of the sensors/actuators a node is equipped with, leading to complication like a poor coverage of the event, or limited mobility in the environment. This dissertation deals with the coverage problem as well as the limited power and capabilities of a sensor node. In some environments, a controlled deployment of the WSN may not be attainable. In such case, the only viable option would be a random deployment over the region of interest (ROI), leading to a great deal of uncovered areas as well as many cutoff nodes. Three different scenarios are presented, each addressing the coverage problem for a distinct purpose. First, a multi-objective optimization is considered with the purpose of relocating the sensor nodes after the initial random deployment, through maximizing the field coverage while minimizing the cost of mobility. Simulations reveal the improvements in coverage, while maintaining the mobility cost to a minimum. In the second scenario, tracking a mobile target with a high level of accuracy is of interest. The relocation process was based on learning the spatial mobility trends of the targets. Results show the improvement in tracking accuracy in terms of mean square position error. The last scenario involves the use of inverse reinforcement learning (IRL) to predict the destination of a given target. This lay the ground for future exploration of the relocation problem to achieve improved prediction accuracy. Experiments investigated the interaction between prediction accuracy and terrain severity. The other WSN limitation is dealt with by introducing the concept of sparse sensing to schedule the measurements of sensor nodes. A hybrid WSN setup of low and high precision nodes is examined. Simulations showed that the greedy algorithm used for scheduling the nodes, realized a network that is more resilient to individual node failure. Moreover, the use of more affordable nodes stroke a better trade-off between deployment feasibility and precision

The Deployment in the Wireless Sensor Networks: Methodologies, Recent Works and Applications

International audienceThe wireless sensor networks (WSN) is a research area in continuous evolution with a variety of application contexts. Wireless sensor networks pose many optimization problems, particularly because sensors have limited capacity in terms of energy, processing and memory. The deployment of sensor nodes is a critical phase that significantly affects the functioning and performance of the network. Often, the sensors constituting the network cannot be accurately positioned, and are scattered erratically. To compensate the randomness character of their placement, a large number of sensors is typically deployed, which also helps to increase the fault tolerance of the network. In this paper, we are interested in studying the positioning and placement of sensor nodes in a WSN. First, we introduce the problem of deployment and then we present the latest research works about the different proposed methods to solve this problem. Finally, we mention some similar issues related to the deployment and some of its interesting applications

Location prediction optimisation in WSNs using kriging interpolation

© The Institution of Engineering and Technology 2016. Many wireless sensor network (WSN) applications rely on precise location or distance information. Despite the potentials of WSNs, efficient location prediction is one of the subsisting challenges. This study presents novel prediction algorithms based on a Kriging interpolation technique. Given that each sensor is aware of its location only, the aims of this work are to accurately predict the temperature at uncovered areas and estimate positions of heat sources. By taking few measurements within the field of interest and by using Kriging interpolation to iteratively enhance predictions of temperature and location of heat sources in uncovered regions, the degree of accuracy is significantly improved. Following a range of independent Monte Carlo runs in different experiments, it is shown through a comparative analysis that the proposed algorithm delivers approximately 98% prediction accuracy

Self-Organized Hybrid Wireless Sensor Network for Finding Randomly Moving Target in Unknown Environment

Unknown target search, in an unknown environment, is a complex problem in Wireless Sensor Network (WSN). It does not have a linear solution when target’s location and searching space is unknown. For the past few years, many researchers have invented novel techniques for finding a target using either Static Sensor Node (SSN) or Mobile Sensor Node (MSN) in WSN i.e. Hybrid WSN. But there is a lack of research to find a solution using hybrid WSN. In the current research, the problem has been addressed mostly using non-biological techniques. Due to its complexity and having a non-linear solution, Bio-inspired techniques are most suited to solve the problem. This paper proposes a solution for searching of randomly moving target in unknown area using only Mobile sensor nodes and combination of both Static and Mobile sensor nodes. In proposed technique coverage area is determined and compared. To perform the work, novel algorithms like MSNs Movement Prediction Algorithm (MMPA), Leader Selection Algorithm (LSA), Leader’s Movement Prediction Algorithm (LMPA) and follower algorithm are implemented. Simulation results validate the effectiveness of proposed work. Through the result, it is shown that proposed hybrid WSN approach with less number of sensor nodes (combination of Static and Mobile sensor nodes) finds target faster than only MSN approach

Sensor coverage and actors relocation in wireless sensor and actor networks (WSAN) : optimization models and approximation algorithms

"December 2010.""A Thesis presented to the Faculty of the Graduate School at the University of Missouri In Partial Fulfillment of the Requirements for the Degree Master of Science."Thesis supervisor: Dr. Esra Sisikoglu.Wireless Sensors and Actor Networks (WSAN) have a wide variety of applications such as military surveillance, object tracking and habitat monitoring. Sensors are data gathering devices. Selecting the minimum number of sensors for network coverage is crucial to reduce the cost of installation and data processing time. Actors in a WSAN are decision-making units. They need to be communicating with their fellow actors in order to respond to events. Therefore, the need to maintain a connected inter-actor network at all times is critical. In the Actor Relocation Problem (Chapter 2) of this thesis we considered the problem of finding optimal strategies to restore connectivity when inter-actor network fails. We used a mixed integer programming formulation to find the optimal relocation strategies for actors in which the total travel distance is minimized. In our formulation we used powers of the adjacency matrix to generate constraints that ensure connectivity. In the Sensor Coverage Problem (Chapter 3) we developed a mixed integer programming model to find the minimum number of sensors and their locations to cover a given area. We also developed a bi-level algorithm that runs two separate optimization algorithms iteratively to find the location of sensors such that every point in a continuous area is covered.Includes bibliographical references (pages 61-63)