CN106506377B - Method for routing foundation for dispatching of power netwoks - Google Patents
Method for routing foundation for dispatching of power netwoks Download PDFInfo
- Publication number
- CN106506377B CN106506377B CN201611026787.4A CN201611026787A CN106506377B CN 106506377 B CN106506377 B CN 106506377B CN 201611026787 A CN201611026787 A CN 201611026787A CN 106506377 B CN106506377 B CN 106506377B
- Authority
- CN
- China
- Prior art keywords
- node
- control centre
- repairment
- request data
- distance
- 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
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000004891 communication Methods 0.000 claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims description 12
- 238000012423 maintenance Methods 0.000 claims description 12
- 230000006855 networking Effects 0.000 claims description 3
- 235000013399 edible fruits Nutrition 0.000 claims 1
- 241001272996 Polyphylla fullo Species 0.000 abstract description 3
- 238000012545 processing Methods 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 abstract description 2
- 239000003990 capacitor Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000010248 power generation Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H02J13/0013—
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02B—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO BUILDINGS, e.g. HOUSING, HOUSE APPLIANCES OR RELATED END-USER APPLICATIONS
- Y02B70/00—Technologies for an efficient end-user side electric power management and consumption
- Y02B70/30—Systems integrating technologies related to power network operation and communication or information technologies for improving the carbon footprint of the management of residential or tertiary loads, i.e. smart grids as climate change mitigation technology in the buildings sector, including also the last stages of power distribution and the control, monitoring or operating management systems at local level
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S20/00—Management or operation of end-user stationary applications or the last stages of power distribution; Controlling, monitoring or operating thereof
- Y04S20/20—End-user application control systems
Abstract
For the method for routing foundation of dispatching of power netwoks, it is related to the Route establishment technology for dispatching of power netwoks.In the present invention, control centre is only communicated in its communication range with track walker, and each node finds satisfactory other track walkers by forwarding, and by satisfactory track walker according to the routing reporting scheduling center established during finding；Control centre is screened further according to different situations, to complete to dispatch.In entire scheduling process, the node that control centre only communicates in range is communicated, and substantial saved the resource of control centre；And in scheduling process, the information scalping process in scheduling is placed at node and is carried out, control centre only needs to carry out fine screen in scalping result, to considerably reduce the speed of control centre's processing data, has saved control centre's resource.The present invention is applicable in Dispatch of electric net and electric power.
Description
Technical field
The present invention relates to the Route establishment technologies for dispatching of power netwoks.
Background technique
Dispatch of electric net and electric power is to guarantee power network safety operation, external reliable power supply, the work of all kinds of power generations
The management means for orderly carrying out and using.
The specific works content of Dispatch of electric net and electric power is the data information fed back according to various information acquisition equipment, or
The information that monitoring personnel provides comprehensively considers items in conjunction with power grid actual operation parameters, such as voltage, electric current, frequency, load
Production work development condition judges power grid security, economical operation state, is referred to by phone or automatic system publication operation
It enables, commander site operation personnel or automatic control system are adjusted, and such as adjust generator output, Load adjustment distribution, switching
Capacitor, reactor etc., so that it is guaranteed that power grid continues safe and stable operation.
Currently, the power equipment fixed for position, since its information is stablized, data are more accurate；But for power grid
The on-site supervision personnel of electric power, what is used by the way of is also the point-to-point communication mode of control centre, and this mode is lowered
The communication load at degree center is serious.
Summary of the invention
The present invention is that the communication in order to solve during Dispatch of electric net and electric power, between on-site supervision personnel uses point pair
Point communicates, the serious problem of communication load in caused scheduling, for the method for routing foundation of dispatching of power netwoks.
For the method for routing foundation of dispatching of power netwoks, it the following steps are included:
Wireless telecom equipment is installed with the track walker of each quasi- networking, is denoted as a node AP, and is set each
The transmission radius ra of communication equipment；
Method for routing foundation for dispatching of power netwoks, comprising the following steps:
Step 1: control centre obtains the coordinate that route reports place for repairment according to route repairing information；
Step 2: control centre is in transmission radius ra, broadcast request data packet, the request data package includes: to report for repairment
Coordinate, distance threshold, the estimated time of arrival in place；
Step 3: other node AP in the transmission radius ra of control centre receive the request data package, it is described other
Node is denoted as the 1st grade of node, and the node AP in transmission radius ra is according to own coordinate and reports location coordinates calculating the two for repairment
Between linear distance, and judge the distance whether be less than or equal to distance threshold, if it is judged that be it is yes, then follow the steps three
One；If it is judged that be it is no, then follow the steps four；
Step 3 one, the node to control centre reply reply data packet, the reply data packet include: self ID, with
Report the arrival time of distance between place, setting for repairment；And execute step 4；
Step 4: the 1st grade of node is written the ID of itself, forms updated request data package in request data package,
And in its communication radius, updated request data package is forwarded to the other node AP for removing control centre；And enable that i's is initial
Value is 2；
Step 5: for (i-1)-th grade of node, the other node AP being communicated in radius are denoted as i-stage node；It is described
I-stage node receives the updated request data package, and is calculated between the two according to own coordinate with location coordinates are reported for repairment
Linear distance, and judge the distance whether be less than or equal to distance threshold, if it is judged that be it is yes, then follow the steps May Day；
If it is judged that be it is no, then follow the steps six；
Step 5 one, i-stage node reversely reply reply data packet, the reply data packet to control centre along the routing
It include: self ID, routing iinformation and the arrival time for reporting distance between place, setting for repairment；And execute step 6；
Step 6: the ID of itself is written in request data package in the i-stage node, updated request data package is formed,
And in its communication radius, updated request data package is forwarded to the other nodes for removing (i-1)-th grade of node；
Step 7: judging whether to reach communication preset time；If it is judged that be it is yes, then each node enters waiting shape
State；If it is judged that be it is no, then enable the value of i add 1, and return to step five；
Step 8: control centre according to each node and reports distance between place, setting for repairment according to the reply data packet received
Arrival time choose final maintenance node AP, and maintenance instructions are issued to it according to the ID of node AP and routing iinformation；It is complete
At primary scheduling.
In step 8, the principle that control centre chooses final maintenance node AP is: by node AP and the spacing for reporting place for repairment
From nearest.
In step 8, the principle that control centre chooses final maintenance node AP is: reporting the place time for repairment by node AP arrival
It is most short.
In the present invention, control centre is only communicated in its communication range with track walker, and each node is sought by forwarding
Satisfactory other track walkers are looked for, and satisfactory track walker is reported into tune according to the routing established during finding
Degree center；Control centre is screened further according to different situations, to complete to dispatch.In entire scheduling process, control centre
The node only communicated in range is communicated, and substantial saved the resource of control centre；And in scheduling process, it will adjust
Information scalping process in degree is placed at node and carries out, and control centre only needs to carry out fine screen in scalping result, thus greatly
The speed of amplitude reduction control centre processing data, has saved control centre's resource.
Specific embodiment
Specific embodiment one, the method for routing foundation for dispatching of power netwoks, it the following steps are included:
Wireless telecom equipment is installed with the track walker of each quasi- networking, is denoted as a node AP, and is set each
The transmission radius ra of communication equipment；
Method for routing foundation for dispatching of power netwoks, comprising the following steps:
Step 1: control centre obtains the coordinate that route reports place for repairment according to route repairing information；
Step 2: control centre is in transmission radius ra, broadcast request data packet, the request data package includes: to report for repairment
Coordinate, distance threshold, the estimated time of arrival in place；
Step 3: other node AP in the transmission radius ra of control centre receive the request data package, it is described other
Node is denoted as the 1st grade of node, and the node AP in transmission radius ra is according to own coordinate and reports location coordinates calculating the two for repairment
Between linear distance, and judge the distance whether be less than or equal to distance threshold, if it is judged that be it is yes, then follow the steps three
One；If it is judged that be it is no, then follow the steps four；
Step 3 one, the node to control centre reply reply data packet, the reply data packet include: self ID, with
Report the arrival time of distance between place, setting for repairment；And execute step 4；
Step 4: the 1st grade of node is written the ID of itself, forms updated request data package in request data package,
And in its communication radius, updated request data package is forwarded to the other node AP for removing control centre；And enable that i's is initial
Value is 2；
Step 5: for (i-1)-th grade of node, the other node AP being communicated in radius are denoted as i-stage node；It is described
I-stage node receives the updated request data package, and is calculated between the two according to own coordinate with location coordinates are reported for repairment
Linear distance, and judge the distance whether be less than or equal to distance threshold, if it is judged that be it is yes, then follow the steps May Day；
If it is judged that be it is no, then follow the steps six；
Step 5 one, i-stage node reversely reply reply data packet, the reply data packet to control centre along the routing
It include: self ID, routing iinformation and the arrival time for reporting distance between place, setting for repairment；And execute step 6；
Step 6: the ID of itself is written in request data package in the i-stage node, updated request data package is formed,
And in its communication radius, updated request data package is forwarded to the other nodes for removing (i-1)-th grade of node；
Step 7: judging whether to reach communication preset time；If it is judged that be it is yes, then each node enters waiting shape
State；If it is judged that be it is no, then enable the value of i add 1, and return to step five；
Step 8: control centre according to each node and reports distance between place, setting for repairment according to the reply data packet received
Arrival time choose final maintenance node AP, and maintenance instructions are issued to it according to the ID of node AP and routing iinformation；It is complete
At primary scheduling.
In the present invention, control centre is only communicated in its communication range with track walker, and each node is sought by forwarding
Satisfactory other track walkers are looked for, and satisfactory track walker is reported into tune according to the routing established during finding
Degree center；Control centre is screened further according to different situations, to complete to dispatch.In entire scheduling process, control centre
The node only communicated in range is communicated, and substantial saved the resource of control centre；And in scheduling process, it will adjust
Information scalping process in degree is placed at node and carries out, and control centre only needs to carry out fine screen in scalping result, thus greatly
The speed of amplitude reduction control centre processing data, has saved control centre's resource.
Specific embodiment two, present embodiment are further limiting for specific embodiment one, in step 8, are adjusted
The principle that final maintenance node AP is chosen at degree center is: by node AP and to report distance between place for repairment nearest.
Specific embodiment three, present embodiment are further limiting for specific embodiment one, in step 8, are adjusted
The principle that final maintenance node AP is chosen at degree center is: it is most short to report the place time for repairment by node AP arrival.
Claims (3)
1. it is used for the method for routing foundation of dispatching of power netwoks, it is characterized in that:
Wireless telecom equipment is installed with the track walker of each quasi- networking, is denoted as a node AP, and set each communication
The transmission radius ra of equipment；
Method for routing foundation for dispatching of power netwoks, comprising the following steps:
Step 1: control centre obtains the coordinate that route reports place for repairment according to route repairing information；
Step 2: control centre is in transmission radius ra, broadcast request data packet, the request data package includes: to report place for repairment
Coordinate, distance threshold, estimated time of arrival；
Step 3: other node AP in the transmission radius ra of control centre receive the request data package, other nodes
It is denoted as the 1st grade of node, the node AP in transmission radius ra is calculated between the two according to own coordinate with location coordinates are reported for repairment
Linear distance, and judge the distance whether be less than or equal to distance threshold, if it is judged that be it is yes, then follow the steps 31；
If it is judged that be it is no, then follow the steps four；
Step 3 one, the node to control centre reply reply data packet, the reply data packet include: self ID, with report for repairment
Distance between place, setting arrival time；And execute step 4；
Step 4: the ID of itself is written in request data package in the 1st grade of node, updated request data package is formed, and
In its communication radius, updated request data package is forwarded to the other node AP for removing control centre；And the initial value of i is enabled to be
2；
Step 5: for (i-1)-th grade of node, the other node AP being communicated in radius are denoted as i-stage node；The i-stage
Node receives the updated request data package, and according to own coordinate and report for repairment location coordinates calculate straight line between the two away from
From, and judge the distance whether be less than or equal to distance threshold, if it is judged that be it is yes, then follow the steps May Day；If sentenced
Disconnected result be it is no, then follow the steps six；
Step 5 one, i-stage node reversely reply reply data packet, the reply data packet to control centre along the routing
It includes: self ID, routing iinformation and the arrival time for reporting distance between place, setting for repairment；And execute step 6；
Step 6: the ID of itself is written in request data package in the i-stage node, updated request data package is formed, and
In its communication radius, updated request data package is forwarded to the other nodes for removing (i-1)-th grade of node；
Step 7: judging whether to reach communication preset time；If it is judged that be it is yes, then each node enters wait state；Such as
Fruit judging result be it is no, then enable the value of i add 1, and return to step five；
Step 8: control centre is according to the reply data packet received, according to each node and report distance between place for repairment, setting is supported
Final maintenance node AP is chosen up to the time, and maintenance instructions are issued to it according to the ID of node AP and routing iinformation；Complete one
Secondary scheduling.
2. the method for routing foundation according to claim 1 for dispatching of power netwoks, it is characterised in that in step 8, in scheduling
The principle that the heart chooses final maintenance node AP is: by node AP and to report distance between place for repairment nearest.
3. the method for routing foundation according to claim 1 for dispatching of power netwoks, it is characterised in that in step 8, in scheduling
The principle that the heart chooses final maintenance node AP is: it is most short to report the place time for repairment by node AP arrival.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611026787.4A CN106506377B (en) | 2016-11-15 | 2016-11-15 | Method for routing foundation for dispatching of power netwoks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611026787.4A CN106506377B (en) | 2016-11-15 | 2016-11-15 | Method for routing foundation for dispatching of power netwoks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106506377A CN106506377A (en) | 2017-03-15 |
| CN106506377B true CN106506377B (en) | 2019-07-26 |
Family
ID=58327356
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611026787.4A Active CN106506377B (en) | 2016-11-15 | 2016-11-15 | Method for routing foundation for dispatching of power netwoks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106506377B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107767646B (en) * | 2017-10-26 | 2020-02-18 | 国网黑龙江省电力有限公司信息通信公司 | Method and device for sending power grid detection data |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101105891A (en) * | 2007-07-27 | 2008-01-16 | 北京金冠鸿远科技有限公司 | GPS vehicle monitoring and scheduling system applying in electric power system |
| CN102194313A (en) * | 2010-03-04 | 2011-09-21 | 苏州百源软件设计有限公司 | Intelligent taxi calling device |
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
| CN103592566A (en) * | 2013-09-02 | 2014-02-19 | 北京交通大学 | Wireless communication based power distribution network distributed online monitoring and fault positioning system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101289083B1 (en) * | 2009-12-21 | 2013-07-22 | 한국전자통신연구원 | Energy Efficient Communication Method in Group Information-based sensor network |
-
2016
- 2016-11-15 CN CN201611026787.4A patent/CN106506377B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101105891A (en) * | 2007-07-27 | 2008-01-16 | 北京金冠鸿远科技有限公司 | GPS vehicle monitoring and scheduling system applying in electric power system |
| CN102194313A (en) * | 2010-03-04 | 2011-09-21 | 苏州百源软件设计有限公司 | Intelligent taxi calling device |
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
| CN103592566A (en) * | 2013-09-02 | 2014-02-19 | 北京交通大学 | Wireless communication based power distribution network distributed online monitoring and fault positioning system |
Non-Patent Citations (1)
| Title |
|---|
| 无线自组织网络在输电线路监测中的应用研究;肖学东;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》;20131215(第S2期);第C042-1483页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106506377A (en) | 2017-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11662760B2 (en) | Wireless communication systems and methods for intelligent electronic devices | |
| CN108199420B (en) | Photovoltaic power plant and secondary frequency modulation control method thereof | |
| Zhou et al. | Distributed secondary control for islanded microgrids with mobile emergency resources | |
| CN104065585B (en) | A kind of method that controller load is dynamically adjusted in software defined network | |
| CN102874279A (en) | Train route handling method | |
| CN105282757A (en) | Multi-operator wireless network collaborative planning system and planning method with optimal network structure | |
| WO2016127513A1 (en) | Baseband pool sharing method and device, and distributed base station system | |
| CN104410076A (en) | Distributed energy network system, microgrid, network scheduling system and forming method thereof | |
| CN106506377B (en) | Method for routing foundation for dispatching of power netwoks | |
| CN105680567A (en) | Fault processing method, device and system of converter system | |
| CN110932291B (en) | Active splitting method for preserving stability of local power grid | |
| CN204578209U (en) | A kind of automation equipment condition intelligent on-line monitoring system | |
| CN102880172A (en) | Real-time control strategy checking method of safety stability control device | |
| CN103207602B (en) | Adaptive scheduling multi-robot patrol method and system | |
| US11588331B2 (en) | Method and system for transferring a load in a thunder and lightning weather | |
| CN104578423A (en) | Intelligent online monitoring system for state of automation equipment | |
| CN106385109B (en) | Dispatching method of electric network based on wireless communication | |
| CN110971132B (en) | Control system, method, device and submodule of modularized multi-level converter | |
| CN106507283B (en) | Cooperating type wireless dispatching method for power grid | |
| CN102970760A (en) | Method and device for scheduling data traffic | |
| CN106100141B (en) | Power station active power and reactive power automatic control system | |
| CN106936141B (en) | Active power control method and control system of flexible ring network controller | |
| CN104953593B (en) | Method for quickly cutting off loads locked by ultra-high-voltage direct current in batches in concurrence manner | |
| CN108390738A (en) | A kind of data transmission method and system based on the synchronization of intelligent substation clock | |
| CN109245934B (en) | Fault processing method, device, system, control equipment and management equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |