CN108833152A - Electric power wireless private network end-to-end performance monitoring node deployment method and device - Google Patents
Electric power wireless private network end-to-end performance monitoring node deployment method and device Download PDFInfo
- Publication number
- CN108833152A CN108833152A CN201810570770.8A CN201810570770A CN108833152A CN 108833152 A CN108833152 A CN 108833152A CN 201810570770 A CN201810570770 A CN 201810570770A CN 108833152 A CN108833152 A CN 108833152A
- Authority
- CN
- China
- Prior art keywords
- vertex
- marked
- topological
- adjacent
- default virtual
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
Abstract
The embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment method and device, including：Electric power wireless private network is modeled, topological diagram is generated；The relatively busy route in the topological diagram is obtained using maximum-flow algorithm, and forms topological subgraph compared with the vertex in busy route using described；The vertex that adjacent vertex number is most in the topological subgraph is obtained, disposes monitoring node in the most apex of adjacent vertex number.The electric power wireless private network end-to-end performance monitoring node deployment of minimum cost can be achieved in the present invention.
Description
Technical field
The present embodiments relate to technical field of electric power more particularly to a kind of electric power wireless private network end-to-end performance monitoring sections
Point dispositions method and device.
Background technique
Electric power wireless private network is from power business demand, using the key such as carrier wave polymerization, OFDMA skill in TD-LTE standard
Art is worked using the proprietary 230MHz radio band of electric power, can carry power information acquisition, load control system, power distribution automation and
The work such as intelligent substation on-line monitoring analysis.With the continuous development of smart grid, industry that electric power wireless private network can carry
Service type is also more abundant.Meanwhile electric power wireless private network end-to-end performance monitoring is undoubtedly particularly significant.
In the prior art, electric power wireless private network performance monitoring node deployment scheme is generally basede on entire communication network carry out portion
Administration, lower deployment cost are higher.
Summary of the invention
The embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment method and device, to
It solves to be disposed based on entire communication network in the prior art, the higher problem of lower deployment cost.
The embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment method, including：To electricity
The modeling of power wireless private network, generates topological diagram；The relatively busy route in the topological diagram is obtained using maximum-flow algorithm, and utilizes institute
It states and forms topological subgraph compared with the vertex in busy route；The vertex that adjacent vertex number is most in the topological subgraph is obtained,
The most apex of adjacent vertex number disposes monitoring node.
The embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment device, including：It generates
Module, path obtain module and deployment module；The generation module generates topological diagram for modeling to electric power wireless private network；Institute
It states path and obtains module, for obtaining the relatively busy route in the topological diagram using maximum-flow algorithm, and it is more numerous described in
Vertex on busy path forms topological subgraph；The deployment module, for obtaining in the topological subgraph adjacent vertex number most
Monitoring node is disposed in the most apex of adjacent vertex number in more vertex.
The embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment equipment, including：At least
One processor；And at least one processor being connect with the processor communication, wherein：The memory is stored with can quilt
The program instruction that the processor executes, the processor call described program instruction to be able to carry out method as described above.
The embodiment of the present invention provides a kind of non-transient computer readable storage medium, the non-transient computer readable storage
Medium storing computer instruction, the computer instruction make the computer execute method as described above.
Electric power wireless private network end-to-end performance monitoring node deployment method and device provided in an embodiment of the present invention, by right
The modeling of electric power wireless private network, generates topological diagram；The relatively busy route in the topological diagram is obtained using maximum-flow algorithm, and is utilized
The vertex compared in busy route forms topological subgraph；The vertex that adjacent vertex number is most in the topological subgraph is obtained,
In the most apex deployment monitoring node of adjacent vertex number, it can be achieved that the electric power wireless private network of minimum cost is end-to-end
Performance monitoring node deployment.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is this hair
Bright some embodiments for those of ordinary skill in the art without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is electric power wireless private network end-to-end performance monitoring node deployment method embodiment flow chart of the present invention；
Fig. 2 is electric power wireless private network end-to-end performance monitoring node deployment Installation practice structural schematic diagram of the present invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
As shown in Figure 1, the embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment method,
Including：101, electric power wireless private network is modeled, generates topological diagram；102, using maximum-flow algorithm obtain in the topological diagram compared with
Busy route, and topological subgraph is formed compared with the vertex in busy route using described；103, it obtains adjacent in the topological subgraph
Monitoring node is disposed in the most apex of adjacent vertex number in the most vertex of vertex number.
Electric power wireless private network end to end performance refers to that electric power wireless private network is communicated based on node end to end, i.e. each business
Node sends the business datum of oneself, by the forwarding of several routing nodes, is finally reached some base-station node.According to institute
The difference of the attributes such as type of service, service node quantity, QoS requirement is selected, can be selected in each specific communication process
Different nodes carries out the transmission of business data flow.Therefore, according to the above electrical network business feature, the present invention is by electric power wireless private network
End-to-end communication network abstraction at topological diagram.
Electric power wireless private network is in the communications and not all node can a large amount of transmission services data.But busier node,
Once there is performance fault, tremendous influence can be carried out to entire communication band.Therefore, when considering to reduce monitoring node lower deployment cost,
For the efficiency for guaranteeing monitoring, copes with busier node and be monitored.In the present embodiment, described in being obtained using maximum-flow algorithm
Relatively busy route in topological diagram forms topological subgraph using the vertex compared in busy route, then examines from topological subgraph
Consider monitoring node deployed position.In topological subgraph, it is contemplated that the most node communication of adjacent node is more frequent, therefore, obtains
The most vertex of adjacent vertex number in the topology subgraph, in the most apex deployment monitoring section of adjacent vertex number
Point.
Electric power wireless private network end-to-end performance monitoring node deployment method provided in an embodiment of the present invention, by electric power without
The modeling of line private network, generates topological diagram；Obtain the relatively busy route in the topological diagram using maximum-flow algorithm, and using it is described compared with
Vertex in busy route forms topological subgraph；The vertex that adjacent vertex number is most in the topological subgraph is obtained, in adjoining
The most apex deployment monitoring node of vertex number is, it can be achieved that the electric power wireless private network end to end performance of minimum cost is supervised
Survey node deployment.
It is described that electric power wireless private network is modeled as a kind of alternative embodiment, topological diagram is generated, is specifically included：By business
Node, routing node and base-station node generate topological diagram as vertex；Two when indicating described top in the topological diagram
Point corresponding node is able to carry out communication.
In the present embodiment, the node in electric power wireless private network is divided into three classes according to the characteristics of electrical network business：Base-station node,
Routing node and service node.Wherein, without being in communication with each other between base-station node, but each base-station node and a routing
Node carries out traffic communications.Each routing node can be led to several base-station nodes, routing node and service node
Letter.But routing node is due to objective condition such as physical attribute and device attributes, the communication industry that can be carried out within the unit time
There are the upper limits for business stream quantity.Each service node is connected between each other also without communication with a routing node.Cause
This generates topological diagram using service node, routing node and base-station node as vertex.It is deposited between the node corresponding vertex of communication
On side.The weight on the vertex is the Forwarding Delay value of corresponding node；It is described while weight be it is described while two vertex correspondences
The communication carrier amount of node.
It is described to obtain the relatively busy route in the topological diagram using maximum-flow algorithm as a kind of alternative embodiment, tool
Body includes：Default virtual starting point is marked and is scanned, further according to the default virtual starting point to related in the topological diagram
Vertex is marked, until default virtual termination is labeled；It obtains by the default virtual starting point and the default virtual termination
Between f- can increase road, as described compared with busy route；The stream on road can be increased by updating the f-, delete all quilts in the topological diagram
Mark the label on vertex；Update the default virtual starting point and the default virtual termination, repeat to obtain it is described compared with busy route,
Until all labeled vertex are scanned.
In the present embodiment, in topological diagram, default virtual starting point x is connected to all routings connecting with service node
Default virtual termination y is connect by node corresponding vertex with all base-station node corresponding vertexs.The mark that opposite vertexes are marked
Number represent the traffic that vertex can transmit, by each vertex carry out label it is available by default virtual starting point x to default virtual
The saturation state in each path of terminal y.Therefore, default virtual starting point x is marked to obtain label l (x)=∞ and scans x,
Related top in the topological diagram is marked further according to the default virtual starting point, until default virtual termination is labeled；
Road can be increased by the f- between the default virtual starting point and the default virtual termination by obtaining, as described compared with busy route.
In the present embodiment, updating the f- to increase the stream concrete mode on road is to update f- to increase the stream of the every section of arc in road,
The stream of every section of arc more new formula is as follows：
Wherein, P is that f- can increase road, and l (y) is the label of default virtual termination y, and the stream of f (a) arc a, f ' (a) is the stream of arc a
Updated value.
When due to default virtual starting point x difference, the label on each vertex is different, and busy route is also different, therefore, described in deletion
The label on all labeled vertex in topological diagram；The default virtual starting point and the default virtual termination are updated, repeats to obtain
It is described compared with busy route, until all labeled vertex are scanned.
As a kind of alternative embodiment, described pair of default virtual starting point is marked and scans, further according to the default void
Related top in the topological diagram is marked in quasi- starting point, until default virtual termination is labeled, specifically includes：To default void
Quasi- starting point is marked and scans, if the weight of the default virtual starting point scanned meets threshold value, to it is described
The adjacent vertex of default virtual starting point is marked；If the default virtual termination is not labeled, it is not scanned to any
Marked vertex is scanned, if the weight on the marked vertex scanned meets the threshold value, to it is described
The adjacent vertex in marked vertex is marked, and repetition is scanned any marked vertex not being scanned, and to
The adjacent vertex in the marked vertex scanned is marked, until the default virtual termination is labeled.
In the present embodiment, threshold value represents the lower limit of the traffic, and the node for only meeting the traffic was communicating
Competence exertion acts in journey.If vertex is unsatisfactory for the lower limit that threshold value is not up to the traffic, do not played in passage
Effect, the necessity not monitored.It is pre- in order to obtain to the Vertex Labeling on default virtual starting point to the path of default virtual termination
If virtual starting point between default virtual termination compared with busy route.
As a kind of alternative embodiment, if the weight on the marked vertex scanned meets the threshold value,
Vertex with the marked vertex adjoining scanned is marked, is specifically included：For each to scan
Marking vertex is the first arc of tail, if the stem vertex of first arc is unmarked and first arc is f- unsaturated, to institute
Stem vertex is stated to be marked；For second arc of each headed by the marked vertex scanned, if second arc
Caudal apex is unmarked and second arc be f- just, the caudal apex is marked.
In the present embodiment, for each using the marked vertex scanned as the first arc of tail, if described first
The stem vertex of arc is unmarked and first arc is f- unsaturated, and the formula that the stem vertex is marked is：l(v1)
=min { l (u1),c(a1)-f(a1)}.Wherein, l (v1) be stem vertex label, l (u1) it is the marked vertex scanned
Label, a1For the first arc, c (a1) it is the traffic that the first arc can accommodate, f (a1) be the first arc stream.For each with just
The second arc headed by the marked vertex of scanning, if the caudal apex of second arc is unmarked and second arc is f-
Just, the formula caudal apex being marked is：l(v2)=min { l (u2),f(a2)}.Wherein, l (v2) it is caudal apex
Label, l (u2) it is the label on marked vertex scanned, a2For the second arc, c (a2) it is the communication that the second arc can accommodate
Amount, f (a2) be the second arc stream.
It is described to obtain the vertex that adjacent vertex number is most in the topological subgraph as a kind of alternative embodiment, specifically
Including：Using greedy algorithm, the vertex that adjacent vertex number is most in the topological subgraph is obtained.
In the present embodiment, using greedy algorithm, can constantly from topological subgraph the most vertex of adjacent vertex number,
To realize the monitoring node deployment of minimum cost.
It is described to utilize greedy algorithm as a kind of alternative embodiment, obtain in the topological subgraph adjacent vertex number most
More vertex, specifically includes:Obtain the vertex that adjacent vertex number is most in the topological subgraph；Delete the adjacent vertex number
Side where the most vertex of mesh and the most vertex of adjacent vertex number continues to obtain adjacent vertex number in the topological subgraph
The most vertex of mesh, until all vertex are accessed；Remaining vertex and side constitute new topological subgraph in the topology subgraph,
The label for deleting vertex in the new topological subgraph, repeats the acquisition on the most vertex of above-mentioned adjacent vertex number, until new
Topological subgraph in all sides delete, obtain the most vertex of whole adjacent vertex numbers.
In the present embodiment, f is enabled if its number of vertices is n for topological subgraph G (V, E)i=-1, (0≤i≤n-1),
Vcount=0, Ecount=0, V 'count=0.Wherein, fiIt is accessed for representing vertex i for -1, is that 0 representative has accessed；VcountIt represents
The number on vertex, E are accessedcountRepresent the number for deleting side, V 'countRepresent the number for deleting vertex.It is described to be calculated using greedy
Method, obtain the vertex that adjacent vertex number is most in the topological subgraph the specific steps are：
(1) each degree of vertex in topological subgraph is calculated.If certain degree of vertex is 0, this vertex is deleted.It calculates remaining
The adjoining degree on vertex.The calculation formula of adjacent degree is：Wherein, v is
Any vertex in topological subgraph, L (v) are the adjoining degree of v, and D (v) is the degree of v, and v ' is an adjacent vertex of v, D (v ')
For the degree of v ', NG(v)For the adjacent vertex set of v.It is most as adjacent vertex number to will abut against the maximum vertex i of degree value
Vertex.The vertex can be put into set C.
(2) vertex i, V are deletedcountAdd 1, V 'countAdd 1, | V |=| V |-| V 'count|, and delete all and vertex i and connect
The side connect, every deletion on one side, then EcountAdd 1.All vertex js adjacent with vertex i are labeled as having accessed, i.e. fi=0, every visit
Ask a vertex, then VcountAdd 1.
(3) if Vcount>=| V |, go to step (4)；Otherwise, continue to obtain the maximum vertex k of adjacent degree, if vertex k has been visited
It asks, does not then deal with, if not accessing, go to step (2)；
(4) if Ecount>=| E |, terminate, otherwise, the G behind vertex is deleted in processing, enables all vertex of the G after deleting vertex
It is collectively labeled as having not visited, i.e. fi=-1, and Vcount=0；V′count=0, go to step (1).
As shown in Fig. 2, the embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment device,
It is characterized in that, generation module, path obtain module and deployment module；The generation module, for being built to electric power wireless private network
Mould generates topological diagram；The path obtains module, for obtaining the busier road in the topological diagram using maximum-flow algorithm
Diameter, and topological subgraph is formed compared with the vertex in busy route using described；The deployment module, for obtaining the topological subgraph
Monitoring node is disposed in the most apex of adjacent vertex number in the most vertex of middle adjacent vertex number.
Electric power wireless private network end-to-end performance monitoring node deployment device provided in an embodiment of the present invention, by electric power without
The modeling of line private network, generates topological diagram；Obtain the relatively busy route in the topological diagram using maximum-flow algorithm, and using it is described compared with
Vertex in busy route forms topological subgraph；The vertex that adjacent vertex number is most in the topological subgraph is obtained, in adjoining
The most apex deployment monitoring node of vertex number is, it can be achieved that the electric power wireless private network end to end performance of minimum cost is supervised
Survey node deployment.
The embodiment of the present invention provides a kind of electric power wireless private network end-to-end performance monitoring node deployment equipment, including：At least
One processor；And at least one processor being connect with the processor communication, wherein：The memory is stored with can quilt
The program instruction that the processor executes, the processor call described program instruction to be able to carry out above-mentioned each method embodiment institute
The method of offer, for example including：101, electric power wireless private network is modeled, generates topological diagram；102, it is obtained using maximum-flow algorithm
Relatively busy route in the topological diagram, and topological subgraph is formed compared with the vertex in busy route using described；103, institute is obtained
The vertex that adjacent vertex number is most in topological subgraph is stated, in the most apex deployment monitoring section of adjacent vertex number
Point.
The present embodiment provides a kind of non-transient computer readable storage medium, the non-transient computer readable storage medium
Computer instruction is stored, the computer instruction makes the computer execute method provided by above-mentioned each method embodiment, example
Such as include：101, electric power wireless private network is modeled, generates topological diagram；102, it is obtained in the topological diagram using maximum-flow algorithm
Topological subgraph is formed compared with the vertex in busy route compared with busy route, and using described；103, it obtains adjacent in the topological subgraph
The most vertex of vertex number is connect, disposes monitoring node in the most apex of adjacent vertex number.
The apparatus embodiments described above are merely exemplary, wherein described, unit can as illustrated by the separation member
It is physically separated with being or may not be, component shown as a unit may or may not be physics list
Member, it can it is in one place, or may be distributed over multiple network units.It can be selected according to the actual needs
In some or all of the modules achieve the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying creativeness
Labour in the case where, it can understand and implement.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can
It realizes by means of software and necessary general hardware platform, naturally it is also possible to pass through hardware.Based on this understanding, on
Stating technical solution, substantially the part that contributes to existing technology can be embodied in the form of software products in other words, should
Computer software product may be stored in a computer readable storage medium, such as ROM/RAM, magnetic disk, CD, including several fingers
It enables and using so that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation
Method described in certain parts of example or embodiment.
Finally it should be noted that：The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that：It still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (10)
1. a kind of electric power wireless private network end-to-end performance monitoring node deployment method, which is characterized in that including：
Electric power wireless private network is modeled, topological diagram is generated；
The relatively busy route in the topological diagram is obtained using maximum-flow algorithm, and using described compared with the vertex shape in busy route
At topological subgraph；
The vertex that adjacent vertex number is most in the topological subgraph is obtained, in the most apex portion of adjacent vertex number
Affix one's name to monitoring node.
2. generating topological diagram, tool the method according to claim 1, wherein described model electric power wireless private network
Body includes：
Using service node, routing node and base-station node as vertex, topological diagram is generated；Described in side expression in the topological diagram
Two vertex correspondence nodes on side are able to carry out communication.
3. the method according to claim 1, wherein described obtained in the topological diagram using maximum-flow algorithm
Compared with busy route, specifically include：
Default virtual starting point is marked and is scanned, further according to the default virtual starting point to related top in the topological diagram
It is marked, until default virtual termination is labeled；
Road can be increased by the f- between the default virtual starting point and the default virtual termination by obtaining, as the busier road
Diameter；
The stream on road can be increased by updating the f-, delete the label on all labeled vertex in the topological diagram；
The default virtual starting point and the default virtual termination are updated, is repeated compared with busy route described in acquisition, until all quilts
The vertex of label is scanned.
4. according to the method described in claim 3, it is characterized in that, described pair of default virtual starting point is marked and scans, then
Related top in the topological diagram is marked according to the default virtual starting point, until default virtual termination is labeled, tool
Body includes：
Default virtual starting point is marked and is scanned, if the weight of the default virtual starting point scanned meets thresholding
Value is then marked the vertex adjacent with the default virtual starting point；
If the default virtual termination is not labeled, any marked vertex not being scanned is scanned, if sweeping
The weight on the marked vertex retouched meets the threshold value, then marks to the vertex adjacent with the marked vertex
Note, repetition be scanned any marked vertex not being scanned, and to adjacent with the marked vertex scanned
Vertex is marked, until the default virtual termination is labeled.
5. if according to the method described in claim 4, it is characterized in that, the weight on the marked vertex scanned meets
The threshold value is then marked the vertex with the marked vertex adjoining scanned, specifically includes：
For each using the marked vertex scanned as the first arc of tail, if the stem vertex of first arc is unmarked
And first arc is f- unsaturated, and the stem vertex is marked；
For second arc of each headed by the marked vertex scanned, if the caudal apex of second arc is unmarked
And second arc be f- just, the caudal apex is marked.
6. the method according to claim 1, wherein described obtain in the topological subgraph adjacent vertex number most
More vertex, specifically includes：
Using greedy algorithm, the vertex that adjacent vertex number is most in the topological subgraph is obtained.
7. being obtained in the topological subgraph the method according to claim 1, wherein described utilize greedy algorithm
The most vertex of adjacent vertex number, specifically includes:
Obtain the vertex that adjacent vertex number is most in the topological subgraph；
The side where the most vertex of the adjacent vertex number and the most vertex of adjacent vertex number is deleted, continues to obtain institute
The vertex that adjacent vertex number is most in topological subgraph is stated, until all vertex are accessed；
Remaining vertex and side constitute new topological subgraph in the topology subgraph, delete the mark on vertex in the new topological subgraph
Note repeats the acquisition on the most vertex of above-mentioned adjacent vertex number, until all sides are deleted in new topological subgraph, obtains complete
The most vertex of portion's adjacent vertex number.
8. a kind of electric power wireless private network end-to-end performance monitoring node deployment device, which is characterized in that including：Generation module, road
Diameter obtains module and deployment module；
The generation module generates topological diagram for modeling to electric power wireless private network；
The path obtains module, for obtaining the relatively busy route in the topological diagram using maximum-flow algorithm, and utilizes institute
It states and forms topological subgraph compared with the vertex in busy route；
The deployment module, for obtaining the vertex that adjacent vertex number is most in the topological subgraph, in adjacent vertex number
Most apexes disposes monitoring node.
9. a kind of electric power wireless private network end-to-end performance monitoring node deployment equipment, which is characterized in that including：
At least one processor；And
At least one processor being connect with the processor communication, wherein：
The memory is stored with the program instruction that can be executed by the processor, and the processor calls described program to instruct energy
Enough methods executed as described in claim 1 to 7 is any.
10. a kind of non-transient computer readable storage medium, which is characterized in that the non-transient computer readable storage medium is deposited
Computer instruction is stored up, the computer instruction makes the computer execute such as method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810570770.8A CN108833152A (en) | 2018-06-05 | 2018-06-05 | Electric power wireless private network end-to-end performance monitoring node deployment method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810570770.8A CN108833152A (en) | 2018-06-05 | 2018-06-05 | Electric power wireless private network end-to-end performance monitoring node deployment method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108833152A true CN108833152A (en) | 2018-11-16 |
Family
ID=64144022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810570770.8A Pending CN108833152A (en) | 2018-06-05 | 2018-06-05 | Electric power wireless private network end-to-end performance monitoring node deployment method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108833152A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111060104A (en) * | 2019-12-13 | 2020-04-24 | 杭州昕华信息科技有限公司 | Method, device, medium and equipment for determining inspection area of robot |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103093281A (en) * | 2012-12-27 | 2013-05-08 | 吴立新 | Network maximum flow parallel solving method |
| CN104202766A (en) * | 2014-09-03 | 2014-12-10 | 北京邮电大学 | Selecting method and system for network probing node of wireless sensor |
| CN105187273A (en) * | 2015-08-26 | 2015-12-23 | 国网智能电网研究院 | Probe deployment method and device for power communication private network service monitoring |
| CN105871621A (en) * | 2016-05-06 | 2016-08-17 | 安徽继远软件有限公司 | Probe deployment method based on improved greedy strategy |
| CN106507374A (en) * | 2016-10-21 | 2017-03-15 | 浙江工业大学 | The WSN fence intensifying methods of secondary deployment |
-
2018
- 2018-06-05 CN CN201810570770.8A patent/CN108833152A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103093281A (en) * | 2012-12-27 | 2013-05-08 | 吴立新 | Network maximum flow parallel solving method |
| CN104202766A (en) * | 2014-09-03 | 2014-12-10 | 北京邮电大学 | Selecting method and system for network probing node of wireless sensor |
| CN105187273A (en) * | 2015-08-26 | 2015-12-23 | 国网智能电网研究院 | Probe deployment method and device for power communication private network service monitoring |
| CN105871621A (en) * | 2016-05-06 | 2016-08-17 | 安徽继远软件有限公司 | Probe deployment method based on improved greedy strategy |
| CN106507374A (en) * | 2016-10-21 | 2017-03-15 | 浙江工业大学 | The WSN fence intensifying methods of secondary deployment |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111060104A (en) * | 2019-12-13 | 2020-04-24 | 杭州昕华信息科技有限公司 | Method, device, medium and equipment for determining inspection area of robot |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| CN107343302B (en) | Sensor network routing structure optimization method based on multi-core processor | |
| CN103514245B (en) | Creation user it is visible processing tracking can search for and global data base | |
| CN107611962B (en) | Power grid system branch searching method and system and electronic equipment | |
| CN107527112B (en) | Method and equipment for determining shortest path between power equipment | |
| CN110213107A (en) | A kind of autoplacement method, device and equipment for network topological diagram | |
| CN107911300A (en) | Multicast routing optimization method based on whale algorithm and its application on Spark platforms | |
| CN107659505A (en) | The route selecting method and SDN controllers of a kind of SDN | |
| CN109246013A (en) | A kind of method for routing in FC-AE-1553 switching network | |
| CN108833152A (en) | Electric power wireless private network end-to-end performance monitoring node deployment method and device | |
| CN108616401B (en) | Intelligent video content server deployment method and system | |
| CN104639557B (en) | A kind of method, system and equipment for establishing PCEP sessions | |
| CN111800339B (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
| CN105871621A (en) | Probe deployment method based on improved greedy strategy | |
| CN109995580B (en) | VN mapping method based on GA _ PSO hybrid algorithm in 5G network slice | |
| CN106850253A (en) | A kind of method of the transmission time reliability measurement based on multimode network | |
| CN106936731A (en) | The method and apparatus of the message forwarding in software defined network SDN | |
| CN112333102B (en) | Software defined network routing method and system based on knowledge graph | |
| Berghoff et al. | Non-collective scalable global network based on local communications | |
| Singh et al. | Fuzzy logic for reducing data loss during cyber intrusion in smart grid wireless network | |
| JP6732927B2 (en) | Housing form searching apparatus, housing form searching method and program | |
| Yan | Node Deployment Algorithm Based on Improved Steiner Tree | |
| CN110493068A (en) | A kind of network route generating method and system | |
| US9158871B2 (en) | Graph modeling systems and methods |
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 | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20220311 |