CN107770784A - The fence covering method of underwater sensor network based on adjacency matrix - Google Patents
The fence covering method of underwater sensor network based on adjacency matrix Download PDFInfo
- Publication number
- CN107770784A CN107770784A CN201710997617.9A CN201710997617A CN107770784A CN 107770784 A CN107770784 A CN 107770784A CN 201710997617 A CN201710997617 A CN 201710997617A CN 107770784 A CN107770784 A CN 107770784A
- Authority
- CN
- China
- Prior art keywords
- fence
- sensor
- node
- sensor network
- adjacency matrix
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- 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 provides a kind of fence covering method of the underwater sensor network based on adjacency matrix, omnidirectional's sensor of random placement is ranked up first, again since being met the sensor of condition with hough transform region left margin distance, suitable node is searched out according to fence coverage condition one by one and builds fence.The present invention searches for the node of the condition of satisfaction structure fence using adjacency matrix, sensor resource can be saved, use sensor node as few as possible builds 1 weak fence and the last 1 fence, and the weak fence of k and the strong fence of k, and ensureing that building process is simpler, computational complexity is lower.
Description
Technical field
The invention belongs to underwater wireless sensor network field, it is related to a kind of fence covering side of underwater sensor network
Method.
Background technology
In recent years, with the development of wireless sensor technology and the communication technology, the fence covering algorithm of sensor network by
The widely studied of related scholar and technical staff is arrived and has discussed.How sharp the fence covering method of sensor network is mainly studied
Fence is built with sensor of the random placement in monitored area, target is monitored during monitor area is passed through
Arrive.According to background and the difference of premise, research mainly includes Barrier Coverage Problem, the grid of mobile node of irregular monitored area
Column covering problem etc..The algorithm that they propose under different background is based on Dijkstra shortest path firsts.Dijkstra is most
Short path is a classic algorithm in graph theory research, it is intended to finds the shortest path between two nodes in figure.But use most
Short path realize sensor network fence covering not only complexity it is higher, and can not ensure structure fence used in node
Number is minimum.The sensing region of individual node is limited in water sound sensor network, and the sea area for usually requiring protection is much larger than
The sensing region of individual node, and sensor resource is more rare, therefore how with less sensor node to build fence
Target area is monitored be urgent need to resolve key.
The content of the invention
For overcome the deficiencies in the prior art, the present invention provides a kind of grid of the underwater sensor network based on adjacency matrix
Column covering method, search for the node of the condition of satisfaction structure fence using adjacency matrix, it is intended to save sensor resource, using up can
The weak fence of sensor node structure 1- and the strong fence of 1- that can be few, and the weak fence of k- and the strong fence of k-, and ensure building process
Simpler, computational complexity is lower.
The technical solution adopted for the present invention to solve the technical problems comprises the following steps：
The first step, to all the sensors of random placement in sensor network, according to position abscissa, ascending order is arranged from left to right
Row, abscissa identical sensor arranges according to position ordinate ascending order, and uses s to each sensor1~sNIt is identified,
Form sensor network figure；
Second step, the coverage diagram of sensor network is built, is comprised the following steps that：
(1) if target passes through monitored area from top to bottom with vertical-path, weak fence covering is built, will each be sensed
Summit of the device as coverage diagram；If wherein two summit siAnd sjTransverse and longitudinal subject distance | xj-xi|≤2Rs, j ＞ i, RsRepresent sensor
The perception radius, then connected between this two summit by the use of straight line as the side of coverage diagram, otherwise summit siWith sjAnd its institute on the right
Have and side is not present between summit；
(2) if target passes through monitored area from top to bottom with free routing, strong fence covering is built, will each be sensed
Summit of the device as coverage diagram；If wherein two summit siAnd sjEuclidean distance d (si,sj)≤2Rs, then will be used between this two summit
Straight line connects the side as coverage diagram, otherwise summit siWith sjAnd its side is not present between all summits on the right；
3rd step, UT- adjacency matrix are established according to coverage diagram, comprised the following steps that：
(1) adjacency matrix A corresponding to weak fencew=(aij)N×N, wherein element aijRepresent summit s in coverage diagramiAnd sjIt
Between position relationship, if siAnd sjBetween side then a be presentij=1, otherwise aij=0；
(2) adjacency matrix corresponding to strong fence is As=(aij)N×N, wherein element aijRepresent summit s in coverage diagramiAnd sj
Between position relationship, if siAnd sjBetween side then a be presentij=1, otherwise aij=0；
4th step, search are less than R with region left margin distancesSensor siFirst node as constructed fence；
If multiple and left margin distance be present is less than RsSensor, take the maximum sensor of wherein abscissa as first node；
If it is less than R in the absence of with left margin distancesSensor, then the sensor network can not build fence；
5th step, the i-th row of adjacency matrix is gone to, choose the element a that the row rightmost is 1i,j, node sjTo build grid
Next node needed for column；
The operation of the 5th step is repeated, until node and the region right margin distance of search are less than Rs, the node is constructed grid
Last node on column.
Mobile all vertical path and sensing region phases of k different sensors for passing through monitored area of target that and if only if
During friendship, this sensor network is just the weak fence coverings of k-, and search is determined with region left margin apart from small first after the first step
In RsAll p sensors and with region right margin distance be less than RsAll q sensors, determine the sensor network energy
The maximum gate column number k≤min { p, q } enough built, if being less than R in the absence of with left margin or right margin distancesSensor, then should
Sensor network can not build fence；Then cover the coverage diagram of structure sensor network according to weak fence and built according to coverage diagram
Vertical UT- adjacency matrix；Finally, respectively with region left margin distance be less than RsEach sensor be first of fence section
Point, the i-th row of adjacency matrix is gone to, choose the element a that the row rightmost is 1i,j, node sjIt is next needed for fence to build
Individual node builds fence；Often structure completes a fence covering, just that former UT- corresponding to all the sensors in the fence is adjacent
Connect whole elements in the row and column in matrix and be set to 0；Structure fence is repeated, until the fence number of structure is equal to the maximum gate determined
Column number or untill complete fence can not be built.
And if only if when mobile all paths for passing through belt-like zone intersect with the sensing region of k different sensors, this
Sensor network is referred to as the strong fence coverings of k-, and search determines to be less than R with region left margin distance first after the first stepsInstitute
There is p sensor and be less than R with region right margin distancesAll q sensors, determine what the sensor network can be built
Maximum gate column number k≤min { p, q }, if being less than R in the absence of with left margin or right margin distancesSensor, then the sensor network
Network can not build fence；Then cover the coverage diagram of structure sensor network according to strong fence and UT- neighbours are established according to coverage diagram
Connect matrix；Finally, respectively with region left margin distance be less than RsEach sensor be fence first node, go to neighbour
The i-th row of matrix is connect, chooses the element a that the row rightmost is 1i,j, node sjCarry out structure for the next node needed for structure fence
Build fence；Often structure completes a fence covering, just by former UT- adjacency matrix corresponding to all the sensors in the fence
Whole elements are set to 0 in row and column；Repeat structure fence, until structure fence number be equal to determine maximum gate column number or can not
Untill building complete fence.
The beneficial effects of the invention are as follows：Suitable for stationary node, sensor senses model is the situation of 0/1 disk model.
Compared with traditional shortest-path method, the present invention, given search termination condition, makes to search for every time in search node one by one
Without the remaining all unselected node of traversal, computational complexity is reduced.When choosing node, only choose and meet fence coverage condition
Node in upper one selected a farthest node of knee level distance, ensure that the sensor section used in the fence of structure
Point is as few as possible.As shown in fig. 6, using the strong fence covering methods of 1- based on UT- adjacency matrix than the 1- based on Dijkstra
Nodes used in strong fence covering method structure fence are few and strong using the k- based on UT- adjacency matrix as seen from Figure 7
Fence number of the fence number also than the strong fence covering method structures of k- based on Dijkstra constructed by fence covering method is more.This
It is outer using UT- adjacency matrix come search node one by one, it is simple easily to realize.So in summary, the present invention has simple easily real
The characteristics of existing, and node used in the fence covering built is less, and complexity is relatively low.In addition, the algorithm frame in the present invention
It can be additionally used in other sensor models and the network being made up of heterogeneous sensor, there are larger application scenarios.
Brief description of the drawings
Fig. 1 is the sensor network laid at random the citing after ascending order arranges.
Fig. 2 is the weak fence coverage diagram of sensor network shown in Fig. 1.
Fig. 3 is the strong fence coverage diagram of sensor network shown in Fig. 1.
Fig. 4 is that Fig. 2 gives the impression of weakness UT- adjacency matrix corresponding to fence coverage diagram.
Fig. 5 is strong UT- adjacency matrix corresponding to fence coverage diagram shown in Fig. 3.
Fig. 6 is the flow chart of 1- fence covering methods.
Fig. 7 is the flow chart of k- fence covering methods.
Fig. 8 is to being built using the fence construction method based on adjacency matrix, the fence based on Dijkstra shortest paths
Method, nodes needed for the structure strong fence of 1- are compared；The preferable minimum nodes number for building strong fence is also depict in figure.
Fig. 9 is to being built using the fence construction method based on adjacency matrix, the fence based on Dijkstra shortest paths
Method, the average strong fence number that can be built are compared.
Embodiment
The present invention is further described with reference to the accompanying drawings and examples, and the present invention includes but are not limited to following implementations
Example.
Known sensor network of the present invention is by N number of omnidirectional's isomorphism sensor group into they are by random placement in two-dimensional rectangle
Region A2-dimIn=[0, L] × [0, W], wherein L and W identify the length and width of the rectangular area respectively.
Barrier Coverage Problem for building less node, is ranked up to omnidirectional's sensor of random placement first, then
Since being met the sensor of condition with hough transform region left margin distance, searched out one by one properly according to fence coverage condition
Node structure fence.The node of the invention for mainly searching for the condition of satisfaction one by one using adjacency matrix.Adjacency matrix is one anti-
The symmetry square matrix of relation between each summit in coverage diagram has been reflected, and has been applied to the adjacency matrix of sensor network fence covering also
Possesses distinctive property under some this backgrounds.These characteristics can simplify the process of search node, make fence covering method more
Simplicity, complexity are lower.
S described belowi,sj,sj1,sj2(0 ＜ i, j, j1, j2≤N) is the node in sensor network after sequence,
Their position coordinates is respectively si(xi,yi),sj(xj,yj),sj1(xj1,yj1),sj2(xj2,yj2)。
The invention mainly comprises two parts：First, the 1- fence covering based on UT- adjacency matrix；Second, abutted based on UT-
The k- fence covering of matrix.Mainly solve when target passes through monitored area from top to bottom, the perception radius Rs identical sensors
Form the Barrier Coverage Problem of network.
1. the 1- fence covering methods based on UT- adjacency matrix
1 (weak fence covering) is defined to cover by sensor network, make along arbitrarily perpendicular to the path of belt-like zone from upper
The mobile target of belt-like zone is passed through under and to be detected by sensor network.
Define 2 (strong fence coverings) to cover by sensor network, make to pass through belt-like zone from top to bottom along free routing
Mobile target can be detected by sensor network.
The first step：To all the sensors of random placement in sensor network, according to position abscissa, ascending order is arranged from left to right
Row (abscissa of several sensing stations is identical if having, then ascending order arranges from bottom to top according to position ordinate by them),
And each sensor is identified；
Sensor network figure by mark is as shown in figure 1, the sensor positioned at high order end is s1, positioned at the biography of low order end
Sensor is sN。
Second step：Based on sensor network figure, wherein each sensor as summit, according between sensor away from
From side is established, the coverage diagram (as shown in Figures 2 and 3) of sensor network is built：
(1) if target passes through rectangle monitored area with vertical-path from top to bottom, weak fence covering need to be built.Will be each
Summit of the sensor as coverage diagram.If the sensor s of wherein two vertex correspondencesiAnd sjPosition relationship meet weak fence condition：
|xj-xi|≤2Rs(j ＞ i) (Rs represents the perception radius of sensor, the present invention is directed the sensor by same perceived radius
The sensor network of composition), then it is used as the side of coverage diagram by the use of straight line connection using between this two summit.If sensor network coverage diagram
A certain summit si(with sensor siIt is corresponding.) and one summit s of its rightjDistance relation be unsatisfactory for：|xj-xi|≤2Rs(j ＞
I), then summit siWith sjAnd its side is not present between all summits on the right.
(2) if target passes through rectangle monitored area with free routing from top to bottom, strong fence covering need to be built.Will be each
Summit of the sensor as coverage diagram.If the sensor s of wherein two vertex correspondencesiAnd sjPosition relationship meet strong fence condition：
d(si,sj)≤2Rs(j ＞ i) (wherein d (si,sj) it is sensor siAnd sjBetween Euclidean distance), then by between this two summit
The side of coverage diagram is used as by the use of straight line connection.If a certain summit s of sensor network coverage diagrami(with sensor siIt is corresponding.) right with it
The summit s of side onejDistance relation be unsatisfactory for：d(si,sj)≤2Rs(j ＞ i), then summit siWith sjAnd its all summits on the right it
Between side is not present.
With above method, corresponding side is drawn according to fence coverage condition, finally give required weak fence coverage diagram or
Strong fence coverage diagram.The weak fence of sensor network shown in Fig. 1 and strong fence coverage diagram are as shown in Figures 2 and 3.
3rd step：According to coverage diagram, UT- adjacency matrix are established.
(1) adjacency matrix corresponding to weak fence is Aw=(aij)N×N, wherein element aijRepresent summit s in coverage diagramiAnd sj
Between position relationship.If siAnd sjBetween side be present, then aij=1, if side, a is not presentij=0.
(2) adjacency matrix corresponding to strong fence is As=(aij)N×N, wherein element aijRepresent summit s in coverage diagramiAnd sj
Between position relationship.If siAnd sjBetween side be present, then aij=1, if side, a is not presentij=0.
Adjacency matrix is N × N symmetry square matrixs, and the present invention takes the upper triangular matrix of adjacency matrix as UT- adjacency matrix.Figure
UT- adjacency matrix corresponding to weak fence and strong fence coverage diagram shown in 2 and Fig. 3 are as shown in Figures 4 and 5.
After the UT- adjacency matrix of weak fence and strong fence determine, two kinds of fence of subsequent processes are identical, do not make in following
Distinguish.
4th step：Search is less than R with region left margin distancesSensor siFirst node as constructed fence.
If multiple and left margin distance be present is less than RsSensor, take wherein abscissa maximum, i.e. the maximum sensor of subscript makees
For first node；If it is less than R in the absence of with left margin distancesSensor, then the sensor network can not build fence.
5th step：The i-th row of adjacency matrix is gone to, chooses the element a that the row rightmost is 1i,j(purpose is to choose to meet
A farthest node of knee level distance has been selected in the node of fence coverage condition with upper one), it is corresponding with its row subscript
Node sjFor the next node needed for structure fence.
The operation of the 5th step is repeated, until node and the region right margin distance of search are less than Rs, the node is constructed grid
Last node on column.Such a complete fence just builds completion, and specific structure flow is as shown in Figure 6.To shown in Fig. 1
The node electing process of the weak fence of network struction and strong fence is as shown in arrow in Fig. 4 and Fig. 5.If it is not present and right margin distance
Less than RsSensor, then the sensor network can not build fence.
2. the k- fence covering based on UT- adjacency matrix
To make full use of sensor network, extend network life, improve the reliability of network detection, it is contemplated that structure k- grid
Column covers.
Define 3 (the weak fence coverings of k-) and if only if all vertical paths for passing through belt-like zone and k different sensors
Sensing region it is intersecting when, this sensor network is just the weak fence coverings of k-.
Define 4 (the strong fence coverings of k-) and if only if all paths for passing through belt-like zone and senses of k different sensors
When knowing that region is intersected, this sensor network is referred to as the strong fence coverings of k-.
The first step：The first step operation of 1- fence covering methods is identical.
Second step：Search determines to be less than R with region left margin distancesAll the sensors and with region right margin apart from small
In RsAll the sensors, the maximum gate column number that can build of the sensor network is determined according to property 6.If being not present and the left side
Boundary or right margin distance are less than RsSensor, then the sensor network can not build fence.
3rd step and the 4th step are identical with the second step of 1- fence covering methods and the 3rd step.
5th step：What is determined respectively with the first step is less than R with region left margin distancesAll the sensors be the of fence
One node, fourth, fifth step in 1- fence covering methods is performed to build fence.Often structure completes a fence covering, just
Whole elements in row and column in former UT- adjacency matrix corresponding to all the sensors in the fence are set to 0.Such as siIt is
A sensor in the fence completed is built, can be whole by the element in corresponding i-th row and the i-th row in UT- adjacency matrix
Set to 0.(because all elements of the i-th row indicate sensor siWith the relation of its right all the sensors, all members of the i-th row
Element indicates sensor siWith the relation of its left side side all the sensors, s is deletediAll information relevant with it need to be deleted, so
All elements in i-th row and the i-th row need to be set to 0)
Repeat the operation of the 5th step and again pull up fence, until the fence number of structure be equal to the maximum gate column number that is determined above or
Untill complete fence can not be built.
Fence covering is generally divided into weak fence covering and the covering of strong fence.Weak fence covering purpose is to pass through sensor network
Covering, makes to be detected by sensor network along the target that moves arbitrarily perpendicular to the path traversal of the belt-like zone region；
And strong fence covering purpose is to cover by sensor network, make the target that moves for passing through belt-like zone along free routing can
Detected by sensor network.
1. the 1- fence covering methods based on UT- adjacency matrix
The main thought of this method is first to find the sensor node conduct that sensing region is intersected with monitored area left margin
Build first node of fence.Again on the basis of first node for having selected fence, according to actual conditions from the right side of the node
Second sensor node of selection structure fence in all nodes in side.Afterwards on the basis of the upper node that fence has selected from
The next node of selection structure fence in all nodes in the right of the node, until the node found and the right of monitored area
Boundary.The main feature of this method：First, a upper node for fence of the selection of each structure fence node with having selected has
Close；Second, simplify the selection course of sensor node using the upper triangular matrix of adjacency matrix.Key step is as follows：
The first step：To all the sensors of random placement in sensor network, according to abscissa, ascending order arranges from left to right,
And each sensor is identified；
Second step：The coverage diagram G of sensor network is established according to fence search conditionw(Vw,Ew), wherein VwAnd EwRepresent top
Point set and Bian Ji.The sensor in vertex correspondence sensor network in coverage diagram, between the side respective sensor in coverage diagram
Distance relation.If two summit s in weak fence coverage diagramiAnd sjMeet formula (1), then summit siAnd sjBetween side be present, otherwise not
In the presence of；If two summit s in strong fence coverage diagramiAnd sjMeet formula (2), then summit siAnd sjBetween side be present, be otherwise not present
Weak fence search condition：|xj-xi|≤2Rs(j ＞ i) (1)
Strong fence search condition：d(si,sj)≤2Rs(j ＞ i) (2)
Wherein d (si,sj) it is sensor siAnd sjBetween Euclidean distance.
When establishing coverage diagram using fence search condition, it is not necessary to searched with node has been selected compared with remaining all nodes
Rope.When being compared search according to node sequence, as long as according to there is a node to meet that formula (3) just terminates to search for.
Search for termination condition：|xj-xi| ＞ 2Rs(j ＞ i) (3)
3rd step：According to coverage diagram, UT- adjacency matrix are established.
Weak fence covering adjacency matrix Aw=(aij)n×n, wherein
Strong fence covering adjacency matrix As=(aij)n×n, wherein
Adjacency matrix is N × N symmetry square matrixs, is discussed for ease of analysis, and the present invention only utilizes the upper of it when building fence
Triangular matrix.
Property for the UT- adjacency matrix of fence covering：
Property 1：I-th row element of the weak corresponding UT- adjacency matrix of fence covering represents sensor siWith its all biography in the right
The horizontal range of sensor；The jth column element of the UT- adjacency matrix represents sensor sjWith its left side all the sensors it is horizontal away from
From.
Property 2：Assuming that three sensor s by ascending order arrangement in sensor network be presenti,sj1,sj2(i ＜ j1 ＜ j2).
Element a in corresponding weak fence covering UT- adjacency matrixi,j1Represent sensor siAnd sj1Between horizontal range；Element ai,j2Table
Show sensor siAnd sj2Between horizontal range.If ai,j1=ai,j2=1, then sensor siAnd sj2Between horizontal range it is big
In siAnd sj1Between horizontal range.
Property 3：If sensor network can construct weak fence covering, then in its corresponding UT- adjacency matrix
Per a line and each at least one element of row is 1.
Property 4：If sensor network can construct weak fence covering, then in its corresponding UT- adjacency matrix
Each minor diagonal element is 1.
Property 5：I-th row element of the strong corresponding UT- adjacency matrix of fence covering represents sensor siWith its all biography in the right
The Euclidean distance of sensor；The jth column element of the UT- adjacency matrix represents sensor sjWith the Euclidean of its left side all the sensors away from
From.
Property 6：If the sensing region for having p node in sensor network is intersected with monitored area left margin, q node
Sensing region intersect with monitored area right margin, then fence number k≤min { p, q } that the network can be built.
Below as the sequence of sensor, search saves the property according to UT- adjacency matrix from left to right in monitored area
Put to build fence.
4th step：Search is less than R with region left margin distancesSensor siAs first node of constructed fence,
If it is less than R in the absence of with region left margin distancesSensor, then the sensor network can not build fence.
5th step：On the basis of a upper node for constructed fence, from it on the right of all nodes in selection structure grid
The next node on column.
According to property 2, the i-th row is gone to, is found and sensor siBetween distance meet require structure fence it is next
Node：According to property 3, the element a that rightmost is 1 is choseni,jCorresponding node sj, as next section needed for structure fence
Point；
The operation of the 5th step is repeated, until node and the region right margin distance of search are less than Rs, the node is constructed grid
Last node on column, such a complete fence just build completion.If it is still right with region to search last node
Frontier distance is less than Rs, then the sensor network can not build fence.
2. the k- fence covering methods based on UT- adjacency matrix
K- fence covering method based on UT- adjacency matrix is mainly based on 1- fence covering methods presented hereinbefore
To build multilayer fence.Key step is as follows：
The first step：The all the sensors of random placement in sensor network are arranged according to ascending order, each sensor is entered
Line identifier；
Second step：Search is less than R with region left margin distancesAll the sensors and with region right margin distance be less than Rs
All the sensors, the maximum gate column number that can build of the sensor network is determined according to property 6.If in the absence of with left margin or
Right margin distance is less than RsSensor, then the sensor network can not build fence.
3rd step：The coverage diagram of sensor network is established according to fence search condition；
4th step：According to coverage diagram, the upper triangular matrix of adjacency matrix is established；
5th step：The fourth, fifth step operation in 1- fence covering methods is performed, constructs a fence.Often construct one
Bar fence, all nodes included in fence are removed from sensor network, above-mentioned biography in its corresponding UT- adjacency matrix
Element is all set to 0 in row and column corresponding to sensor.
The operation of the 5th step is repeated, until the fence number of structure is equal to the maximum gate column number being determined above or can not build
Untill complete fence.
Claims (3)
1. a kind of fence covering method of the underwater sensor network based on adjacency matrix, it is characterised in that comprise the steps：
The first step, to all the sensors of random placement in sensor network, according to position abscissa, ascending order arranges from left to right,
Abscissa identical sensor arranges according to position ordinate ascending order, and uses s to each sensor1~sNIt is identified, is formed
Sensor network figure；
Second step, the coverage diagram of sensor network is built, is comprised the following steps that：
(1) if target passes through monitored area from top to bottom with vertical-path, weak fence covering is built, each sensor is made
For the summit of coverage diagram；If wherein two summit siAnd sjTransverse and longitudinal subject distance | xj-xi|≤2Rs, j ＞ i, RsRepresent the sense of sensor
Know radius, then connected between this two summit by the use of straight line as the side of coverage diagram, otherwise summit siWith sjAnd its all tops on the right
Side is not present between point；
(2) if target passes through monitored area from top to bottom with free routing, strong fence covering is built, each sensor is made
For the summit of coverage diagram；If wherein two summit siAnd sjEuclidean distance d (si,sj)≤2Rs, then straight line will be used between this two summit
The side as coverage diagram is connected, otherwise summit siWith sjAnd its side is not present between all summits on the right；
3rd step, UT- adjacency matrix are established according to coverage diagram, comprised the following steps that：
(1) adjacency matrix A corresponding to weak fencew=(aij)N×N, wherein element aijRepresent summit s in coverage diagramiAnd sjBetween
Position relationship, if siAnd sjBetween side then a be presentij=1, otherwise aij=0；
(2) adjacency matrix corresponding to strong fence is As=(aij)N×N, wherein element aijRepresent summit s in coverage diagramiAnd sjBetween
Position relationship, if siAnd sjBetween side then a be presentij=1, otherwise aij=0；
4th step, search are less than R with region left margin distancesSensor siFirst node as constructed fence；If deposit
It is less than R with left margin distance multiplesSensor, take the maximum sensor of wherein abscissa as first node；If no
It is less than R in the presence of with left margin distancesSensor, then the sensor network can not build fence；
5th step, the i-th row of adjacency matrix is gone to, choose the element a that the row rightmost is 1i,j, node sjFor needed for structure fence
Next node；
The operation of the 5th step is repeated, until node and the region right margin distance of search are less than Rs, the node be constructed fence most
The latter node.
2. the fence covering method of the underwater sensor network according to claim 1 based on adjacency matrix, its feature exist
In：When all vertical paths for passing through monitored area of movement target that and if only if are intersected with the sensing region of k different sensors,
This sensor network is just the weak fence coverings of k-, and search determines to be less than R with region left margin distance first after the first steps's
All p sensors and with region right margin distance be less than RsAll q sensors, determine that the sensor network can be built
Maximum gate column number k≤min { p, q }, if in the absence of with left margin or right margin distance be less than RsSensor, then the sensor
Network can not build fence；Then cover the coverage diagram of structure sensor network according to weak fence and UT- is established according to coverage diagram
Adjacency matrix；Finally, respectively with region left margin distance be less than RsEach sensor be fence first node, go to
I-th row of adjacency matrix, choose the element a that the row rightmost is 1i,j, node sjCome for the next node needed for structure fence
Build fence；Often structure completes a fence covering, just by former UT- adjacency matrix corresponding to all the sensors in the fence
Row and column in whole elements be set to 0；Structure fence is repeated, until the fence number of structure is equal to the maximum gate column number or nothing that determine
Untill method builds complete fence.
3. the fence covering method of the underwater sensor network according to claim 1 based on adjacency matrix, its feature exist
In：And if only if when mobile all paths for passing through belt-like zone intersect with the sensing region of k different sensors, this sensor
Network is referred to as the strong fence coverings of k-, and search determines to be less than R with region left margin distance first after the first stepsAll p
Sensor and with region right margin distance be less than RsAll q sensors, determine the maximum that the sensor network can be built
Fence number k≤min { p, q }, if being less than R in the absence of with left margin or right margin distancesSensor, then the sensor network without
Method builds fence；Then cover the coverage diagram of structure sensor network according to strong fence and UT- adjoining squares are established according to coverage diagram
Battle array；Finally, respectively with region left margin distance be less than RsEach sensor be fence first node, go to adjacent square
I-th row of battle array, choose the element a that the row rightmost is 1i,j, node sjTo build the next node needed for fence to build grid
Column；Often structure completes the covering of fence, just by the row in former UT- adjacency matrix corresponding to all the sensors in the fence with
Whole elements are set to 0 in row；Structure fence is repeated, until the fence number of structure is equal to the maximum gate column number determined or can not build
Untill complete fence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710997617.9A CN107770784B (en) | 2017-10-24 | 2017-10-24 | Fence covering method of underwater sensor network based on adjacency matrix |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710997617.9A CN107770784B (en) | 2017-10-24 | 2017-10-24 | Fence covering method of underwater sensor network based on adjacency matrix |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107770784A true CN107770784A (en) | 2018-03-06 |
| CN107770784B CN107770784B (en) | 2021-03-23 |
Family
ID=61269198
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710997617.9A Active CN107770784B (en) | 2017-10-24 | 2017-10-24 | Fence covering method of underwater sensor network based on adjacency matrix |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107770784B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110263228A (en) * | 2019-05-21 | 2019-09-20 | 杭州电子科技大学 | The weak fence building of the k- of wireless chargeable Sensor Network and mobile charging dispatching method |
| CN111314925A (en) * | 2019-10-22 | 2020-06-19 | 天津大学 | Barrier construction method for dynamic underwater environment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158988A (en) * | 2011-04-14 | 2011-08-17 | 北京交通大学 | Method for judging strong barrier coverage of directed sensor network |
| CN104796916A (en) * | 2015-05-11 | 2015-07-22 | 苏州惠通天地信息科技有限公司 | Establishment method of wireless sensor network high barrier coverage for target detection |
| CN105554775A (en) * | 2015-12-15 | 2016-05-04 | 南京邮电大学 | Directional sensor network fence fixing method based on mobile node |
| CN105828344A (en) * | 2016-04-28 | 2016-08-03 | 杭州电子科技大学 | Sensor network barrier coverage deployment method on 3D surface |
-
2017
- 2017-10-24 CN CN201710997617.9A patent/CN107770784B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102158988A (en) * | 2011-04-14 | 2011-08-17 | 北京交通大学 | Method for judging strong barrier coverage of directed sensor network |
| CN104796916A (en) * | 2015-05-11 | 2015-07-22 | 苏州惠通天地信息科技有限公司 | Establishment method of wireless sensor network high barrier coverage for target detection |
| CN105554775A (en) * | 2015-12-15 | 2016-05-04 | 南京邮电大学 | Directional sensor network fence fixing method based on mobile node |
| CN105828344A (en) * | 2016-04-28 | 2016-08-03 | 杭州电子科技大学 | Sensor network barrier coverage deployment method on 3D surface |
Non-Patent Citations (2)
| Title |
|---|
| SHIBO HE ET AL.: "Barrier coverage in wireless sensor networks: From lined-based to curve-based deployment", 《2013 PROCEEDINGS IEEE INFOCOM》 * |
| 范兴刚等: "一种基于邻居节点运动的分布式有向栅栏构建算法", 《计算机研究与发展》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110263228A (en) * | 2019-05-21 | 2019-09-20 | 杭州电子科技大学 | The weak fence building of the k- of wireless chargeable Sensor Network and mobile charging dispatching method |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107770784B (en) | 2021-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100517346C (en) | Path-finding method for optimal path | |
| CN103401922B (en) | Distributed localization apparatus and method based on game method in wireless sensor network | |
| CN107665498A (en) | The full convolutional network airplane detection method excavated based on typical case | |
| CN106022380A (en) | Individual identity identification method based on deep learning | |
| CN106643701A (en) | Robot inter-detection method and robot inter-detection device | |
| CN107770784A (en) | The fence covering method of underwater sensor network based on adjacency matrix | |
| CN106991370A (en) | Pedestrian retrieval method based on color and depth | |
| CN110348383A (en) | A kind of road axis and two-wire extracting method based on convolutional neural networks recurrence | |
| CN105374037B (en) | A kind of X-comers auto-screening method of corner detection | |
| CN107491752A (en) | Ship board character recognition method, device in a kind of natural scene based on deep learning | |
| CN109753949A (en) | A kind of more form method for traffic sign detection based on deep learning | |
| CN106767819A (en) | A kind of indoor navigation data construction method and navigation system based on BIM | |
| CN106123898A (en) | The indoor paths planning method resolved based on picture | |
| CN104778213A (en) | Social network recommendation method based on random walk | |
| CN106376010B (en) | A kind of movement routine planing method of auxiliary positioning beaconing nodes | |
| CN107424161A (en) | A kind of indoor scene image layout method of estimation by thick extremely essence | |
| CN110533103A (en) | A kind of lightweight wisp object detection method and system | |
| CN107977635A (en) | A kind of trellis drainage recognition methods | |
| CN109458978A (en) | A kind of Downtilt measurement method based on multiple scale detecting algorithm | |
| CN109242930B (en) | A kind of elevational point for digital adventure appearance and contour spatial logic relationship detection method | |
| CN110057362A (en) | The method for planning path for mobile robot of finite elements map | |
| CN107301376A (en) | A kind of pedestrian detection method stimulated based on deep learning multilayer | |
| CN106127161A (en) | Fast target detection method based on cascade multilayer detector | |
| CN104915539A (en) | Method for obtaining drainage basin underlying surface information based on remote sensing classification | |
| CN103679301B (en) | Complex terrain-based optimal path searching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |