CN106358209A - Surface covering method of wireless sensor network based on Delaunay tetrahedron - Google Patents

Surface covering method of wireless sensor network based on Delaunay tetrahedron Download PDF

Info

Publication number
CN106358209A
CN106358209A CN201610888624.0A CN201610888624A CN106358209A CN 106358209 A CN106358209 A CN 106358209A CN 201610888624 A CN201610888624 A CN 201610888624A CN 106358209 A CN106358209 A CN 106358209A
Authority
CN
China
Prior art keywords
candidate position
delaunay
candidate
reference position
wireless sensor
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.)
Granted
Application number
CN201610888624.0A
Other languages
Chinese (zh)
Other versions
CN106358209B (en
Inventor
解梅
张锦宇
刘伸展
周扬
苏星霖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Houpu Clean Energy Group Co ltd
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201610888624.0A priority Critical patent/CN106358209B/en
Publication of CN106358209A publication Critical patent/CN106358209A/en
Application granted granted Critical
Publication of CN106358209B publication Critical patent/CN106358209B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18Network planning tools
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Arrangements For Transmission Of Measured Signals (AREA)

Abstract

The invention discloses a surface covering method of a wireless sensor network based on a Delaunay tetrahedron, and belongs to the technical field of node deployment of wireless sensors. The method comprises the following steps: firstly using a Delaunay algorithm to discretize a target region, establishing a Delaunay triangulation network, then establishing a Voronoi diagram based on the Delaunay triangulation network, using the excentre of each Voronoi unit as a candidate position of the wireless sensor, and regulating the radius of a circumscribed circle to achieve different wireless sensor deployment schemes so that the wireless sensor deployment scheme can be regulated based on different surface roughness factors; screening the candidate positions, dereplicating and deleting the candidate positions located in overlapping regions, reducing the number of the deployed wireless sensors, and obtaining an optimized deployment scheme under the conditions of ensuring the local and overall communication capacity.

Description

Wireless sensor network surface covering method based on Delaunay tetrahedron
Technical field
The present invention relates to the node deployment of wireless senser and in particular to a kind of based on delaunay Delaunay tetrahedron Wireless sensor network surface covering method.
Background technology
Wireless sensor network is defined as a kind of subclass of the AD-HOC network for the purpose of monitoring.This network typically should For be difficult to reach or danger area monitoring.Wireless sensor network main composition is node, and the main of node is appointed Business is to collect monitoring desired signal.Node location distribution is incorrect to lead to wireless sensor network to be difficult to obtain the letter of needs Number.It is critical only that of the node deployment of wireless sensor network: how to ensure in different target region reasonable distribution sensor section Point, reaches the efficient region area coverage of maximum with number of sensors as few as possible.
Currently, people are to delaunay (delaunay) network of triangle and the construction distribution of voronoi (Thiessen polygon) figure The deployment of sensor node had certain achievement, but be seldom related to regard to more real topographic features, such as, area The volume of domain block and surface roughness.Generally, it is only limited to two-dimensional space during deployment.For three dimensions, a big difficult point is exactly The step needing a discretization surface cell.In this step, the data meeting that under-represented surface discretization obtains Increase the quantity of node, thus increasing the deployment quantity of sensor.
Content of the invention
The goal of the invention of the present invention is, disclose a kind of can effective control sensor deployment quantity based on delaunay four The wireless sensor network surface covering side of face body.
The wireless sensor network surface covering method based on Delaunay tetrahedron of the present invention, comprises the following steps:
Step 1: determine the border of three-dimensional target region, target area is carried out with delaunay triangulation network subdivision, set up and include The delaunay triangulation network of multiple delaunay trianglees;
Determine the border of three-dimensional target region, in order to distribution sensor node.Blender figure is for example utilized to realize The border of three-dimensional target region determines.After border determines, using delaunay delaunay triangle, target area is divided For a series of geometric units blocks (delaunay triangle) composition, target area is carried out with delaunay triangulation network subdivision, sets up The delaunay triangulation network including multiple delaunay trianglees.
Step 2: Thiessen polygon figure (voronoi figure) is built based on the delaunay triangulation network that step 1 obtains, will The circumscribed circle center of circle of each voronoi unit of voronoi in figure is as the candidate position of wireless senser;
Step 3: search the isolated node in candidate position and delete, wherein isolated node is: if current candidate position with The spacing of all adjacent candidate position is all higher than the communication radius of wireless senser, then current candidate position is defined as isolated section Point;
Step 4: delete the candidate position of repeated space position, to improve the sensor covering quality of target area, reduce Unnecessary number of sensors.
Step 5: search the overlapping region between adjacent candidate position and delete candidate position positioned at overlapping region, obtain mesh The sensor distributing position in mark region:
Step 501: constitute candidate position set t by currently all candidate position;
Step 502: randomly choose a candidate position from set t as reference position a;
Step 603: all adjacent candidate position to reference position a, judge reference position a and each adjacent candidate position respectively Air line distance between putting whether less than the circle that is located radius and, if so, then execution step 604;Otherwise execution step 605;
Step 604: calculate the reference position a and overlapping region area between currently adjacent candidate position, and from candidate position The candidate position being located at current overlapping region area is deleted in set t;
The calculating process of overlapping region area is:
Represent currently adjacent candidate position with b, represent the circle at reference position a place and circle that candidate position b is located with c, d Cross point, uses r0、r1The radius of circle that reference position a, b are located respectively, the position coordinateses (x based on reference position a, ba,ya,za)、 (xb,yb,zb) computed range c, according to the overlapping region area of following equation calculating reference position a candidate position b:
C=((xa-xb)2+(ya-yb)2+(za-zb)2)1/2
c o s ( 1 2 ∠ c a b ) = r 0 2 + c 2 - r 1 2 2 r 0 c
c o s ( 1 2 ∠ c b a ) = r 1 2 + c 2 - r 0 2 2 r 1 c
γ=acos (∠ cba), θ=2 γ;ζ=acos (∠ cab), ρ=2 ζ;
Step 505: all adjacent candidate position of reference position a is judged to finish, then continues to select one from set t Non-selected candidate position, as reference position a, continues executing with step 502, until having traveled through all candidate positions in set t Put;
Step 506: obtain the sensor distributing position of target area based on all candidate position of current collection t.
In sum, due to employing technique scheme, the invention has the beneficial effects as follows: the present invention initially with Delaunay algorithm carries out discrete region to target area, sets up the delaunay triangulation network, then builds voronoi based on it Figure, using the unfaithful intention of each voronoi unit as wireless senser candidate position, by adjust circumscribed circle radius can be real Existing different radio sensor deployment scheme, thus can be based on different earth's surface degree of roughness factor adjustment wireless senser deployment Scheme;And candidate position carried out screen, duplicate removal and delete the candidate position being located at overlapping region, reduce the wireless biography disposed The quantity of sensor, under conditions of guaranteeing local and integrated communication ability, obtains the deployment scheme optimizing.Brief description
Fig. 1 is Plain coverage test schematic diagram.
Fig. 2 is plateau coverage test schematic diagram.
Fig. 3 is mountain region coverage test schematic diagram.
Fig. 4 is Plain communication test schematic diagram.
Fig. 5 is plateau communication test schematic diagram.
Fig. 6 is mountain region communication test schematic diagram.
Specific embodiment
For making the object, technical solutions and advantages of the present invention clearer, with reference to embodiment and accompanying drawing, to this Bright it is described in further detail.
The inventive method is used for the wireless senser portion of the target area of different terrain (as Plain, plateau and mountain region etc.) Administration, and test checking directly perceived, effective is carried out on matlab, to verify the effect of its deployment.For Plain, plateau and mountain region Can be used for the practical uses such as forest fire detection etc. the wireless senser deployment of different terrain.
Setting target area is in 200 × 200m2Left and right.Fig. 1 is the target area test chart (4022.23m in Plain2), Fig. 2 Target area test chart (4080.24m for plateau2), Fig. 3 is the target area test chart (4405.92m in mountain region2).Model takes Value take into account mountain peak and mountain valley.
Carried out using the wireless sensor network surface covering method of the present invention in the target area to above-mentioned different terrain After wireless senser deployment, obtain following result:
Plain topography uses 26 wireless sensers, and each monitoring range is 295 ± 56 meters, total coverage rate 100% (4022.23m2);
Plateau landform uses 20 wireless sensers, and each monitoring range is 335 ± 20.7 meters, total coverage rate 98.2% (4006.74m2);
Mountain region uses 62 wireless sensers, and each monitoring range is 180 ± 4.5 meters, total coverage rate 91.01% (4009.65m2).
Fig. 4, Fig. 5, Fig. 6 have gone out the nothing in Plain, plateau and mountain region by the delaunay triangulation network and three-dimensional voronoi icon The distribution schematic diagram of line sensor node.In checking local and global communication aspect of performance, can be using based on shortest path Dijkstra algorithm is tested to different terrain.Result draws, Plain, plateau, three kinds of mountain region landform are distributed in global communication On be respectively necessary for 18 wireless sensor nodes, 8 wireless sensor nodes and 42 wireless sensor nodes.Local communication with The minimum node number of global communication and distance are limit, are realized by dijkstra algorithm.Therefore the present invention guarantee local and whole The deployment scheme of optimization under conditions of body communication ability, can be obtained based on a number of wireless senser.

Claims (1)

1. the wireless sensor network surface covering method based on Delaunay tetrahedron is it is characterised in that comprise the following steps:
Step 1: determine the border of three-dimensional target region, target area is carried out with delaunay triangulation network subdivision, foundation includes multiple The delaunay triangulation network of delaunay triangle;
Step 2: the delaunay triangulation network being obtained based on step 1 builds Thiessen polygon figure, by Thiessen polygon in figure each The circumscribed circle center of circle of Thiessen polygon unit is as the candidate position of wireless senser;
Step 3: search the isolated node in candidate position and delete, wherein isolated node is: if current candidate position with all The spacing of adjacent candidate position is all higher than the communication radius of wireless senser, then current candidate position is defined as isolated node;
Step 4: delete the candidate position of repeated space position;
Step 5: search the overlapping region between adjacent candidate position and delete candidate position positioned at overlapping region, obtain target area The sensor distributing position in domain:
Step 501: constitute candidate position set t by currently all candidate position;
Step 502: randomly choose a candidate position from set t as reference position a;
Step 503: all adjacent candidate position to reference position a, judge respectively reference position a and each adjacent candidate position it Between distance whether less than the circle that is located radius and, if so, then execution step 604;Otherwise execution step 605;
Step 504: calculate the reference position a and overlapping region area between currently adjacent candidate position, and from candidate position set t The middle candidate position deleted positioned at current overlapping region area;
The calculating process of overlapping region area is:
Represent currently adjacent candidate position with b, represent intersecting of reference position a circle being located and circle that candidate position b is located with c, d Point, uses r0、r1The radius of circle that reference position a, b are located respectively, the position coordinateses (x based on reference position a, ba,ya,za)、(xb, yb,zb) calculate apart from c between a and b, according to the overlapping region area of following equation calculating reference position a candidate position b:
(this formula needs)
c o s ( 1 2 ∠ c a b ) = r 0 2 + c 2 - r 1 2 2 r 0 c
c o s ( 1 2 ∠ c b a ) = r 1 2 + c 2 - r 0 2 2 r 1 c
γ=a cos (∠ cba), θ=2 γ;ζ=a cos (∠ cab), ρ=2 ζ;
Step 505: all adjacent candidate position of reference position a is judged to finish, then continue from set t selection one not by The candidate position selecting, as reference position a, continues executing with step 502, until having traveled through all candidate position in set t;
Step 506: obtain the sensor distributing position of target area based on all candidate position of current collection t.
CN201610888624.0A 2016-10-11 2016-10-11 Wireless sensor network surface covering method based on Delaunay tetrahedron Active CN106358209B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610888624.0A CN106358209B (en) 2016-10-11 2016-10-11 Wireless sensor network surface covering method based on Delaunay tetrahedron

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610888624.0A CN106358209B (en) 2016-10-11 2016-10-11 Wireless sensor network surface covering method based on Delaunay tetrahedron

Publications (2)

Publication Number Publication Date
CN106358209A true CN106358209A (en) 2017-01-25
CN106358209B CN106358209B (en) 2019-06-21

Family

ID=57866554

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610888624.0A Active CN106358209B (en) 2016-10-11 2016-10-11 Wireless sensor network surface covering method based on Delaunay tetrahedron

Country Status (1)

Country Link
CN (1) CN106358209B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107389318A (en) * 2017-08-01 2017-11-24 赵淑娟 A kind of LED light source detection method and system
CN112333730A (en) * 2020-10-16 2021-02-05 广西电网有限责任公司 Method for constructing cellular network coverage map based on adaptive triangulation induced interpolation
CN113613259A (en) * 2021-08-23 2021-11-05 中国地质大学(武汉) Sensor node covering deployment method and system in continuous three-dimensional space
CN114120565A (en) * 2021-11-26 2022-03-01 燕山大学 Forest fire early warning method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102802164A (en) * 2012-08-30 2012-11-28 吴军 Optimization method on basis of coverage control theory and algorithm in wireless sensor network
KR20140076897A (en) * 2012-12-13 2014-06-23 한국과학기술원 Method of constructing path in wireless sensor network, method of updating path in wireless sensor network, wireless sensor network using the same and mobile system included in wireless sensor network
CN105392146A (en) * 2015-10-22 2016-03-09 桂林理工大学 WSN coverage blind zone detection method based on three-dimensional terrain correction

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102802164A (en) * 2012-08-30 2012-11-28 吴军 Optimization method on basis of coverage control theory and algorithm in wireless sensor network
KR20140076897A (en) * 2012-12-13 2014-06-23 한국과학기술원 Method of constructing path in wireless sensor network, method of updating path in wireless sensor network, wireless sensor network using the same and mobile system included in wireless sensor network
CN105392146A (en) * 2015-10-22 2016-03-09 桂林理工大学 WSN coverage blind zone detection method based on three-dimensional terrain correction

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
方伟: ""基于Voronoi图盲区的无线传感器网络覆盖控制部署策略"", 《物理学报》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107389318A (en) * 2017-08-01 2017-11-24 赵淑娟 A kind of LED light source detection method and system
CN112333730A (en) * 2020-10-16 2021-02-05 广西电网有限责任公司 Method for constructing cellular network coverage map based on adaptive triangulation induced interpolation
CN113613259A (en) * 2021-08-23 2021-11-05 中国地质大学(武汉) Sensor node covering deployment method and system in continuous three-dimensional space
CN113613259B (en) * 2021-08-23 2022-08-30 中国地质大学(武汉) Sensor node covering deployment method and system in continuous three-dimensional space
CN114120565A (en) * 2021-11-26 2022-03-01 燕山大学 Forest fire early warning method

Also Published As

Publication number Publication date
CN106358209B (en) 2019-06-21

Similar Documents

Publication Publication Date Title
CN103401922B (en) Distributed localization apparatus and method based on game method in wireless sensor network
CN106358209A (en) Surface covering method of wireless sensor network based on Delaunay tetrahedron
CN105783810B (en) Engineering earthwork measuring method based on unmanned plane camera work
CN103747419B (en) A kind of indoor orientation method based on signal strength difference and dynamic linear interpolation
CN107172626A (en) A kind of CO2The sensing network node positioning and optimizing method in geological storage region
CN105526925B (en) A kind of regional land subsidence level monitoring net optimum design method
CN105355042B (en) A kind of road network extraction method based on taxi GPS
CN102170697A (en) Indoor positioning method and device
CN106604291B (en) RTK moving reference station site selection method and device
CN109031301A (en) Alpine terrain deformation extracting method based on PSInSAR technology
CN105704652A (en) Method for building and optimizing fingerprint database in WLAN/Bluetooth positioning processes
CN110929390B (en) Numerical simulation detection method based on groundwater hydrogeology test
CN103529427A (en) Target positioning method under random deployment of wireless sensor network
CN102879820A (en) Three-dimensional surface layer model construction method based on triangular grid
CN107909192A (en) The estimating and measuring method and device of heavy metal content in soil
CN106931942A (en) A kind of super high rise building tilt measuring method
CN103491591A (en) Zoning method and node positioning method for complicated zone of wireless sensor network
CN111854692A (en) Method for measuring unmanned aerial vehicle image matching point cloud in road survey
CN106802432A (en) The method for surveying and device of soil layer construction
CN104570070B (en) A kind of method and apparatus for setting up two-dimentional near surface geological model
CN107725044A (en) The method of Sandstone Gas Bearing reservoir producing water ratio prediction based on array induction, laterolog
CN106488526A (en) Mobile multi-hop underwater acoustic network dynamic method for self-locating based on layering
CN102175567A (en) Method for acquiring density of rock fill object by using additive mass method and digital template chart
CN106125044B (en) Offline localization method based on gradient decline
JP2005337746A (en) Electric exploration method

Legal Events

Date Code Title Description
C06 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: 20210517

Address after: No.3, 11th floor, building 6, no.599, shijicheng South Road, Chengdu hi tech Zone, China (Sichuan) pilot Free Trade Zone, Chengdu, Sichuan 610041

Patentee after: Houpu clean energy Co.,Ltd.

Address before: 611731, No. 2006, West Avenue, Chengdu hi tech Zone (West District, Sichuan)

Patentee before: University of Electronic Science and Technology of China

TR01 Transfer of patent right
CP01 Change in the name or title of a patent holder

Address after: No.3, 11th floor, building 6, no.599, shijicheng South Road, Chengdu hi tech Zone, China (Sichuan) pilot Free Trade Zone, Chengdu, Sichuan 610041

Patentee after: Houpu clean energy (Group) Co.,Ltd.

Address before: No.3, 11th floor, building 6, no.599, shijicheng South Road, Chengdu hi tech Zone, China (Sichuan) pilot Free Trade Zone, Chengdu, Sichuan 610041

Patentee before: Houpu clean energy Co.,Ltd.

CP01 Change in the name or title of a patent holder