CN109257763A - The judgment method of wireless sensor two-dimensional network boundary node - Google Patents
The judgment method of wireless sensor two-dimensional network boundary node Download PDFInfo
- Publication number
- CN109257763A CN109257763A CN201811228559.4A CN201811228559A CN109257763A CN 109257763 A CN109257763 A CN 109257763A CN 201811228559 A CN201811228559 A CN 201811228559A CN 109257763 A CN109257763 A CN 109257763A
- Authority
- CN
- China
- Prior art keywords
- node
- hop neighbor
- path
- paths
- depth
- 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
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses a kind of judgment method of wireless sensor two-dimensional network boundary node, is related to wireless sensor node detection field, includes the following steps: 1) to determine all nodes in wireless sensor two-dimensional network；2) to a node judge it includes all hop neighbor nodes；3) in a hop neighbor node of any one node, an optional hop neighbor node carries out depth-first search as start node, until all hop neighbor nodes are all searched in set；4) judge the path situation that depth-first search detects: if depth-first retrieval only retrieves a paths, directly judging whether path forms close ring；If depth-first retrieves several ways diameter, judge whether several paths can be connected to a paths；5) judge whether path forms close ring；6) judge detected node u whether is surrounded in close ringn；The present invention can be completed in local side, calculated less, efficiently judged whether detected node is boundary node.
Description
Technical field
The present invention relates to wireless sensor network fields, and in particular to a kind of wireless sensor two-dimensional network boundary node
Judgment method.
Background technique
Now, wireless sensor two-dimensional network (WSN) has been widely adopted to collect about area-of-interest (RoI)
Physical message.Especially artificially can not reach or be not easy long to bad environments area, placement sensor can only be passed through
Node carries out a series of detection, therefore using wireless sensor two-dimensional network detection information extremely important.Particularly one
In a little applications, such as the detection of environmental observation, forecast system, size of animal, the network coverage are very important a factor, side
Boundary's detection is also very important.Physics covering represents the detectability of wireless sensor two-dimensional network, and coverage area is nothing
One of the basic problem of line sensor two-dimensional network.And usual border detection and covering loophole are associated, it will usually solve simultaneously
Certainly.Covering loophole is surrounded in the boundary node of network internal.
When sensor node is set in portion, usually there are two types of modes: one is random distributions, and one is be uniformly distributed.But
It is uniformly distributed and people is needed to understand landform, and fixed point goes to put node, very elapsed time and energy, so, Ren Men
When the node of sensor network is set in large-scale portion, it cannot always set in uniform portion well, it will usually selection disseminates node at random,
So the random portion of node is set in sensing range, it is easy to form white space.Also, since wireless sensor node is general
It is to be battery powered, replacement battery is again very troublesome, so, when node is without electricity or machine is there are when failure, can all lead
Network is caused to form covering loophole.It is therefore desirable to which the covering loophole of detection sensor ensures the coverings of wireless sensor and actor networks
Integrality.
In Local Area Network, as fruit dot ζ any field in all comprising belonging to the point of set A, also include to be not belonging to set A
Point, then point ζ is referred to as a boundary point of set A.The method of existing detection boundary and covering is broadly divided into three classes: opening up
Flutter method, statistical method, method of geometry.Usual method of geometry be it should be understood that arrive the position coordinates of node, and judge node it
Between distance or angular relationship determine whether node is boundary node.Therefore this method needs sensor device to install GPS
Function, very consuming financial resource, so not taking this mode usually in large-scale wireless network region.Statistics
Method is usually the degree for counting sensor node, then determines a threshold value, is compared, so that it is determined that boundary node；Total comes
It says, this method is to need Node distribution more uniform, it may thereby determine that the number of nodes that a boundary node is connected, thus into
Row judgement, so, this method needs node to be more uniformly distributed.It is finally topological method, topological method is not required to it is to be understood that saving
The positional relationship of point, does not need node yet and is more uniformly distributed；The relationship between node is fully utilized in topological method, usually collects
In in the information that provides of connected graph of node, be inferred to boundary from its topological structure.But they usually require node and collect greatly
The realm information of amount needs higher compiling costs and calculates cost.
In conclusion these schemes are primarily present following problems: 1, calculating at high cost；2, equipment performance is required high；
3, Node distribution is required high.
Summary of the invention
It is an object of that present invention to provide a kind of judgment methods of wireless sensor two-dimensional network boundary node, by wireless
A hop neighbor of node to be detected carries out cyclic judgement in sensor two-dimensional network, and the node that identifies rapidly and efficiently is
The boundary node of two-dimensional network, method are implemented simple.
To reach above-mentioned purpose, the following technical solutions are proposed: a kind of wireless sensor two-dimensional network boundary node by the present invention
Judgment method, include the following steps:
(1) all nodes in wireless sensor two-dimensional network are determined, and form set U, the U=[u comprising all nodes1,
u2,...,un], n is the number for all nodes for including in wireless sensor two-dimensional network；
(2) to any one node u in set Un, judge it includes all hop neighbor nodes, obtain node unInstitute
There is the set of a hop neighbor nodeThen the set of a hop neighbor node of all nodes is denoted as N in set U,
(3) in the set of any one hop neighbor nodeIn, a hop neighbor node is randomly selected as initial
Node carries out depth-first search and detects path, and the hop neighbor node having detected that is marked, until present node
When carrying out depth-first search can not continue, then gatheringIn randomly select a weight in unlabelled hop neighbor node
It is new to carry out depth-first search detection path, depth-first search process is repeated, until setIn all hop neighbors
Until node is all labeled；
(4) judge the path situation that depth-first search detects: including 1) depth-first retrieval only retrieve Yi Tiaolu
Diameter or depth-first retrieve several ways diameter and several ways diameter can be connected with each other and form a paths；2) depth-first
Several ways diameter is retrieved, and several paths cannot be interconnected to form a paths；
(5) whether the head and the tail node in path connects is judged respectively to two kinds of path situations that depth-first search detects,
Judge whether path forms close ring；Wherein, estimate of situation 1) in the head and the tail node in path can connect, then path forms closure
Otherwise ring directly judges node unIt is boundary node；To situation 2) in all paths whether judge each path head and the tail node respectively
Connection, the head and the tail node in certain path can connect, then the path forms close ring；If situation 2) in all paths do not form closure
Ring then directly judges node unIt is boundary node；
(6) judge detected node u whether is surrounded in close ring ringn, in which: close ring surrounds un, show unIt is internal section
Point, close ring do not surround un, show unIt is boundary node.
Further, the head and the tail node in path is connected to communication connection in the step (4).
Further, any one node u in the step (2)nA hop neighbor node deterministic process are as follows: it is wireless to pass
Any one node u in sensor two-dimensional networknIssue message, collector node unAll hop neighbor sections within the scope of communication radius
The return message of point, the return message includes node identities id；Node unAll hop neighbor nodes in the form of array
Storage, then obtain node unThe set of all hop neighbor nodes
Further, the process in depth-first search detection path includes the following steps: in the step (3)
(1.1) from a hop neighbor node setIn, a hop neighbor node is arbitrarily selected as start node；
(1.2) judge the accessibility child node of the start node, the child node, which is denoted as, to be gatheredIn, start node
All hop neighbor nodes that can be communicated in communication radius；
(1.3) a child node connection is arbitrarily selected, is marked, and using the child node as start node circulating repetition
Step (1.2) until all hop neighbor nodes for gathering interior start node are all labeled, and store and obtains using array list
The path shown；
(1.4) gatheringIn randomly select one in unlabelled hop neighbor node and be re-used as start node, weight
Multiple step (1.2) and (1.3), until setIn all hop neighbor nodes it is all labeled until, storage obtains several using number
The path that group indicates.
Further, judge whether several paths can be connected to the process of a paths in the step (4) are as follows: right
The head and the tail node of each paths successively carries out communication judgement in several paths, if any one in two nodes of the head and the tail in certain path
A node communication connection in communication radius with the arbitrary node in other paths, then two paths of phase mutual energy communication connection connect
A paths are connected in, successively judge all paths.
Judge that close ring surrounds detected node u in the step (6)nPrinciple be in two-dimensional surface close ring arbitrarily
Three nodes are chosen, any node two-by-two in three of them node is formed using detected node as vertex, the angle not being overlapped mutually
The sum of be equal to 360 °；Also, it is any in any two node in three nodes, with the section not comprising another node
One node forms what three nodes were formed, with detected node unFor the angle on vertex and always not equal to 360 degree.
If close ring surrounds detected node un, then at least three nodes are certainly existed, so that with detected node unFor top
Point, three nodes and detected node unIt is formed by angle and for 360 degree, and any two node in three nodes,
Form what three nodes were formed with any one node in the section not comprising another node, with detected node unFor top
The angle of point and always not equal to 360 degree.The judgement that above-mentioned close ring surrounds detected node is unsatisfactory in two-dimentional border networks
Condition, defining the node is external node, successively judges all nodes.
As it can be seen from the above scheme the judgment method of wireless sensor two-dimensional network boundary node disclosed by the invention obtains
It is following the utility model has the advantages that
Technical solution of the present invention is from the definition of boundary node and internal node, by judging detected node un's
Whether neighbor node, which forms, is surrounded detected node unClose ring judge detected node unIt whether is boundary node, wherein
If neighbor node, which is formed, surrounds detected node unClose ring, then determine that detected node is otherwise boundary for internal node
Node；Technical solution of the present invention is clear, calculates simple.
The basic process that the present invention realizes uses topological method, from detected node unIts neighbor node is found, it is secondly adjacent
The detection for carrying out ring between node using Depth Priority Algorithm is occupied, and whether the ring that detection is formed surrounds detected node
unNot using the position coordinates of node during this is a series of.The present invention only needs the hop neighbor information using node,
It is very few compared to the common hop neighbor information of other boundary detection methods without position, can not accurately it determine.The present invention is only
Using a hop neighbor information, the accuracy rate for calculating boundary node is improved.And save great deal of nodes infonnation collection process and
The calculating process of nodal information improves the judging efficiency of boundary node.
In addition, boundary node judges to use the seat of the position between node using the relationship between angle in the prior art
Mark, but present invention only requires the characteristics using node, and then understand the angular relationship between node, do not need to obtain position seat
Mark, simplifies the implementation of method, and judging efficiency is high.
It should be appreciated that as long as aforementioned concepts and all combinations additionally conceived described in greater detail below are at this
It can be viewed as a part of the subject matter of the disclosure in the case that the design of sample is not conflicting.
Can be more fully appreciated from the following description in conjunction with attached drawing present invention teach that the foregoing and other aspects, reality
Apply example and feature.The features and/or benefits of other additional aspects such as illustrative embodiments of the invention will be below
Description in it is obvious, or learnt in practice by the specific embodiment instructed according to the present invention.
Detailed description of the invention
Attached drawing is not intended to drawn to scale.In the accompanying drawings, identical or nearly identical group each of is shown in each figure
It can be indicated by the same numeral at part.For clarity, in each figure, not each component part is labeled.
Now, example will be passed through and the embodiments of various aspects of the invention is described in reference to the drawings, in which:
Fig. 1 is present system flow chart；
Fig. 2 is the concrete model of depth-first search of the invention；
Fig. 3 is the location diagram of close ring of the present invention and detected node: (a) close ring surrounds detected node model
Figure, (b) close ring does not surround detected node illustraton of model；
Fig. 4 is to judge whether local path connects flow chart；
Fig. 5 is to judge whether close ring surrounds detected node flow chart；
Fig. 6 is the exemplary diagram that multipath is converted into a paths；
Fig. 7 is the rational exemplary diagram for judging angle sum；
Fig. 8 is two kinds of situations that node surrounds detected node；
Fig. 9 is to form the Node distribution situation for surrounding detected node close ring.
Specific embodiment
In order to better understand the technical content of the present invention, special to lift specific embodiment and institute's accompanying drawings is cooperated to be described as follows.
Various aspects with reference to the accompanying drawings to describe the present invention in the disclosure, shown in the drawings of the embodiment of many explanations.
It is not intended to cover all aspects of the invention for embodiment of the disclosure.It should be appreciated that a variety of designs and reality presented hereinbefore
Those of apply example, and describe in more detail below design and embodiment can in many ways in any one come it is real
It applies, this is because conception and embodiment disclosed in this invention are not limited to any embodiment.In addition, disclosed by the invention one
A little aspects can be used alone, or otherwise any appropriately combined use with disclosed by the invention.
The present invention is directed to cover intact wireless sensor two-dimensional network by building to carry out data acquisition, therefore it is required that
Sensor node is uniformly covered on interested region and collects information.Based in the prior art, usually cover on a large scale
Cover area is not easily achieved when arranging node and is evenly arranged each node, furthermore, it is desirable to acquisition node location information, it is desirable that
Node is uniformly distributed, and there is the problems such as containing much information and calculate complexity, proposes a kind of wireless sensor two-dimensional network boundary node
Judgment method, do not need the position coordinates according to node to be calculated, and have no requirement to Node distribution, and only
Need a hop neighbor of collector node.
Shown in reference to the accompanying drawing, the judgment method of wireless sensor two-dimensional network boundary node of the invention is made into one
Step is specific to be introduced, and lowercase a in following description, b, c, d, e, f, g, h, i indicate the title of a hop neighbor node.
As shown in connection with fig. 1,1) a kind of judgment method of wireless sensor two-dimensional network boundary node, includes the following steps:
It determines all nodes in wireless sensor two-dimensional network, and forms set U, the U=[u comprising all nodes1,u2,...,un], n
Number for all nodes for including in wireless sensor two-dimensional network；
2) to any one node u in set Un, judge it includes all hop neighbor nodes, obtain node unInstitute
There is the set of a hop neighbor nodeThen the set of a hop neighbor node of all nodes is denoted as N in set U,
3) in the set of any one hop neighbor nodeIn, a hop neighbor node is randomly selected as initial
Node carries out depth-first search and detects path, and the hop neighbor node having detected that is marked, until present node
When carrying out depth-first search can not continue, then gatheringIn randomly select a weight in unlabelled hop neighbor node
It is new to carry out depth-first search detection path, depth-first search process is repeated, until setIn all hop neighbors
Until node is all labeled；
4) judge the path situation that depth-first search detects: only retrieving Yi Tiaolu including 1) depth-first retrieval
Diameter or depth-first retrieve several ways diameter and several ways diameter can be connected with each other and form a paths；2) depth-first
Several ways diameter is retrieved, and several paths cannot be interconnected to form a paths；Wherein, it is to show the way that path, which can be connected with each other,
Diameter energy communication connection；
5) whether the head and the tail node in path, which connects, is judged to two kinds of path situations that depth-first search detects respectively, is sentenced
Whether breaking diameter forms close ring；Wherein, estimate of situation 1) in the head and the tail node in path can connect, then path forms close ring,
Otherwise directly judge node unIt is boundary node；To situation 2) in all paths judge whether each path head and the tail node connects respectively
It connects, the head and the tail node in certain path can connect, then the path forms close ring；If situation 2) in all paths do not form closure
Ring then directly judges node unIt is boundary node；
6) judge detected node u whether is surrounded in close ring ringn, in which: close ring surrounds un, show unIt is internal section
Point, close ring do not surround un, show unIt is boundary node.
Above-mentioned steps 2) in any one node unA hop neighbor node deterministic process are as follows: wireless sensor two-dimensional mesh
Any one node u in networknIssue message, collector node unThe return of all hop neighbor nodes within the scope of communication radius disappears
Breath；Such as node unMessage " hello " is sent to a hop neighbor node, one hop neighbor node receives message and then returned
It again, include nodal information, including node identities id etc. in replying message, a hop neighbor of each node is deposited in the form of array
Storage, then obtain node unThe set of all hop neighbor nodesTo all nodes of other in step 1) all according to above-mentioned behaviour
Make, successively obtains the set of a hop neighbor node of each nodeDeng by a jump of all nodes in set U
The set of neighbor node is denoted as N,
The process in depth-first search detection path includes the following steps: (1.1) from a hop neighbor section in the step 3)
Point setIn, a hop neighbor node is arbitrarily selected as start node；(1.2) judge that the start node is accessibility
Child node, the child node, which is denoted as, to be gatheredIn, all hop neighbor sections that start node can communicate in communication radius
Point；(1.3) a child node connection is arbitrarily selected, is marked, and using the child node as start node circulating repetition step
(1.2), it until all hop neighbor nodes for gathering interior start node are all labeled, and stores and obtains with array representation
Path；(1.4) gatheringIn randomly select one in unlabelled hop neighbor node and be re-used as start node, repeat
Step (1.2) and (1.3), until setIn all hop neighbor nodes it is all labeled until, storage obtains several using array
The path of expression.
Specific embodiment as shown in connection with fig. 2 carries out Depth Priority Searching realization to the neighbor node of each node
It is as follows: for example, current detected node unAll hop neighbor nodes be stored as in the form of array [a, b, c, d, e, f, g,
H, i], wherein a to i letter respectively indicates each nodename id；Secondly, neighbor node is randomly selected, such as the first section in array
Present node of the point a as depth-first search；After a depth-first search, as shown in Fig. 2 (a), one is formed
Partial closure ring and store path [a, b, c, the i] in the form of array；At this point, with path node array and neighbor node array into
Row relatively obtains still have node not to be retrieved, then continues to use undetected node that any one is searched as start node
Rope uses node d to be retrieved as start node as shown in Fig. 2 (b), and the path formed is [d, e, f, g, h]；It carries out again
Comparison is it is found that node unAll neighbor nodes all detected completely.
In some embodiments, by by detected node unA hop neighbor node array in each rubidium marking be 1,
It is 0 when the neighbor node after depth-first search is detected postscript；Label, which is on the one hand to distinguish, to be searched
Node, do not need repeat search, reduction computes repeatedly, on the other hand when all nodes, which mark, is, then explanation be detected
Node unAll hop neighbor node searchings are completed, and depth-first search can be stopped.
It is tested whether the judgement in technical solution of the present invention mainly comprises determining whether to surround there are close ring and formation ring
Survey two deterministic processes of node, the i.e. implementation process of step 5) and step 6).
It checks road specifically, as shown in connection with fig. 4, the path that the present invention forms depth-first search judges
The quantity of diameter array shows that a hop neighbor node of node to be detected only has a paths, then directly if only one array
Judge whether path forms close ring, i.e. situation 1 in step 5)) state；As shown in connection with fig. 3 embodiment in step 5) if
The head and the tail node of path array can communicate to connect, then path forms being described in further detail for close ring, as shown in Fig. 3 (a), if
Detected node unA hop neighbor node a be first node, c is end node, then whether detection node a is connected with node c,
Judgement connection sends communication information to node c in communication radius using node a, if node c in communication radius, can be received
The message of node a transmission simultaneously returns to message, and being denoted as between node a and node c at this time can communicate to connect, otherwise node a and node c
Between cannot connect, and when node a is connected with node c just formed close ring, otherwise.In close ring situation, if
Surround detected node un, then can be the situation as shown in Fig. 3 (a), detected node unInside close ring, i.e. detection node un
For internal node；If close ring does not surround detected node un, then it is the situation as shown in Fig. 3 (b), detected node unIt is closing
Outside cyclization, i.e., directly judge detection node unFor boundary node.
The path that discovery depth-first search is formed in the step 4) include it is several, that is, have multiple arrays in several paths,
Then first judge whether each path connects into a paths, i.e., the head and the tail node of each paths in several paths is successively carried out
Communication judgement, if the arbitrary node in two nodes of the head and the tail in certain path in any one node and other paths is in communication radius
It is interior can communication connection, then can mutually two paths of communication connection be connected as a paths, successively judge all paths, the present invention
In make mulitpath merge into a paths as far as possible, and when middle part of the connecting node in path, path connection selection
Give up the less side of node, specific implementation process is as shown in Figure 6.
Since depth-first search has directionality, the sequence of depth-first search node is different, same path meeting
Array comprising both direction, in the path model as shown in Fig. 6 (a), detected node unA hop neighbor node there are two
The first kind situation of a path array [a, b, c, d, e] and [f, i, j, k, l, m] and there are two arrays [a, b, c, d, e] and
The second class situation of [f, m, l, k, j, i].If it is the first kind, is then detected, that is, used using the head and the tail node of path array
Node a and node e are measured, and are connected respectively to node f and node m, at this time completely without giving up node, it is only necessary to carry out
The duplication of node, is interconnected to a paths, and composition array is [a, b, c, d, e, m, l, k, j, i, f].If it is
Two classes, likewise, the head and the tail node using path array is detected, i.e. node a and node e are connected respectively to node f and section
Point m, and node i is not connected to the node in other path arrays, then can carry out judging node a and node e directly with node f
It is connected with node m, then may will form the paths that array is [a, b, c, d, e, m, f], gives up l, k, j, i tetra- sections
Point, at this moment needs to judge whether there is other nodes being connected, and then merges path, such as when node f is connected with node i,
An as close ring, it can be realized that if node f and node m can change a direction and merge with another paths, i.e. group
It is a paths of [a, b, c, d, e, m, l, k, j, i, f] at array.
If Fig. 6 (b) is as detected node unNeighbor node do not include node e, then two arrays [a, b, c, d] and [f,
M, l, k, j, i], node a and node d are connected with another array interior joint f and node l respectively, and node i is not at other
There is the node being connected in array, then judges that node f and node l and array [a, b, c, d] are connected, formation array [a, b, c,
D, f, m, l], give up tri- nodes of i, j, k, m node is utilized；It calculates discovery node f simultaneously to be connected with node i, i.e.,
A close ring can be formed, by above-mentioned deterministic process it is found that when node f and node l changes a direction and the conjunction of another paths
And form the paths that array is [a, b, c, d, l, k, j, i, f].
In addition, if any two paths are not connected to, directly being looked into during the connection judgment in above-mentioned several paths
It sees with the presence or absence of individual partial closure ring in several paths, if close ring is also not present, can directly judge detected node un
For boundary node.
Judge whether close ring surrounds detected node u in the step 6)nPrinciple be close ring surround node when,
Three points are certainly existed, using detected node as vertex, angle and be 360 that arbitrarily node and detected node are formed two-by-two
Degree；Also, in the array path of the ring of formation, any two points will not be found in the path for not including another node
A bit, be formed by 3 points with this two o'clock, can two-by-two with detected node formed angle and be 360 degree.
Firstly, three nodes are selected at random from close ring path node, using detected node as vertex, because of number of nodes
After the angle excessively formed between detected node, whether detected node can not be surrounded using angle and to calculate.And
When selecting three nodes, detection is arbitrarily formed by angle two-by-two respectively between node and detected node, does not have repetition
Part, if more nodes again, will appear the repeating part as shown in Fig. 7 (b).As shown in Fig. 7 (a), it is selected and calculates section
Three nodes such as c, d, f of point angle calculate angle then respectively using detected node as vertex two-by-two, and angle is compared in judgement
Degree and with 360 ° of sizes, it may be assumed that ∠ cunD, ∠ dunF and ∠ cunF, then by ∠ cunD, ∠ dunF and ∠ cunThe sum that f angle is added,
When be equal to 360 degree then judge close ring encirclement detected node un.If selecting more than three node, will appear such as Fig. 7
(b) shown in, the angle ∠ cu between any node two-by-two is calculated separatelynB, ∠ bunE, ∠ eunG, ∠ gunC, ∠ gunB, ∠
cunE, then will appear repeating part, angle and be greater than 360 °, be unsatisfactory for judging result.If detected node unA hop neighbor
The close ring that node is formed does not surround un, then as shown in Fig. 7 (c), angle and can not be 360 ° that the node found is formed.
If close ring surrounds detected node, detected node surrounding certainly exists node, it is impossible to surround
But there is no the case where node；If the node of the ring of formation is in node u as shown in Fig. 9 (a)nLeft side, then node c's, f is logical
News connection can not necessarily reach the u of nodenRight side, can not necessarily form encirclement.Then, if surrounding node u to be formedn's
Close ring, it is inevitable in node unRight side at least find a node, the node g as shown in Fig. 9 (b).
But when there are three points in close ring, using detected node as vertex, arbitrarily node and detected node two-by-two
The angle of formation and be 360 degree；Also, in the array path of the ring of formation, any two points are not including another node
In path, be present in this two o'clock and be formed by 3 points, can two-by-two with detected node formed angle and be 360 degree, close at this time
Detected node is not also surrounded in cyclization；After detecting the angle arbitrarily formed two-by-two in three nodes and being 360 degree, still can
There is situation as shown in Figure 8, i.e. detected node unNeighbor node be present " recessed " shape, need to exclude this feelings at this time
Condition.Therefore, after detecting angle and being 360 degree, it is still desirable to further detection judgement.
Detection method is as follows: as shown in Fig. 8 (a), being connected with two paths in node a, b, one is passed through node c, another
Item is without node c, in the section without node c, detects each node, i.e. node d, any of e node and section
Three nodes of point a, b composition respectively two-by-two with node unIt is formed by the angle of angle and whether is 360 degree, if not being
360 degree are determined as that close ring surrounds node.Similarly distinguish detection node b, c and c, between a, if close ring surrounds node,
So then as that shown in Fig. 8 (a), can only form angle on a path and for 360 degree of node, this situation is considered as close ring packet
Enclose detected node un.It is exactly such as Fig. 8 (b) if angle can be formed on multiple sections and for 360 degree of node
Shown situation at " recessed " type ring around node, rather than is surrounded.In the situation shown in Fig. 8 (b), node a, b are connected with two paths,
One jump pass through node c, one without c, we can find a node d in the section without c, so that ∠ aunB,
∠bunD and ∠ dunA angle be added and be 360 degree, such case is determined as that ring does not surround detected node un。
Finally, testing result is as it appears from the above, when front ring surrounds detected node un, i.e. close ring encirclement detected node un
When, define detected node unFor internal node；If three nodes of all any combination are in close ring with detected node
For vertex, the angle of formation not overlapped, angle and not equal to 360 °, then detected node u is definednFor boundary node；Weight
Multiple aforesaid operations process, until nodes all in wireless sensing two-dimensional network are judged to complete.
Although the present invention has been disclosed as a preferred embodiment, however, it is not to limit the invention.Skill belonging to the present invention
Has usually intellectual in art field, without departing from the spirit and scope of the present invention, when can be used for a variety of modifications and variations.Cause
This, the scope of protection of the present invention is defined by those of the claims.
Claims (6)
1. a kind of judgment method of wireless sensor two-dimensional network boundary node, which comprises the steps of:
(1) all nodes in wireless sensor two-dimensional network are determined, and form set U, the U=[u comprising all nodes1,
u2,...,un], n is the number for all nodes for including in wireless sensor two-dimensional network；
(2) to any one node u in set Un, judge it includes all hop neighbor nodes, obtain node unAll one
The set of hop neighbor nodeThen the set of a hop neighbor node of all nodes is denoted as N in set U,
(3) in the set of any one hop neighbor nodeIn, a hop neighbor node is randomly selected as start node
It carries out depth-first search and detects path, and the hop neighbor node having detected that is marked, until present node carries out
When depth-first search can not continue, then gatheringIn randomly select in unlabelled hop neighbor node one again into
Row depth-first search detects path, repeats depth-first search process, until setIn all hop neighbor nodes
Until being all labeled；
(4) judge the path situation that depth-first search detects: including 1) depth-first retrieval only retrieve a paths, or
Depth-first retrieves several ways diameter and several ways diameter can be connected with each other and form a paths；2) depth-first retrieves
Several ways diameter, and several paths cannot be interconnected to form a paths；
(5) whether the head and the tail node in path, which connects, is judged to two kinds of path situations that depth-first search detects respectively, is judged
Whether path forms close ring；Wherein, estimate of situation 1) in the head and the tail node in path can connect, then path forms close ring, no
Then directly judge node unIt is boundary node；To situation 2) in all paths judge whether each path head and the tail node connects respectively,
The head and the tail node in certain path can connect, then the path forms close ring；If situation 2) in all paths do not form close ring,
Directly judge node unIt is boundary node；
(6) judge node u whether is surrounded in close ring ringn, in which: close ring surrounds un, show unIt is internal node；Close ring
Do not surround un, show unIt is boundary node.
2. the judgment method of wireless sensor two-dimensional network boundary node according to claim 1, which is characterized in that described
Path can be connected to energy communication connection in step (4).
3. the judgment method of wireless sensor two-dimensional network boundary node according to claim 1, which is characterized in that described
Any one node u in step (2)nA hop neighbor node deterministic process are as follows:
Any one node u in wireless sensor two-dimensional networknIssue message, collector node unIt is all within the scope of communication radius
The return message of one hop neighbor node；Node unAll hop neighbor nodes stored in the form of array, then obtain node unInstitute
There is the set of a hop neighbor node
4. the judgment method of wireless sensor two-dimensional network boundary node according to claim 1, which is characterized in that described
The process in depth-first search detection path includes the following steps: in step (3)
(1.1) from a hop neighbor node setIn, a hop neighbor node is selected at random as start node；
(1.2) judge the accessibility child node of the start node, the child node, which is denoted as, to be gatheredIn, start node is logical
All hop neighbor nodes that can be communicated in letter radius；
(1.3) a child node connection is arbitrarily selected, is marked, and using the child node as start node circulating repetition step
(1.2), it until all hop neighbor nodes for gathering interior start node are all labeled, and stores and obtains with array representation
Path；
(1.4) gatheringIn randomly select one in unlabelled hop neighbor node and be re-used as start node, repeat to walk
Suddenly (1.2) and (1.3), until setIn all hop neighbor nodes it is all labeled until, storage obtains several using array list
The path shown.
5. the judgment method of wireless sensor two-dimensional network boundary node according to claim 1, which is characterized in that described
Several paths can be connected with each other and form the deterministic process of a paths in step (4) are as follows: to each paths in several paths
Head and the tail node successively carry out communication judgement, if in two nodes of the head and the tail in certain path in any one node and other paths
Arbitrary node energy communication connection in communication radius, then two paths of mutual communication connection are connected as a paths, successively sentence
All paths that disconnected depth-first retrieves.
6. the judgment method of wireless sensor two-dimensional network boundary node according to claim 2, which is characterized in that described
Returning to message includes node identities id.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811228559.4A CN109257763B (en) | 2018-10-22 | 2018-10-22 | Method for judging two-dimensional network boundary nodes of wireless sensor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811228559.4A CN109257763B (en) | 2018-10-22 | 2018-10-22 | Method for judging two-dimensional network boundary nodes of wireless sensor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109257763A true CN109257763A (en) | 2019-01-22 |
| CN109257763B CN109257763B (en) | 2021-12-03 |
Family
ID=65045920
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811228559.4A Active CN109257763B (en) | 2018-10-22 | 2018-10-22 | Method for judging two-dimensional network boundary nodes of wireless sensor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109257763B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111405631A (en) * | 2020-03-25 | 2020-07-10 | 安徽工业大学 | Boundary node judgment method and device based on triangle interior point test |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102665252A (en) * | 2012-06-05 | 2012-09-12 | 重庆大学 | Routing void processing method for wireless sensing network geographical position |
| CN103945412A (en) * | 2014-04-11 | 2014-07-23 | 东南大学 | WSN hollow node detection method based on connectivity |
| CN105357732A (en) * | 2015-12-10 | 2016-02-24 | 中北大学 | Wireless sensor network edge node recognition method independent of position information |
-
2018
- 2018-10-22 CN CN201811228559.4A patent/CN109257763B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102665252A (en) * | 2012-06-05 | 2012-09-12 | 重庆大学 | Routing void processing method for wireless sensing network geographical position |
| CN103945412A (en) * | 2014-04-11 | 2014-07-23 | 东南大学 | WSN hollow node detection method based on connectivity |
| CN105357732A (en) * | 2015-12-10 | 2016-02-24 | 中北大学 | Wireless sensor network edge node recognition method independent of position information |
Non-Patent Citations (3)
| Title |
|---|
| CHI ZHANG: "Detecting Coverage Boundary Nodes in Wireless Sensor Networks", 《PROC OF IEEE INTERNATIONAL》 * |
| 林靖: "基于多边形包围的无线传感器网络边缘检测算法", 《微电子学与计算机》 * |
| 陈成涛: "无线传感器网络边缘检测技术研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111405631A (en) * | 2020-03-25 | 2020-07-10 | 安徽工业大学 | Boundary node judgment method and device based on triangle interior point test |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109257763B (en) | 2021-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Deng et al. | Confident information coverage hole healing in hybrid industrial wireless sensor networks | |
| Gupta et al. | Connected sensor cover: Self-organization of sensor networks for efficient query execution | |
| Rathore et al. | Towards Trusted Green Computing for Wireless Sensor Networks: Multi Metric Optimization Approach. | |
| Bai et al. | Mobile sensor deployment optimization for k-coverage in wireless sensor networks with a limited mobility model | |
| US20120036242A1 (en) | Method and sensor network for attribute selection for an event recognition | |
| CN102883429B (en) | Method and device for tracking move object in sensor network based on directional antenna | |
| CN101459914A (en) | Wireless sensor network node coverage optimization method based on ant colony algorithm | |
| CN103607763B (en) | The method and system of object location aware in a kind of wireless sensor network | |
| CN106028417A (en) | Wireless sensor network path planning method based on node energy consumption and remaining energy | |
| Krishnan et al. | An improved clustering with particle swarm optimization-based mobile sink for wireless sensor networks | |
| CN109257763A (en) | The judgment method of wireless sensor two-dimensional network boundary node | |
| CN107222925A (en) | A kind of node positioning method based on cluster optimization | |
| Ren et al. | Energy efficient tracking in uncertain sensor networks | |
| Agumbe Suresh et al. | Towards optimal event detection and localization in acyclic flow networks | |
| CN104809205B (en) | A kind of online network of waterways space-time accident detection method | |
| Ren et al. | Target tracking under uncertainty in wireless sensor networks | |
| CN107271840A (en) | A kind of Fault Section Location of Distribution Network based on LFOA | |
| Mirza Samiulla Beg et al. | A comprehensive study in wireless sensor network (wsn) using artificial bee colony (abc) algorithms | |
| Jiang et al. | Detection and tracking of region-based evolving targets in sensor networks | |
| Sivasakthiselvan et al. | Distributed Re-localization and Pattern Recognition Algorithm for Wireless Sensor Networks | |
| Ma et al. | Trust-based time series data model for mobile crowdsensing | |
| Yang et al. | Short life artificial fish swarm algorithm for wireless sensor network | |
| Chavan et al. | Efficient bio-inspired method for disaster monitoring in wireless sensor networks using improved PSO | |
| CN106211219A (en) | A kind of lost contact node dynamic testing method of Adhoc net | |
| Abdellatief et al. | Efficient Topology Extraction Technique for Wireless Sensor Networks |
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 |