Wireless Sensor Networks-Node Localization for Various Industry Problems

Fast and effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Electrically powered systems in industrial settings require monitoring of emitted electromagnetic fields to determine the status of the equipment and ensure the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial informatics 2015-06, Vol.11 (3), p.752-762
Main Authors: Derr, Kurt, Manic, Milos
Format: Article
Language:English
Subjects:
Delaunay triangulation
ENGINEERING
Mesh generation
mesh network
Monitoring
Robot sensing systems
sensor node
Sociology
Statistics
topology
Wireless sensor network
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fast and effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Electrically powered systems in industrial settings require monitoring of emitted electromagnetic fields to determine the status of the equipment and ensure their safe operation. In situations such as these, wireless sensor nodes (WSNs) at fixed predetermined locations provide monitoring to ensure safety. A challenging algorithmic problem is determining the locations to place these WSNs while meeting several criteria: (1) to provide complete coverage of the domain; (2) to create a topology with problem-dependent node densities; and (3) to minimize the number of WSNs. This paper presents a novel approach, advancing front mesh generation with constrained Delaunay triangulation and smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine WSN locations for areas of high interest (hospitals, schools, and high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm provides significant reduction in the number of nodes, in some cases over 40%, compared with an advancing front mesh generation algorithm; maintains and improves optimal spacing between nodes; and produces simulation run times suitable for real-time applications.
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2015.2396007