Wireless Sensor Networks - Node Localization for Various Industry Problems
Abstract
Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, 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 wireless sensor node locations for areas of high interest (hospitals, schools, 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 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3)more »
- Authors:
-
- Idaho National Lab. (INL), Idaho Falls, ID (United States)
- Publication Date:
- Research Org.:
- Idaho National Lab. (INL), Idaho Falls, ID (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1178056
- Report Number(s):
- INL/JOU-14-31516
Journal ID: ISSN 1551-3203; TRN: US1500500
- Grant/Contract Number:
- AC07-05ID14517
- Resource Type:
- Journal Article: Accepted Manuscript
- Journal Name:
- IEEE Transactions on Industrial Informatics
- Additional Journal Information:
- Journal Volume: 11; Journal Issue: 3; Journal ID: ISSN 1551-3203
- Publisher:
- IEEE
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 42 ENGINEERING; Delaunay triangulation; mesh generation; mesh network; sensor node; topology; Wireless sensor network
Citation Formats
Derr, Kurt, and Manic, Milos. Wireless Sensor Networks - Node Localization for Various Industry Problems. United States: N. p., 2015.
Web. doi:10.1109/TII.2015.2396007.
Derr, Kurt, & Manic, Milos. Wireless Sensor Networks - Node Localization for Various Industry Problems. United States. https://doi.org/10.1109/TII.2015.2396007
Derr, Kurt, and Manic, Milos. 2015.
"Wireless Sensor Networks - Node Localization for Various Industry Problems". United States. https://doi.org/10.1109/TII.2015.2396007. https://www.osti.gov/servlets/purl/1178056.
@article{osti_1178056,
title = {Wireless Sensor Networks - Node Localization for Various Industry Problems},
author = {Derr, Kurt and Manic, Milos},
abstractNote = {Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, 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 wireless sensor node locations for areas of high interest (hospitals, schools, 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 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.},
doi = {10.1109/TII.2015.2396007},
url = {https://www.osti.gov/biblio/1178056},
journal = {IEEE Transactions on Industrial Informatics},
issn = {1551-3203},
number = 3,
volume = 11,
place = {United States},
year = {Mon Jun 01 00:00:00 EDT 2015},
month = {Mon Jun 01 00:00:00 EDT 2015}
}
Web of Science
Works referencing / citing this record:
Localization of Sensor Nodes in WSN Using Area Between a Node and Two Beacons
book, December 2019
- Gautam, Prateek Raj; Kumar, Sunil; Verma, Akshay
- Lecture Notes in Electrical Engineering
Research on wireless coverage area detection technology for 5G mobile communication networks
journal, December 2017
- Wang, Hongjun; Zhou, Yu; Sha, Wenhao
- International Journal of Distributed Sensor Networks, Vol. 13, Issue 12
An INS-UWB Based Collision Avoidance System for AGV
journal, February 2019
- Sun, Shunkai; Hu, Jianping; Li, Jie
- Algorithms, Vol. 12, Issue 2
Moth Flame Optimization Algorithm Range-Based for Node Localization Challenge in Decentralized Wireless Sensor Network
journal, January 2019
- Miloud, Mihoubi; Abdellatif, Rahmoun; Lorenz, Pascal
- International Journal of Distributed Systems and Technologies, Vol. 10, Issue 1