CN107734510A - A kind of fence covering method of hybrid wireless sensor node - Google Patents
A kind of fence covering method of hybrid wireless sensor node Download PDFInfo
- Publication number
- CN107734510A CN107734510A CN201711067620.7A CN201711067620A CN107734510A CN 107734510 A CN107734510 A CN 107734510A CN 201711067620 A CN201711067620 A CN 201711067620A CN 107734510 A CN107734510 A CN 107734510A
- Authority
- CN
- China
- Prior art keywords
- wireless sensor
- node
- fence
- coverage
- sensor node
- 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.)
- Pending
Links
Classifications
-
- 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
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of fence covering method based on hybrid wireless sensor node, this method introduces Voronoi diagram and divides whole deployment region, according to principle of least square method, benchmark fence line is built using static node, establishes a kind of hybrid network deployment mechanisms collectively constituted by static node and dynamic node.Then influence of the fence covering to mixed node is calculated using Voronoi diagram, from the covering performance of each method of different dimensional comparisons, so as to improve the covering quality to monitored area.The present invention can make up shortcomings and deficiencies existing for the network being all made up of in fence covering static node or dynamic node, and fence covering is efficiently accomplished with less node motion distance and relatively low energy consumption, reach expected covering and require and target.
Description
Technical Field
The invention belongs to the technical field of wireless sensor networks, and particularly relates to a fence coverage method of a hybrid wireless sensor node.
Background
The wireless sensor network is a distributed network which is used for finishing interaction with the physical world by sensing, calculating, processing and storing a large number of sensor nodes deployed in a monitoring area. Fence coverage is one of the research hotspot problems of wireless sensor network coverage control, and research results are widely applied to the fields of military, national security, marine pollution, forest fire, military marching and the like [ WangChao, fangxinggang, wanheng, and the like ] A high-efficiency strong K-fence coverage construction algorithm, a technical report on sensing 2015,28 (2): 227-233; liushuai, li Ke Qing, daizuan, etc. moving sensors k fence coverage research, sensors and microsystems 2014,33 (5): 52-54. Ban DS et al [ Ban D S, wen J, jiang J, et al, construction k-Barrier Coverage in Mobile Wireless Sensor networks.journal of Software,2011,22 (9): 2089-2103 ] studied the problem of omnidirectional Mobile Sensor network k-fence Coverage and proposed an energy-efficient fence Coverage construction algorithm CBIGB. The research area covered by the static fence is fixed, nodes need to be deployed redundantly in order to realize effective coverage, and a traversing path which is not monitored exists; the dynamic algorithm has the advantages of large energy consumption, high complexity, insufficient feasibility, high cost and the like. Coverage performance is one of the key indicators for random deployment of wireless sensor network nodes. From the analysis of documents mastered at present, most coverage mechanisms aim at a network consisting of all static nodes or a network consisting of all dynamic nodes, but in the former, a network coverage area consisting of randomly deployed static nodes is fixed and unchanged, a fence coverage hole may exist in a sensor network, or a crossing path which cannot be monitored exists, or an effective fence is formed for ensuring, the coverage rate is improved, the node deployment density is increased, and excessive nodes are scattered, so that node redundancy and waste are caused; in the latter case, although the crossing path can be monitored, multiple times of moving nodes or multi-step approximate calculation are needed to construct a fence, so that the algorithm complexity is high, the energy consumption is high, the network cost is high, the feasibility is not enough, and the method is not easy to popularize in practical application.
Disclosure of Invention
In order to make up for the defects and shortcomings of a network which is composed of static nodes or dynamic nodes, a Voronoi diagram is introduced to divide the whole deployment area, a reference fence line is constructed by taking the static nodes as the reference according to the principle of a least square method, and a hybrid network deployment mechanism which is composed of the static nodes and the dynamic nodes is provided to realize effective fence coverage.
In order to achieve the purpose, the invention adopts the technical scheme that: a fence coverage method of a hybrid wireless sensor node, the fence coverage method comprising the steps of:
the method comprises the following steps: constructing a reference barrier line: the method comprises the steps that wireless sensor nodes are randomly deployed in a long and narrow strip-shaped area with two horizontal boundaries, fence areas are divided according to a differential thought, each small section of fence area is approximately regarded as a straight line, a reference fence line is selected in the long strip-shaped area, and the position of the reference fence line is calculated by adopting a least square method;
step two: monitoring of coverage holes: in the monitoring area, comparing the maximum value of the distance between each wireless sensor node and each vertex of the Voronoi polygonal area where the wireless sensor node is located with the size of the sensing radius of the wireless sensor node, and judging whether a coverage hole exists or not;
step three: wireless sensor node mobile deployment: randomly scattering wireless sensor nodes, monitoring a cavity area near the reference fence line, and arranging a static node S in the cavity area 1 、S 3 And setting a dynamic node S 2 Respectively as static nodes S 1 、S 3 Using the sensing radius Rs of the wireless sensor node as the radius circle center, respectively taking the tangent points A and C on the two circles, and making a tangentThere is one point B such thatSimultaneous calculationA value of (d);
step four: repairing a coverage hole: according to the vectorThe dynamic nodes are arranged along the lines with different included anglesAnd moving in the direction, and stopping moving when the dynamic node senses that the area on the left side of the coverage hole can be repaired and the area on the right side of the coverage hole can be repaired.
Step five: and judging the coverage hole area again, and repairing the coverage holes according to the first step to the fourth step until all the coverage holes are repaired, thereby achieving the expected coverage requirement.
Further, according to the fence coverage method of the hybrid wireless sensor node, in the first step, a fitting equation of a reference fence line is set asTo make the node as close as possible to the straight line, the value y is measured i And fitting equationDeviation of calculated valueMinimum, solved according to least squares:
substituting the obtained values a and b into a fitting equationAnd obtaining the reference barrier line, wherein x and y are fitting equation variables, a is fitting equation coefficients, b is equation constant, n is the number of static nodes for constructing the reference barrier line, and i is a certain static node.
Further, according to the fence covering method of the hybrid wireless sensor node, in the second step, the maximum distance between the wireless sensor node and each vertex of the Voronoi polygon where the wireless sensor node is located is
Where d (S, V) represents the maximum value of the distance between the wireless sensor node and each vertex of the Voronoi polygon, S represents the wireless sensor node, V represents the Voronoi vertex, and (x, y) represents the coordinates of the wireless sensor node.
Further, according to the fence coverage method of the hybrid wireless sensor node, in the second step, when d (S, V) > Rs, a coverage hole exists in the Voronoi polygon area; when d (S, V) < Rs, there are no coverage holes within the Voronoi polygon area.
Furthermore, according to the fence coverage method of the hybrid wireless sensor node, in the fourth step, when ≈ AS 2 When C =0 degrees, the point A and the point C are superposed, the two static nodes are tangent, and no coverage hole exists; angle crossing AS 2 When C =90 °, a hole exists, and the node S is dynamically connected 2 Along the edgeDirection movementThe coverage hole can be repaired; when vector included angle AS 2 C is an obtuse angle, if the static nodes are covered with intersections, no coverage holes exist.
Further, according to the fence coverage method of the hybrid wireless sensor node of the present invention, in the third step,is solved as follows:
wherein, the angle AS 2 C＝∠S 1 S 2 S 3 +∠S 1 S 2 A+∠S 3 S 2 C。
The beneficial effects of the invention are as follows: aiming at the problem of network fence coverage which is formed by static nodes or dynamic nodes together, the network coverage area which is formed by the static nodes is fixed and invariable, and redundant deployment nodes are needed to realize effective coverage; the network composed of all dynamic nodes is not feasible enough, complexity, energy consumption are high, cost is high, network coverage holes exist in a node deployment area due to the characteristics that a wireless sensor network topological structure is easy to change, the dynamic nodes are deployed randomly and the like, and in order to solve the problem of the coverage holes and effectively cover a monitoring area, a Voronoi-based mixed node dynamic wireless sensor network fence coverage algorithm is provided. The algorithm solves the problem of cavity monitoring and repairing by constructing a reference fence line, and compared with the existing fence coverage algorithm from different dimensions, the effective fence coverage is realized, and the expected coverage requirement and target are achieved.
Drawings
Fig. 1 is a reference fence line.
Fig. 2 is a determination of the distance moved by a node.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings and examples.
A fence covering method of a hybrid wireless sensor node comprises the following steps:
the first step is as follows: reference fence line construction
As shown in fig. 1, n wireless sensor nodes are randomly deployed in an elongated strip-like area with two horizontal boundaries, the length of the elongated strip-like area is L, and the width of the elongated strip-like area is W. In an actual environment, the long strip-shaped area cannot be a straight line, therefore, the fence areas are divided according to a differential idea, each small section of fence area is approximately regarded as a straight line, the position of the reference fence line is obtained by adopting a least square method principle, and as shown in fig. 1, a broken line is a selected reference fence line RBL.
The fitting equation of the reference barrier line is set asTo make the node as close as possible to the straight line, the value y is measured i And fitting equationDeviation of calculated valueMinimum, solved according to the least square method
Substituting the obtained values of a and b into a fitting equationA reference fence line can be obtained. Wherein the number of the reference fence lines is closely related to the k-fence coverage. According to actual needs, strong k-fence coverage or weak k-fence coverage is achieved by constructing a reasonable reference fence line.
The second step is that: monitoring of coverage holes
In the target area, whether a coverage hole exists is judged according to the comparison of the maximum value d (S, V) of the distance between each wireless sensor node and each vertex of the Voronoi polygon (Thiessen polygon) where the wireless sensor node is located and the sensing radius Rs of the wireless sensor node.
The maximum value d (S, V) of the distance between the wireless sensor node and each vertex of the Voronoi polygon where the wireless sensor node is located is as follows:
where d (S, V) represents the maximum value of the distance between the sensor node and each vertex of the Voronoi polygon, S represents the sensor node, V represents the Voronoi vertex, and (x, y) represents the coordinates of the wireless sensor node.
According to the network model, each wireless sensor node can acquire the position information of the wireless sensor node and the wireless sensor nodes adjacent to the wireless sensor node in the Voronoi graph, and through comparing the sizes of d (S, V) and Rs, 3 possible position relations exist between the sensing range of the wireless sensor node and the Voronoi polygon where the wireless sensor node is located, which are respectively as follows: (1) The perception region may have one or more intersections with vertices of the Voronoi polygon; (2) The Voronoi polygon can completely surround the sensing region, otherwise, the Voronoi polygon can be completely included by the sensing region, the situation of coverage holes does not exist in the sensing region, coverage overlapping exists, and nodes are deployed redundantly; (3) When the maximum value d (S, V) of the distances between the centers of the adjacent wireless sensor nodes and the vertex of the Voronoi polygon area is larger than the sensing radius Rs of the wireless sensor nodes, the Voronoi polygon area has a coverage hole.
The third step: wireless sensor node mobile deployment
After the wireless sensor nodes are scattered randomly, whether a hole exists or not is monitored near the reference fence line, and if the hole exists, the hole is repaired through node movement.
The wireless sensor nodes have the defects that the energy stored by the wireless sensor nodes is small, the energy can hardly be supplemented for the wireless sensor nodes, and the like, and in the deployment of a wireless sensor network, the energy consumption must be reduced as much as possible, and the life cycle of the network is prolonged. Therefore, it is necessary to specify the moving direction and the moving distance, and to reduce the moving distance to the maximum and reduce the power consumption.
Determining a direction of node movement by moving a dynamic node to a void region near a reference barrier line to reduce a void area, the void region being provided with a static node S 1 、S 3 And setting a dynamic node S 2 Respectively as static nodes S 1 、S 3 Using the sensing radius Rs of the wireless sensor node as a circle center, respectively taking tangent points A and C on the two circles, and making tangent linesThere is a point B such thatSimultaneous calculationThe value of (c).
Is solved as follows:
wherein, the angle AS 2 C＝∠S 1 S 2 S 3 +∠S 1 S 2 A+∠S 3 S 2 C。
In order to reduce the energy loss of nodes, prolong the life cycle of a network and reduce the moving times and moving distance of wireless sensor nodes participating in repair as much as possible in the moving process, the requirements on coverage are specified as follows: the average moving times of the wireless sensor nodes cannot exceed 1/5 of the total number of the dynamic nodes, the average moving distance cannot exceed 13 meters, and the coverage rate reaches 85% -95%.
The fourth step: and repairing the coverage hole.
For the direction of movement of the dynamic node to the fence hole area, i.e. alongMobile dynamic node S 2 Inevitably, the area of the cavity is reduced, and the cavity can be repaired.
According to the vectorThe included angles are different, and the dynamic nodes are arranged alongMoving in the direction to repair the hole, (1) when ≈ AS 2 C =0 °, point a and point C coincide, the two static nodes are tangent,no voids are present; (2) Angle crossing AS 2 When the temperature of the steel is C =90 ℃,by combining dynamic nodes S 2 Along the edgeDirection movementThe cavity can be repaired. AS shown in fig. 2, angle AS 2 C is an obtuse angle, the point B coincides with the dynamic node S4, and the moving distance of the dynamic node S2 is the maximum
When the vector included angle is AS 2 C =180 DEG, cos & lt AS 2 C takes a minimum value of-1, in which case a vector is definedIs directed to the passing point S 2 The vertical line of the wireless sensor node points to the reference barrier line, and the size of the vertical line is the sensing radius Rs of the wireless sensor node. Dynamic nodal edgesAnd when the direction is moved and the area on the left side of the cavity is sensed to be covered, the direction is moved, and the movement is stopped when the area on the right side of the cavity is sensed to be covered.
The fifth step:
and judging the hole area again, and repairing the holes according to the first step to the fourth step until all the holes are repaired, thereby achieving the expected coverage requirement.
Claims (6)
1. A fence covering method of a hybrid wireless sensor node is characterized by comprising the following steps:
the method comprises the following steps: constructing a reference barrier line: the method comprises the steps that wireless sensor nodes are randomly deployed in a long and narrow strip-shaped area with two horizontal boundaries, fence areas are divided according to a differential thought, each small section of fence area is approximately regarded as a straight line, a reference fence line is selected in the long strip-shaped area, and the position of the reference fence line is calculated by adopting a least square method;
step two: monitoring of coverage holes: in the monitoring area, comparing the maximum value of the distance between each wireless sensor node and each vertex of the Voronoi polygonal area where the wireless sensor node is located with the size of the sensing radius of the wireless sensor node, and judging whether a coverage hole exists or not;
step three: wireless sensor node mobile deployment: monitoring a cavity area near the reference barrier line, and setting a static node S in the cavity area 1 、S 3 And setting a dynamic node S 2 Respectively as static nodes S 1 、S 3 Using the sensing radius Rs of the wireless sensor node as the radius circle center, respectively taking the tangent points A and C on the two circles, and making a tangentThere is a point B such thatSimultaneous calculationA value of (d);
step four: repairing a coverage hole: according to the vectorThe dynamic nodes are arranged along the lines with different included anglesAnd moving the direction, and stopping moving when the dynamic node senses that the area on the left side of the coverage hole can be repaired and the area on the right side of the coverage hole can be repaired.
Step five: and judging the coverage hole area again, and repairing the coverage holes according to the first step to the fourth step until all the coverage holes are repaired, thereby achieving the expected coverage requirement.
2. The fence coverage method of a hybrid wireless sensor node as claimed in claim 1, wherein in the first step, the fitting equation of the reference fence line is set asTo make the node as close as possible to the straight line, the value y is measured i And fitting equationDeviation of calculated valueAnd minimum, solving according to a least square method to obtain:
substituting the obtained values a and b into a fitting equationAnd obtaining the reference barrier line, wherein x and y are fitting equation variables, a is fitting equation coefficients, b is equation constant, n is the number of static nodes for constructing the reference barrier line, and i is a certain static node.
3. The fence covering method for the hybrid wireless sensor node as claimed in claim 1, wherein in the second step, the maximum distance between the wireless sensor node and each vertex of the Voronoi polygon where the wireless sensor node is located is
Where d (S, V) represents the maximum value of the distance between the wireless sensor node and each vertex of the Voronoi polygon, S represents the wireless sensor node, V represents the Voronoi vertex, and (x, y) represents the coordinates of the wireless sensor node.
4. The fence coverage method of the hybrid wireless sensor node according to claim 3, wherein in the second step, when d (S, V) > Rs, a coverage hole exists in the Voronoi polygon area; when d (S, V) < Rs, there are no coverage holes within the Voronoi polygon area.
5. The fence coverage method for hybrid wireless sensor nodes AS claimed in claim 1, wherein in the fourth step, when ═ AS 2 When C =0 degrees, the point A and the point C are superposed, the two static nodes are tangent, and no coverage hole exists; angle AS 2 When C =90 °, a hole exists, and dynamic node S is set 2 Along the edgeDirection movement 1/2The coverage hole can be repaired; when vector included angle AS 2 C is an obtuse angle, if the static nodes are covered with intersections, no coverage holes exist.
6. The method of claim 1, wherein in step three,is solved as follows:
wherein the angle AS 2 C＝∠S 1 S 2 S 3 +∠S 1 S 2 A+∠S 3 S 2 C。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711067620.7A CN107734510A (en) | 2017-11-03 | 2017-11-03 | A kind of fence covering method of hybrid wireless sensor node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711067620.7A CN107734510A (en) | 2017-11-03 | 2017-11-03 | A kind of fence covering method of hybrid wireless sensor node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107734510A true CN107734510A (en) | 2018-02-23 |
Family
ID=61221413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711067620.7A Pending CN107734510A (en) | 2017-11-03 | 2017-11-03 | A kind of fence covering method of hybrid wireless sensor node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107734510A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109803265A (en) * | 2019-01-11 | 2019-05-24 | 沈阳化工大学 | A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy |
| CN111314925A (en) * | 2019-10-22 | 2020-06-19 | 天津大学 | Barrier construction method for dynamic underwater environment |
| CN113179520A (en) * | 2021-03-12 | 2021-07-27 | 杭州电子科技大学 | Method for optimizing service life of K-fence in energy collection mobile sensor network |
| CN115119215A (en) * | 2022-07-04 | 2022-09-27 | 河南科技大学 | Optimal path repairing method for grid coverage hole in natural protected ground |
-
2017
- 2017-11-03 CN CN201711067620.7A patent/CN107734510A/en active Pending
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109803265A (en) * | 2019-01-11 | 2019-05-24 | 沈阳化工大学 | A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy |
| CN111314925A (en) * | 2019-10-22 | 2020-06-19 | 天津大学 | Barrier construction method for dynamic underwater environment |
| CN111314925B (en) * | 2019-10-22 | 2022-03-29 | 天津大学 | Barrier construction method for dynamic underwater environment |
| CN113179520A (en) * | 2021-03-12 | 2021-07-27 | 杭州电子科技大学 | Method for optimizing service life of K-fence in energy collection mobile sensor network |
| CN113179520B (en) * | 2021-03-12 | 2022-05-03 | 杭州电子科技大学 | Method for optimizing service life of K-fence in energy collection mobile sensor network |
| CN115119215A (en) * | 2022-07-04 | 2022-09-27 | 河南科技大学 | Optimal path repairing method for grid coverage hole in natural protected ground |
| CN115119215B (en) * | 2022-07-04 | 2023-09-22 | 河南科技大学 | Optimal path repairing method for fence coverage holes in natural protected area |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107734510A (en) | A kind of fence covering method of hybrid wireless sensor node | |
| Wang et al. | On full-view coverage in camera sensor networks | |
| Wang et al. | Barrier coverage in camera sensor networks | |
| Han et al. | Mobile anchor nodes path planning algorithms using network-density-based clustering in wireless sensor networks | |
| Wang et al. | Barrier coverage in hybrid directional sensor networks | |
| Amutha et al. | A distributed border surveillance (dbs) system for rectangular and circular region of interest with wireless sensor networks in shadowed environments | |
| Purohit et al. | Constructing minimum connected dominating set: Algorithmic approach | |
| CN101951615B (en) | Wireless sensor network node dormant qualification judgment method based on central angle coverage degree | |
| Lei et al. | The research of coverage problems in wireless sensor network | |
| Kim et al. | Maximum lifetime of reinforced barrier-coverage in wireless sensor networks | |
| CN104822152B (en) | A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection | |
| CN104618886B (en) | A kind of wireless sensor network method for early warning for invading danger zone | |
| Liu et al. | Barrier coverage in mobile camera sensor networks with grid-based deployment | |
| Kim et al. | Event-driven partial barriers in wireless sensor networks | |
| CN101316200A (en) | Method for detecting and mending worst case covering of wireless video sensor network | |
| Guo et al. | Enhancing barrier coverage with β quality of monitoring in wireless camera sensor networks | |
| An et al. | Coverage hole problem under sensing topology in flat wireless sensor networks | |
| Tao et al. | A quality-enhancing coverage scheme for camera sensor networks | |
| Baltzis | Distance distribution in convex n-gons: Mathematical framework and wireless networking applications | |
| Dang et al. | An algorithm for hybrid nodes barrier coverage based on voronoi in wireless sensor networks | |
| Huang et al. | A multi-robot patrol strategy for any security degree environment monitoring | |
| Zhao et al. | Energy efficient barrier coverage in hybrid directional sensor networks | |
| Dang et al. | A gap repair algorithm based on clustered barrier coverage in 3d environment | |
| Iliodromitis et al. | A methodology for WSN deployment in 2D large-scale constraining environments, using computational geometry algorithms | |
| Li et al. | On critical density for coverage and connectivity in directional sensor network using continuum percolation |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180223 |
|
| WD01 | Invention patent application deemed withdrawn after publication |