scholarly journals Solving sensor network coverage problems by distributed asynchronous actor-critic methods

2007 ◽  
Author(s):  
Paris Pennesi ◽  
Ioannis Ch. Paschalidis
Keyword(s):  
Sensor Network ◽  
Network Coverage ◽  
Coverage Problems

A simplified framework for prediction of sensor network coverage in real-time structural health monitoring of plate-like structures

2021 ◽  
pp. 147592172110332
Author(s):  
Mehrdad Ghyabi ◽  
Hamidreza Nemati ◽  
Ehsan Dehghan-Niri
Keyword(s):  
Finite Element ◽  
Sensor Network ◽  
Health Monitoring ◽  
Surface Crack ◽  
Piezoelectric Sensor ◽  
Network Coverage ◽  
Coverage Area ◽  
Fem Simulations ◽  
Network Geometry ◽  
Critical Defect

In this article, the coverage area prediction of piezoelectric sensor network for detecting a specific type of under-surface crack in plate-like structures is addressed. In particular, this article proposes a simplified framework to estimate the coverage of any given sensor network arrangement when a critical defect is known. Based on numerical results from finite element methods (FEM), a simplified framework to estimate coverage area of any given network arrangement is developed. Using such a simplified framework, one can avoid time-consuming procedure of evaluating numerous FEM models in estimating sensor network coverage. Back-scatter fields of partial cracks are estimated using a proposed function, whose parameters are estimated from the results of a limited number of FEM simulations. The proposed function efficiently predicts the back-scattered field of any combination of transmitters and receivers for a given crack geometry. Superposition is used to estimate the coverage area of an arbitrary piezoelectric (e.g., PZT) sensor network. It is shown that the coverage area of a sensor network depends on both sensor network geometry and defect properties (e.g., crack inclination) and it is not necessarily a linear function of the number of sensors. Furthermore, it is shown that the network arrangement has an important effect on the geometry of the coverage area. Experimental results of a network of 14 PZTs in two clusters confirm the accuracy of the method.

scholarly journals Enhancing Network Coverage Using Sensing Models in Wireless Sensor Network

2021 ◽  
Vol 1717 ◽  
pp. 012062
Author(s):  
J Vidhya ◽  
P Prasanna ◽  
M Margarat ◽  
S Jayalakshmy
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Network Coverage

scholarly journals Node optimization coverage method under link model in passive monitoring system of three-dimensional wireless sensor network

2019 ◽  
Vol 15 (8) ◽  
pp. 155014771986987 ◽  
Author(s):  
Zhanjun Hao ◽  
Nanjiang Qu ◽  
Xiaochao Dang ◽  
Jiaojiao Hou
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Particle Swarm Optimization Algorithm ◽  
Three Dimensional ◽  
Wireless Sensor ◽  
Network Coverage ◽  
Swarm Optimization ◽  
Passive Monitoring ◽  
Link Model

3D coverage is not only closer to the actual application environment, but also a research hotspot of sensor networks in recent years. For this reason, a node optimization coverage method under link model in passive monitoring system of three-dimensional wireless sensor network is proposed in this article. According to wireless link-aware area, the link coverage model in three-dimensional wireless sensor network is constructed, and the cube-based network coverage is used to represent the quality of service of the network. This model takes advantage of the principle that the presence of human beings can change the transmission channel of the link. On this basis, the intruder is detected by the data packets transmitted between the wireless links, and then the coverage area is monitored by monitoring the received signal strength of the wireless signal. Based on this new link awareness model, the problem of optimal coverage deployment of the receiving node is solved, that is, how to deploy the receiving node to achieve the optimal coverage of the monitoring area when the location of the sending node is given. In the process of optimal coverage, the traditional genetic algorithm and particle swarm optimization algorithm are introduced and improved. Based on the genetic algorithm, the particle swarm optimization algorithm which integrates the idea of simulated annealing is regarded as an important operator of the genetic algorithm, which can converge to the optimal solution quickly. The simulation results show that the proposed method can improve the network coverage, converge quickly, and reduce the network energy consumption. In addition, we set up a real experimental environment for coverage verification, and the experimental results verify the feasibility of the proposed method.

Decentralized control for mobile robotic sensor network self-deployment: barrier and sweep coverage problems

Robotica ◽  
2010 ◽  
Vol 29 (2) ◽  
pp. 283-294 ◽  
Author(s):  
Teddy M. Cheng ◽  
Andrey V. Savkin
Keyword(s):  
Sensor Network ◽  
Decentralized Control ◽  
Nearest Neighbor ◽  
Barrier Coverage ◽  
Control Law ◽  
Motion Coordination ◽  
Robotic Sensor ◽  
Information Consensus ◽  
Coverage Problems ◽  
Robotic Sensors

SUMMARYThis paper addresses the problems of barrier coverage and sweep coverage in a corridor environment with a network of self-deployed mobile autonomous robotic sensors. Using the ideas of nearest neighbor rules and information consensus, we propose a decentralized control law for the robotic sensors to solve the coverage problems. Numerical simulations illustrate the effectiveness of the proposed algorithm. The results in this paper demonstrate that such simple motion coordination rules can play a significant role in addressing the issue of coverage in a mobile robotic sensor network.

Sign in / Sign up

Export Citation Format

Share Document