Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks
We discuss the problem of maximizing the sensor field coverage for a specific number of sensors while minimizing the distance traveled by the sensor nodes. Thus, we define the movement task as an optimization problem that involves the adjustment of sensor node positions in a coverage optimization mi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-09-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/478470 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849695944891695104 |
|---|---|
| author | Du Xiaoyu Sun Lijuan Liu Linfeng |
| author_facet | Du Xiaoyu Sun Lijuan Liu Linfeng |
| author_sort | Du Xiaoyu |
| collection | DOAJ |
| description | We discuss the problem of maximizing the sensor field coverage for a specific number of sensors while minimizing the distance traveled by the sensor nodes. Thus, we define the movement task as an optimization problem that involves the adjustment of sensor node positions in a coverage optimization mission. We propose a coverage optimization algorithm based on sampling to enhance the coverage of 3D underwater sensor networks. The proposed coverage optimization algorithm is inspired by the simple random sampling in probability theory. The main objective of this study is to lessen computation complexity by dimension reduction, which is composed of two detailed steps. First, the coverage problem in 3D space is converted into a 2D plane for heterogeneous networks via sampling plane in the target 3D space. Second, the optimization in the 2D plane is converted into an optimization in a line segment by using the line sampling method in the sample plane. We establish a quadratic programming mathematical model to optimize the line segment coverage according to the intersection between sensing circles and line segments while minimizing the moving distance of the nodes. The intersection among sensors is decreased to increase the coverage rate, while the effective sensor positions are identified. Simulation results show the effectiveness of the proposed approach. |
| format | Article |
| id | doaj-art-5f5ef1144f7a4f7b95ddc9fce6478756 |
| institution | DOAJ |
| issn | 1550-1477 |
| language | English |
| publishDate | 2013-09-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-5f5ef1144f7a4f7b95ddc9fce64787562025-08-20T03:19:35ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-09-01910.1155/2013/478470478470Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor NetworksDu Xiaoyu0Sun Lijuan1Liu Linfeng2 Basic Experiment and Teaching Center, Henan University, Kaifeng 475003, China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China College of Computer, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu 210003, ChinaWe discuss the problem of maximizing the sensor field coverage for a specific number of sensors while minimizing the distance traveled by the sensor nodes. Thus, we define the movement task as an optimization problem that involves the adjustment of sensor node positions in a coverage optimization mission. We propose a coverage optimization algorithm based on sampling to enhance the coverage of 3D underwater sensor networks. The proposed coverage optimization algorithm is inspired by the simple random sampling in probability theory. The main objective of this study is to lessen computation complexity by dimension reduction, which is composed of two detailed steps. First, the coverage problem in 3D space is converted into a 2D plane for heterogeneous networks via sampling plane in the target 3D space. Second, the optimization in the 2D plane is converted into an optimization in a line segment by using the line sampling method in the sample plane. We establish a quadratic programming mathematical model to optimize the line segment coverage according to the intersection between sensing circles and line segments while minimizing the moving distance of the nodes. The intersection among sensors is decreased to increase the coverage rate, while the effective sensor positions are identified. Simulation results show the effectiveness of the proposed approach.https://doi.org/10.1155/2013/478470 |
| spellingShingle | Du Xiaoyu Sun Lijuan Liu Linfeng Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks International Journal of Distributed Sensor Networks |
| title | Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks |
| title_full | Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks |
| title_fullStr | Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks |
| title_full_unstemmed | Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks |
| title_short | Coverage Optimization Algorithm Based on Sampling for 3D Underwater Sensor Networks |
| title_sort | coverage optimization algorithm based on sampling for 3d underwater sensor networks |
| url | https://doi.org/10.1155/2013/478470 |
| work_keys_str_mv | AT duxiaoyu coverageoptimizationalgorithmbasedonsamplingfor3dunderwatersensornetworks AT sunlijuan coverageoptimizationalgorithmbasedonsamplingfor3dunderwatersensornetworks AT liulinfeng coverageoptimizationalgorithmbasedonsamplingfor3dunderwatersensornetworks |