Return
Sensor Placement Algorithm With Range Constraints for Precision Agriculture
DOI:10.1109/MAES.2019.2921177.png)
Abstract
En 中文
In precision agriculture (PA), fusing low-resolution remote sensing (RS) information with proximal sensors provided by wireless sensor networks (WSN) can help increase productivity, reduce cost, and optimize resources. However, sensor cost and their range emerge as a major bottleneck in proximal sensing. Moreover, the range is affected by weather and farming operations outages. Consequently, optimal sensor placement to reduce cost considering range constraints and having ability to fuse high-level low-resolution RS information has emerged as one of the key problems in WSNs for PA applications. Typically, optimal sensor placement is a combinatorial problem which is computationally intensive (NP-hard) and range constraints add another complex dimension to the problem. This paper proposes Sensor Placement Algorithm with range constraints (SPARC), which optimally places sensors considering their range. Furthermore, it has ability to fuse low-resolution RS information with proximal sensing of the sensors. We first show that the problem is computationally intensive and complex due to its combinatorial nature. Next, we propose a two-step approach wherein the optimal sensor placement problem is solved in the first step by using the optimization models. In the second step, the sensor locations are adjusted to address the range constraints such that the error covariance is reduced. Novelty of SPARC is the inclusion of range constraints, fusing the proximal measurements with low-resolution high-level data, and the solution technique that organizes the problems into two steps. As a result, sensor cost, physical constraints of farming practices, and maintenance cost can be reduced drastically without compromising on the monitoring capability. We also present prototype of the sensor node and illustrate the SPARC on a precision farming test-bed developed by the authors.
Keywords:
ORBIT MODAL IDENTIFICATION
NONLINEAR MODEL-REDUCTION
SELECTION
NETWORKS
OPTIMIZATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
2.1K
Citations:
2.5K


