CN111683377B - Real-time reliable relay deployment method for power distribution network - Google Patents
Real-time reliable relay deployment method for power distribution network Download PDFInfo
- Publication number
- CN111683377B CN111683377B CN202010506714.5A CN202010506714A CN111683377B CN 111683377 B CN111683377 B CN 111683377B CN 202010506714 A CN202010506714 A CN 202010506714A CN 111683377 B CN111683377 B CN 111683377B
- Authority
- CN
- China
- Prior art keywords
- communication
- node
- communication node
- nodes
- deployment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
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
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/22—Traffic simulation tools or models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
- H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A real-time reliable relay deployment method facing a power distribution network comprises the steps of re-estimating communication radiuses of all deployment positions according to measured channel quality, reconstructing a communication topological graph for guiding deployment, selecting one deployment position meeting real-time requirements each time for trial deployment, and estimating the communication radiuses of all deployment positions; the communication node capable of measuring the packet receiving rate is obtained through a path loss factor and signal to noise ratio correlation; the communication radius for a communication node that cannot measure the packet reception rate is equal to the communication radius of its nearest communication node that can measure the packet reception rate. Therefore, the defect of poor accuracy of the traditional offline deployment method is effectively overcome, and the reliability of the network is ensured.
Description
Technical Field
The invention relates to a wireless communication network construction method, in particular to a real-time reliable relay deployment method for a power distribution network.
Background
Wireless sensor networks have been widely adopted by a variety of applications, which typically consist of large-scale wireless sensor nodes and a small number of sink nodes, communicating via single/multi-hop paths. Because of limitations of communication, calculation, energy consumption and the like, the network formed by only the sensor nodes has various defects such as unbalanced energy consumption, short service life of the network, short communication distance, poor expandability and the like. Therefore, students at home and abroad claim to build a connected topological structure for the whole network by deploying additional relay nodes so as to enhance the network performance. The deployment of relay nodes directly constructs network topology connectivity and deeply influences the performance of protocols of each layer of the wireless sensor network, so that the deployment of the relay nodes is widely and deeply studied.
The wireless sensor network is gradually applied to various industrial scenes due to the advantages of low cost, convenient installation, easy maintenance and the like. The power distribution network detection is an important application scene of the wireless sensor network in the industrial field, and the main purpose of the power distribution network detection is to realize functions of real-time monitoring, fault prediction and the like aiming at power distribution network lines and equipment. The coverage area of the distribution network is large, so that the topography of the area where the distribution network is located is complex, and if a traditional wired communication system is adopted, the network deployment cost is greatly increased, and even when the distribution network is serious, the communication network is difficult to deploy. The wireless sensor network does not need to lay a circuit, so that the wireless sensor network can be well adapted to various complex environments of a power distribution network, and the network deployment cost is effectively reduced.
However, the distribution network deployment site has complex topography, and particularly various switch stations in the distribution network have the characteristics of severe radio frequency environment, severe metal shielding and the like, so that low-power consumption lossy channels in the distribution network have high dynamic property and uncertainty, and an offline static channel model loses use value. Therefore, the channel quality between any two points in the deployment area cannot be accurately obtained in advance by using the static channel model. In addition, the coverage area of the power distribution network is large, and channel quality detection cannot be performed on all positions in a deployment area, so that global channel information is lost. Unfortunately, the underlying assumption of existing research is that global channel quality information is known and accurate prior to relay deployment. This means that the existing research results and experience are no longer applicable to the wireless sensor network facing the power distribution network.
Disclosure of Invention
The first aspect of the present invention provides a method for estimating a communication radius of a communication node in a communication network, so as to solve a technical problem that the communication radius of the communication node in a specific application is not easy to obtain due to physical blocking.
The second invention aims to provide a real-time reliable relay deployment method for a power distribution network, which aims to solve the technical problem that effective relay nodes are not easy to quickly add in a wireless communication network due to physical blocking influence.
The third invention aims to provide a real-time reliable relay deployment method for a power distribution network, which aims to solve the technical problems that a wireless communication network capable of meeting communication needs is not easy to deploy quickly due to physical blocking.
In order to solve the technical problems, the following technical scheme can be selected as required:
a method for estimating communication radius of communication node in communication network, the communication node is composed of gateway node, sensor node and candidate node, the position for disposing the communication node includes gateway node disposing position, n sensor node disposing positions and m candidate node disposing positions, the gateway node set is { g }, the sensor node set is S = { S 1 ,s 2 ,…,s n The candidate node set is C= { C } 1 ,c 2 ,…,c m -comprising the steps of:
step 2a, collecting
One of the communication nodes, designated as communication node u, generates a maximum set of communication radii corresponding to communication node u ∈>
Step 2b, collecting
The other communication node is recorded as a communication node v, and the path loss factor a between the communication node u and the communication node v is obtained according to the actually measured packet receiving rate psi (u, v) between the communication node u and the communication node v, the position information of the communication node u and the position information of the communication node v;
calculating the minimum signal to noise ratio
Wherein ρ is the data rate, B N For noise bandwidth, l is datagram length, function Q -1 (x) As an inverse function of the function Q (x), θ is a channel quality constraint;
calculating the maximum communication radius of the communication node u after passing through the communication node v
Where P is the transmit power, PL is the reference distance average path loss, P n Is a noise substrate, d 0 For reference distance gamma min (u, v) is the minimum signal-to-noise ratio between communication node u and communication node v, and a is the path loss factor between communication node u and communication node v;
updating R u ＝R u ∪{d max (u,v)}；
Sub-step 2c, repeatedly executing sub-step 2b to obtain communication node u and set
Maximum communication radius set R between all other communication nodes in the network u Communication radius r of communication node u u ＝min R u ；
step 4, collecting
Communication node corresponding to any element>
Is set to the communication radius of the communication node +.>
Distance set->
A communication radius corresponding to the nearest communication node.
Preferably, in the step 2, the step is performed according to the collection
The method for obtaining the path loss factor a between the communication node u and the communication node v by the measured packet receiving rate ψ (u, v) between the communication node u and the communication node v, the position information of the communication node u and the position information of the communication node v comprises the following steps: />
Signal-to-noise ratio between communication node u and communication node v
Wherein ρ is the data rate, B N For noise bandwidth, l is datagram length, function Q -1 (x) Is an inverse function of the function Q (x);
path loss factor between communication node u and communication node v
Where P is the transmit power, PL is the reference distance average path loss, P n Is the noise floor, d is the distance between communication node u and communication node v, d 0 Is the reference distance.
The utility model provides a real-time reliable relay deployment method facing a power distribution network, wherein the communication node is composed of gateway nodes, sensor nodes and candidate nodes, the positions for deploying the communication nodes comprise gateway node deployment positions, n sensor node deployment positions and m candidate node deployment positions, the gateway node set is { g }, and the sensor node set is S= { S 1 ,s 2 ,…,s n The candidate node set is C= { C } 1 ,c 2 ,…,c m -a }; the method is characterized by comprising the following steps of:
step A, setting a communication node for the previous round of deployment as w, recording a parent node of the communication node w as p (w), setting the hop count from a gateway node to the communication node for the previous round of deployment as k (w), setting a deployed relay node set as R, and recording a restoration point A; estimating the communication radius of all communication nodes by using the method for estimating the communication radius of the communication nodes in the communication network, and constructing a communication topological graph G= (V, E), wherein V is a communication node set, and E is an edge set;
step B, updating the communication node w deployed in the previous round to deploy the relay node, and constructing all neighbor communication nodes of the communication node w deployed in the previous round in the communication topological graph G to form a set N G (w) one by one actually deploying communication node w and set N in the previous round G The packet receiving rate (psi (S, w)) between any sensor nodes S in (w) backand S, the channel quality constraint is set as theta, the sensor nodes with the packet receiving rate (psi (S, w)) more than or equal to theta between the communication nodes w deployed in the previous round are first sensor nodes, the first sensor nodes are deleted from the set S, and the set S is updated;
traversing set Ω=n G Each communication node u in (w) \ (R ≡S) is used for acquiring a sensor node set y (u) which can be effectively connected by each communication node u as
{Υ(u)|s∈S,h(p G (s,u))+κ(w)+1≤δ} (5)
Wherein p is G (s, u) represents the shortest path from the sensor node s to the communication node u in the communication topology graph G;
recording a restore point B;
step C, if
Or a set of sensor nodes to which any communication node u of set Ω can be operatively connected ∈>
Restoring to the restoring point A and re-executing the step B; if->
And the set of sensor nodes to which all communication nodes u in set Ω can be operatively connected +.>
The weight of each non-empty communication node u in the weight y (u) is +.>
Wherein T is G (u, y (u)) represents a shortest path tree from communication node u to all sensor nodes in y (u) corresponding to communication node u in communication topology graph G, and x represents the number of communication nodes on path tree x;
setting a communication node with the smallest weight omega (u) in the weight omega (u) corresponding to the deployment position of the relay node t in the weight omega (u) of all communication nodes in the set omega, actually measuring the psi (t, w) between the relay node t and the communication node w deployed in the previous round, and re-estimating the communication radius of all communication nodes by using the method for estimating the communication radius of the communication node in the communication network;
if ψ (t, w) is more than or equal to θ, a new relay node t is successfully deployed in the communication network, w=t, p (t) =w, κ (t) =κ (w) +1, and r=r { t }; if ψ (t, w) < θ, Ω=Ω\ { t }, and return to point B, and re-execute step C.
Preferably, in the step a, if the communication node w deployed in the previous round is the gateway node g, then
p(w)＝-1，κ(w)＝0。
Preferably, in the step a, the method for constructing the edge elements in the edge set E includes the following steps: any two communication nodes u and V in the communication node set V are traversed, and if u-V is less than min (r v ,r u ) An edge connecting two points of the communication node u and the communication node v exists in the communication topological graph G, wherein I U-V I is the distance between the communication node u and the communication node v, and r is the distance between the communication node u and the communication node v u For the communication radius, r, of the communication node u v Is the communication radius of the communication node v.
Preferably, the method further comprises a step D disposed after the step C, the step D comprising: at the set
When one relay node is deployed successfully, the processes from the step B to the step C are repeatedly executed until the set is +.>
The method is provided by fully considering the characteristics of complex terrain, serious radio frequency interference and the like in the coverage area of the power distribution network and the requirements of the power distribution network on deployment cost, network reliability, real-time performance and the like, and can successfully lay the wireless sensor network meeting the constraint of real-time performance and reliability in the complex terrain and radio frequency environment with lower deployment cost.
Compared with the prior art, the invention has the beneficial effects that:
(1) The method for estimating the communication radius of the communication node in the communication network can re-estimate the communication radius of all deployment positions in the deployment area according to the channel quality measured during deployment, and is used for guiding the deployment process. The online real-time channel estimation method can effectively avoid the defects that the channel quality prediction accuracy is poor and the network reliability cannot be ensured caused by the adoption of an offline static model in the existing deployment method.
(2) The real-time reliable relay deployment method for the power distribution network is different from the online relay deployment method of the existing offline deployment strategy, and the communication radius estimation method is utilized to re-estimate the communication radius of each deployment position according to the actually measured channel quality after each round of deployment, and the communication topological graph is re-built for guiding deployment, so that the defect of poor accuracy of the traditional offline deployment method is effectively overcome, and the network reliability is ensured. On the other hand, the method adopts a depth-first deployment strategy, and each time, one deployment position meeting the real-time requirement is selected for trial deployment so as to meet the real-time requirement of the power distribution network. Furthermore, depth-first policies facilitate field deployment implementation.
Drawings
Fig. 1 is a flow chart of a method of estimating a communication radius of a communication node in a communication network according to the present invention.
Fig. 2 is a flowchart of a real-time reliable relay deployment method for a power distribution network.
Fig. 3 is a flowchart of deploying relay nodes in the real-time reliable relay deployment method for the power distribution network.
Fig. 4 is a schematic diagram illustrating an estimation method for estimating a communication radius of a communication node in a communication network according to the present invention.
Fig. 5 is an asymptotic deployment schematic diagram of a real-time reliable relay deployment method for a power distribution network, to which the present invention is applied.
Fig. 6 is an asymptotic deployment schematic diagram II of a real-time reliable relay deployment method for a power distribution network.
Fig. 7 is an asymptotic deployment schematic diagram III of a real-time reliable relay deployment method for a power distribution network.
Fig. 8 is an asymptotic deployment schematic diagram of a real-time reliable relay deployment method for a power distribution network, which is applied to the invention.
Fig. 9 is an asymptotic deployment schematic diagram of a real-time reliable relay deployment method for a power distribution network, which is applied to the invention.
Fig. 10 is an asymptotic deployment schematic diagram six of a real-time reliable relay deployment method for a power distribution network, which is applied to the invention.
Fig. 11 is an asymptotic deployment schematic diagram seven of a real-time reliable relay deployment method for a power distribution network, which is applied to the invention.
Fig. 12 is an asymptotic deployment schematic diagram eight of a real-time reliable relay deployment method for a power distribution network, to which the present invention is applied.
Fig. 13 is a schematic diagram of a deployment process of the real-time reliable relay deployment method for the power distribution network.
Detailed Description
The present invention is described in the following embodiments in conjunction with the accompanying drawings to assist those skilled in the art in understanding and implementing the invention. The following examples and technical terms therein should not be construed to depart from the technical knowledge of the art unless otherwise indicated.
The expression in the present invention is defined as follows:
the expression { A } \ { B } represents deleting all elements contained in the set { B } in the set { A }, and updating the set { A }.
The equation x=x+1 represents the updated x after the original x+1, i.e., x on the left side of the equation is updated x and x on the right side of the equation is pre-updated x, similar to the pointer update in a computer program.
The equation a=a & -B represents the updated set a after the union operation of the original set a and the set B, that is, the set a on the left side of the equation is the updated set a, and the set a on the right side of the equation is the set a before the update, which is similar to the pointer update in the computer program.
First part of the invention
A method of estimating a communication radius of a communication node in a communication network, see fig. 1, said communication node being formed by a gateway node, a sensor node and candidate nodes, the location for deploying said communication node comprising a gateway node deployment location, n sensor nodesThe point deployment position and m candidate node deployment positions, the gateway node set is { g }, and the sensor node set is S= { S } 1 ,s 2 ,…,s n The candidate node set is C= { C } 1 ,c 2 ,…,c m -comprising the steps of:
step 2a, collecting
One of the communication nodes, designated as communication node u, generates a maximum set of communication radii corresponding to communication node u ∈>
Step 2b, collecting
The other communication node is denoted as a communication node v, and the path loss factor a between the communication node u and the communication node v is obtained according to the measured packet receiving rate ψ (u, v) between the communication node u and the communication node v, the position information of the communication node u and the position information of the communication node v, specifically as follows:
signal-to-noise ratio between communication node u and communication node v
Wherein ρ is the data rate, B N For noise bandwidth, l is datagram length (unit bit), function Q -1 (x) Is an inverse function of the function Q (x);
path loss factor between communication node u and communication node v
Where P is the transmit power, PL is the reference distance average path loss, P n Is the noise floor, d is the distance between communication node u and communication node v, d 0 Is the reference distance;
the minimum signal to noise ratio gamma is calculated according to the following formula min (u,v)
Wherein ρ is the data rate, B N For noise bandwidth, l is datagram length, function Q -1 (x) As an inverse function of the function Q (x), θ is a channel quality constraint;
calculating the maximum communication radius of the communication node u after passing through the communication node v
Where P is the transmit power, PL is the reference distance average path loss, P n Is a noise substrate, d 0 Is the reference distance;
updating R u ＝R u ∪{d max (u,v)}；
Sub-step 2c, repeating sub-step 2b to obtain a set
Internal communication node u and set->
Maximum communication radius set R between all other communication nodes in the network u Communication radius r of communication node u u ＝min R u ；/>
step 4, collecting
Communication node corresponding to any element>
Is set to the communication radius of the communication node +.>
Distance set->
A communication radius corresponding to the nearest communication node.
It should be understood that the two-dot chain line box in fig. 1 corresponds to step 2.
It should be appreciated that the candidate node deployment location may be deployed with the communication device or may be in a reserved state without deploying the communication device. All the communication nodes corresponding to the deployment positions with the communication equipment can measure the packet receiving rate, and the communication nodes form a set
All communication nodes corresponding to the deployment locations of undeployed communication devices are not capable of measuring the packet rate, which constitutes the set +.>
Example 1: fig. 4 is a schematic diagram of communication distance estimation of a log-distance path loss model. The packet receiving rate between the communication nodes which have been tested in the figure is respectively psi (c) 4 ,c 13 )＝0.93，Ψ(c 12 ,c 13 )＝0.76，Ψ(c 15 ,c 13 )＝0.87，Ψ(c 11 ,c 16 )＝0.95，Ψ(c 11 ,s 2 )＝0.96，Ψ(c 11 ,c 10 )＝0.91，Ψ(c 11 ,c 9 )＝0.78，Ψ(c 6 ,c 7 ) =0.76. At user input transmit power p, reference distance average path loss PL, reference distance d 0 Noise floor P n Bandwidth of noise B N After parameters such as data rate ρ, datagram length l bit, etc., the maximum communication radius d along each measured direction can be calculated according to equations (9) - (12) max (c 4 ,c 13 )，d max (c 12 ,c 13 )，d max (c 15 ,c 13 )，d max (c 11 ,c 16 )，d max (c 11 ,s 2 )，d max (c 11 ,c 10 )，d max (c 11 ,c 9 )，d max (c 6 ,c 7 ). From these measured values, the maximum communication radius of all communication nodes can then be deduced. For example to estimate c 13 Due to c 13 For the detected communication node, the maximum estimated radius d of all detected directions is first found max (c 4 ,c 13 )，d max (c 12 ,c 13 )，d max (c 15 ,c 13 ) It can be seen that d max (c 12 ,c 13 ) Is at a minimum value, so c 13 Is d max (c 12 ,c 13 ). Also e.g. to estimate c 2 Radius of communication, because of c 2 For a communication node to be tested, the distance c is first found 2 The nearest measured communication node, known as c 6 . Then calculate c 6 Radius of communication, c 6 Only one direction, ψ (c 6 ,c 7 ) =0.76, from which value d can be calculated from formulas (9) - (12) max (c 6 ,c 7 ) Thus c 6 And (5) calculating the radius. From step 2, it can be seen that c 2 Communication radius d max (c 6 ,c 7 )。
The second part of the invention
Referring to fig. 3, the communication node is composed of gateway nodes, sensor nodes and candidate nodes, the positions for deploying the communication nodes comprise gateway node deployment positions, n sensor node deployment positions and m candidate node deployment positions, the gateway node set is { g }, and the sensor node set is S= { S 1 ,s 2 ,…,s n The candidate node set is C= { C } 1 ,c 2 ,…,c m -comprising the steps of:
step A, setting a communication node for the previous round of deployment as w, recording a parent node of the communication node w as p (w), setting the hop count from a gateway node to the communication node for the previous round of deployment as k (w), setting a deployed relay node set as R, and recording a restoration point A; generally, a gateway node g is deployed at a gateway node deployment location, and a relay node is deployed at a candidate node deployment location;
estimating the communication radius of all communication nodes by using a method for estimating the communication radius of communication nodes in a communication network disclosed in the first part of the invention, and constructing a communication topological graph G= (V, E), wherein V is a communication node set, and E is an edge set;
the construction method of the edge is as follows: any two communication nodes u and V in the communication node set V are traversed, and if u-V is less than min (r v ,r u ) An edge connecting two points of the communication node u and the communication node v exists in the communication topological graph G, wherein I U-V I is the distance between the communication node u and the communication node v, and r is the distance between the communication node u and the communication node v u For the communication radius, r, of the communication node u v Is the communication radius of the communication node v.
Step B, updating the communication node w deployed in the previous round to be part ofDeploying relay nodes, generally, deploying relay nodes at candidate node deployment positions, and constructing all neighbor communication nodes of a communication node w deployed in the previous round in a communication topological graph G to form a set N G (w) one by one actually deploying communication node w and set N in the previous round G The packet receiving rate (psi (S, w)) between any sensor nodes S in (w) backand S, the channel quality constraint is set as theta, the sensor nodes with the packet receiving rate (psi (S, w)) more than or equal to theta between the communication nodes w deployed in the previous round are first sensor nodes, the first sensor nodes are deleted from the set S, and the set S is updated;
traversing set Ω=n G Each communication node u in (w) \ (R ≡S) is used for acquiring a sensor node set y (u) which can be effectively connected by each communication node u as
{Υ(u)|s∈S,h(p G (s,u))+κ(w)+1≤δ} (13)
Wherein p is G (s, u) represents the shortest path from the sensor node s to the communication node u in the communication topology graph G;
recording a restore point B;
step C, if
Or a set of sensor nodes to which any communication node u of set Ω can be operatively connected ∈>
Restoring to the restoring point A and re-executing the step B; if->
And the set of sensor nodes to which all communication nodes u in set Ω can be operatively connected +.>
The weight of each non-empty communication node u in the weight y (u) is
Wherein T is G (u, y (u)) represents a shortest path tree from communication node u to all sensor nodes in y (u) corresponding to communication node u in communication topology graph G, and |x| represents the number of communication nodes on path tree x;
setting a communication node with the smallest weight omega (u) to correspond to a deployment position t in the weight omega (u) corresponding to all communication nodes in the set omega, actually measuring the psi (t, w) between the deployment position t and the communication node w deployed in the previous round, and re-estimating the communication radius of all the communication nodes by using the method for estimating the communication radius of the communication nodes in the communication network disclosed in the first part of the invention;
if ψ (t, w) is more than or equal to θ, a new relay node t is successfully deployed in the communication network, where w=t, p (t) =w, κ (t) =κ (w) +1, and r=rρt; if ψ (t, w) < θ, Ω=Ω\ { t }, and return to point B, and re-execute step C.
It should be understood that in fig. 3, the communication node w deployed in the previous round in step a may be a gateway node or a relay node. The double stippled line box in fig. 3 corresponds to step C. If the communication node w deployed in the previous round in the step A is the gateway node g, then
p(w)＝-1，κ(w)＝0。
Third part of the invention
Referring to fig. 2-3, the communication node is composed of gateway nodes, sensor nodes and candidate nodes, the positions for deploying the communication nodes comprise gateway node deployment positions, n sensor node deployment positions and m candidate node deployment positions, the gateway node set is { g }, and the sensor node set is S= { S 1 ,s 2 ,…,s n The candidate node set is C= { C } 1 ,c 2 ,…,c m -comprising the steps of:
step A, setting a communication node for the previous round of deployment as w, setting a parent node of the communication node w as p (w), setting the hop count from a gateway node to the communication node for the previous round of deployment as k (w), setting a deployed relay node set as R, and recording a restoration point A; generally, a gateway node g is deployed at a gateway node deployment location;
estimating the communication radius of all communication nodes by using a method for estimating the communication radius of communication nodes in a communication network disclosed in the first part of the invention, and constructing a communication topological graph G= (V, E), wherein V is a communication node set, and E is an edge set;
the construction method of the edge is as follows: any two communication nodes u and V in the communication node set V are traversed, and if u-V is less than min (r v ,r u ) An edge connecting two points of the communication node u and the communication node v exists in the communication topological graph G, wherein I U-V I is the distance between the communication node u and the communication node v, and r is the distance between the communication node u and the communication node v u For the communication radius, r, of the communication node u v Is the communication radius of the communication node v.
Step B, updating the communication node w deployed in the previous round to deploy the relay node, typically, deploying the relay node at the candidate node deployment position, and constructing all neighbor communication nodes of the communication node w deployed in the previous round in the communication topology graph G to form a set N G (w) one by one actually deploying communication node w and set N in the previous round G The packet receiving rate (psi (S, w)) between any sensor nodes S in (w) backand S, the channel quality constraint is set as theta, the sensor nodes with the packet receiving rate (psi (S, w)) more than or equal to theta between the communication nodes w deployed in the previous round are first sensor nodes, the first sensor nodes are deleted from the set S, and the set S is updated;
traversing set Ω=n G Each communication node u in (w) \ (R ≡S) is used for acquiring a sensor node set y (u) which can be effectively connected by each communication node u as
{Υ(u)|s∈S,h(p G (s,u))+κ(w)+1≤δ} (15)
Wherein p is G (s, u) represents the shortest path from the sensor node s to the communication node u in the communication topology graph G;
recording a restore point B;
step C, if
Or a set of sensor nodes to which any communication node u of set Ω can be operatively connected ∈>
Restoring to the restoring point A and re-executing the step B; if->
And the set of sensor nodes to which all communication nodes u in set Ω can be operatively connected +.>
The weight of each non-empty communication node u in the weight y (u) is
Wherein T is G (u, y (u)) represents a shortest path tree from communication node u to all sensor nodes in y (u) corresponding to communication node u in communication topology graph G, and |x| represents the number of communication nodes on path tree x;
setting a communication node with the smallest weight omega (u) to correspond to a deployment position t in the weight omega (u) corresponding to all communication nodes in the set omega, actually measuring the psi (t, w) between the deployment position t and the communication node w deployed in the previous round, and re-estimating the communication radius of all the communication nodes by using the method for estimating the communication radius of the communication nodes in the communication network disclosed in the first part of the invention;
if ψ (t, w) is more than or equal to θ, a new relay node t is successfully deployed in the communication network, where w=t, p (t) =w, κ (t) =κ (w) +1, and r=rρt; if ψ (t, w) < θ, Ω=Ω\ { t }, and return to return point B, and re-execute step C;
step D, in the set
When one relay node is deployed successfully, the processes from the step B to the step C are repeatedly executed until the set is +.>
It should be understood that in fig. 3, the communication node deployed in step a may be a gateway node or a relay node. The double stippled line box in fig. 3 corresponds to step C. If the communication node w deployed in the previous round in the step A is the gateway node g, then
p(w)＝-1，κ(w)＝0。
Example 2: fig. 5-12 are schematic diagrams of a progressive relay deployment method based on weighted depth-first. Deployment starts from the gateway node, i.e. v=g, p (g) = -1, h (g) =0. All node communication radii are estimated first using the communication distances of the log-distance path loss model, and a communication topology is constructed according to step a as shown in fig. 5. Then go to step B to search all neighbor nodes of v, and all neighbor nodes in the round, i.e. g, see N in FIG. 5 G (g)＝{c 1 ,c 2 ,c 3 }. Then find c according to equation (15) 1 、c 2 And c 3 A set of operatively connectable sensor nodes and calculating c according to equation (16) 1 、c 2 And c 3 Is a weight of (a). First from c 1 、c 2 And c 3 C with the smallest weight value 1 Then test c 1 And v (this round is g), the packet-receiving rate ψ (c) 1 G) because of ψ (c 1 G) is greater than or equal to θ, so at c 1 Deploying a relay on, and c 1 And recording the U. Let p (c 1) =v, κ (c 1) =κ (v) +1, v=c 1 . And then, the next round is carried out, and the steps B to C are repeatedly executed. And at c in the second wheel 6 One relay node is deployed. After the third round, attempt to place the relay at c 11 Location, but after testing found ψ (c 11 ,c 6 ) The reliability constraint θ cannot be satisfied, and the communication topology change is found after the next round of communication distance estimation, as shown in fig. 6. Find C in the next round of step C 6 Neighbors that can effectively connect sensor nodes can no longer be found in the topology mapThus the current deployment position v is returned to its parent node c 1 The deployment is reattempted. Then at c 1 Also, it is not possible to find neighbors that can effectively connect sensor nodes, so it goes back to c 1 Is deployed again from g.
Steps B through C are repeated all the way through the subsequent deployment process, where fig. 7 shows the method all the way along C 2 、c 9 、c 7 、c 12 Successfully deploy and connect the sensor nodes s 1 Connecting to a gateway node; FIG. 8 shows that the method has not been able to find neighbors that can effectively connect the remaining sensor nodes, along c 12 、c 7 、c 9 Back to c 2 The method comprises the steps of carrying out a first treatment on the surface of the FIG. 9 shows the method from c 2 With successful finding of neighbors effectively connecting the remaining sensor nodes, all the way along c 2 、c 8 、c 13 To c 16 And sensor node s 2 Connecting to a gateway node; FIG. 10 shows that at c16, neighbors that can effectively connect the remaining sensor nodes can no longer be found, returning to c 13 The method comprises the steps of carrying out a first treatment on the surface of the FIG. 11 shows at c 13 With re-finding neighbors c that can effectively connect the remaining sensor nodes 17 And effectively uses the node to drive the last sensor node s 3 Is connected to the gateway node. To this end, all sensor nodes are operatively connected to the gateway node. Finally, generating a shortest path tree which takes the network management node as the root node and connects all the sensor nodes, and eliminating the relay nodes which are not on the tree (namely c) 1 And c 6 ) The final output result is shown in fig. 12.
The invention is described in detail above with reference to the drawings and examples. It should be understood that the description of all possible embodiments is not intended to be exhaustive or to limit the inventive concepts disclosed herein to the precise form disclosed. The technical characteristics of the above embodiments are selected and combined, specific parameters are experimentally changed by those skilled in the art, or the technical means disclosed in the present invention are conventionally replaced by the prior art in the technical field, which is not paid with creative work, and all the specific embodiments are implicitly disclosed in the present invention.
Claims (4)
1. The utility model provides a real-time reliable relay deployment method facing to a power distribution network, wherein a communication node is composed of gateway nodes, sensor nodes and candidate nodes, the positions for deploying the communication nodes comprise gateway node deployment positions, n sensor node deployment positions and m candidate node deployment positions, the gateway node set is { g }, and the sensor node set is S= { S 1 ，s 2 ，…，s n The candidate node set is C= { C } 1 ，c 2 ，…，c m -a }; the method is characterized by comprising the following steps of:
step A, setting a communication node for the previous round of deployment as w, recording a parent node of the communication node w as p (w), setting the hop count from a gateway node to the communication node for the previous round of deployment as k (w), setting a deployed relay node set as R, and recording a restoration point A; estimating the communication radius of all communication nodes by using a method for estimating the communication radius of the communication nodes in a communication network, and constructing a communication topological graph G= (V, E), wherein V is a communication node set, and E is an edge set;
step B, updating the communication node w deployed in the previous round to deploy the relay node, and constructing all neighbor communication nodes of the communication node w deployed in the previous round in the communication topological graph G to form a set N G (w) one by one actually deploying communication node w and set N in the previous round G The packet receiving rate (psi (S, w)) between any sensor nodes S in (w) backand S, the channel quality constraint is set as theta, the sensor nodes with the packet receiving rate (psi (S, w)) more than or equal to theta between the communication nodes w deployed in the previous round are first sensor nodes, the first sensor nodes are deleted from the set S, and the set S is updated;
traversing set Ω=n G Each communication node u in (w) \ (R ≡S) is used for acquiring a sensor node set y (u) which can be effectively connected by each communication node u as
{Υ(u)|s∈S，h(p G (s，u))+κ(w)+1≤δ} (1)
Wherein p is G (s, u) represents the distance from the sensor node s to the communication node in the communication topology graph Gu shortest path;
recording a restore point B;
step C, if
Or a set of sensor nodes to which any communication node u of set Ω can be operatively connected
Restoring to the restoring point A and re-executing the step B; if->
And the set of sensor nodes to which all communication nodes u in set Ω can be operatively connected +.>
The weight of each non-empty communication node u in the weight y (u) is
Wherein T is G (u, y (u)) represents a shortest path tree from communication node u to all sensor nodes in y (u) corresponding to communication node u in communication topology graph G, and |x| represents the number of communication nodes on path tree x;
setting a communication node with the smallest weight omega (u) to correspond to the deployment position of the relay node t in the weight omega (u) corresponding to all communication nodes in the set omega, actually measuring the packet receiving rate psi (t, w) between the relay node t and the communication node w deployed in the previous round, and re-estimating the communication radius of all communication nodes by using a method for estimating the communication radius of the communication node in the communication network;
if ψ (t, w) is more than or equal to θ, a new relay node t is successfully deployed in the communication network, w=t, p (t) =w, κ (t) =κ (w) +1, and r=r { t }; if ψ (t, w) < θ, Ω=Ω\ { t }, and return to return point B, and re-execute step C;
and a step D arranged after the step C, wherein the step D comprises the following steps: at the set
When one relay node is deployed successfully, the processes from the step B to the step C are repeatedly executed until the set is +.>
The method for estimating the communication radius of the communication node in the communication network comprises the following steps:
step 1, acquiring an initial communication radius r, a sensor node hop count constraint delta and a channel quality constraint theta of the communication node; all communication nodes capable of measuring packet rate form a set
All communication nodes incapable of measuring packet rate form a set
Step 2, obtaining the communication radius corresponding to the communication node capable of measuring the packet receiving rate, comprising the following sub-steps,
step 2a, collecting
One of the communication nodes, designated as communication node u, generates a maximum set of communication radii corresponding to communication node u ∈>
Step 2b, collecting
Another communication node is recorded as a communication node v, according to the relationship between the communication node u and the communication node vThe method comprises the steps of (1) obtaining a path loss factor a between a communication node u and a communication node v by the aid of measured packet receiving rate psi (u, v), position information of the communication node u and position information of the communication node u;
calculating the minimum signal to noise ratio
Wherein ρ is the data rate, B N For noise bandwidth, l is datagram length, function Q -1 (x) As an inverse function of the function Q (x), θ is a channel quality constraint;
calculating the maximum communication radius of the communication node u after passing through the communication node v
Where P is the transmit power, PL is the reference distance average path loss, P n Is a noise substrate, d 0 For reference distance gamma min (u, v) is the minimum signal-to-noise ratio between communication node u and communication node v, and a is the path loss factor between communication node u and communication node v;
updating R u ＝R u ∪{d max (u，v)}；
Sub-step 2c, repeatedly executing sub-step 2b to obtain communication node u and set
Maximum communication radius set R between all other communication nodes in the network u Communication radius r of communication node u u ＝minR u ；
Step 3, repeatedly executing the step 2 to obtain a set
Communication node corresponding to any element>
Is a communication radius of (2);
step 4, collecting
Communication node corresponding to any element>
Is set to the communication radius of the communication node +.>
Distance set->
A communication radius corresponding to the nearest communication node.
2. The method for deployment of real-time reliable relays for power distribution networks according to claim 1, wherein in said step 2, according to a set
The method for obtaining the path loss factor a between the communication node u and the communication node v by the measured packet receiving rate ψ (u, v) between the communication node u and the communication node v, the position information of the communication node u and the position information of the communication node v comprises the following steps:
signal-to-noise ratio between communication node u and communication node v
Wherein p is the data rate, B N For noise bandwidth, l is datagram length, function Q -1 (x) Is an inverse function of the function Q (x);
path loss factor between communication node u and communication node v
Where P is the transmit power, PL is the reference distance average path loss, P n Is the noise floor, d is the distance between communication node u and communication node v, d 0 Is the reference distance.
3. The method for deploying relay in real time and reliability for power distribution network according to claim 1, wherein in the step a, if the communication node w deployed in the previous round is the gateway node g
p (w) =one 1, and κ (w) =0. />
4. The method for real-time reliable relay deployment for power distribution networks according to claim 1, wherein in the step a, the method for constructing the edge elements in the edge set E includes the steps of: any two communication nodes u and V in the communication node set V are traversed, and if u-V is less than min (r v ，r u ) An edge connecting two points of the communication node u and the communication node v exists in the communication topological graph G, wherein I U-V I is the distance between the communication node u and the communication node v, and r is the distance between the communication node u and the communication node v u For the communication radius, r, of the communication node u v Is the communication radius of the communication node v.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010506714.5A CN111683377B (en) | 2020-06-05 | 2020-06-05 | Real-time reliable relay deployment method for power distribution network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010506714.5A CN111683377B (en) | 2020-06-05 | 2020-06-05 | Real-time reliable relay deployment method for power distribution network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111683377A CN111683377A (en) | 2020-09-18 |
| CN111683377B true CN111683377B (en) | 2023-05-30 |
Family
ID=72435064
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010506714.5A Active CN111683377B (en) | 2020-06-05 | 2020-06-05 | Real-time reliable relay deployment method for power distribution network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111683377B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113099464B (en) * | 2021-05-12 | 2022-11-08 | 国网河南省电力公司经济技术研究院 | Wireless sensor network deployment method and computer readable medium for power distribution network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109005525A (en) * | 2018-08-07 | 2018-12-14 | 西北工业大学 | A kind of relay network deployment method and device |
| EP3442177A1 (en) * | 2017-08-11 | 2019-02-13 | Helvar Oy Ab | Method and arrangement for optimising the location of a node in a mesh network |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7546094B2 (en) * | 2004-08-27 | 2009-06-09 | International Business Machines Corporation | Method and system for deploying a wireless repeater |
| EP2180741A1 (en) * | 2008-10-27 | 2010-04-28 | Nokia Siemens Networks OY | Apparatus and method for dynamically deploying a network node |
| CN102271342B (en) * | 2011-09-13 | 2014-09-24 | 智格网信息科技(上海)有限公司 | Rapid deploying method and device of wireless ad hoc network |
| CN103716803B (en) * | 2013-12-03 | 2017-06-27 | 西安交通大学 | A kind of wireless sensor network relay node deployment method |
| CN106100892A (en) * | 2016-07-04 | 2016-11-09 | 广东工业大学 | A kind of algorithm building stable dynamic network shortest path tree |
| CN108184239B (en) * | 2016-12-08 | 2021-03-26 | 中国科学院沈阳自动化研究所 | Relay node deployment method in time delay limited wireless sensor network |
| CN109474023B (en) * | 2019-01-22 | 2021-03-02 | 山东大学 | Intelligent power distribution network section real-time updating method and system, storage medium and terminal |
-
2020
- 2020-06-05 CN CN202010506714.5A patent/CN111683377B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3442177A1 (en) * | 2017-08-11 | 2019-02-13 | Helvar Oy Ab | Method and arrangement for optimising the location of a node in a mesh network |
| CN109005525A (en) * | 2018-08-07 | 2018-12-14 | 西北工业大学 | A kind of relay network deployment method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111683377A (en) | 2020-09-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7460976B2 (en) | Semi-definite programming method for ad hoc network node localization | |
| JP2007221790A (en) | Path selection protocol based on link duration for multi-hop ad hoc network | |
| CN103139804B (en) | Energy-saving transmission self-adaption recursive least squares (RLS) distributed-type detection method of wireless sensor network | |
| CN113411213B (en) | Ad hoc network topology control method and cooperative monitoring method based on Internet of things | |
| CN111683377B (en) | Real-time reliable relay deployment method for power distribution network | |
| Gong et al. | Measurement‐based wireless network planning, monitoring, and reconfiguration solution for robust radio communications in indoor factories | |
| CN102970677B (en) | Wireless communication method based on monitoring Gossip average common view technology | |
| EP3425861A1 (en) | Improved routing in an heterogeneous iot network | |
| Li et al. | On designing bandwidth constrained mobile tactical networks for complex terrains | |
| CN103338472B (en) | A kind of wireless network links quality estimation method | |
| CN103152751B (en) | Energy-saving transmission adaptive LMS (Least-Mean Squares) distributed detection method for wireless sensor network | |
| CN111404595B (en) | Method for evaluating health degree of space-based network communication satellite | |
| CN108684052B (en) | Wireless link quality prediction method in high-freedom-degree underwater sensor network | |
| Karjee et al. | Distributed cooperative communication and link prediction in cloud robotics | |
| CN101267403B (en) | A measuring system and method for routing stability of wireless self-organized network | |
| CN108594169B (en) | Multi-robot distributed cooperative positioning method suitable for time-varying communication topology | |
| Champ et al. | Adnl-angle: accurate distributed node localization for wireless sensor networks with angle of arrival information | |
| Yu et al. | Physical topology discovery scheme for wireless sensor networks using random walk process | |
| Siddik et al. | Performance Evaluation of IEEE 802.11 for UAV-based Wireless Sensor Networks in NS-3 | |
| CN107071846B (en) | Ad Hoc unidirectional link network centerless distributed rapid consensus method | |
| CN109884587A (en) | A kind of wireless sensor network locating method calculating environment for mist | |
| Champ et al. | ADNL: Accurate distributed node localization algorithm in Wireless Sensor Networks | |
| CN116647889B (en) | Switching method of wireless communication network applied to intelligent equipment of Internet of things | |
| CN113286257B (en) | Novel distributed non-ranging positioning method | |
| CN113395762B (en) | Position correction method and device in ultra-wideband positioning network |
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 |