CN105262702B - TDMA communication network slot uniform distribution method based on minimal time delay shake - Google Patents
TDMA communication network slot uniform distribution method based on minimal time delay shake Download PDFInfo
- Publication number
- CN105262702B CN105262702B CN201510770651.3A CN201510770651A CN105262702B CN 105262702 B CN105262702 B CN 105262702B CN 201510770651 A CN201510770651 A CN 201510770651A CN 105262702 B CN105262702 B CN 105262702B
- Authority
- CN
- China
- Prior art keywords
- time slot
- matrix
- cost
- state
- communication network
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/826—Involving periods of time
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to electronic communication fields, more particularly to stochastic regime branching algorithm and TDMA communication network slot evenly distribute the scheme present invention for the not perfect of TDMA communication network slot allocative decision research, it is proposed a kind of TDMA communication network slot uniform distribution method based on minimal time delay shake, i.e. using TDMA communication procotol as foundation, based on stochastic regime transfer theory, it is used and in time slot unevenly distributed known, it solves a kind of time slot allocative decision and makes up to minimum delay variation, and it combines and has actually done distribution effects assessment, theory support is provided to the networking planning of TDMA communication network, with very strong realistic meaning.
Description
Technical field
The invention belongs to electronic communication field more particularly to stochastic regime branching algorithm and TDMA communication network slot are uniform
Allocative decision.
Background technology
Delay variation is the important technology index of TDMA communication network, refers to the change of TDMA communication delay of communication
Change, that is, the unstability of communication network.Requirement of the TDMA communication network to delay variation is TDMA communication group of networks network planning
The key component in the stage of drawing, it is significant to seek a kind of scientific and effective slot allocation method.In the time slot of TDMA communication network
The fixation time slot allocative decision of the binary tree usually used in distribution, while ensure that each network user's communication requirement,
It ensure that uniformity of the distributed time slot block in a call duration time unit of data-link so that the work of communication network is steady
Qualitative to greatly improve, deficiency is that the overall uniformity (such as Fig. 1) in different time unit can not be met.In TDMA communication network
In actual utilization, if distributing fixed time slot block to all-network user, the waste of time interval resource is often caused, is reduced
The work efficiency of data-link.It is that a variety of methods of salary distribution collocation such as fixed allocation mode and contention mode use more reasonably to use,
The resource utilization of communication chain is improved, but this can cause the inhomogeneities of available time slot, and the time slot after being, which evenly distributes, to be caused
Obstacle.
With the emergence of new theory, research on TDMA communication network slot optimum allocation also explore continuous and
Deeply.Tradition relies primarily on the distribution of TDMA communication network slot the distribution method of binary tree, when distribution method mainly considers
The feasibility of minimal time delay shake and allocative decision of the gap in a chronomere, however entire TDMA communication network is basic
Call duration time unit circle is reciprocal, and the delay variation cost paid in different allocative decisions is also not quite similar, according to
Many limitations and inaccuracy are there will naturally be by traditional distribution method.There is a small amount of scholar to utilize graph theory directed edge at present
Thought realize the time slot of certain type data-link and evenly distribute, but be confined to time slot it is less in the case of, and be not directed to
Algorithm optimization is actually made, algorithm complexity is caused to greatly increase.
The content of the invention
The present invention is not perfect for TDMA communication network slot allocative decision research, proposes that one kind is trembled based on minimal time delay
Dynamic TDMA communication network slot uniform distribution method that is, using TDMA communication procotol as foundation, is shifted based on stochastic regime
Theory is used and known in time slot unevenly distributed, is solved a kind of time slot allocative decision and is made up to minimum time delay and trembles
It is dynamic, and combine and actually done distribution effects assessment, theory support is provided to the networking planning of TDMA communication network, is had very strong
Realistic meaning.
Based on the TDMA communication network slot uniform distribution method of minimal time delay shake, include the following steps：
S1, made according to TDMA communication network related protocol it is assumed that defining the cost function of delay variation, specially：
S11, the unit interval of TDMA communication network are a time frame, and the timeslot number of a time frame is M, wherein, M is not
The natural number for being zero；
S12, the quantity for being currently available for distributing time slot are N number of, currently need to distribute L time slot to some network user,
Wherein, L is the natural number being not zero；
S13, slot time adjacent in preferable time slot allocative decision areIt is a, in actual time slot allocative decision
In adjacent time slot i and time slot j at intervals of
Wherein, tab (j) is the label of time slot j, and tab (i) is the label of time slot i, i=1,2,3 ..., N, j=1,2,3 ..., N；
S14, distribution time slot i, the shake cost function that j is paid are
S2, it is modeled according to TDMA communication network related protocol and stochastic regime transfer theory, is specially：
S21, the time slot of distribution can be used for be considered an independent state s each, then stateful set S={ s1,
s2,…,si,…,sN-1,sN}；
S22, the transition probability for setting each state to next state are equiprobable, then according to random process correlation theory
Understand P { Si=si|S0=s0,S1=s1,…,Si-1=si-1}=P { Si=si|Si-1=si-1}；
S23, a step cost matrix is definedWherein, in the step cost matrix Ρ
Element meaning be from state siTo state sjThe probability paid；
S24, the N number of time slot of distribution need the state transfer that N is walked, then a step as described in the homogeneity and S23 of Markov chain
Cost matrix Ρ understands that the state-transition matrix of n (1 ＜ n ＜ N) isWherein, step state transfer it is expected that cost isOne step state transfer value matrix is
S25, n step cost matrix are expressed as
S26, path matrix Path (n) is defined；
S27, setting constraints are specially：
The number of timeslots N of distribution can be used for be less than the total number of timeslots M of a time frame in model,
The demand number of timeslots L of some user is less than the number of timeslots N available for distribution in model,
It must assure that allocated number of timeslots is not less than required number of timeslots with remaining number of timeslots in model,
I.e. as n step cost matrixes ΡcIf the i-th row jth column element (n) meetsIt is then that this element is corresponding
State transfer is considered as insignificant state transfer, is set to " × ", and any numerical value and the computing of " × " can all obtain " × "；
S28, set and complete delay variation cost desired value total after time slot distributes as C, then simulated target is C=mindiag
{ΡC(N) }, ΡC(N) Path (N) element in matrix corresponding to minimum diagonal element is minimum delay variation allocative decision；
S3, model integration data M, N, L calculate cost function according to S2, to Ρ described in S25C(n) data letter is carried out
Change, reject insignificant state transfer, calculate n step cost matrixes, path matrix Path (n) described in update S26 selects distribution side
Case；
S4, integrate described in S3 as a result, whether verification result is correct.
Further, concretely comprising the following steps for path matrix Path (n) is defined described in S26：
S261, setFor state set { s1,s2A step state shift paid cost expected matrix and haveWherein, the computation rule of first matrix element is expired
FootRepresent s1→s1→s1/s1→s2→s1The cost of two states transfer it is expected；
The corresponding path of S262, P (2)Equally haveIts
In, a+a+a/b+c+a/a+b+c/b+d+c is represented and corresponding Path (3)：s1→s1→s1→s1/s1→s2→s1→s1/s1→
s1→s2→s1/s1→s2→s2→s1,
The calculating of the expected matrix of S263, other elements and higher order is analogized according to S262.
The beneficial effects of the invention are as follows：
In given unit call duration time in the case of available time slot number and expected distribution timeslot number, the present invention is utilized to propose
Based on minimal time delay shake TDMA communication network slot evenly distribute scheme, can calculate minimal time delay shake time slot
Allocative decision.With reference to reality to algorithm optimization after, algorithm is simple, and calculation amount is small, works well.
Description of the drawings
Fig. 1 is that traditional binary tree time slot distributes schematic diagram.
Fig. 2 is model hypothesis schematic diagram.
Fig. 3 is slot index schematic diagram.
Fig. 4 shifts schematic diagram for state.
Fig. 5 is computing flow diagram.
Fig. 6 assumes schematic diagram for example.
Fig. 7 is allocative decision schematic diagram.
Specific embodiment
With reference to embodiment and attached drawing, the technical solution that the present invention will be described in detail.
S1, made according to TDMA communication network related protocol it is assumed that defining the cost function of delay variation, specially：
As shown in Fig. 2, it is not in general manner, to make the assumption that：
S11, the unit interval of TDMA communication network are a time frame, and the timeslot number of a time frame is M, wherein, M is not
The natural number for being zero；
S12, the quantity for being currently available for distributing time slot are N number of, currently need to distribute L time slot to some network user,
Wherein, L is the natural number being not zero；
Define delay variation cost function：
S13, slot time adjacent in preferable time slot allocative decision areIt is a, in actual time slot allocative decision
In adjacent time slot i and time slot j at intervals of
Wherein, as shown in figure 3, tab (j) is the label of time slot j, tab (i) is the label of time slot i, i=1,2,3 ..., N, j=1,2,
3,...,N；
S14, distribution time slot i, the shake cost function that j is paid are
S2, it is modeled according to TDMA communication network related protocol and stochastic regime transfer theory, is specially：
S21, the time slot of distribution can be used for be considered an independent state s each, then stateful set S={ s1,
s2,…,si,…,sN-1,sN}；
S22, the transition probability for setting each state to next state are equiprobable, then according to random process correlation theory
Understand P { Si=si|S0=s0,S1=s1,…,Si-1=si-1}=P { Si=si|Si-1=si-1, which is next Markov
Process；
S23, a step cost matrix is definedWherein, in the step cost matrix Ρ
Element meaning be from state siTo state sjThe probability paid；
S24, the N number of time slot of distribution need the state transfer that N is walked, then a step as described in the homogeneity and S23 of Markov chain
Cost matrix Ρ understands that the state-transition matrix of n (1 ＜ n ＜ N) isWherein, step state transfer it is expected that cost isOne step state transfer value matrix is
S25, n step cost matrix are expressed as
S26, path matrix Path (n) is defined, is specially：
S261, setFor state set { s1,s2A step state shift paid cost expected matrix and haveWherein, the computation rule of first matrix element is expired
FootRepresent s1→s1→s1/s1→s2→s1The cost of two states transfer it is expected；
The corresponding path of S262, P (2)Equally haveIts
In, a+a+a/b+c+a/a+b+c/b+d+c is represented and corresponding Path (3)：
s1→s1→s1→s1/s1→s2→s1→s1/s1→s1→s2→s1/s1→s2→s2→s1,
The calculating of the expected matrix of S263, other elements and higher order is analogized according to S262；
S27, setting constraints are specially：
The number of timeslots N of distribution can be used for be less than the total number of timeslots M of a time frame in model,
The demand number of timeslots L of some user is less than the number of timeslots N available for distribution in model,
It must assure that allocated number of timeslots is not less than required number of timeslots with remaining number of timeslots in model,
I.e. as n step cost matrixes ΡcIf the i-th row jth column element (n) meetsIt is then that this element is corresponding
State transfer is considered as insignificant state transfer, is set to " × ", and any numerical value and the computing of " × " can all obtain " × ", example
Such as,
S28, set and complete delay variation cost desired value total after time slot distributes as C, then simulated target is C=mindiag
{ΡC(N) }, ΡC(N) Path (N) element in matrix corresponding to minimum diagonal element is minimum delay variation allocative decision；
S3, as shown in figure 5, according to S2 model integration data M, N, L calculate cost function, to Ρ described in S25C(n)
Data reduction is carried out, rejects insignificant state transfer, n step cost matrixes is calculated, updates path matrix Path (n) described in S26,
Select allocative decision；
S4, integrate described in S3 as a result, whether verification result is correct.
Embodiment,
1st, setup parameter, example calculation.
According to TDMA communication network related protocol, setup parameter, the cost value of calculation delay shake.
According to TDMA communication procotol, it is assumed that M=16, N=5, L=4 (such as Fig. 6), i.e.,：Timeslot number in one time frame
For 16；The timeslot number that can be used in one time frame is 5；Certain user needs to distribute 4 time slots from this 5 time slots.
The cost of calculation delay shake.
According toDefinition, whereinAnd combination interval (i,
J) computational methods obtain delay variation cost value C during step state transferi,j：
According to stochastic regime transfer theory and TDMA communication network related protocol, model is established, according to available time slot quantity,
Definition stochastic regime collection is combined into available time slot and is sequentially allocated random transferring state Si, obtain stochastic regime set S={ s1,s2,s3,
s4,s5}：
| Available time slot i | 1 | 2 | 3 | 4 | 5 |
| tab(i) | 3 | 7 | 11 | 14 | 16 |
| Stochastic regime | S1 | S2 | S3 | S4 | S5 |
The cost value that state transfer delay variation is paid forms cost matrix：
Since state transition probability is equal, step state transfer is obtained
Cost matrix
Model describes：
If total delay variation cost desired value is C after completing time slot distribution, then simulated target C=mindiag { ΡC
(4) }, constraints is：1), 16 ＞ 5 meets the total number of timeslots for being less than a time frame available for the number of timeslots of distribution；2)、
5 ＞ 4 meet the needs of some user number of timeslots and are less than available for the number of timeslots distributed；3), n walks cost matrix Ρc
(n) the i-th row jth column element of (0 ＜ n ＜ 4) meets：
It is calculated according to operational flowchart, obtains minimal time delay shake cost allocative decision：Simplify data, reject insignificant
State shifts.It is calculated using constraints：
| J=1 | J=2 | J=3 | J=4 | J=5 | |
| I=1 | It is meaningless | It is meaningless | It is meaningless | ||
| I=2 | It is meaningless | It is meaningless | It is meaningless | ||
| I=3 | It is meaningless | It is meaningless | It is meaningless | ||
| I=4 | It is meaningless | It is meaningless | It is meaningless | ||
| I=5 | It is meaningless | It is meaningless | It is meaningless |
Obtain a step state transfer value matrixRecord corresponding element therein
Path updates path matrix
Two step cost matrix Ρ are calculated using same procedurec(2) and Path (2)：
Wherein, "/" represents the generation of different state transition paths
Valency it is expected.
The path of corresponding element therein is recorded, updates path matrix
Ρ is calculated using same procedurec(3) and Path (3)：
The path of corresponding element therein is recorded, updates path matrix
According to operational flowchart computation rule, Ρ is takenc(3) and ΡcIdentical row and column does expectation computing：
"/" represents that the cost of different state transition paths it is expected.
Record the path of corresponding element therein, newer path matrix Path (4)：
2nd, conformity calculation is as a result, whether verification result of calculation is correct.
According to the four step cost matrix Ρ for calculating gainedc(4), it can be seen that the desired value 2/ of minimum delay variation cost
5, and in the scheme of time delay Least-cost there are four types of, delay variation cost can be obtained from Path (4) and it is expected minimum side
Case is (such as Fig. 7)：{ 1,2,3,4,1 } { 1,2,3,5,1 }, the scheme of delay variation cost maximum are：{ 1,3,4,5,1 }.
All it is 2/5 by calculating the delay variation cost that { 1,2,3,4,1 } { 1,2,3,5,1 } is examined to be paid, 1,3,4,
5,1 } the delay variation cost paid is 22/5.It is so correct through inspection result.
Claims (1)
1. the TDMA communication network slot uniform distribution method based on minimal time delay shake, which is characterized in that include the following steps：
S1, made according to TDMA communication network related protocol it is assumed that defining the cost function of delay variation, specially：
S11, the unit interval of TDMA communication network are a time frame, and the timeslot number of a time frame is M, wherein, M is to be not zero
Natural number；
S12, the quantity for being currently available for distributing time slot are N number of, currently need to distribute L time slot to some network user, wherein,
L is the natural number being not zero；
S13, slot time adjacent in preferable time slot allocative decision areIt is a, the phase in actual time slot allocative decision
Adjacent time slot i and time slot j at intervals of
Wherein, tab (j) is time slot j
Label, tab (i) is the label of time slot i, i=1,2,3 ..., N, j=1,2,3 ..., N；
S14, distribution time slot i, the shake cost function that j is paid are
S2, it is modeled according to TDMA communication network related protocol and stochastic regime transfer theory, is specially：
S21, the time slot of distribution can be used for be considered an independent state s each, then stateful set S={ s1,
s2,…,si,…,sN-1,sN}；
S22, the transition probability for setting each state to next state are equiprobable, then according to random process correlation theory
P{Si=si|S0=s0,S1=s1,…,Si-1=si-1}=P { Si=si|Si-1=si-1}；
S23, a step cost matrix is definedWherein, the member in the step cost matrix Ρ
Plain meaning is from state siTo state sjThe probability paid；
S24, the N number of time slot of distribution need the state transfer that N is walked, then a step cost as described in the homogeneity and S23 of Markov chain
Matrix Ρ understands that the state-transition matrix of n (1 ＜ n ＜ N) is
Wherein, step state transfer it is expected that cost isOne step state transfer value matrix is
S25, n step cost matrix are expressed as
S26, path matrix Path (n) is defined, it is described to define concretely comprising the following steps for path matrix Path (n)：
S261, setFor state set { s1,s2A step state shift paid cost expected matrix and haveWherein, the computation rule of first matrix element is expired
FootRepresent s1→s1→s1/s1→s2→s1The cost of two states transfer it is expected；
The corresponding path of S262, P (2)Equally haveIts
In, a+a+a/b+c+a/a+b+c/b+d+c is represented and corresponding Path (3)：
s1→s1→s1→s1/s1→s2→s1→s1/s1→s1→s2→s1/s1→s2→s2→s1,
<mrow>
<mi>P</mi>
<mi>a</mi>
<mi>t</mi>
<mi>h</mi>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "[" close = "]">
<mtable>
<mtr>
<mtd>
<mfrac>
<mfrac>
<mrow>
<mo>{</mo>
<mn>1111</mn>
<mo>}</mo>
</mrow>
<mrow>
<mo>{</mo>
<mn>1211</mn>
<mo>}</mo>
</mrow>
</mfrac>
<mfrac>
<mrow>
<mo>{</mo>
<mn>1121</mn>
<mo>}</mo>
</mrow>
<mrow>
<mo>{</mo>
<mn>1221</mn>
<mo>}</mo>
</mrow>
</mfrac>
</mfrac>
</mtd>
<mtd>
<mo>*</mo>
</mtd>
</mtr>
<mtr>
<mtd>
<mo>*</mo>
</mtd>
<mtd>
<mo>*</mo>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
The calculating of the expected matrix of S263, other elements and higher order is analogized according to S262；
S27, setting constraints are specially：
The number of timeslots N of distribution can be used for be less than the total number of timeslots M of a time frame in model,
The demand number of timeslots L of some user is less than the number of timeslots N available for distribution in model,
It must assure that allocated number of timeslots not less than required number of timeslots, that is, is worked as with remaining number of timeslots in model
N step cost matrixes ΡcIf the i-th row jth column element (n) meetsThen by the corresponding state of this element
Transfer is considered as insignificant state transfer, is set to " × ", and any numerical value and the computing of " × " can all obtain " × "；
S28, set and complete delay variation cost desired value total after time slot distributes as C, then simulated target is C=min diag { ΡC
(N) }, ΡC(N) Path (N) element in matrix corresponding to minimum diagonal element is minimum delay variation allocative decision；
S3, model integration data M, N, L calculate cost function according to S2, to Ρ described in S25C(n) data reduction is carried out, is picked
Except insignificant state shifts, n step cost matrixes are calculated, path matrix Path (n) described in update S26 selects allocative decision；
S4, scheme described in S3 is integrated, whether verification result is correct.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510770651.3A CN105262702B (en) | 2015-11-12 | 2015-11-12 | TDMA communication network slot uniform distribution method based on minimal time delay shake |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510770651.3A CN105262702B (en) | 2015-11-12 | 2015-11-12 | TDMA communication network slot uniform distribution method based on minimal time delay shake |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105262702A CN105262702A (en) | 2016-01-20 |
| CN105262702B true CN105262702B (en) | 2018-06-05 |
Family
ID=55102210
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510770651.3A Active CN105262702B (en) | 2015-11-12 | 2015-11-12 | TDMA communication network slot uniform distribution method based on minimal time delay shake |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105262702B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107483140B (en) * | 2016-06-07 | 2019-03-08 | 航天恒星科技有限公司 | Network-building method based on TDMA |
| CN109729591B (en) * | 2019-03-25 | 2022-04-05 | 重庆邮电大学 | Time division multiple access time slot allocation method based on genetic algorithm |
| CN113596924B (en) * | 2021-07-12 | 2023-08-15 | 武汉大学 | Periodic time slot allocation method for wireless network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1521988A (en) * | 2003-01-28 | 2004-08-18 | 华为技术有限公司 | Method for uniform distribution of physical layer data transmitting time slot in whole time domain |
| CN101394220A (en) * | 2008-10-22 | 2009-03-25 | 北京航空航天大学 | Time slot uniform distribution method oriented to MF-TDMA system |
-
2015
- 2015-11-12 CN CN201510770651.3A patent/CN105262702B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1521988A (en) * | 2003-01-28 | 2004-08-18 | 华为技术有限公司 | Method for uniform distribution of physical layer data transmitting time slot in whole time domain |
| CN101394220A (en) * | 2008-10-22 | 2009-03-25 | 北京航空航天大学 | Time slot uniform distribution method oriented to MF-TDMA system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105262702A (en) | 2016-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| He et al. | Blockchain-based edge computing resource allocation in IoT: A deep reinforcement learning approach | |
| Wang et al. | Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning | |
| CN109240818A (en) | Task discharging method based on user experience in a kind of edge calculations network | |
| Low et al. | Modelling and heuristics of FMS scheduling with multiple objectives | |
| Mavalizadeh et al. | Hybrid expansion planning considering security and emission by augmented epsilon-constraint method | |
| Nourmohammadi et al. | An imperialist competitive algorithm for multi-objective U-type assembly line design | |
| CN104036324B (en) | Optimal design method of communication network capacity based on genetic algorithm | |
| Shokripour et al. | New method for scheduling heterogeneous multi-installment systems | |
| CN104619029B (en) | It is a kind of centralization cellular network architecture under baseband pool resource allocation methods and device | |
| Xu et al. | Strategic robust mixed model assembly line balancing based on scenario planning | |
| CN104461748B (en) | A kind of optimal localization tasks dispatching method based on MapReduce | |
| CN105262702B (en) | TDMA communication network slot uniform distribution method based on minimal time delay shake | |
| CN111106999A (en) | IP-optical network communication service joint distribution method and device | |
| CN104808770A (en) | Data center energy consumption management method and system based on dynamic frequency modulation | |
| CN101685480A (en) | Parallel computing method for security and stability analysis of large power grid and computing platform | |
| CN106708625A (en) | Minimum-cost maximum-flow based large-scale resource scheduling system and minimum-cost maximum-flow based large-scale resource scheduling method | |
| El-Gallad et al. | Particle swarm optimizer for constrained economic dispatch with prohibited operating zones | |
| Dhaliwal et al. | Modified binary differential evolution algorithm to solve unit commitment problem | |
| Bahmanifirouzi et al. | Multi-objective stochastic dynamic economic emission dispatch enhancement by fuzzy adaptive modified theta particle swarm optimization | |
| CN106991520A (en) | A kind of Economical Operation of Power Systems dispatching method for considering environmental benefit | |
| CN108304925A (en) | A kind of pond computing device and method | |
| CN105391056A (en) | Power system distributed economic dispatching method taking unbalanced communication network into consideration | |
| CN104660677A (en) | Tree CDN-P2P fusion network framework based on grid structure and method thereof | |
| CN106407007A (en) | Elasticity analysis process oriented cloud resource allocation optimization method | |
| CN110490324A (en) | A kind of gradient decline width learning system implementation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |