CN104822152A - Target-detection-oriented construction method for weak barrier coverage of wireless sensor network - Google Patents
Target-detection-oriented construction method for weak barrier coverage of wireless sensor network Download PDFInfo
- Publication number
- CN104822152A CN104822152A CN201510240144.9A CN201510240144A CN104822152A CN 104822152 A CN104822152 A CN 104822152A CN 201510240144 A CN201510240144 A CN 201510240144A CN 104822152 A CN104822152 A CN 104822152A
- Authority
- CN
- China
- Prior art keywords
- node
- bunch
- weak
- lower boundary
- fence
- 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
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Devices Affording Protection Of Roads Or Walls For Sound Insulation (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a target-detection-oriented construction method for weak barrier coverage of a wireless sensor network, and the method is used to solve problems of target lose caused by vulnerability in barrier coverage in an existing wireless sensor network. The method comprises: randomly deploying sensor nodes to a region of interest, the nodes reporting self-positions and orientation information to a base station; based on the perception range of the node on a lower edge direction, the base station making the nodes form weak connection clusters, and calculating distances between the clusters; establishing a directed weak barrier diagram, through finding the shortest path of the directed weak barrier diagram, determining whether initial network deployment provides barrier coverage, so as to establish the minimum number of movable nodes (or cost) needed by barrier coverage. Different from a conventional barrier coverage method, the invention provides a model of a directed weak barrier diagram, a problem of the needed minimum number (or cost) of movable sensor nodes is converted to a problem of the shortest path of the diagram. The method is an 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 forms by being deployed in sensor nodes a large amount of in monitored area, a multihop self-organizing network is formed by communication between node, perceptive object information in the perception that can cooperate, acquisition and processing network's coverage area, and send to groups of users interested.Target detection is one of important research content of wireless sensor network, has Military Application and civilian applications prospect widely, especially plays significant role in safety guard field, 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 challenge: first, and static sensor node random placement, in region-of-interest, because static sensor node can not move, cannot ensure to guarantee to provide weak fence to cover; Secondly, cover to build fence, propose and dispose removable sensor node and make up and to build weak fence between static sensor node and cover, but removable sensor node cost is high, how to build that to minimize removable sensor node number while weak fence covers be the significant challenge faced.
Therefore, the present invention devises a kind of weak fence coverage constructing method of optimum, builds weak fence cover with minimum removable sensor node number (cost) with the static sensor node disposed.The proposition of this method builds for disposing removable sensor node the solution that fence covering provides optimum, promotes the further application of wireless sensor network in safety guard field.
Summary of the invention
Object of the present invention is for the problem cannot guaranteeing to provide weak fence to cover after static sensor node random placement in wireless sensor network, a kind of weak fence coverage constructing method based on removable sensor node is provided, guarantees that building weak fence covers with minimum removable sensor node number (cost).
Realize order of the present invention
?technical scheme is:
a kind of weak fence coverage constructing method of wireless sensor network of object-oriented detection, the method comprises following steps:
1) sensor node random placement is to region-of-interest, each node report self ID, geographical position and towards angle information to base station;
2) based on node institute report information, base station calculates the sensing range of each node on lower boundary direction;
3) base station utilizes a Weak link bunch formation algorithm that nodes is formed Weak link bunch, and compute cluster and bunch between distance;
4) based on Weak link bunch and region-of-interest information, oriented weak fence is set up
figure, find described oriented weak fence
in figureshortest path.If shortest path length is 0, network initial deployment provides weak fence to cover; If shortest path length is not 0, the length of shortest path is the minimum removable sensor node number built needed for the covering of weak fence;
5) the removable sensor node needed for deployment, and removable sensor node is moved to oriented weak fence
in figureleak corresponding to shortest path, makes up corresponding leak, builds weak fence and covers.
Described Weak link bunch formation algorithm step is: according to the left side dividing value of node on lower boundary direction, sort to all nodes, left side dividing value is less, and node sequencing is more forward; For collated node set, initialization first Weak link bunch, and using the member of first node as this Weak link bunch, then each node is from left to right checked, if node with bunch sensing range exists and occurs simultaneously, this node is included into current cluster, and the right dividing value of renewal bunch; If there is no occur simultaneously, create a new Weak link bunch, and using first member of this node as new Weak link bunch, continue to check node below; Repeat previous action until check out last node.
Described region-of-interest is a rectangular area, and the length of up-and-down boundary is L, and the length of right boundary is H, and target enters from lower boundary, passes from coboundary.
Described network provides weak fence to cover and refers to, target passes through region-of-interest along the free routing perpendicular to lower boundary, and extremely I haven't seen you for ages detected by a sensor node.
The sensing range of described node on lower boundary direction is the projection of node perceived region on lower boundary direction.Make i generation
table oneindividual node, lower boundary place axis of orientation is x-axis,
for the left margin that node i projects on lower boundary direction,
for the right margin that node i projects on lower boundary direction, therefore, the sensing range of node on lower boundary direction is
Described Weak link bunch is made up of node, and the sensing range on its lower boundary direction, place is the union of the sensing range of each node on lower boundary direction in its bunch, and sensing range is continuous print.
Described bunch and bunch between distance refer to that the left side dividing value of Weak link on right side bunch deducts the right dividing value of Weak link in left side bunch.
Described oriented weak fence
figureit is an omnidirectional
figure, represent left margin and the right margin of region-of-interest respectively with summit s and t, each Weak link bunch corresponds to
in figure, all there is a border between any two summits in a summit, the weight on border is the minimum removable sensor node number of connection needed for two summits on lower boundary direction.
Described forms Weak link bunch by nodes, and concrete steps are: first carrying out sequence to node is (a, b, c, d, e, f, g, h, i, j, k, l), then checks each node, initialization bunch wc
1, and using node a as a bunch wc
1first member, the sensing range due to node b and node a exists and occurs simultaneously on lower boundary direction, and node b is included into a bunch wc
1, upgrade bunch wc
1right margin, continue check next node, same, node c and node d is included into a bunch wc
1, bunch wc
1right margin also constantly update, check node e, node e and bunch wc
1there is not common factor in lower boundary direction, therefore a newly-built bunch of wc
2, and using node e as a bunch wc
2first member, continue to check node below, to the last a node 1 is inspected, and finally obtains two Weak link bunch wc
1={ a, b, c, d} and wc
2={ e, f, g, h, i, j, k, l}.
Leak on described shortest path refers to that length on shortest path is greater than the leak between the Weak link corresponding to limit bunch of 0 and Weak link bunch, the leak between the leak between region left margin and Weak link bunch and Weak link bunch and region right margin.
Compared to the prior art, the beneficial effect had is in the present invention:
1) utilize removable sensor node to make up static sensor node leak, can guarantee that building weak fence covers.
2) propose Weak link bunch formation algorithm, its computation complexity is low, is applicable to massive wireless sensor.
3) oriented weak fence is proposed
figureconcept, the removable sensor node problem of minimal amount is converted into
figureshortest route problem, have found and make up the optimal solution that fence covers required removable sensor node.
4) compared with conventional art, the weak fence covering algorithm of wireless sensor network of object-oriented detection of the present invention, effectively can judge whether network initial deployment provides weak fence to cover, and utilize the removable sensor node of minimal amount (cost) to build fence with the static sensor node to have disposed to cover, minimize the removable sensor node cost needed for the weak fence covering of structure.
Accompanying drawing explanation
fig. 1for the weak fence of wireless sensor network covers signal
figure.
fig. 2for the signal of initial deployment network node
figure.
fig. 3for the Weak link bunch signal formed based on node deployment
figure.
fig. 4for the oriented weak fence based on Weak link bunch structure
diagrammeaning
figure.
Embodiment
Below in conjunction with
accompanying drawingwith embodiment, the present invention is described further.
Embodiment
Now combine
accompanying drawing 1, 2,3 and 4 illustrate specific embodiments of the invention be:
1) the weak fence of wireless sensor network covers signal
figure
fig. 1be depicted as the weak fence of wireless sensor network and cover signal
figure.The region-of-interest that rectangular area representation node is deployed in.The orthogonal of represented by dotted arrows target passes through path, and this passes through path orthogonal in up-and-down boundary, enters from lower boundary, and coboundary passes.The sensing region of fan-shaped representation node.Grayed-out nodes forms a weak fence, ensures to cover the weak fence of region-of-interest, can detect that any one passes through along orthogonal the target that region-of-interest is passed through in path.
2) base station utilizes a Weak link bunch formation algorithm that nodes is formed Weak link bunch:
fig. 2be depicted as initial deployment network node situation.Base station calculates the sensing range of each node on lower boundary direction, and based on a Weak link bunch formation algorithm, node is formed Weak link bunch.Wherein, first a Weak link bunch formation algorithm sorts to node, and order is (a, b, c, d, e, f, g, h, i, j, k, l), then checks each node.Initialization bunch wc
1, and using node a as a bunch wc
1first member, the sensing range due to node b and node a exists and occurs simultaneously on lower boundary direction, and node b is included into a bunch wc
1, upgrade bunch wc
1right margin, continue check next node, same, node c and node d is included into a bunch wc
1, bunch wc
1right margin also constantly update.In time checking node e, node e and bunch wc
1there is not common factor in lower boundary direction, therefore a newly-built bunch of wc
2, and using node e as a bunch wc
2first member, continue to check node below, to the last a node 1 is inspected.
as Fig. 3shown in, we can obtain two Weak link bunch wc
1={ a, b, c, d} and wc
2={ e, f, g, h, i, j, k, l}.
3) based on Weak link bunch and region-of-interest information, oriented weak fence is set up
figure, find
in figureshortest path:
The oriented weak fence set up
figure is as Fig. 4shown in.With the left margin of behalf region-of-interest, t represents the right margin of region-of-interest, two Weak link bunch wc
1with a bunch wc
2correspond respectively to a respective summit.A limit is all there is, the number of the minimum removable sensor node of weight needed for connection two summits on limit between any two summits.Such as, bunch wc
1with a bunch wc
2between limit weight be 1, be because connect bunch wc
1with a bunch wc
2required minimum removable sensor node number is 1, in like manner, connects bunch wc
17 removable sensor nodes are at least needed with t.It should be noted that s and bunch wc
1between limit weight be 0, this is because bunch wc
1crossing with left margin, without the need to disposing removable sensor node.
Utilize
figuredijkstra's algorithm classical in opinion can find oriented weak fence
figureshortest path be s--wc
1--wc
2--t, path is 2.Therefore, network initial deployment does not provide weak fence to cover, and at least needs extra deployment two removable sensor nodes could build weak fence and covers.
4) the removable node needed for deployment, and removable node motion is arrived
in figureleak corresponding to shortest path, makes up corresponding leak, builds weak fence and covers.
?
fig. 4in, shortest path refers to the leak of correspondence: bunch wc
1with a bunch wc
2between leak, bunch wc
2and the leak between t.Two leaks only need 1 removable sensor node to be made up respectively.Therefore, random placement two removable sensor nodes, wherein 1 node motion is to a bunch wc
1with a bunch wc
2between, another node motion is to wc
2and between t, thus build the covering of weak fence.
Above-mentioned specific embodiment is used for explaining the present invention, instead of limits the invention, in spirit of the present invention and
claimprotection range in, to not inventing any amendment and change made, all fall into protection scope of the present invention.
Claims (10)
1. the weak fence coverage constructing method of the wireless sensor network of object-oriented detection, is characterized in that comprising following steps:
1) sensor node random placement is to region-of-interest, each node report self ID, geographical position and towards angle information to base station;
2) based on node institute report information, base station calculates the sensing range of each node on lower boundary direction;
3) base station utilizes a Weak link bunch formation algorithm that nodes is formed Weak link bunch, and compute cluster and bunch between distance;
4) based on Weak link bunch and region-of-interest information, set up oriented weak fence diagrams, find the shortest path in described oriented weak fence diagrams; If shortest path length is 0, network initial deployment provides weak fence to cover; If shortest path length is not 0, the length of shortest path is the minimum removable sensor node number built needed for the covering of weak fence;
5) the removable sensor node needed for deployment, and removable sensor node is moved to the leak in oriented weak fence diagrams corresponding to shortest path, make up corresponding leak, build weak fence and cover.
2. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: step 3) described in the step of Weak link bunch formation algorithm be: according to the left side dividing value of node on lower boundary direction, all nodes are sorted, left side dividing value is less, and node sequencing is more forward; For collated node set, initialization first Weak link bunch, and using the member of first node as this Weak link bunch, then each node is from left to right checked, if node with bunch sensing range exists and occurs simultaneously, this node is included into current cluster, and the right dividing value of renewal bunch; If there is no occur simultaneously, create a new Weak link bunch, and using first member of this node as new Weak link bunch, continue to check node below; Repeat previous action until check out last node.
3. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, is characterized in that: step 3) described in bunch and bunch between distance refer to that the left side dividing value of Weak link on right side bunch deducts the right dividing value of Weak link in left side bunch.
4. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: step 1) described in region-of-interest be a rectangular area, the length of up-and-down boundary is L, the length of right boundary is H, target enters from lower boundary, passes from coboundary.
5. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: step 2) described in the sensing range of sensor node on lower boundary direction be the projection of node perceived region on lower boundary direction, i is made to represent a node, lower boundary place axis of orientation is x-axis
for the left margin that node i projects on lower boundary direction,
for the right margin that node i projects on lower boundary direction, the sensing range of node on lower boundary direction is
6. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: step 4) described in network provide weak fence cover refer to, target passes through region-of-interest along the free routing perpendicular to lower boundary, and extremely I haven't seen you for ages detected by a sensor node.
7. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: step 4) described in Weak link bunch be made up of each node, sensing range on its lower boundary direction, place is the union of the sensing range of each node on lower boundary direction in its bunch, and sensing range is continuous print.
8. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: step 4) described in oriented weak fence diagrams be omnidirectional figure, left margin and the right margin of region-of-interest is represented respectively with summit s and t, each Weak link bunch corresponds to a summit in figure, all there is a border between any two summits, the weight on border is the minimum removable sensor node number of connection needed for two summits on lower boundary direction.
9. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: described forms Weak link bunch by nodes, concrete steps are: first carrying out sequence to node is (a, b, c, d, e, f, g, h, i, j, k, l), then check each node, initialization bunch wc
1, and using node a as a bunch wc
1first member, the sensing range due to node b and node a exists and occurs simultaneously on lower boundary direction, and node b is included into a bunch wc
1, upgrade bunch wc
1right margin, continue check next node, same, node c and node d is included into a bunch wc
1, bunch wc
1right margin also constantly update, check node e, node e and bunch wc
1there is not common factor in lower boundary direction, therefore a newly-built bunch of wc
2, and using node e as a bunch wc
2first member, continue to check node below, to the last a node 1 is inspected, and finally obtains two Weak link bunch wc
1={ a, b, c, d} and wc
2={ e, f, g, h, i, j, k, l}.
10. the weak fence coverage constructing method of wireless sensor network of a kind of object-oriented detection as claimed in claim 1, it is characterized in that: the leak that described shortest path is corresponding refers to that the length of shortest path is greater than the leak between the Weak link corresponding to limit bunch of 0 and Weak link bunch, leak between region left margin and Weak link bunch, and the leak between Weak link bunch and region right margin.
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 true CN104822152A (en) | 2015-08-05 |
| CN104822152B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110291213A (en) * | 2017-01-09 | 2019-09-27 | 力克公司 | Method for modifying the cutting track of the estimated component being cut into from 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 |
| CN115119215A (en) * | 2022-07-04 | 2022-09-27 | 河南科技大学 | Optimal path repairing method for grid coverage hole in natural protected ground |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110156957A1 (en) * | 2009-12-31 | 2011-06-30 | Waite James W | Precise positioning using a distributed sensor network |
| CN102497642A (en) * | 2011-12-23 | 2012-06-13 | 湖南大学 | Weak fence coverage constructing method for moveable heterogeneous sensor network |
-
2015
- 2015-05-11 CN CN201510240144.9A patent/CN104822152B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110156957A1 (en) * | 2009-12-31 | 2011-06-30 | Waite James W | Precise positioning using a distributed sensor network |
| CN102497642A (en) * | 2011-12-23 | 2012-06-13 | 湖南大学 | Weak fence coverage constructing method for moveable heterogeneous sensor network |
Non-Patent Citations (3)
| Title |
|---|
| DAN TAO.ETC: "Strong barrier coverage in directional sensor networks", 《COMPUTER COMMUNICATIONS》 * |
| 罗卿: "《中国博士学位论文全文数据库》", 15 June 2013 * |
| 陶丹，毛续飞，吴昊: "有向传感网络中移动目标栅栏覆盖算法", 《北京邮电大学学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110291213A (en) * | 2017-01-09 | 2019-09-27 | 力克公司 | Method for modifying the cutting track of the estimated component being cut into from flexible material |
| CN110291213B (en) * | 2017-01-09 | 2021-08-24 | 力克公司 | Method for modifying the cutting trajectory of a part intended to be cut out of 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 |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104822152B (en) | 2018-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104796916A (en) | Establishment method of wireless sensor network high barrier coverage for target detection | |
| Barooah et al. | Cut detection in wireless sensor networks | |
| CN104822152A (en) | Target-detection-oriented construction method for weak barrier coverage of wireless sensor network | |
| CN102665277B (en) | A kind of method that wireless sensor network interior joint is positioned | |
| CN102158988B (en) | Method for judging strong barrier coverage of directed sensor network | |
| CN103491591B (en) | Zoning method and node positioning method for complicated zone of wireless sensor network | |
| Gupta et al. | Coverage problem in wireless sensor networks: A survey | |
| CN101772013B (en) | Voting mechanism based WSN anti-attack node positioning method | |
| CN106257301A (en) | Distributed space time correlation model trace tracking method based on statistical inference | |
| CN102547763B (en) | Control method for wireless network topology | |
| Saipulla et al. | Barrier coverage with airdropped wireless sensors | |
| CN101917777B (en) | Wireless sensor network node sleep qualification judging method based on cooperation between neighboring nodes | |
| Maksimović | Evaluating the optimal sensor placement for smoke detection | |
| Ghosh et al. | Distributed hole detection algorithms for wireless sensor networks | |
| Alsalih et al. | Distributed voronoi diagram computation in wireless sensor networks. | |
| Liu et al. | Obstacle-avoidance minimal exposure path for heterogeneous wireless sensor networks | |
| Xu et al. | A distributed barrier coverage mechanism for supporting full view in wireless visual sensor networks | |
| Kim et al. | Maximum lifetime of reinforced barrier-coverage in wireless sensor networks | |
| Guo et al. | Enhancing barrier coverage with β quality of monitoring in wireless camera sensor networks | |
| Das et al. | Computational geometry based coverage hole-detection and hole-area estimation in wireless sensor network | |
| CN104363612A (en) | Partitioned wireless sensor network repair method based on mobile relay scheduling | |
| Moustafa et al. | Self-Identification of Boundary's nodes in wireless sensor networks | |
| CN103546966A (en) | Node positioning method of wireless sensor based on field environment | |
| Wang | Three-dimensional wireless sensor networks: geometric approaches for topology and routing design | |
| Sabri et al. | Forest fire detection and localization with 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 |