CN108493908B - A kind of locality protection partition method considering communication constraint - Google Patents

A kind of locality protection partition method considering communication constraint Download PDF

Info

Publication number
CN108493908B
CN108493908B CN201810196352.7A CN201810196352A CN108493908B CN 108493908 B CN108493908 B CN 108493908B CN 201810196352 A CN201810196352 A CN 201810196352A CN 108493908 B CN108493908 B CN 108493908B
Authority
CN
China
Prior art keywords
main website
substation
matrix
communication
locality protection
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
Application number
CN201810196352.7A
Other languages
Chinese (zh)
Other versions
CN108493908A (en
Inventor
李振兴
龚旸
程宜兴
李振华
翁汉琍
徐艳春
黄景光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Three Gorges University CTGU
Original Assignee
China Three Gorges University CTGU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Three Gorges University CTGU filed Critical China Three Gorges University CTGU
Priority to CN201810196352.7A priority Critical patent/CN108493908B/en
Publication of CN108493908A publication Critical patent/CN108493908A/en
Application granted granted Critical
Publication of CN108493908B publication Critical patent/CN108493908B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02HEMERGENCY PROTECTIVE CIRCUIT ARRANGEMENTS
    • H02H7/00Emergency protective circuit arrangements specially adapted for specific types of electric machines or apparatus or for sectionalised protection of cable or line systems, and effecting automatic switching in the event of an undesired change from normal working conditions
    • H02H7/26Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured
    • H02H7/261Sectionalised protection of cable or line systems, e.g. for disconnecting a section on which a short-circuit, earth fault, or arc discharge has occured involving signal transmission between at least two stations

Abstract

A kind of locality protection partition method considering communication constraint; the technical requirements of this method facing area protection quick-action and reliability; consider to influence substation and the maximum hop count factor of master station communication; and subregional harmony is combined, a kind of locality protection main website Selection Model of permutation and combination preferentially method is proposed based on Floyd shortest path first;Further communication delay Multiple factors attributes are protected to establish substation partitioning model according to influence area property.In the partition process of substation, in conjunction with graph-theory techniques, the influence of the network parameters such as locality protection communication network topology relationship and length, bandwidth is considered, reasonable distribution is carried out to substation.Then N-1 channel-failures in rear predeterminable area are formed with regard to subregion, analyzes in its substation communication back haul, consider the influence of communication delay, amendment and supplement is further realized to subregion domain policy.Effectively overcome the shortcomings of that conventional method needs a large amount of artificial judgments and specified, realizes the Region homogenization of subregion, and intra-area communication time delay is shorter.

Description

A kind of locality protection partition method considering communication constraint
Technical field
The invention belongs to relay protection fields in electric system, are a kind of locality protection square partitions for considering communication constraint Method.
Background technique
Traditional back-up protection carries out tripping decision by information on the spot, and there are adjustings and cooperation, and difficult, extensive trend turns When shifting the deficiencies of easy malfunction.With the development of communication technology, the collection areas power grid multi-source such as domain protection, wide area protection of standing letter The regional protection that breath carries out decision is widely studied because solving the deficiency of traditional back-up protection.This kind of protection system is deposited In a common feature, i.e., to wide area bulk power grid classifying rationally region, region decision center, center is respectively set in subregion According to the communication technology and communication infrastructure, multi-source information in collecting zone is realized the on-line tuning of in-situ protection device or is based on Protection differentiates and trips after multi information fault distinguishing principle realizes area fault.From principle it is found that regional protection zone divides It is suitable whether, directly determine that can multi-source information quickly and accurately be transmitted to region decision center, and then determine region Property protection quick-action and reliability.Therefore, carrying out reasonable subregion to wide area bulk power grid has weight to the regional protection of realization Big and actual meaning.
Currently, having many scholars proposes some regional protection subregion thoughts and realization technology, research method master If carrying out region by region finite element or grid type according to power grid electric topology, substation geographical location or protection philosophy It divides, rarely has the requirement in view of communication system parameter and data transmission for regional protection real-time.Existing a kind of point Area's method first selectes initial center station, divides a finite element region with specified radius.Further according to main website outside finite element region Selection principle determines other main websites, and so on, all websites are subjected to region division (Yin Xianggen, Wang's Yang, Zhang Zhe.Adapt to intelligence The limited wide area relay protection subregion of energy power grid and the strategy [J] that trips.Proceedings of the CSEE, 2010 (07): 1-7).It is another Kind partition method determines zone boundary using method for searching shortest route based on adjacency matrix.Using boundary substation as starting point, use Field Using Fuzzy Comprehensive Assessment determines next central station addressing, and repeat search process is until region division finishes (He Jinghan, Wang Zi Fine jade, Zhang great Hai.Wide area backup protection partition method [J] based on graph theory and fuzzy evaluation.Electric Power Automation Equipment, 2017 (02): 75-82).But for the composition of regionality protection, locality protection depends on the communication technology and communication infrastructure, protection Subregion should further consider the influence of communication constraint.
Summary of the invention
The present invention proposes a kind of locality protection partition method for considering communication constraint, protects communication constraint based on regional, The real-time and harmony for comprehensively considering locality protection communication, establish main website Selection Model and substation partitioning model respectively.In During main website chooses, a kind of permutation and combination preferentially method progress main website selection is proposed based on Floyd shortest path first.In substation In partition process, in conjunction with graph-theory techniques, graph-theory techniques basic theories writes " Graph Theory & Its Application " referring to Zhang Xiandi, Li Zhengliang, high Equal education publishing house, 2005.Consider the influence of the network parameters such as locality protection communication network topology relationship and length, bandwidth, it is right Substation carries out reasonable distribution.Partition method proposed by the present invention can overcome conventional method to need a large amount of artificial judgments and specify Deficiency, realize the Region homogenization of subregion, and intra-area communication time delay is shorter.
The technical scheme adopted by the invention is as follows:
A kind of locality protection partition method considering communication constraint, comprising the following steps:
Step 1: according to system topological, the connection matrix A of system connection can be characterized such as in conjunction with graph-theory techniques building Shown in lower;
Step 2: according to given main website number, all possible combinations of main website is solved and store main website combination Set P;
Step 3: each main website is combined, minimum hop count J of each substation from each main website is sought1,J2…Jm, take most Small value is used as main website-substation minimum hop count si=min { J1,J2…Jm, all minimum hop counts are summed to obtainIt asks Take selected main website combination Connected degree andThe different factor of two dimensions is normalized,Then weighting summation establishes corresponding main website Selection ModelWherein, for jZhong main website form, Sj 1Application permutation and combination preferentially seek by method The normalized form of minimum hop count sum;LjIt is the normalized form of the sum of connected substation quantity of each main website for total Connected degree;Weight ω1And ω2It is determined according to proportion quotiety using analytic hierarchy process (AHP).J1, J2…JmBetween respectively i-th of substation and m main website Minimum hop count;siThe minimum value of minimum hop count between i-th of substation and m main website;To minimum hop count and it is normalized Processing, Smax、SminMinimum hop count and maximum value and minimum value in respectively all main website combinations;LjFor for jZhong main website group It closes, the sum of the Connected degree of all main websites;Lmax、LminThe maximum value and minimum value of Connected degree sum in respectively all main website combinations. Then, optimal main website is solved using Floyd algorithm according to main website Selection Model combine Pj
Step 4: when constructing the influences such as channel width, channel length communication according to system concrete condition combination graph-theory techniques The corresponding channel width matrix B of the influence factor prolonged, channel length matrix D are as follows;
Step 5: substation partitioning model is establishedWherein,K all possible path set, k between two stations are Either path in set, i are any channel in the corresponding t channel of path k;(1/bi)1For i-th channel width inverse Value after normalization;(1/b)maxFor the maximum value of channel width inverse in entire communication network;(1/b)minFor in entire communication network The minimum value of channel width inverse;di 1Value after being normalized for i-th channel length;diFor the length of i-th channel;dmaxFor Channel length maximum value in entire communication network;dminFor channel length minimum value in entire communication network.Then, in conjunction with channel width Matrix B, channel length matrix D solve the minimum weight matrix Q between any two website using Floyd algorithmk
Step 6: weight minimum matrix Q required by step 5 is utilizedk, in conjunction with selected main website and plan substation number according to power It is worth minimum principle and divides substation to each main website;
Step 7: unallocated substation is judged whether there is, and if it exists, go to step eight, unallocated substation is drawn Point, if it does not exist, jump directly to step 7 output division result;
Step 8: being directed to each unallocated substation, according to required minimum weight matrix Qk, obtain remaining substation and master Weight set between standing, chooses in this weight set that the corresponding main website of minimum value is as its optimal main website, by all unallocated sons It stands and distributes to corresponding main website;
Step 9: subregion corrects principle under design N-1 channel-failures, and principle 1: there are feasible circuitous paths for one's respective area When, detour is carried out to the information transmitted on broken string by one's respective area circuitous path;Its substation divides constant.Principle 2: if one's respective area There is no can circuitous path, then need to be transmitted at this time other regions carry out detour.Judge through other regional channel detours to originally Whether main website decision center in region meets delay requirement.If meeting delay requirement, by other region detours, substation is divided not Become;If being unsatisfactory for delay requirement, the smallest main website of delay is transmitted information to, and the substation is divided to corresponding area Domain.Two principle practical application schematic diagrames are shown in attached drawing 1.Division result is modified according to above-mentioned amendment principle.Finally, output point Area's result.
The present invention is a kind of locality protection partition method for considering communication constraint, and advantage is:
1) present invention is directed to requirement of the locality protection for real-time communication, reliability, considers shadow during subregion The Multiple factors for ringing communication delay ensure that after carrying out zone configuration by partitioning strategies proposed by the present invention that communication system can Meet the requirement that multi-source information is transmitted in locality protection.
2) present invention emphasis when design main website Selection Model consider to collect master information the maximum hop count of influence because Element, to introduce Connected degree and this index, the permutation and combination for devising a kind of suitable main website selection is selected convenient for selecting optimal main website Excellent method can effectively ensure that the harmony of communication system after subregion.
3) for the present invention when designing substation partitioning model, considering comprehensively influences the institute that substation information is transmitted to main website time delay There is factor, ensure that the science in terms of substation is divided in communication constraint.
4) the case where present invention considers N-1 channel-failures situation, need to carry out detour processing to the information on broken string.For Different channel-failures situations, is arranged different round about manners, makees corresponding amendment to division result.Communication is effectively guaranteed System is able to satisfy the communication constraint of locality protection under normal circumstances and in the case of channel-failures.
Detailed description of the invention
Fig. 1 is the flow chart for considering the locality protection partition method of communication constraint.
Fig. 2 (a) is disconnection information round about manner schematic diagram (detour in information one's respective area) under different channels fault condition;
Fig. 2 (b) is that (information is circuitous by other regions for disconnection information round about manner schematic diagram under different channels fault condition It returns);
Fig. 2 (c) is that (information is transferred to other regions master to disconnection information round about manner schematic diagram under different channels fault condition It stands).
Fig. 3 is the corresponding communication network topology figure of IEEE39 node system.
Specific embodiment
A kind of locality protection partition method considering communication constraint, comprising the following steps:
Step 1: in conjunction with graph-theory techniques, power telecommunication network is indicated with non-directed graph G=(V, E).Wherein V={ Vi|i =1,2 ..., p } be fundamental node set, a substation in each node on behalf electric system;E={ Ei| i=1, 2 ..., q } it is the branch collection for connecting fundamental node, each branch, which represents the fiber optic communication between connection substation and substation, to be believed Road.The value of branch weight E can represent the physical significances such as channel length.It is closed according to the connection in system between substation and substation System building connection matrix A.
Step 2: according to given main website number, all possible combinations of main website is solved and store main website combination Set P;
Step 3: P is combined for each main websitej, it is based on main website Selection Model, preferentially method is sought most using permutation and combination Excellent main website combination, i.e., combine this g kind, preferentially selects minimum hop count and the higher main website combination of smaller and Connected degree as most Excellent combination;
Step 4: according to concrete conditions such as channel width each in system, channel lengths, the graph theory skill in conjunction with described in step 1 Art is assigned to branch collection E, and then constructs channel width matrix B, channel length matrix D;
Step 5: by the hop count J of path kk, channel width biAnd channel length diAfter normalization, by the shadow to communication delay The degree of sound is weighted summation, establishes substation partitioning model.In conjunction with channel width matrix B, channel length matrix D, according to substation Partitioning model solves the minimum weight matrix Q between any two website using Floyd algorithmk
Step 6: weight minimum matrix Q required by step 5 is utilizedk, in conjunction with selected main website and plan substation number according to power Value QkMinimum principle divides substation to each main website;
Step 7: unallocated substation is judged whether there is, and if it exists, go to step eight, if it does not exist, jump directly to Step 9 exports division result;
Step 8: being directed to each unallocated substation, according to weight matrix required in step 5, obtain remaining substation with Weight set between main website, choosing the corresponding main website of minimum value in this weight set, will be all unallocated as its optimal main website Substation is distributed to corresponding main website;
Step 9: it configures using interregional repetition substation as boundary substation, is corrected according to subregion under N-1 channel-failures Principle is modified, and exports division result.
In step 1, in conjunction with previous constructions non-directed graph G=(V, E) technology, the connection matrix of electric system is constructed, with characterization System topological connection relationship.The building method of connection matrix A is for example shown below:
Wherein, i, j are respectively substation's number, and A (i, j) is that connection matrix A the i-th row jth arranges corresponding value.
In step 2, for given district system, it is assumed that substation's sum is n, and given main website number is m, main website The possibility of random combine hasKind, by main website possible in this g combine storage for permutation and combination preferentially method select it is optimal Main website combination.
In step 3, each main website is combined, minimum hop count of each substation from each main website is sought, is minimized work For main website-substation minimum hop count, and seek selected main website combination Connected degree and, two factors normalization rear weight is added, that is, is built Corresponding main website Selection Model has been found, optimal main website has been solved using Floyd algorithm according to main website Selection Model and combines;
In step 4, using previous constructions non-directed graph G=(V, E) technology, channel length bandwidth matrices B is constructed, channel is long Spend matrix D.
In step 5, in conjunction with channel width matrix B, channel length matrix D, Floyd is utilized most according to substation partitioning model Short path algorithm solves the minimum weight matrix Q between any two websitek
In step 6, using weight minimum matrix required by step 5, in conjunction with selected main website and plan substation number according to power Value QkMinimum principle divides substation to each main website.
In step 7, checks all substation distribution conditions, judge whether there is unallocated substation.
In step 8, for each unallocated substation, from required weight matrix QkThe remaining substation of middle acquisition and main website Between weight set, choose in this weight set that the corresponding main website of minimum value is as its optimal main website, by all unallocated substations It distributes to corresponding main website.
In step 9, it is based on locality protection communication constraint, subregion under N-1 channel-failures is designed and corrects principle, and is right accordingly Above-mentioned subregion is modified.
Following further describes the present invention with reference to the drawings.
The case where being located at same website there are a plurality of bus in IEEE39 node system, therefore will in corresponding communication system It is combined into a point, to obtain the corresponding 17 nodal communication network topological diagram of IEEE39 bus-bar system, including 23 optical fiber letters Road, as shown in Figure 3.Each channel length of system and bandwidth are shown in attached drawing 3.With the corresponding communication system of IEEE39 node system of Fig. 2 For, a kind of locality protection partition method considering communication constraint, specific embodiment is as follows:
Step 1: determining system connection matrix according to system topological combination graph-theory techniques, line number i and columns j are substation Number, the value of corresponding position represent the connection relationship between substation and substation, and construction connection matrix A is as follows;
Step 2: according to given main website number, this example substation number is set as 3, owns to main websiteKind combine into Row is solved and is stored;The set P of all main website combinations is as follows:
P=[1,2,3], [1,2,4] ..., [15,16,17] }
Step 3: each main website being combined, by permutation and combination, preferentially method main website Selection Model solves optimal main website group It closes;Q can be obtainedjCorresponding main website combination, i.e., optimal main website group are combined into P when minimumj=[2,8,10];
Step 4: constructing channel width, channel length etc. according to system concrete condition combination graph-theory techniques influences communication delay Shadow
The corresponding matrix of the factor of sound;
Step 5: in conjunction with channel width matrix, channel length matrix, being solved according to substation partitioning model using Floyd algorithm Minimum weight matrix between any two website;
Step 6: using above-mentioned required weight minimum matrix, in conjunction with selected main website and plan substation number according to weight QkMost Small principle divides substation to each main website.Preliminary division result is as shown in table 1;
The substation number division result according to plan of table 1
Step 7: judging whether there is unallocated substation, and if it exists, go to step (8) jump directly to if it does not exist Step 9 exports division result.In this example, substation B14, B16 are unallocated, therefore go to step 8;
Step 8: being directed to each unallocated substation, according to weight matrix required in step 5, obtain remaining substation and master Weight set between standing, chooses in this weight set that the corresponding main website of minimum value is as its optimal main website, by all unallocated sons It stands and distributes to corresponding main website.In this example, the weight set of remaining substation and main website is as follows;
Qk(B14)=[1.77 0.89 2.21]
Qk(B16)=[1.33 1.38 0.79]
Weight 0.89 between substation B14 and main website B8 is minimum value, the weight 0.79 between substation B16 and main website B10 Minimum value.Therefore, substation B14 should be divided in the corresponding region main website B8, and substation B16 should be divided in the corresponding region main website B10.
Step 9: configuring using interregional repetition substation as boundary substation, corrected according to subregion under N-1 channel-failures Principle is modified division result, exports division result, this example division result is as follows.
2 substation all standing division result of table

Claims (6)

1. a kind of locality protection partition method for considering communication constraint, it is characterised in that the following steps are included:
Step 1: in conjunction with graph-theory techniques, building can characterize the connection matrix A of system connection;
Step 2: according to given main website number, solving all possible combinations of main website, and stores the g kind group of main website Close P1....Pg
Step 3: P is combined for each main websitej(j=1,2,3...g) is based on main website Selection Model, is selected using permutation and combination Excellent method seeks optimal main website combination, i.e., this g kind is combined, preferential to select minimum hop count and the higher main website of smaller and Connected degree Combination is used as optimum combination;
Step 4: according to channel width each in system, the concrete condition of channel length, the graph-theory techniques in conjunction with described in step 1 are assigned It is worth and gives branch collection E, and then constructs channel width matrix B, channel length matrix D;
Step 5: by the hop count J of path kk, channel width biAnd channel length diAfter normalization, by the influence journey to communication delay Degree is weighted summation, establishes substation partitioning model;In conjunction with channel width matrix B, channel length matrix D, divided according to substation Model solves the weight minimum matrix Q between any two website using Floyd algorithmk
Step 6: weight minimum matrix Q required by step 5 is utilizedk, in conjunction with selected main website and plan substation number, most according to weight Minor matrix QkMinimum principle divides substation to each main website;
Step 7: unallocated substation is judged whether there is, and if it exists, go to step eight, if it does not exist, jump directly to step Nine output division results;
Step 8: being directed to each unallocated substation, according to weight matrix required in step 5, obtains remaining substation and main website Between weight set, choose in this weight set that the corresponding main website of minimum value is as its optimal main website, by all unallocated substations It distributes to corresponding main website;
Step 9: it is configured using interregional repetition substation as boundary substation, corrects principle according to subregion under N-1 channel-failures It is modified, exports division result.
2. a kind of locality protection partition method for considering communication constraint according to claim 1, which is characterized in that step 1 In, using the connection matrix of graph-theory techniques construction electric system, to characterize system topological connection relationship;The construction of connection matrix A Method is for example shown below:
3. a kind of locality protection partition method for considering communication constraint according to claim 1, which is characterized in that step 2 In, for given district system, it is assumed that substation's sum is n, and given main website number is m, the possibility of main website random combine HaveKind, by the possible main website combination storage of this g kind so that preferentially method selects optimal main website combination to permutation and combination.
4. a kind of locality protection partition method for considering communication constraint according to claim 1, it is characterised in that: step 3 In, each main website is combined, minimum hop count of each substation from each main website is sought, is minimized as main website-substation most Small hop count, and seek selected main website combination Connected degree and two factors normalization rear weight is added, that is, establishes corresponding main website Selection Model solves optimal main website using Floyd algorithm according to main website Selection Model and combines.
5. a kind of locality protection partition method for considering communication constraint according to claim 1, it is characterised in that: step 7 In, it checks all substation distribution conditions, judges whether there is unallocated substation.
6. a kind of locality protection partition method for considering communication constraint according to claim 1, it is characterised in that: step 9 In, it is based on locality protection communication constraint, subregion under N-1 channel-failures is designed and corrects principle, and above-mentioned subregion is repaired accordingly Just;Correct principle, principle 1: one's respective area is there are when feasible circuitous path, by one's respective area circuitous path to transmitting on broken string Information carries out detour;Its substation divides constant;Principle 2: if one's respective area there is no can circuitous path, need to be transmitted to it at this time He carries out detour in region;Judge whether meet delay requirement through other regional channel detours to one's respective area main website decision center;If Meet delay requirement, then by other region detours, it is constant to divide substation;If being unsatisfactory for delay requirement, transmit information to The smallest main website of delay, and the substation is divided to corresponding region.
CN201810196352.7A 2018-03-09 2018-03-09 A kind of locality protection partition method considering communication constraint Active CN108493908B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810196352.7A CN108493908B (en) 2018-03-09 2018-03-09 A kind of locality protection partition method considering communication constraint

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810196352.7A CN108493908B (en) 2018-03-09 2018-03-09 A kind of locality protection partition method considering communication constraint

Publications (2)

Publication Number Publication Date
CN108493908A CN108493908A (en) 2018-09-04
CN108493908B true CN108493908B (en) 2019-11-08

Family

ID=63338268

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810196352.7A Active CN108493908B (en) 2018-03-09 2018-03-09 A kind of locality protection partition method considering communication constraint

Country Status (1)

Country Link
CN (1) CN108493908B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102021210935B3 (en) 2021-09-30 2022-11-10 Robert Bosch Gesellschaft mit beschränkter Haftung Method for determining a master clock in a communication network
CN115022156B (en) * 2022-07-22 2024-02-02 烽火通信科技股份有限公司 Network management method and system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1327587C (en) * 2005-09-02 2007-07-18 清华大学 Voltage control method based on soft partitions in power system
CN103532237A (en) * 2013-10-21 2014-01-22 中国南方电网有限责任公司 Wide-area protection control system based on IEEE1588 network timing protocol
CN104078946B (en) * 2013-10-30 2015-08-05 中国南方电网有限责任公司 A kind of wide area distance protecting method towards transformer station
CN107070750B (en) * 2017-04-11 2018-02-27 中国民航大学 Pre-configured IMA platform networks scheduling data for communication generation method based on constraint

Also Published As

Publication number Publication date
CN108493908A (en) 2018-09-04

Similar Documents

Publication Publication Date Title
CN109523051B (en) Electric automobile charging real-time optimization scheduling method
CN104537580B (en) The construction method of distribution network structure based on K means clusters
CN105656198B (en) A kind of acquisition methods of powerline network redundant path strategy
CN111431173B (en) Medium-voltage distribution network ring network structure determination method and system considering load complementary characteristics
CN106685745B (en) A kind of constructing network topology method and device
CN108493908B (en) A kind of locality protection partition method considering communication constraint
Deng et al. Optimal design of feeder-bus network related to urban rail line based on transfer system
CN105208622A (en) High-efficiency dynamic automatic-maintenance routing list structure and routing list management method
CN107800624A (en) A kind of optimal circuitous path selection new method of regional protection key message
CN102546440A (en) Routing and wavelength assignment method and system
CN110290001B (en) Single-chain structure optimization method, device and equipment for power communication network
CN107085939B (en) A kind of highway VMS layout optimization method divided based on road network grade
CN112887207B (en) Service route distribution method and device for power IP-optical communication network
CN104994508A (en) Cognitive radio mesh network resource distribution and routing method
CN110740394A (en) Power optical transmission network optimization method and system based on site classification business classification
CN106973015A (en) A kind of middle voltage distribution networks power line carrier communication routing algorithm
CN107689884A (en) A kind of method of half network plan simulation in kind of power communication
Wei et al. Transmission network planning with N-1 security criterion based on improved multi-objective genetic algorithm
CN110197302A (en) A kind of distribution network planning method considering Connection Mode topological constraints
CN110139173A (en) A kind of network dividing area method reducing optical transfer network end-to-end time delay
CN107248926B (en) Multi-objective-oriented EPON planning method
CN113055221B (en) Typical bandwidth demand measuring and calculating method for power communication network transmission network based on region division
CN105720570B (en) A kind of DC grid rack construction method
Elroby et al. Generalized optimal placement of PMUs considering power system observability, communication infrastructure, and quality of service requirements
CN112018757A (en) General example generation method for morphological evolution of power distribution 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
EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180904

Assignee: Yichang Yizhixing Technology Co.,Ltd.

Assignor: CHINA THREE GORGES University

Contract record no.: X2023980034895

Denomination of invention: A Regional Protection Zoning Method Considering Communication Constraints

Granted publication date: 20191108

License type: Common License

Record date: 20230426

EE01 Entry into force of recordation of patent licensing contract
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20180904

Assignee: Hubei Yispatiotemporal Unmanned Aerial Vehicle Technology Co.,Ltd.

Assignor: CHINA THREE GORGES University

Contract record no.: X2023980044218

Denomination of invention: A Regional Protection Zoning Method Considering Communication Constraints

Granted publication date: 20191108

License type: Common License

Record date: 20231024