CN109068266B - Three-dimensional surface sensor network deployment method - Google Patents
Three-dimensional surface sensor network deployment method Download PDFInfo
- Publication number
- CN109068266B CN109068266B CN201810853510.1A CN201810853510A CN109068266B CN 109068266 B CN109068266 B CN 109068266B CN 201810853510 A CN201810853510 A CN 201810853510A CN 109068266 B CN109068266 B CN 109068266B
- Authority
- CN
- China
- Prior art keywords
- point set
- reference point
- triangle
- sequence
- sensor network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000005259 measurement Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 claims description 5
- 238000004458 analytical method Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000013507 mapping Methods 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 abstract description 8
- 238000004891 communication Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 108090000765 processed proteins & peptides Proteins 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention relates to a three-dimensional surface sensor network deployment method, which comprises the steps of firstly collecting a three-dimensional geographic information data point set of a region to be monitored, triangulating and optimizing the point set by using a Choi algorithm, taking each vertex of a subdivision triangle as a candidate deployment position of a sensor node, optimizing the candidate deployment position according to two principles of maximum coverage area and no intersection of a coverage surface, and taking the optimized vertex set as the deployment position of the sensor node. And then, triangulation is carried out again by using the deployment position of the sensor node as a vertex, and a new deployment position of the sensor node is calculated by using a triangulation triangle sequence, namely the deployment of the three-dimensional surface sensor network is completed. The invention realizes coverage monitoring of the three-dimensional complex curved surface by using the least number of sensor nodes, solves the problems of repeated coverage and coverage holes of the three-dimensional complex curved surface, and has flexible deployment method and high coverage rate.
Description
Technical Field
The invention relates to the technical field of three-dimensional sensor network coverage, in particular to a three-dimensional surface sensor network deployment method.
Background
The Wireless Sensor Network (WSN) is composed of sensor nodes deployed on the surface, and in recent years, the application range and the field thereof are increasingly wider, and the WSN has wide applications in the fields of military, forest fire prevention, medical care, submarine environment monitoring, industrial control, commerce and the like. The WSN technology mainly aims at perceiving and monitoring a target area and realizing perceiving and monitoring of various environments or objects in the target area. How to use a proper sensor node deployment method to optimize and configure various resources of the WSN so as to improve various service qualities of the WSN becomes a problem to be solved urgently in the WSN technology.
Due to the characteristics of wide application range of the sensor network, complex application environment, limited network node resources and the like, the overlapping of network coverage areas can be caused by a large number of deployed nodes, so that repeated coverage is caused, and resources are wasted. Under the limitation of factors such as communication quality, coverage rate and cost performance, sensor nodes are reasonably deployed, network resources are effectively utilized, the requirement of network service quality is met, and effective coverage in the application of the wireless sensor network is very important. Meanwhile, most of sensor coverage researches are focused on an ideal two-dimensional plane and a full three-dimensional space, however, in many practical applications, a target field is a three-dimensional complex curved surface, sensor nodes can only be deployed on the surface of a monitoring area instead of being placed randomly, if the previous coverage strategy is adopted, the problem of network coverage holes is caused, and a monitoring blind area is caused, so that the traditional method is not applicable.
Disclosure of Invention
Aiming at the existing problems, the invention provides a three-dimensional surface sensor network deployment method, which realizes coverage monitoring on a three-dimensional complex curved surface by using the least number of sensor nodes and solves the problems of repeated coverage and coverage holes of the three-dimensional complex curved surface.
In order to achieve the purpose, the specific technical scheme of the invention is as follows: a three-dimensional surface sensor network deployment method comprises the following steps:
1) collecting a three-dimensional geographic information data point set PA of a region to be monitored by utilizing a GIS technology; wherein, PAi(xi,yi,zi) Denotes the ith point, xiIndicates the longitude, y of the ith pointiIndicating the latitude, z, of the ith pointiRepresents the height of the ith point;
2) triangulation is carried out on the point set PA by using the Choi algorithm to obtain a subdivision triangle sequence N1;
3) For subdivision triangle sequence N1Optimizing according to the circumscribed curved surface circle-simulating criterion and the space shape optimizing criterion to obtain an optimized subdivision triangular sequence N2;
4) Taking and subdividing a triangular sequence N2Each vertex of the medium triangle is used as a candidate deployment position of the sensor node, and a point set is recorded as PB;
5) optimizing a point set PB according to two principles of maximum coverage area and no intersection of coverage surfaces to obtain a reference point set PC;
6) triangulation is carried out on the reference point set PC by using the Choi algorithm to obtain a subdivision triangle sequence N3;
7) Using a split triangular sequence N3Calculating a new reference point, and adding the new reference point into a reference point set PC;
8) and taking points in the reference point set PC as actual node deployment positions of the sensor network deployment to realize the three-dimensional surface sensor network deployment.
Further, in the step 1), a specific method for acquiring the three-dimensional geographic information data point set of the area to be monitored is as follows:
1.1) acquiring the geographic information of an area to be monitored through field actual measurement, space flight and aviation remote sensing, aerial measurement and a Global Positioning System (GPS);
1.2) abstracting geographic information into layers with different behavior characteristics according to points, lines and planes to obtain attribute data and spatial data, wherein the attribute data comprises the quality and the quantity of geographic entities, and the spatial data is position information of the entities, namely three-dimensional coordinates of the entities;
1.3) verifying, modifying and editing the attribute data by using a digitizer and an analysis mapping instrument to obtain a space coordinate information discrete point set PA of the area to be monitored;
further, in the step 5), the method for optimizing the point set PB to obtain the reference point set PC is as follows:
5.1) initializing reference point set PC, PC ═ PB1In which PB is1Is the first element in the point set PB;
5.2) calculating the distance d between the reference point and all other points in the PB;
5.3) selecting points which satisfy the condition that d is more than 2r and less than 4r and are not in the reference point set PC as new reference points, and adding the new reference points into the reference point set PC, wherein r is the sensing radius of the sensor node;
5.4) repeating the steps 5.2) to 5.3) for the newly added points in the reference point set PC until no new reference points are added;
and 5.5) taking the reference point set PC as the optimized sensor node deployment position.
Further, in the step 7), the subdivision triangular sequence N is utilized3Calculating a new reference point, and adding the new reference point into a reference point set PC, wherein the specific method comprises the following steps:
7.1) taking a subdivision triangle sequence N3The first triangle in (1);
7.2) calculating the outer center of the triangle and the distance L between the outer center of the triangle and the vertex of the triangle;
7.3) judging whether L is larger than 2r, if so, turning to a step 7.4), and if not, turning to a step 7.5);
7.4) inserting sensor nodes between the outer center and the vertex of the triangle;
7.5) vertically projecting the outer center and the node to be inserted to the subdivision triangular sequence N along the height coordinate2Triangle of (5);
7.6) calculating the space coordinate of each projection point according to the centroid, the longitude and latitude coordinates of each node to be inserted and a triangular plane equation;
7.7) adding the projection point as a new reference point into a reference point set PC;
7.8) taking N3Repeating the step 7.2) to the step 7.7) until the next triangle is traversed3。
Further, in the step 7.4) above,if the coordinate of the outer center of the triangle is O (x)0,y0,z0) The vertex coordinate is E (x)1,y1,z1) Then node coordinate R is to be insertedn(xn,yn,zn) The calculation formula is as follows:
Compared with the existing deployment method, the deployment method has the advantages that the coverage monitoring of the three-dimensional complex curved surface is realized by using the least number of the sensor nodes, the problems of repeated coverage and coverage holes of the three-dimensional complex curved surface are solved, and the deployment method is flexible and high in coverage rate.
Drawings
Fig. 1 is a sensor network deployment flow overview diagram.
FIG. 2 is a flow chart of optimization of the point set PB.
Detailed Description
A three-dimensional surface sensor network deployment method is shown in fig. 1, and includes the following steps:
1) the method comprises the following steps of acquiring three-dimensional geographic information data discrete points of an area to be monitored by utilizing a GIS technology to obtain a point set PA of the area to be monitored, wherein the acquisition method specifically comprises the following steps:
1.1) acquiring the geographic information of an area to be monitored through field actual measurement, space flight and aviation remote sensing, aerial measurement and a Global Positioning System (GPS);
1.2) abstracting geographic information into layers with different behavior characteristics according to points, lines and planes to obtain attribute data and spatial data, wherein the attribute data comprises the quality and the quantity of geographic entities, and the spatial data is position information of the entities, namely three-dimensional coordinates of the entities;
1.3) verifying, modifying and editing the attribute data and the spatial data by using a digitizer and an analysis mapping instrument to obtain a discrete point set PA of spatial coordinate information of an area to be monitored; wherein, PAi(xi,yi,zi) Denotes the ith point, xiIndicates the longitude, y of the ith pointiIndicating the latitude, z, of the ith pointiRepresents the height of the ith point;
2) triangulation is carried out on the point set PA by using the Choi algorithm to obtain a subdivision triangle sequence N1;
3) For subdivision triangle sequence N1Optimizing according to the circumscribed curved surface circle-simulating criterion and the space shape optimizing criterion to obtain an optimized subdivision triangular sequence N2;
4) Taking and subdividing a triangular sequence N2Each vertex of the medium triangle is used as a candidate deployment position of the sensor node, and a point set is recorded as PB;
5) optimizing a point set PB according to two principles of maximum coverage area and no intersection of coverage surfaces to obtain a reference point set PC; as shown in fig. 2, the specific method is as follows:
5.1) initializing reference point set PC, PC ═ PB1In which PB is1Is the first element in the point set PBA peptide;
5.2) calculating the distance d between the reference point and all other points in the PB;
5.3) selecting points which satisfy the condition that d is more than 2r and less than 4r and are not in the reference point set PC as new reference points, and adding the new reference points into the reference point set PC, wherein r is the sensing radius of the sensor node;
5.4) repeating the steps 5.2) to 5.3) for the newly added points in the reference point set PC until no new reference points are added;
5.5) taking the reference point set PC as the optimized sensor node deployment position;
6) triangulation is carried out on the reference point set PC by using the Choi algorithm to obtain a subdivision triangle sequence N3;
7) Using a split triangular sequence N3Calculating a new reference point, and adding the new reference point into a reference point set PC, wherein the specific method comprises the following steps:
7.1) taking a subdivision triangle sequence N3The first triangle in (1);
7.2) calculating the outer center of the triangle and the distance L between the outer center of the triangle and the vertex of the triangle;
7.3) judging whether L is larger than 2r, if so, turning to a step 7.4), and if not, turning to a step 7.5);
7.4) inserting sensor nodes between the triangle's outer center and the vertices,whereinIs an upper rounding formula; if the coordinate of the outer center of the triangle is O (x)0,y0,z0) The vertex coordinate is E (x)1,y1,z1) Then node coordinate R is to be insertedn(xn,yn,zn) The calculation formula is as follows:
7.5) vertically projecting the outer center and the node to be inserted to the subdivision triangular sequence N along the height coordinate2Triangle of (5);
7.6) calculating the space coordinate of each projection point according to the centroid, the longitude and latitude coordinates of each node to be inserted and a triangular plane equation;
7.7) adding the projection point as a new reference point into a reference point set PC;
7.8) taking N3Repeating the step 7.2) to the step 7.7) until the next triangle is traversed3;
8) And taking points in the reference point set PC as actual node deployment positions of the sensor network deployment to realize the three-dimensional surface sensor network deployment.
Claims (5)
1. A three-dimensional surface sensor network deployment method is characterized by comprising the following steps:
1) collecting a three-dimensional geographic information data point set PA of a region to be monitored by utilizing a GIS technology; wherein, PAi(xi,yi,zi) Denotes the ith point, xiIndicates the longitude, y of the ith pointiIndicating the latitude, z, of the ith pointiRepresents the height of the ith point;
2) triangulation is carried out on the point set PA by using the Choi algorithm to obtain a subdivision triangle sequence N1;
3) For subdivision triangle sequence N1Optimizing according to the circumscribed curved surface circle-simulating criterion and the space shape optimizing criterion to obtain an optimized subdivision triangular sequence N2;
4) Taking and subdividing a triangular sequence N2Each vertex of the medium triangle is used as a candidate deployment position of the sensor node, and a point set is recorded as PB;
5) optimizing a point set PB according to two principles of maximum coverage area and no intersection of coverage surfaces to obtain a reference point set PC;
6) triangulation is carried out on the reference point set PC by using the Choi algorithm to obtain a subdivisionTriangular sequence N3;
7) Using a split triangular sequence N3Calculating a new reference point, and adding the new reference point into a reference point set PC;
8) and taking points in the reference point set PC as actual node deployment positions of the sensor network deployment to realize the three-dimensional surface sensor network deployment.
2. The three-dimensional surface sensor network deployment method according to claim 1, wherein in the step 1), a specific method for collecting the three-dimensional geographic information data point set of the region to be monitored is as follows:
1.1) acquiring the geographic information of an area to be monitored through field actual measurement, space flight and aviation remote sensing, aerial measurement and a Global Positioning System (GPS);
1.2) abstracting geographic information into layers with different behavior characteristics according to points, lines and planes to obtain attribute data and spatial data, wherein the attribute data comprises the quality and the quantity of geographic entities, and the spatial data is position information of the entities, namely three-dimensional coordinates of the entities;
and 1.3) verifying, modifying and editing the attribute data by using a digitizer and an analysis mapping instrument to obtain a space coordinate information discrete point set PA of the area to be monitored.
3. The three-dimensional surface sensor network deployment method according to claim 1, characterized in that in step 5), the method for optimizing the point set PB to obtain the reference point set PC is as follows:
5.1) initializing reference point set PC, PC ═ PB1In which PB is1Is the first element in the point set PB;
5.2) calculating the distance d between the reference point and all other points in the PB;
5.3) selecting points which satisfy the condition that d is more than 2r and less than 4r and are not in the reference point set PC as new reference points, and adding the new reference points into the reference point set PC, wherein r is the sensing radius of the sensor node;
5.4) repeating the steps 5.2) to 5.3) for the newly added points in the reference point set PC until no new reference points are added;
and 5.5) taking the reference point set PC as the optimized sensor node deployment position.
4. The method for deploying the three-dimensional surface sensor network according to claim 1, wherein in step 7), a subdivision triangle sequence N is utilized3Calculating a new reference point, and adding the new reference point into a reference point set PC, wherein the specific method comprises the following steps:
7.1) taking a subdivision triangle sequence N3The first triangle in (1);
7.2) calculating the outer center of the triangle and the distance L between the outer center of the triangle and the vertex of the triangle;
7.3) judging whether L is larger than 2r, if so, turning to a step 7.4), and if not, turning to a step 7.5);
7.4) inserting sensor nodes between the outer center and the vertex of the triangle;
7.5) vertically projecting the outer center and the node to be inserted to the subdivision triangular sequence N along the height coordinate2Triangle of (5);
7.6) calculating the space coordinate of each projection point according to the centroid, the longitude and latitude coordinates of each node to be inserted and a triangular plane equation;
7.7) adding the projection point as a new reference point into a reference point set PC;
7.8) taking N3Repeating the step 7.2) to the step 7.7) until the next triangle is traversed3。
5. The method for deploying the three-dimensional surface sensor network according to claim 4, wherein in step 7.4), the method requiresIf the coordinate of the outer center of the triangle is O (x)0,y0,z0) The vertex coordinate is E (x)1,y1,z1) Then node coordinate R is to be insertedn(xn,yn,zn) The calculation formula is as follows:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810853510.1A CN109068266B (en) | 2018-07-30 | 2018-07-30 | Three-dimensional surface sensor network deployment method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810853510.1A CN109068266B (en) | 2018-07-30 | 2018-07-30 | Three-dimensional surface sensor network deployment method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109068266A CN109068266A (en) | 2018-12-21 |
CN109068266B true CN109068266B (en) | 2020-08-28 |
Family
ID=64831915
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810853510.1A Active CN109068266B (en) | 2018-07-30 | 2018-07-30 | Three-dimensional surface sensor network deployment method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109068266B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113905387A (en) * | 2021-09-30 | 2022-01-07 | 中北大学 | Wireless underground sensor node deployment method and device and storage medium |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101702834A (en) * | 2009-10-23 | 2010-05-05 | 北京航空航天大学 | Routing method in wireless sensor network based on equilateral triangle subdivision model |
CN105392146A (en) * | 2015-10-22 | 2016-03-09 | 桂林理工大学 | WSN coverage blind zone detection method based on three-dimensional terrain correction |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10378893B2 (en) * | 2016-07-29 | 2019-08-13 | Ca, Inc. | Location detection sensors for physical devices |
-
2018
- 2018-07-30 CN CN201810853510.1A patent/CN109068266B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101702834A (en) * | 2009-10-23 | 2010-05-05 | 北京航空航天大学 | Routing method in wireless sensor network based on equilateral triangle subdivision model |
CN105392146A (en) * | 2015-10-22 | 2016-03-09 | 桂林理工大学 | WSN coverage blind zone detection method based on three-dimensional terrain correction |
Non-Patent Citations (1)
Title |
---|
基于三维地形修正的无线传感器网络覆盖盲区检测;神显豪,李军,奈何;《传感技术学报》;20160115;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN109068266A (en) | 2018-12-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5603432B2 (en) | Determining the location of a mobile device using a location database | |
JP5395963B2 (en) | Management of location database of positioning system based on network | |
JP5389275B2 (en) | Location filtering using country codes | |
JP6906617B2 (en) | Highly accurate radio positioning methods and equipment | |
CN106054920A (en) | Unmanned aerial vehicle flight path planning method and device | |
CN110782708A (en) | Unmanned aerial vehicle flight network modeling method based on low-altitude airspace limiting conditions | |
US10509096B2 (en) | Location error radius determination | |
Gupta et al. | Analysis of coverage under border effects in three-dimensional mobile sensor networks | |
KR20180047572A (en) | Method for building a grid map with mobile robot unit | |
CN103596265B (en) | A kind of multi-user's indoor orientation method based on sound ranging and motion-vector | |
Xie et al. | Estimation and validation of the 3D smooth-turn mobility model for airborne networks | |
CN109068266B (en) | Three-dimensional surface sensor network deployment method | |
JP2021103168A (en) | Augmented reality device and positioning method | |
Brown et al. | Obstacle-aware wireless video sensor network deployment for 3D indoor monitoring | |
Allen et al. | The range beacon placement problem for robot navigation | |
Zhang et al. | A target group tracking algorithm for wireless sensor networks using azimuthal angle of arrival information | |
Zhu et al. | EZMap: Boosting Automatic Floor Plan Construction With High-Precision Robotic Tracking | |
KR20190113013A (en) | Indoor positioning method based on beacon signal and fingerprint map and system having the method | |
EP3097435B1 (en) | Method for estimating the position of a portable device | |
CN108981713B (en) | Hybrid wireless self-adaptive navigation method and device | |
KR101459004B1 (en) | Method for converting 3D Image based plan to 3D Image based spherical surface | |
CN108491401B (en) | Coordinate deviation rectifying method for 2.5-dimensional map | |
Schall et al. | Rapid and accurate deployment of fiducial markers for augmented reality | |
CN108960738A (en) | A kind of laser radar data clustering method under warehouse aisles environment | |
Mendoza-Silva et al. | Situation goodness method for weighted centroid-based Wi-Fi aps localization |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right |
Effective date of registration: 20240207 Address after: 1003, Building A, Zhiyun Industrial Park, No. 13 Huaxing Road, Henglang Community, Dalang Street, Longhua District, Shenzhen City, Guangdong Province, 518000 Patentee after: Shenzhen Wanzhida Technology Transfer Center Co.,Ltd. Country or region after: China Address before: 212013 No. 301, Xuefu Road, Zhenjiang, Jiangsu Patentee before: JIANGSU University Country or region before: China |
|
TR01 | Transfer of patent right |