skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

Journal Article · · Sensors
DOI:https://doi.org/10.3390/s17102304· OSTI ID:1628549
ORCiD logo [1];  [2]
  1. New Jersey Institute of Technology, Newark, NJ (United States)
  2. Xi'an International Univ., Shaanxi (China)

Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k-cover a given set of target objects. By exhausting the combinations of discreteness/continuousness constraints on either sensor locations or target objects, we formulate four classes of sensor deployment problems in 3D space: deploy sensors at Discrete/Continuous Locations (D/CL) to cover Discrete/Continuous Targets (D/CT). We begin with the design of an approximate algorithm for DLDT and then reduce DLCT, CLDT, and CLCT to DLDT by discretizing continuous sensor locations or target objects into a set of divisions without sacrificing sensing precision. Furthermore, we consider a connected version of each problem where the deployed sensors must form a connected network, and design an approximation algorithm to minimize the number of deployed sensors with connectivity guarantee. For performance comparison, we design and implement an optimal solution and a genetic algorithm (GA)-based approach. Extensive simulation results show that the proposed deployment algorithms consistently outperform the GA-based heuristic and achieve a close-to-optimal performance in small-scale problem instances and a significantly superior overall performance than the theoretical upper bound.

Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
USDOE; National Science Foundation (NSF)
Grant/Contract Number:
AC05-00OR22725; CNS-1560698
OSTI ID:
1628549
Journal Information:
Sensors, Vol. 17, Issue 10; ISSN 1424-8220
Publisher:
MDPI AGCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 6 works
Citation information provided by
Web of Science

References (14)

Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks journal March 2014
Steiner tree problem with minimum number of Steiner points and bounded edge-length journal January 1999
Protecting cultural heritage tourism sites with the ubiquitous sensor network journal May 2009
Algorithmic construction of sets for k -restrictions journal April 2006
On efficient deployment of sensors on planar grid journal October 2007
The problem of thirteen spheres — a proof for undergraduates journal August 2007
An Efficient Large-Scale Sensor Deployment Using a Parallel Genetic Algorithm Based on CUDA journal January 2016
Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks journal July 2015
Method for Optimal Sensor Deployment on 3D Terrains Utilizing a Steady State Genetic Algorithm with a Guided Walk Mutation Operator Based on the Wavelet Transform journal April 2012
Improved approximation algorithms for connected sensor cover journal May 2006
On the optimal random deployment of wireless sensor networks in non-homogeneous scenarios journal May 2013
A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks journal February 2010
Efficient point coverage in wireless sensor networks journal May 2006
Approximation algorithms for combinatorial problems journal December 1974

Cited By (1)

Improved Many-Objective Optimization Algorithms for the 3D Indoor Deployment Problem journal January 2019