CN104822152B - A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection - Google Patents
A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection Download PDFInfo
- Publication number
- CN104822152B CN104822152B CN201510240144.9A CN201510240144A CN104822152B CN 104822152 B CN104822152 B CN 104822152B CN 201510240144 A CN201510240144 A CN 201510240144A CN 104822152 B CN104822152 B CN 104822152B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- weak
- fence
- lower boundary
- 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
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
Abstract
The invention discloses a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection, to solve the problem of fence covers there are loophole, causes target to be lost in current wireless sensor network.This method includes：Random placement sensor node reports the position of oneself and towards angle information to base station to interest region, node；Sensing range based on node on lower boundary direction, node is formed Weak link cluster by base station, and calculates the distance between cluster and cluster；Oriented weak fence diagrams are established, by searching for the shortest path of oriented weak fence diagrams, judge whether initial network deployment provides fence covering, and at least removable interstitial content (or cost) needed for structure fence covering.Different from traditional fence covering method, the present invention proposes the model of oriented weak fence diagrams, and the removable sensor node problem of required minimal amount (cost) is converted into the shortest route problem of figure, is a kind of optimal solution.
Description
Technical field
The present invention relates to a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection, belong to wireless
Sensor network field.
Background technology
Wireless sensor network is formed by being deployed in substantial amounts of sensor node in monitoring region, passes through channel radio between node
Letter mode forms a multihop self-organizing network, the perception pair in the perception that can be cooperated, collection and processing network's coverage area
Image information, and it is sent to groups of users interested.Target detection is one of important research content of wireless sensor network, is had
Extensive Military Application and civilian applications prospect, especially play significant role in safety guard field, such as battlefield monitoring, border
Defence, airport security defence, nuclear leakage monitoring etc..
The weak Barrier Coverage Problem of wireless sensor network of object-oriented detection is faced with multiple challenges：First, it is static to pass
Sensor node random placement is into interest region, since static sensor node is immovable, can not ensure to ensure to provide weak grid
Column covers；Secondly, covered to build fence, it is proposed that the removable sensor node of deployment makes up structure between static sensor node
Weak fence covering is built, but removable sensor node is of high cost, is minimized while how building weak fence covering removable
Sensor node number is the significant challenge faced.
Therefore, the present invention devises a kind of optimal weak fence coverage constructing method, with minimum removable sensor section
The static sensor node counted out (cost) and disposed builds weak fence and covers.The it is proposed of this method will be that deployment is removable
Sensor node structure fence covering provides optimal solution, promote wireless sensor network safety guard field into
One step application.
The content of the invention
The purpose of the present invention is directed in wireless sensor network can not ensure to provide after static sensor node random placement
The problem of weak fence covering, there is provided a kind of weak fence coverage constructing method based on removable sensor node, can with minimum
Mobile sensor node number (cost) ensures to build weak fence covering.
The technical solution for realizing the object of the invention is：A kind of weak fence covering of the wireless sensor network of object-oriented detection
Construction method, this method comprise the following steps：
1) sensor node random placement is to interest region, and each node is reported the ID of itself, geographical location and believed towards angle
Cease to base station；
2) node institute report information is based on, base station calculates sensing range of each node on lower boundary direction；
3) nodes are formed Weak link cluster by base station using Weak link cluster formation algorithm, and are calculated between cluster and cluster
Distance；
4) Weak link cluster and interest area information are based on, establishes oriented weak fence diagrams, finds the oriented weak fence diagrams
In shortest path.If shortest path length is 0, network initial deployment provides weak fence covering；If shortest path length is not
0, the length of shortest path is at least removable sensor node number built needed for weak fence covering；
5) the removable sensor node needed for deployment, and removable sensor node is moved in oriented weak fence diagrams
Loophole corresponding to shortest path, makes up corresponding loophole, builds weak fence covering.
The Weak link cluster formation algorithm step is：According to left boundary value of the node on lower boundary direction, to all
Node is ranked up, and left boundary value is smaller, and node sequencing is more forward；It is weak for collated node set, initialization first
Connect cluster, then the and member using first node as this Weak link cluster from left to right checks each node, if node with
The node is included into current cluster, and update the right boundary value of cluster by the sensing range of cluster there are intersection；If there is no intersection, wound
A new Weak link cluster, and first member using the node as new Weak link cluster are built, continues checking for node below；
Previous action is repeated until checking out last node.
The interest region is a rectangular area, and the length of up-and-down boundary is L, and the length of right boundary is H, target from
Lower boundary enters, and is pierced by from coboundary.
The network provides weak fence covering and refers to that target passes through region of interest along the free routing perpendicular to lower boundary
Domain, at least can be detected by a sensor node.
Sensing range of the node on lower boundary direction is projection of the node perceived region on lower boundary direction.
I is made to represent a node, axis of orientation where lower boundary is x-axis,The left margin projected for node i on lower boundary direction,
The right margin projected for node i on lower boundary direction, therefore, sensing range of the node on lower boundary direction is
The Weak link cluster is made of node, and the sensing range where it on lower boundary direction is each node in its cluster
The union of sensing range on lower boundary direction, and sensing range is continuous.
The distance between the cluster and cluster refer to that the left boundary value in the Weak link cluster on right side subtracts the weak company in left side
Connect the right boundary value of cluster.
The oriented weak fence diagrams are omnidirectional's figures, represent left margin and the right side in interest region respectively with vertex s and t
Border, each Weak link cluster correspond to a vertex in figure, and there are a line circle, the weight on border between any two vertex
At least removable sensor node number needed for two vertex is as connected up in lower boundary side.
Described forms Weak link cluster by nodes, concretely comprises the following steps：Node is ranked up first for (a, b, c,
D, e, f, g, h, i, j, k, l), then check each node, initialization cluster wc1, and using node a as cluster wc1First into
Member, due to the sensing range of node b and node a, there are intersection, node b on lower boundary direction to be included into cluster wc1, renewal cluster wc1
Right margin, next node is continued checking for, likewise, node c and node d are included into cluster wc1, cluster wc1Right margin it is also continuous
Renewal, checks node e, node e and cluster wc1Intersection is not present on lower boundary direction, therefore creates a cluster wc2, and by node
E is as cluster wc2First member, continue checking for node below, to the last a node l is inspected, and is finally obtained
Two Weak link cluster wc1={ a, b, c, d } and wc2={ e, f, g, h, i, j, k, l }.
Loophole on the shortest path refer to Weak link cluster corresponding to the side of length on shortest path more than 0 with it is weak
The loophole between cluster is connected, between the loophole and Weak link cluster and region right margin between region left margin and Weak link cluster
Loophole.
Compared to the prior art the present invention, has an advantageous effect in that：
1) static sensor node loophole is made up using removable sensor node, it can be ensured that build weak fence covering.
2) Weak link cluster formation algorithm is proposed, its computation complexity is low, suitable for massive wireless sensor.
3) concept of oriented weak fence diagrams is proposed, the removable sensor node problem of minimal amount is converted into figure
Shortest route problem, have found the optimal solution for making up and sensor node being moved needed for fence covering.
4) compared with conventional art, the weak fence covering algorithm of wireless sensor network of object-oriented detection of the invention,
It can effectively judge whether network initial deployment provides weak fence covering, and utilize the removable sensing of minimal amount (cost)
Device node and the static sensor node structure fence covering disposed, minimize the removable biography built needed for weak fence covering
Sensor node cost.
Brief description of the drawings
Fig. 1 covers schematic diagram for the weak fence of wireless sensor network.
Fig. 2 is initial deployment network node schematic diagram.
Fig. 3 is the Weak link cluster schematic diagram formed based on node deployment.
Fig. 4 is the oriented weak fence diagrams schematic diagram based on Weak link cluster structure.
Embodiment
The present invention is described further with reference to the accompanying drawings and examples.
Embodiment
Illustrate that specific embodiment of the invention is in conjunction with attached drawing 1,2,3 and 4：
1) the weak fence covering schematic diagram of wireless sensor network
Fig. 1 show the weak fence covering schematic diagram of wireless sensor network.Rectangular area represent node be deployed in it is emerging
Interesting region.Dotted line represents the orthogonal of target and passes through path, this passes through path orthogonal in up-and-down boundary, enters from lower boundary, top
Boundary is pierced by.Sector represents the sensing region of node.Grayed-out nodes form a weak fence, ensure to cover the weak fence in interest region
Lid, is able to detect that any one along the orthogonal target for passing through path traversal interest region.
2) nodes are formed Weak link cluster by base station using Weak link cluster formation algorithm：
Fig. 2 show initial deployment network node situation.Base station calculates perception model of each node on lower boundary direction
Enclose, and node is formed by Weak link cluster based on Weak link cluster formation algorithm.Wherein, Weak link cluster formation algorithm first to node into
Row sequence, is sequentially (a, b, c, d, e, f, g, h, i, j, k, l), then checks each node.Initialize cluster wc1, and by node a
As cluster wc1First member, due to the sensing range of node b and node a, there are intersection, node b on lower boundary direction
It is included into cluster wc1, renewal cluster wc1Right margin, next node is continued checking for, likewise, node c and node d are included into cluster
wc1, cluster wc1Right margin also constantly update.When node e is checked, node e and cluster wc1It is not present on lower boundary direction
Intersection, therefore create a cluster wc2, and using node e as cluster wc2First member, continue checking for node below, until
Last node l is inspected.As shown in figure 3, we can obtain two Weak link cluster wc1={ a, b, c, d } and wc2=
{e,f,g,h,i,j,k,l}。
3) Weak link cluster and interest area information are based on, oriented weak fence diagrams is established, finds the shortest path in figure：
The oriented weak fence diagrams established are as shown in Figure 4.With the left margin in behalf interest region, t represents the right side in interest region
Border, two Weak link cluster wc1With cluster wc2Correspond respectively to a respective vertex.There are one between any two vertex
Side, the weight on side is the minimum number for moving sensor node needed for two vertex of connection.Such as cluster wc1With cluster wc2It
Between side right weight be 1, be because connection cluster wc1With cluster wc2Required at least removable sensor node number is 1, similarly, even
Meet cluster wc17 removable sensor nodes are at least needed with t.It should be noted that s and cluster wc1Between side right weight be 0, this
It is because cluster wc1Intersect with left margin, without disposing removable sensor node.
The shortest path that oriented weak fence diagrams can be found using dijkstra's algorithm classical in graph theory is s--wc1--
wc2-- t, path length 2.Therefore, network initial deployment does not provide weak fence covering, at least needs additionally deployment two removable
Dynamic sensor node could build weak fence covering.
4) the removable node needed for deployment, and the loophole by removable node motion into figure corresponding to shortest path,
Corresponding loophole is made up, builds weak fence covering.
In Fig. 4, shortest path refers to corresponding loophole：Cluster wc1With cluster wc2Between loophole, cluster wc2Between t
Loophole.Two loopholes only need 1 removable sensor node to be compensated for respectively.Therefore, random placement two is removable
Sensor node, wherein 1 node motion is to cluster wc1With cluster wc2Between, another node motion to wc2Between t, so that structure
Build weak fence covering.
Above-mentioned specific embodiment is used for explaining the present invention, rather than limits the invention, the present invention spirit and
In scope of the claims, to not inventing any modifications and changes made, protection scope of the present invention is both fallen within.
Claims (7)
1. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection, it is characterised in that include following step
Suddenly：
1) sensor node random placement is to interest region, each node report itself ID, geographical location and towards angle information to
Base station；
2) node institute report information is based on, base station calculates sensing range of each node on lower boundary direction；
3) base station using Weak link cluster formation algorithm by nodes form Weak link cluster, and calculate between cluster and cluster away from
From；
4) Weak link cluster and interest area information are based on, establishes oriented weak fence diagrams, is found in the oriented weak fence diagrams
Shortest path；If shortest path length is 0, network initial deployment provides weak fence covering；If shortest path length is not 0, most
The length of short path is at least removable sensor node number built needed for weak fence covering；
5) the removable sensor node needed for deployment, and removable sensor node is moved to most short in oriented weak fence diagrams
Loophole corresponding to path, makes up corresponding loophole, builds weak fence covering；
Wherein, the step of Weak link cluster formation algorithm described in step 3) is：According to the left side of the node on lower boundary direction
Dividing value, is ranked up all nodes, and left boundary value is smaller, and node sequencing is more forward；For collated node set, initially
Change first Weak link cluster, and the member using first node as this Weak link cluster, then from left to right check each node,
If the node is included into current cluster, and update the right boundary value of cluster by the sensing range of node and cluster there are intersection；If there is no
Intersection, creates a new Weak link cluster, and first member using the node as new Weak link cluster, continue checking for behind
Node；Previous action is repeated until checking out last node；
Weak link cluster described in step 4) is made of each node, and the sensing range where it on lower boundary direction is every in its cluster
The union of sensing range of a node on lower boundary direction, and sensing range is continuous；
Described forms Weak link cluster by nodes, concretely comprises the following steps：Node is ranked up first for (a, b, c, d, e,
F, g, h, i, j, k, l), then check each node, initialization cluster wc1, and using node a as cluster wc1First member, by
In the sensing range of node b and node a, there are intersection, node b on lower boundary direction to be included into cluster wc1, renewal cluster wc1The right side
Border, continues checking for next node, likewise, node c and node d is included into cluster wc1, cluster wc1Right margin also constantly more
Newly, node e, node e and cluster wc are checked1Intersection is not present on lower boundary direction, therefore creates a cluster wc2, and by node e
As cluster wc2First member, continue checking for node below, to the last a node l is inspected, and finally obtains two
A Weak link cluster wc1={ a, b, c, d } and wc2={ e, f, g, h, i, j, k, l }.
2. a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection as claimed in claim 1, its
It is characterized in that：The distance between cluster and cluster described in step 3) refer to that the left boundary value of the Weak link cluster on right side is subtracted on a left side
The right boundary value of the Weak link cluster of side.
3. a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection as claimed in claim 1, its
It is characterized in that：Interest region described in step 1) is a rectangular area, and the length of up-and-down boundary is L, the length of right boundary
For H, target enters from lower boundary, is pierced by from coboundary.
4. a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection as claimed in claim 1, its
It is characterized in that：Sensing range of the sensor node on lower boundary direction described in step 2) is node perceived region following
Projection on boundary direction, makes i represent a node, and axis of orientation where lower boundary is x-axis,It is node i on lower boundary direction
The left margin of projection,The right margin projected for node i on lower boundary direction, sensing range of the node on lower boundary direction
For
5. a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection as claimed in claim 1, its
It is characterized in that：Network described in step 4) provides weak fence covering and refers to, target is along the free routing perpendicular to lower boundary
Interest region is passed through, at least can be detected by a sensor node.
6. a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection as claimed in claim 1, its
It is characterized in that：Oriented weak fence diagrams described in step 4) are omnidirectional's figures, and interest region is represented respectively with vertex s and t
Left margin and right margin, each Weak link cluster correspond to a vertex in figure, there are a line circle between any two vertex,
The weight on border is at least removable sensor node number connected up in lower boundary side needed for two vertex.
7. a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection as claimed in claim 1, its
It is characterized in that：The corresponding loophole of the shortest path refers to the Weak link cluster corresponding to side of the length more than 0 of shortest path
With the loophole between Weak link cluster, the loophole between region left margin and Weak link cluster, and Weak link cluster and region right margin
Between loophole.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510240144.9A CN104822152B (en) | 2015-05-11 | 2015-05-11 | A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510240144.9A CN104822152B (en) | 2015-05-11 | 2015-05-11 | A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104822152A CN104822152A (en) | 2015-08-05 |
| CN104822152B true CN104822152B (en) | 2018-05-01 |
Family
ID=53732291
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510240144.9A Active CN104822152B (en) | 2015-05-11 | 2015-05-11 | A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104822152B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR3061669B1 (en) * | 2017-01-09 | 2019-05-31 | Lectra | METHOD OF MODIFYING THE CUTTING PATH OF WORKPIECES INTENDED TO BE CUTTED IN A FLEXIBLE MATERIAL |
| CN110418352A (en) * | 2019-07-17 | 2019-11-05 | 浙江工业大学 | A kind of weak fence gap restorative procedure being deployed in aquatic environment |
| CN110972142A (en) * | 2019-12-23 | 2020-04-07 | 中通服咨询设计研究院有限公司 | 5G network weak coverage area locking and adjusting method based on GNG mode |
| CN115119215B (en) * | 2022-07-04 | 2023-09-22 | 河南科技大学 | Optimal path repairing method for fence coverage holes in natural protected area |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102497642A (en) * | 2011-12-23 | 2012-06-13 | 湖南大学 | Weak fence coverage constructing method for moveable heterogeneous sensor network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9151822B2 (en) * | 2009-12-31 | 2015-10-06 | Optimal Ranging, Inc. | Precise positioning using a distributed sensor network |
-
2015
- 2015-05-11 CN CN201510240144.9A patent/CN104822152B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102497642A (en) * | 2011-12-23 | 2012-06-13 | 湖南大学 | Weak fence coverage constructing method for moveable heterogeneous sensor network |
Non-Patent Citations (2)
| Title |
|---|
| Strong barrier coverage in directional sensor networks;Dan Tao.etc;《Computer Communications》;20120122;第895-905页 * |
| 有向传感网络中移动目标栅栏覆盖算法;陶丹，毛续飞，吴昊;《北京邮电大学学报》;20131031;第6-9页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104822152A (en) | 2015-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104796916B (en) | A kind of wireless sensor network strong fence coverage constructing method of object-oriented detection | |
| CN104822152B (en) | A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection | |
| He et al. | Curve-based deployment for barrier coverage in wireless sensor networks | |
| Al-Dhief et al. | A review of forest fire surveillance technologies: Mobile ad-hoc network routing protocols perspective | |
| CN102158988B (en) | Method for judging strong barrier coverage of directed sensor network | |
| CN108241369B (en) | Method and device for avoiding static obstacle for robot | |
| Rajasegarar et al. | Ellipsoidal neighbourhood outlier factor for distributed anomaly detection in resource constrained networks | |
| CN109035641B (en) | Dynamic optimization and visualization method for fire evacuation path considering smoke influence | |
| Feng et al. | Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot | |
| CN103716587B (en) | Video frequency tracking method based on GIS network analysis and buffer zone analysis | |
| Liu et al. | Obstacle-avoidance minimal exposure path for heterogeneous wireless sensor networks | |
| US20180254974A1 (en) | Hierarchical graph-based path search method and path search method in internet of things environment using same | |
| CN101917777A (en) | Wireless sensor network node sleep qualification judging method based on cooperation between neighboring nodes | |
| Kuawattanaphan et al. | A novel heterogeneous Wireless Sensor Node deployment algorithm with parameter-free configuration | |
| Guo et al. | Enhancing barrier coverage with β quality of monitoring in wireless camera sensor networks | |
| CN101316200B (en) | Method for detecting and mending worst case covering of wireless video sensor network | |
| Xu et al. | A distributed barrier coverage mechanism for supporting full view in wireless visual sensor networks | |
| Keerthana et al. | Enhancing the robustness and security against various attacks in a scale: Free network | |
| Das et al. | Computational geometry based coverage hole-detection and hole-area estimation in wireless sensor network | |
| Vieira et al. | An autonomous Wireless Networked Robotics System for backbone deployment in highly-obstructed environments | |
| Wang | Three-dimensional wireless sensor networks: geometric approaches for topology and routing design | |
| Zhou et al. | Improving mobile target detection on randomly deployed sensor networks | |
| Moustafa et al. | Self-Identification of Boundary's nodes in wireless sensor networks | |
| CN108334071A (en) | The method that multi-robot system collisionless reaches target location | |
| Ranga et al. | Restoration of lost connectivity of partitioned wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |