CN107690196A - A kind of data transmission scheduling method based on channel quality detecting in LTE cellular networks - Google Patents
A kind of data transmission scheduling method based on channel quality detecting in LTE cellular networks Download PDFInfo
- Publication number
- CN107690196A CN107690196A CN201711011552.2A CN201711011552A CN107690196A CN 107690196 A CN107690196 A CN 107690196A CN 201711011552 A CN201711011552 A CN 201711011552A CN 107690196 A CN107690196 A CN 107690196A
- Authority
- CN
- China
- Prior art keywords
- data
- detecting
- transmission
- channel quality
- time
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1221—Wireless traffic scheduling based on age of data to be sent
-
- 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
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of data transmission scheduling method based on channel quality detecting, including based on optimum stopping theory, in 0 0.37*TendSensing channel quality in time, according to detecting variable XN={ N, RN, draw unit data transfer power dissipation obj ectives functional minimum value and maximum, i.e. fmin(N,RN) and fmax(N,RN)；Predict epicycle channel quality detecting stop timing tn, during channel quality detecting, it is f that dynamic, which adjusts object function reference value,ref(N,RN)；According to current channel data transmittability C (t) by demonstrating heartbeat type and can the dynamic dispatching of delaying type data transfer request be transmitted to channel quality optimal time.The present invention is on the basis of tail energy consumption polymerization technique, take full advantage of optimum stopping theory algorithm, on the basis of tail energy consumption occurrence number is reduced, further reduce the transmission energy consumption of data transfer request, unit data transfer energy consumption is effectively reduced, for improving mobile terminal data transmission energy utilization rate, the extension mobile intelligent terminal continuation of the journey working time has deeper meaning.
Description
Technical field
The invention belongs to computer network communication technology field, data pass in more particularly to a kind of LTE cellular network environments
Defeated dispatching method.Existing for the tail time in LTE cellular network environments causes data transmission efficiency low, has a strong impact on mobile whole
The problem of end continuation of the journey operating time, a kind of data transmission scheduling method based on quality of wireless channel detecting is proposed, by tail
The quality of time periodically detecting wireless channel, select to carry out data dispatch transmission in channel quality the best time, belong to meter
Calculation machine technical field of network communication.
Background technology
Today's society, with flourishing for science and technology, mobile communications network is basically completed popularization, intelligent mobile terminal
Mobile communication and internet are combined, greatly facilitated the development of mobile Internet.Application in intelligent mobile terminal
Program software and internet carry out data interaction and have become normality.Either social software is (such as：Facebook, microblogging),
Or instant communication software is (such as：Wechat, QQ) it is required for carrying out data interaction with internet, and also the data package size transmitted is in
Existing ascendant trend, from text data to high definition picture, or even video file.Turn into picture and video in main data transfer
Today of appearance, requirement more and more higher of the mobile Internet to message transmission rate, the function of mobile terminal is stronger and stronger, interface
Abundant application program emerges in an endless stream.
The prosperity of mobile Internet make it that the intelligent mobile terminal continuation of the journey working time is shorter and shorter, is repeatedly charged within one day
Have become normality, have a strong impact on the experience of user.The finiteness of battery of mobile terminal capacity determines its work of continuing a journey
Time is also limited.Current smart mobile phone hardware configuration upgrading is very fast, calculating speed is faster, screen is bigger, data transfer more
Add frequently, and the development of battery receives the influence of its physical technology, progressive speed lags far behind mobile intelligent terminal.
As the cellular network port of one of the important consuming components of mobile intelligent terminal, the energy consumption consumed in the data transmission
A sizable part in occupation of in mobile intelligent terminal total energy consumption.Because cellular network is after the completion of each data transfer, deposit
In one section of tail energy consumption.I.e. port from connection status to resting state during, it is necessary to undergo one section do not perform data transfer but
But the time (i.e. tail time) of high power consumption state is maintained in a manner of DRX cycle, the energy consumption during this period of time consumed is referred to as tail
Energy consumption.In each data transfer of LTE cellular networks, the ratio shared by tail energy consumption has had a strong impact on its energy consumption more than 80%
Utilization rate.It has been investigated how the energy utilization rate of cellular network port is improved, the continuation of the journey work for improving mobile intelligent terminal
It is significant as the time.
Existing LTE cellular network environments lower tail energy optimization technology is broadly divided into two kinds, the i.e. polymerization of tail energy consumption and tail energy
Consumption is stolen.The polymerization of tail energy consumption, which flocks together multiple request of data, disposably to be sent, the tail energy that should will repeatedly occur
Consumption is reduced to once；Tail energy consumption steals the data biography for referring to and utilizing the upper state progress of honeycomb port extra in the tail energy consumption stage
It is defeated, without causing new tail energy consumption.Above tail energy optimization technology can realize cellular network port energy to a certain extent
The lifting of utilization rate is consumed, but there is also following shortcoming：1) the tail energy consumption polymerization technique transmission request big to delay-tolerant degree can
To obtain preferable energy-saving effect, but the immediate communication tool for being commonly used in current smart mobile phone and needs keep long link
The program of state, energy-saving efficiency are bad；2) tail energy consumption steals inactive timer and network of the technology needs according to RRC state machine
Transmission rate, judge to utilize the duration of tail energy consumption stage transmission and prefetch the size of packet to be restricted.
The content of the invention
(1) technical problems to be solved
In view of this, the present invention have studied the quality change situation of wireless channel on the basis of tail energy consumption polymerization technique
With influence of the network throughput to data transfer energy utilization rate.Pass through the detecting wireless channel matter in tail time periodically
Amount, ductile data transfer request is dispatched to by channel quality optimal time using the optimal scheduling strategy of channel quality and carried out
Transmission, so as to reduce the transmission energy consumption of unit data, improve the energy utilization rate of LTE cellular networks.
(2) technical scheme
In order to solve the above technical problems, the present invention proposes the number based on channel quality detecting in a kind of LTE cellular networks
According to transmission dynamic dispatching method, comprise the following steps：
S1：Based on optimum stopping theory, in 0-0.37*TendSensing channel quality in time；
S2：Variable X is detected according to step S1N={ N, RN, draw the minimum value of the object function of unit data transfer energy consumption
And maximum, i.e. fmin(N,RN) and fmax(N,RN)；
S3：Predict epicycle channel quality detecting stop timing tn, with reference to step S2, dynamically adjusted during channel detecting
Object function reference value；
S4：According to heartbeat queue dynamic transmission decision strategy by demonstrating heartbeat type data transfer request dynamic dispatching to step S3 institutes
The channel quality the best time detected；
S5：According to the Throughput of step S3 channel quality the best times detected, current channel data is calculated
Transmittability C (t), according to C (t) and the preferential level dynamic dispatching transmission delay type data of delaying type data.
In some embodiments, described step S1 includes：In 0-0.37*TendTime periodically sensing channel gulps down
Rate is told, draws channel quality detecting Variables Sequence X={ X1,X2,…XN-1,XN}.Wherein, XN={ N, RN}。
In some embodiments, the step S2 includes：Define object function of the present invention, i.e. unit data average transmission
Energy consumption f (N, RN), draw the minimum value and maximum that object function in section is detected in step S1.
The period that channel quality detecting is often taken turns in definition is 0-Tend, send terminal and detectd every cycle T one secondary channel of progress
Survey, per secondary channel, the detecting duration is very short, and much smaller than T, it is E to detect energy consumption every timedet.Detected well when sending terminal
Channel after, duration for transmitting data is t, and transmission energy consumption is P*t, and its value is much larger than detecting energy consumption Edet.Because channel increases
Beneficial g keeps constant in cycle T, so transmission data time t meets condition t≤T.
One, which takes turns the data transfer total energy consumption that channel is detected, is：
EN=NEdet+P*t+Etail
Wherein, N represents to detect preferred channels in n-th, i.e. the action of sensing channel has stopped at n-th；T is represented
Time needed for this secondary transmission data；P is data sending power；EtailRepresent what is wasted during secondary channel quality detecting
Tail energy consumption.
Channel quality reference function is defined, i.e., stops detecting with current time, and with present channel throughput gathered
Close the transmission of data so that mean unit data transfer energy consumption is minimum.When the i-th wheel detecting stops at NiWhen, send terminal and spent
The total time taken is the detecting time With data transmission period t sums；In this period, the demonstrating heartbeat type of generation
It is with delaying type data：Wherein, a makes a living into heartbeat and the sum shared by delayed data bag
According to the ratio of amount.
The data volume that then this wheel can not be transmittedFor：
Then we define unit of transfer's data average energy consumption it is as follows:(assuming that having carried out the detecting of Y wheels)
According to law of great number, i.e. the arithmetic mean of instantaneous value of sequence of random variables is received to the arithmetic mean of instantaneous value of its each mathematic expectaion
Hold back.The formula converges on：
By EN=NEdet+P*t+EtailEquation below can be obtained by substituting into above formula：
Consider t influence, t represents to transmit the time needed for data to be sent, and the Throughput for defining n-hour is RN。
Under average case, the data of transmission and Δ T in the t timesNCaused data volume is equal in the+t times, i.e.
E[RN* t]=E [Vprod*(ΔTN+t)*a]
Wherein Δ TN=N*T, then it can show that the relational expression that t meets is as follows：
To sum up, the transmission energy consumption that can obtain unit data converges on：
So we construct a selection stop timing N to minimize the optimal stopping rule problem of above formula；We can
So that this problem to be described as：
We are defined function f (N, RN) as follows：
By step S1 in 0-0.37*TendThe channel quality detecting Variables Sequence X={ X drawn in time1,X2,…XN-1,
XN, substitute into object function f (N, RN) object function maximum and minimum value, i.e. f in the period can be drawnmin(N,RN) and
fmax(N,RN)。
In some embodiments, the step S3 includes：Channel detecting is carried out using optimum stopping theory algorithm, can be with
Dynamic adjustment channel quality reference value.At the Optimal Stop moment (i.e. data delivery time) of N wheels detecting before recording, sequence is：T
={ t1,t2,…tn-1,tn}.Using the Single-step Prediction in time series forecasting, we predict optimal the stopping of next round channel detecting
Only moment tn+1.Using weighted average predicted method, a weight sequence Weight={ w is set up1,w2,…wn-1,wnAnd the sequence
Row are an increasing sequences, i.e., it is bigger to detect nearer weight from next round.And meet w1+w2+…+wn=1.Then tn+1It can represent
It is as follows：
The detecting stop timing sequence that definition is often taken turns in channel detecting is T={ T1,T2,…Tn-1,Tn, corresponding channel gulps down
It is R={ R to tell rate sequence1,R2,…Rn-1,RnThen ith detecting variable Xi={ Ti, Ri, by every group of { i, RiSubstitute into target letter
Number f (N, RN), f (N, R can be obtainedN) detecting sequence.
I.e. we are by detecting variable Xi, the value actually in detecting object function.Stopped using optimal based on secretary problem
Only theoretical, we are first in 0-0.37*TendThe minimum value of an object function is inside obtained, as a comparison reference value fmin(N,
RN).Wherein TendRepresent the maximum detecting moment.
Safeguard f (N, RN) queue, we by prediction obtained this time stop detecting at the time of tn+1。
By data transfer dynamic dispatching algorithm set forth below, the period that channel quality detecting is often taken turns in definition is 0-
Tend, we increase a constraints for the Optimal Stop algorithm based on secretary problem, realize the dynamic of channel quality reference value
State adjusts.
Wherein fmin(N,RN) it is in 0-0.37*TendThe object function minimum value detected in section, fmax(N,RN) it is to be somebody's turn to do
Object function maximum in section.
In some embodiments, the step S4 includes：Data transfer dynamic dispatching method includes heartbeat queue biography
Defeated decision-making technique.
When data transfer request to be sent belongs to demonstrating heartbeat type request of data, then it is added into heartbeat waiting list.
In the present invention, we are according to certain ratio with data production rate VprodTo generate data waiting for transmission.Take care
When the number of heartbeat packet in jump queue is equal to N, it is believed that the heartbeat queue meets unified transmission condition.
The arrival time sequence that we define N number of heartbeat packet is { t1,t2,…,tn, and corresponding adjustable time sequence
It is classified as { d1,d2,…,dn}.Then the array of delivery time at the latest of each heartbeat packet is as follows：
Time=[t1+d1,t2+d2,…,tn+dn]
Then the minimum value in Time arrays is the last delivery time that this is unified in heartbeat packet transmission mechanism, with TsTable
Show.Select section { Ts-10,TsAs our selectable unified delivery time sections.In the section, use is noted earlier
Method carries out channel quality detecting, selects channel quality optimal time to carry out heartbeat packet aggregation transmission using optimum stopping theory.
In some embodiments, the step S5 includes：Variable is detected according to present channel quality and draws present channel
Data transmission capabilities C (t).
It is assumed that in each slot cycle T, channel gain g keeps constant, i.e., channel transmission rate is kept constant, each
The data total amount that can be transmitted in individual slot cycle T is defined as:
C (t)=T*RN(t)
Represent data transmission capabilities of the wireless channel in a slot cycle
In some embodiments, the step S5 also includes：It is excellent according to channel data transmittability and delaying type data
First level, dynamic dispatching transmission is carried out to delaying type data.
In data transmission scheduling algorithm, data transfer request is divided into 3 types, instant type, demonstrating heartbeat type and delaying type.
The dispatching priority of data transfer request is defined first, and instant type data must be transmitted immediately.
For demonstrating heartbeat type packet, because it can be considered as empty bag, size can be ignored, so it is preferential not set its
Level, acquiescence heartbeat packet can all be sent in this polymerization is sent.
The priority query of delaying type request of data is prioritydelay={ 1,2,3 }, the priority of delayed data request
Divided according to data package size, generally, can delayed data have it is bigger can time delay, it is contemplated that can postpone
The maximum amount of data that can be transmitted when the packet total size in queue and the transmission data of the preferred channels quality moment to detect,
That is the relation of channel optimal transmission ability, the prioritised transmission delaying type small data in the case where data to be transmitted amount is more, that is, count
Smaller according to wrapping, its priority is higher.Finally, we by this aggregation transfer it is remaining can the priority of delayed data reset to can
Limit priority in delay queue, represent next transmission preferences transmission last time remaining data.
Data-oriented generating rate Vprod, can proportionally generate different types of data transfer request.State first
It is used to deposit demonstrating heartbeat type packet in queue 1；Storage can delayed data bag in queue 2.
Data dynamic decision dispatching algorithm comprises the following steps that：
Step 1：Data transfer request
Step 2：Judge present data transmission request type
Step 3：Ask for instant type, to send the request immediately, otherwise go to step 9
Step 4：Judge in queue 1 and queue 2 whether available for transmission data
Step 5：If there are data, channel quality detecting is carried out, it is determined that stopping detecting moment and optimal rate R, is otherwise gone to
Step 1
Step 6：Judge outgoing data total amount Data and data transmission capabilities R*T magnitude relationship in queue 2
Step 7：If Data<=R*T, with the total data in optimal rate R transmit queues 1 and queue 2
Step 8：If Data>R*T, then total data in transmit queue 1, the data in queue 2 are according to priority carry out portion
Distribution is sent, and the priority of remaining data is adjusted into highest level, is gone to afterwards in step 4；
Step 9：Ask as demonstrating heartbeat type, the request is added in queue 1, whether the number for judging to ask in queue 1 is more than
Given threshold, otherwise go to step 11
Step 10：If asking number to be more than given threshold in queue 1, channel quality detecting is carried out, determines optimal transmission
Moment and channel optimal rate, go to step 6；Otherwise step 1 step 11 is gone to：Ask for can delay type, data are added
In queue 2, step 1 is gone to
(3) beneficial effect
The present invention proposes a kind of data transmission scheduling method based on quality of wireless channel detecting, by tail time inner circumferential
The quality of phase property detecting wireless channel, select to carry out heartbeat data in channel quality the best time and the scheduling of delaying type data passes
It is defeated, data transfer energy consumption is effectively reduced, extends mobile intelligent terminal continuation of the journey operating time.
Brief description of the drawings
Fig. 1 is the Optimal Stop algorithm schematic diagram that dynamic of the invention adjusts channel quality reference value；
Fig. 2 is the data transfer dynamic dispatching flow chart of the invention based on preferred channels quality.
Embodiment
With reference to the accompanying drawings and examples, the embodiment of the present invention is described in further detail.Implement below
Example is used to illustrate the present invention, but is not intended to limit the scope of the present invention.
The present invention proposes the data transfer dynamic dispatching method based on channel quality detecting in a kind of LTE cellular networks,
Comprise the following steps：
Step 1：Based on optimum stopping theory, in 0-0.37*TendSensing channel quality in time.
Step 2：Variable X is detected according to step 1N={ N, RN, draw the object function of unit data transfer energy consumption most
Small value and maximum, i.e. fmin(N,RN) and fmax(N,RN)；
Step 3：Predict epicycle channel quality detecting stop timing tn, with reference to step 2, during channel quality detecting
Dynamic adjustment object function reference value.
Step 4：According to heartbeat queue dynamic transmission decision strategy by demonstrating heartbeat type data transfer request dynamic dispatching to step
Three channel quality the best times detected.
Step 5：The Throughput of the channel quality the best time detected according to step 3, calculate present channel
Data transmission capabilities C (t), according to C (t) and the preferential level dynamic dispatching transmission delay type data of delaying type data.
Further, described step one includes：In 0-0.37*TendTime periodically sensing channel throughput, draws
Channel quality detecting Variables Sequence X={ X1,X2,…XN-1,XN}.Wherein, XN={ N, RN}。
Further, the step 2 includes：Define object function of the present invention, i.e. unit data average transmission energy consumption f (N,
RN), draw the minimum value and maximum that object function in section is detected in step 1.
The data transfer energy consumption model based on RRC state machine includes in LTE cellular networks：Send energy consumption and tail energy consumption.
Send the statistical function of energy consumption：Send energy consumption=transmit power * and send the time
There is following relational expression to set up：
Esend=Psend*tsend
Wherein PsendAnd tsendData sending power is represented respectively and sends the time.
Wherein, the time is sent depending on data package size, the transmission rate of uplink and downlink.When cellular network port is sent
Between formula it is as follows：
Wherein, packet.vol represents data package size, and μ represents that upstream data amount accounts for the ratio of bag size, speedupWith
speeddownUpstream rate and downstream rate are represented respectively, and max represents to take between up transmission time and down sending time
Maximum.
Transmit power PsendIt is represented by：
Psend=speedup*αup+speeddown*αdown+β
Wherein, α in LTE networkup、αdownValue with β is respectively：438mW/Mbps, 52mW/Mbps and 1288mW.β is end
Mouth sends base power.Due to base power β presence, thus also need to judge uplink and downlink in transmitting procedure it is overlapping when
Between.Wherein overlapping transmission time tIt is overlappingCalculation formula be：
Wherein, min represents to take minimum value in up transmission time and down sending time.
It can be drawn from above：EIt is overlapping=Psend*tIt is overlapping
I.e.：
Residue sends energy consumption EIt is remainingStatistical function it is as follows：
Residue sends energy consumption=residue and sends time * residue transmit power
Wherein, the remaining transmission time subtracts the overlapping transmission time equal to the time is sent.I.e.：
tIt is remaining=tsend-tIt is overlapping
Remaining transmit power PIt is remainingDepending on sending that send in the time is upstream data or downlink data remaining, such as
Fruit is upstream data, PIt is remaining=speedup*αup+ β, otherwise PIt is remaining=speeddown*αdown+β。
It is then remaining to send energy consumption EIt is remainingFunction it is as follows：
If remaining data is upstream data：
If remaining data is downlink data：
To sum up, energy consumption E is sentsendCalculation formula be：
Esend=EIt is overlapping+EIt is remaining
The statistical function of tail energy consumption is as follows：
Tail energy consumption is left state power by tail time and RRC ports and influenceed in LTE cellular networks.Once complete tail
Power consumption state handoff procedure is：It is continuous to receive state → Short DRX → Long DRX → IDLE.Wherein control the inactive of switching
Timer is Ta、TbAnd Tc.Short cycle and long period discontinuous reception state all employ DRX side under LTE cellular network connected states
Formula, i.e., each state has been divided into the stage of being sunk into sleep and clear-headed stage, and the power per part differs.DRX characteristic is：Only
Have to transmit in clear-headed stage ability response data and ask.If data transfer request reaches in the stage of being sunk into sleep, need when next
The clear-headed stage of individual DRX cycle can just meet with a response.So we must be judged the stage being presently in, Wo Mending
An adopted DRX stage discriminant function.
We define first：
State duration=transmission request delivery time-this state enters the moment
Remaining time=state duration %DRX cycle times
Then DRX condition adjudgements function false code is as follows：
The relation that we are defined as follows：
Transmission intercal time=this transmission request moment-last time is transmitted the moment.It is designated as T
Pconnected=continuously receive state power
PshortAwake=Short DRX regain consciousness stage power
EoneShort=single Short cycles energy consumption
PlongAwake=Long DRX regain consciousness stage power
EoneLong=single Long cycles energy consumption
It can then show that the false code of tail energy consumption statistic function is as follows：
Assuming that to transmit one group of request sequence r={ r1,r2,…rn-1,rn, required total energy consumption EallIt is represented by：
It is contemplated that the data package size sequence p={ p of data transfer request1,p2,…pn-1,pn, then unit data is flat
Transmission energy consumption μ is represented by：
The period that channel quality detecting is often taken turns in definition is 0-Tend, send terminal and detectd every cycle T one secondary channel of progress
Survey, per secondary channel, the detecting duration is very short, and much smaller than T, it is E to detect energy consumption every timedet.Detected well when sending terminal
Channel after, duration for transmitting data is t, and transmission energy consumption is P*t, and its value is much larger than detecting energy consumption Edet.Because channel increases
Beneficial g keeps constant in cycle T, so transmission data time t meets condition t≤T.
One, which takes turns the data transfer total energy consumption that channel is detected, is：
EN=NEdet+P*t+Etail
Wherein, N represents to detect preferred channels in n-th, i.e. the action of sensing channel has stopped at n-th；T is represented
Time needed for this secondary transmission data；P is data sending power；EtailRepresent what is wasted during secondary channel quality detecting
Tail energy consumption.
Channel quality reference function is defined, i.e., stops detecting with current time, and with present channel throughput gathered
Close the transmission of data so that mean unit data transfer energy consumption is minimum.When the i-th wheel detecting stops at NiWhen, send terminal and spent
The total time taken is the detecting time With data transmission period t sums；In this period, the demonstrating heartbeat type of generation
It is with delaying type data：Wherein, a makes a living into heartbeat and the total data shared by delayed data bag
The ratio of amount.
The data volume that then this wheel can not be transmittedFor：
Then we define unit of transfer's data average energy consumption it is as follows:(assuming that having carried out the detecting of Y wheels)
According to law of great number, i.e. the arithmetic mean of instantaneous value of sequence of random variables is received to the arithmetic mean of instantaneous value of its each mathematic expectaion
Hold back.The formula converges on：
By EN=NEdet+P*t+EtailEquation below can be obtained by substituting into above formula：
Consider t influence, t represents to transmit the time needed for data to be sent, and the Throughput for defining n-hour is RN。
Under average case, the data of transmission and Δ T in the t timesNCaused data volume is equal in the+t times, i.e.,
E[RN* t]=E [Vprod*(ΔTN+t)*a]
Wherein Δ TN=N*T, then it can show that the relational expression that t meets is as follows：
To sum up, the transmission energy consumption that can obtain unit data converges on：
So we construct a selection stop timing N to minimize the optimal stopping rule problem of above formula；We can
So that this problem to be described as：
S.t.N={ N:1≤N≤M}
We define unit data average transmission energy consumption function f (N, RN) as follows：
The detecting stop timing sequence that definition is often taken turns in channel detecting is T={ T1,T2,…Tn-1,Tn, corresponding channel gulps down
It is R={ R to tell rate sequence1,R2,…Rn-1,Rn, then n-th detects variable XN={ N, RN}.Pass through periodicity sensing channel, it is intended to
Find out one group of detecting variable XN={ N, RNSo that unit data average transmission energy consumption is function f (N, RN) obtain minimum value.
Further, according to Figure of description 1, the step 3 is additionally included in during channel quality detecting, and dynamic is adjusted
Whole channel quality reference value.
At the Optimal Stop moment (i.e. data delivery time) of N wheels detecting before recording, sequence is：T={ t1,t2,…tn-1,
tn}.Using the Single-step Prediction in time series forecasting, we predict the Optimal Stop moment t of next round channel detectingn+1.Utilize
Weighted average predicted method, set up a weight sequence Weight={ w1,w2,…wn-1,wnAnd the sequence be a progressive sequence
Row, i.e., weight nearer from the next round detecting moment are bigger.And meet w1+w2+…+wn=1.Then tn+1It can represent as follows：
The detecting stop timing sequence that definition is often taken turns in channel detecting is T={ T1,T2,…Tn-1,Tn, corresponding channel gulps down
It is R={ R to tell rate sequence1,R2,…Rn-1,RnThen ith detecting variable Xi={ Ti, Ri, by every group of { i, RiSubstitute into target letter
Number f (N, RN), f (N, R can be obtainedN) detecting sequence.
I.e. we are by detecting variable Xi, the value actually in detecting object function.Stopped using optimal based on secretary problem
Only theoretical, we are first in 0-0.37*TendThe minimum value of an object function is inside obtained, as a comparison reference value fmin(N,
RN).Wherein TendRepresent the maximum detecting moment.
Safeguard f (N, RN) queue, we by prediction obtained this time stop detecting at the time of tn+1。
By data transfer dynamic dispatching algorithm set forth below, the period that channel quality detecting is often taken turns in definition is 0-
Tend, we increase a constraints for the Optimal Stop algorithm based on secretary problem, realize the dynamic of channel quality reference value
State adjusts.
Wherein fmin(N,RN) it is in 0-0.37*TendThe object function minimum value detected in section, fmax(N,RN) it is to be somebody's turn to do
Object function maximum in section.
Further, according to Figure of description 2, the data transfer dynamic dispatching method includes heartbeat queue transmission and determined
Plan method.
As seen from Figure 2 when the data transfer request of arrival belongs to demonstrating heartbeat type request of data, then heartbeat etc. is added into
Treat in queue.We set whether a kind of heartbeat queue transmission decisions method meets come the heartbeat data packets judged in heartbeat queue
Unified transmission condition.
In the present invention, we are according to certain ratio with data production rate VprodTo generate data waiting for transmission.Take care
When the number of heartbeat packet in jump queue is equal to N, it is believed that the heartbeat queue meets unified transmission condition.
The arrival time sequence that we define N number of heartbeat packet is { t1,t2,…,tn, and corresponding adjustable time sequence
It is classified as { d1,d2,…,dn}.Then the array of delivery time at the latest of one group of heartbeat packet is as follows：
Time=[t1+d1,t2+d2,…,tn+dn]
Then the minimum value in Time arrays is the last delivery time that this is unified in heartbeat packet transmission mechanism, with TsTable
Show.Select section { Ts-10,TsAs our selectable unified delivery time sections.In the section, step 3 institute is used
State method and carry out channel quality detecting, unified heartbeat packet hair is carried out using optimum stopping theory selection channel quality optimal time
Send.
Further, according to Figure of description 2, the step 4 and step 5 are included in the progress of channel quality the best time
The scheduled transmission of demonstrating heartbeat type and delaying type data.
After channel quality the best time is detected, in the T of time slot, it is assumed that Throughput RNKeep constant, then
The size of data that can be transmitted in this period T is RN*T.According to data generation rate VprodCome judge to be temporarily stored into can delay queue and
Data to be transmitted bag size and R in heartbeat queueN* T relation.
When the i-th wheel detecting stops at NiWhen, it is the detecting time to send the total time that terminal is spent
With data transmission period t sums；In this period, the demonstrating heartbeat type and delaying type data of generation are：Wherein, a makes a living into the ratio of demonstrating heartbeat type and the total amount of data shared by delaying type packet.
IfThen current demonstrating heartbeat type to be sent and delaying type data
Success can be sent.
IfThen represent present data transmission scarce capacity, it is impossible to will be poly-
The demonstrating heartbeat type and delaying type data of conjunction are disposably sent.Now it is necessary to the priority of data transfer request is set, according to excellent
First level is carried out selected section data and is transmitted.
For demonstrating heartbeat type packet, because it can be considered as empty bag, size can be ignored, and acquiescence heartbeat packet can be at this
Polymerization is all sent in sending.
The priority query of delaying type request of data is prioritydelay={ 1,2,3 }, the priority of delayed data request
Divided according to data package size, generally, can delayed data have it is bigger can time delay.
When data transmission capabilities deficiency, i.e.,When, prioritised transmission delaying type
Small data, i.e. packet are smaller, and its priority is higher.Finally, we by this aggregation transfer it is remaining can delayed data it is excellent
First level resets to limit priority that can be in delay queue, represents next transmission preferences transmission last time remaining data.
Data-oriented generating rate Vprod, can proportionally generate different types of data transfer request.State first
It is used to deposit demonstrating heartbeat type packet in queue 1；Storage can delayed data bag in queue 2.
Data dynamic decision dispatching algorithm comprises the following steps that：
Step 1：Data transfer request
Step 2：Judge present data transmission request type
Step 3：Ask for instant type, to send the request immediately, otherwise go to step 9
Step 4：Judge in queue 1 and queue 2 whether available for transmission data
Step 5：If there are data, channel quality detecting is carried out, it is determined that stopping detecting moment and optimal rate R, is otherwise gone to
Step 1
Step 6：Judge outgoing data total amount Data and data transmission capabilities R*T magnitude relationship in queue 2
Step 7：If Data<=R*T, with the total data in optimal rate R transmit queues 1 and queue 2
Step 8：If Data>R*T, then total data in transmit queue 1, the data in queue 2 are according to priority carry out portion
Distribution is sent, and the priority of remaining data is adjusted into highest level, is gone to afterwards in step 4；
Step 9：Ask as demonstrating heartbeat type, the request is added in queue 1, whether the number for judging to ask in queue 1 is more than
Given threshold, otherwise go to step 11
Step 10：If asking number to be more than given threshold in queue 1, channel quality detecting is carried out, determines optimal transmission
Moment and channel optimal rate, go to step 6；Otherwise step 1 is gone to
Step 11：Ask for can delay type, by data add queue 2 in, go to step 1
The present invention exists for the tail time in LTE cellular network environments causes data transmission efficiency low, has a strong impact on shifting
The problem of dynamic terminal continuation of the journey operating time, a kind of data transmission scheduling method based on quality of wireless channel detecting is proposed, is passed through
In the quality of tail time periodically detecting wireless channel, select to carry out heartbeat data and delaying type in channel quality the best time
The scheduled transmission of data.
Those of ordinary skills in the art should understand that：The specific embodiment of the present invention is the foregoing is only, and
The limitation present invention is not used in, within the spirit and principles of the invention, any modification, equivalent substitution and improvements done etc.,
It should be included within protection scope of the present invention.
Claims (7)
1. the data transmission scheduling method based on channel quality detecting in a kind of LTE cellular networks, it is characterised in that including following
Step：
S1：Based on optimum stopping theory, in 0-0.37*TendSensing channel quality in time；
S2：Variable X is detected according to step S1N={ N, RN, draw the minimum value and most of the object function of unit data transfer energy consumption
Big value, i.e. fmin(N,RN) and fmax(N,RN)；
S3：Predict epicycle channel quality detecting stop timing tn, with reference to step S2, target is dynamically adjusted during channel detecting
Function reference value；
S4：The dynamic dispatching of demonstrating heartbeat type data transfer request is detected to step S3 according to heartbeat queue dynamic transmission decision strategy
The channel quality the best time arrived；
S5：According to the Throughput of step S3 channel quality the best times detected, current channel data transmission is calculated
Ability C (t), according to C (t) and the preferential level dynamic dispatching transmission delay type data of delaying type data.
2. the data transmission scheduling method according to claim 1 based on channel quality detecting, it is characterised in that described
Step S1 includes：In 0-0.37*TendTime periodically sensing channel throughput, draw channel quality detecting Variables Sequence X=
{X1,X2,…XN-1,XN}.Wherein, XN={ N, RN}。
3. the data transmission scheduling method according to claim 1 based on channel quality detecting, it is characterised in that the step
Rapid S2 includes：Define object function of the present invention, i.e. unit data average transmission energy consumption f (N, RN), draw in step S1 detection regions
The minimum value and maximum of interior object function.
The period that channel quality detecting is often taken turns in definition is 0-Tend, send terminal and carry out a secondary channel detecting every cycle T, often
The secondary channel detecting duration is very short, and much smaller than T, it is E to detect energy consumption every timedet.Good channel is detected when sending terminal
Afterwards, the duration for transmitting data is t, and transmission energy consumption is P*t, and its value is much larger than detecting energy consumption Edet.Because channel gain g exists
Keep constant in cycle T, so transmission data time t meets condition t≤T.
One, which takes turns the data transfer total energy consumption that channel is detected, is：
EN=NEdet+P*t+Etail
Wherein, N represents to detect preferred channels in n-th, i.e. the action of sensing channel has stopped at n-th；T represents this
Send the time needed for data；P is data sending power；EtailRepresent the tail energy wasted during secondary channel quality detecting
Consumption.
Channel quality reference function is defined, i.e., stops detecting with current time, and aggregate number is carried out with present channel throughput
According to transmission so that mean unit data transfer energy consumption is minimum.When the i-th wheel detecting stops at NiWhen, send what terminal was spent
Total time is the detecting time With data transmission period t sums；In this period, the demonstrating heartbeat type of generation and prolong
Type data are late：Wherein, a makes a living into heartbeat and the total amount of data shared by delayed data bag
Ratio.
The data volume that then this wheel can not be transmittedFor：
Then we define unit of transfer's data average energy consumption it is as follows:(assuming that having carried out the detecting of Y wheels)
According to law of great number, i.e. the arithmetic mean of instantaneous value of sequence of random variables is restrained to the arithmetic mean of instantaneous value of its each mathematic expectaion.Should
Formula converges on：
By EN=NEdet+P*t+EtailEquation below can be obtained by substituting into above formula：
Consider t influence, t represents to transmit the time needed for data to be sent, and the Throughput for defining n-hour is RN.Average
In the case of, the data of transmission and Δ T in the t timesNCaused data volume is equal in the+t times, i.e.
E[RN* t]=E [Vprod*(ΔTN+t)*a]
Wherein Δ TN=N*T, then it can show that the relational expression that t meets is as follows：
To sum up, the transmission energy consumption that can obtain unit data converges on：
So we construct a selection stop timing N to minimize the optimal stopping rule problem of above formula；We can incite somebody to action
This problem is described as：
S.t.N={ N:1≤N≤M}
We are defined function f (N, RN) as follows：
By step S1 in 0-0.37*TendThe channel quality detecting Variables Sequence X={ X drawn in time1,X2,…XN-1,XN,
Substitute into object function f (N, RN) object function maximum and minimum value, i.e. f in the period can be drawnmin(N,RN) and fmax
(N,RN)。
4. the data transmission scheduling method according to claim 1 based on channel quality detecting, it is characterised in that the step
Rapid S3 includes：Channel quality detecting is carried out, can dynamically adjust channel quality reference value.
At the Optimal Stop moment (i.e. data delivery time) of N wheels detecting before recording, sequence is：T={ t1,t2,…tn-1,tn}。
Using the Single-step Prediction in time series forecasting, we predict the Optimal Stop moment t of next round channel detectingn+1.Utilize weighting
Average forecast method, set up a weight sequence Weight={ w1,w2,…wn-1,wnAnd the sequence be an increasing sequence, i.e.,
It is bigger that nearer weight is detected from next round.And meet w1+w2+…+wn=1.Then tn+1It can represent as follows：
The detecting stop timing sequence that definition is often taken turns in channel detecting is T={ T1,T2,…Tn-1,Tn, corresponding Throughput
Sequence is R={ R1,R2,…Rn-1,RnThen ith detecting variable Xi={ Ti, Ri, by every group of { i, RiSubstitute into object function f
(N,RN), f (N, R can be obtainedN) detecting sequence.
I.e. we are by detecting variable Xi, the value actually in detecting object function.Managed using the Optimal Stop based on secretary problem
By we are first in 0-0.37*TendThe minimum value of an object function is inside obtained, as a comparison reference value fmin(N,RN).Its
Middle TendRepresent the maximum detecting moment.
Safeguard f (N, RN) queue, we by prediction obtained this time stop detecting at the time of tn+1。
By data transfer dynamic dispatching algorithm set forth below, the period that channel quality detecting is often taken turns in definition is 0-Tend, I
For based on secretary problem Optimal Stop algorithm increase a constraints, realize channel quality reference value dynamic adjust
It is whole.
Wherein fmin(N,RN) it is in 0-0.37*TendThe object function minimum value detected in section, fmax(N,RN) it is the section
Interior object function maximum.
5. the data transmission scheduling method according to claim 1 based on channel quality detecting, it is characterised in that the step
Rapid S4 includes：Data transfer dynamic dispatching method includes heartbeat queue transmission decisions method.
When data transfer request to be sent belongs to demonstrating heartbeat type request of data, then it is added into heartbeat waiting list.
In the present invention, we are according to certain ratio with data production rate VprodTo generate data waiting for transmission.When heartbeat queue
In the number of heartbeat packet when being equal to N, it is believed that the heartbeat queue meets unified transmission condition.
The arrival time sequence that we define N number of heartbeat packet is { t1,t2,…,tn, and corresponding adjustable time series is
{d1,d2,…,dn}.Then the array of delivery time at the latest of each heartbeat packet is as follows：
Time=[t1+d1,t2+d2,…,tn+dn]
Then the minimum value in Time arrays is the last delivery time that this is unified in heartbeat packet transmission mechanism, with TsRepresent.Choosing
Select section { Ts-10,TsAs our selectable unified delivery time sections.In the section, entered using method noted earlier
Row channel quality is detected, and selects channel quality optimal time to carry out heartbeat packet aggregation transmission using optimum stopping theory.
6. the data transmission scheduling method according to claim 1 based on channel quality detecting, it is characterised in that the step
Rapid S5 includes：The data transmission capabilities C (t) of present channel is drawn according to present channel quality detecting variable.
It is assumed that in each slot cycle T, channel gain g keeps constant, i.e., channel transmission rate is kept constant, at each
The data total amount that can be transmitted in gap cycle T is defined as:
C (t)=T*RN(t)
Represent data transmission capabilities of the wireless channel in a slot cycle.
7. the data transmission scheduling method according to claim 1 based on channel quality detecting, it is characterised in that the step
Rapid S5 includes：According to channel data transmittability and delaying type data priority, dynamic dispatching transmission is carried out to delaying type data.
In data transmission scheduling algorithm, data transfer request is divided into 3 types, instant type, demonstrating heartbeat type and delaying type.First
The dispatching priority of data transfer request is defined, instant type data must be transmitted immediately.
For demonstrating heartbeat type packet, because it can be considered as empty bag, size can be ignored, so not setting its priority, write from memory
Recognizing heartbeat packet can all be sent in this polymerization is sent.
The priority query of delaying type request of data is prioritydelay={ 1,2,3 }, delayed data request priority according to
Data package size divides, generally, can delayed data have it is bigger can time delay, it is contemplated that can delay queue
In packet total size and the transmission data of the preferred channels quality moment to detect when the maximum amount of data that can transmit, that is, believe
The relation of road optimal transmission ability, prioritised transmission delaying type small data, i.e. packet in the case where data to be transmitted amount is more
Smaller, its priority is higher.Finally, we by this aggregation transfer it is remaining can the priority of delayed data reset to and can postpone
Limit priority in queue, represent next transmission preferences transmission last time remaining data.
Data-oriented generating rate Vprod, can proportionally generate different types of data transfer request.Queue 1 is stated first
In be used for deposit demonstrating heartbeat type packet；Storage can delayed data bag in queue 2.
Data dynamic decision dispatching algorithm comprises the following steps that：
Step 1：Data transfer request
Step 2：Judge present data transmission request type
Step 3：Ask for instant type, to send the request immediately, otherwise go to step 9
Step 4：Judge in queue 1 and queue 2 whether available for transmission data
Step 5：If there are data, channel quality detecting is carried out, it is determined that stopping detecting moment and optimal rate R, otherwise goes to step 1
Step 6：Judge outgoing data total amount Data and data transmission capabilities R*T magnitude relationship in queue 2
Step 7：If Data<=R*T, with the total data in optimal rate R transmit queues 1 and queue 2
Step 8：If Data>R*T, then total data in transmit queue 1, the data in queue 2 carry out part hair according to priority
Send, and the priority of remaining data is adjusted to highest level, go to afterwards in step 4；
Step 9：Ask as demonstrating heartbeat type, the request is added in queue 1, whether the number for judging to ask in queue 1 is more than setting
Threshold value, otherwise go to step 11
Step 10：If asking number to be more than given threshold in queue 1, channel quality detecting is carried out, determines optimal delivery time
With channel optimal rate, step 6 is gone to；Otherwise step 1 is gone to
Step 11：Ask for can delay type, by data add queue 2 in, go to step 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711011552.2A CN107690196B (en) | 2017-10-26 | 2017-10-26 | Data transmission scheduling method based on channel quality detection in L TE cellular network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711011552.2A CN107690196B (en) | 2017-10-26 | 2017-10-26 | Data transmission scheduling method based on channel quality detection in L TE cellular network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107690196A true CN107690196A (en) | 2018-02-13 |
| CN107690196B CN107690196B (en) | 2020-07-17 |
Family
ID=61154749
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711011552.2A Active CN107690196B (en) | 2017-10-26 | 2017-10-26 | Data transmission scheduling method based on channel quality detection in L TE cellular network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107690196B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108990022A (en) * | 2018-06-15 | 2018-12-11 | 北京邮电大学 | A kind of MTC terminal communication means |
| CN113141228A (en) * | 2021-04-15 | 2021-07-20 | 青岛鼎信通讯股份有限公司 | Distribution room clock management solution based on transmission delay self-correction |
| CN113329429A (en) * | 2021-06-08 | 2021-08-31 | 安科讯(福建)科技有限公司 | Rate scheduling method and terminal |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102711274B (en) * | 2012-06-01 | 2015-03-25 | 重庆市电力公司 | WLAN communication channel detecting method based on optimal stopping theory |
| CN106714323B (en) * | 2017-01-12 | 2020-04-14 | 南京邮电大学 | Priority distinguishing and scheduling method for heterogeneous streams in 4G network |
| CN107046675A (en) * | 2017-05-05 | 2017-08-15 | 西安交通大学 | Optimal relay selection method based on social threshold value in D2D collaboration communications |
-
2017
- 2017-10-26 CN CN201711011552.2A patent/CN107690196B/en active Active
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108990022A (en) * | 2018-06-15 | 2018-12-11 | 北京邮电大学 | A kind of MTC terminal communication means |
| CN108990022B (en) * | 2018-06-15 | 2020-11-03 | 北京邮电大学 | MTC terminal communication method |
| CN113141228A (en) * | 2021-04-15 | 2021-07-20 | 青岛鼎信通讯股份有限公司 | Distribution room clock management solution based on transmission delay self-correction |
| CN113329429A (en) * | 2021-06-08 | 2021-08-31 | 安科讯(福建)科技有限公司 | Rate scheduling method and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107690196B (en) | 2020-07-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103889001B (en) | A kind of adaptive load balancing method based on future load prediction | |
| CN107690196A (en) | A kind of data transmission scheduling method based on channel quality detecting in LTE cellular networks | |
| CN102448143B (en) | Recognition-based access network selecting method | |
| CN106793133A (en) | The dispatching method of multi-service QoS is ensured in a kind of electric power wireless communication system | |
| CN102075440B (en) | Service-quality-sensitive 802.11e multimedia data grouping scheduling method | |
| CN100411474C (en) | Downstream grouped data scheduling method suitable to mobile communication system | |
| Li et al. | A fast-csma algorithm for deadline-constrained scheduling over wireless fading channels | |
| CN114866474A (en) | End network cooperative traffic scheduling method, device, system and storage medium | |
| CN105873233A (en) | IEEE802.11ax access enhancement method based on hierarchical scheduling | |
| CN102883372A (en) | Traffic controlling method and terminal | |
| CN102958182B (en) | A kind of method and system of cognitive radio fairness dispatch | |
| CN102932885B (en) | Mobile intelligent terminal third-generation (3G) communication energy consumption and user performance experience balancing and scheduling scheme | |
| CN102883420A (en) | Transmission scheduling method and device under sleeping mode | |
| CN103458520A (en) | Allocation method and device of uplink frequency domain resources | |
| CN107231224A (en) | LTE wlan networks dynamic aggregation decision-making technique under a kind of maximum transmitted time limit | |
| CN110536398A (en) | Average delay based on multidimensional available capacity ensures Poewr control method and system | |
| CN103458525B (en) | Scheduling strategy system of selection and device in heterogeneous network | |
| CN101212248B (en) | Uplink scheduling information report method in radio communication system | |
| CN103974378A (en) | Low-bitrate user access control method based on QoS guarantee and contention window | |
| Hao et al. | Utility-based scheduling algorithm for wireless multi-media sensor networks | |
| CN108512766A (en) | A kind of OpenFlow interchangers flow table adjusting method | |
| CN104159301A (en) | Bearing mode selection method and device | |
| Qu et al. | Efficient wireless sensor networks scheduling scheme: Game theoretic analysis and algorithm | |
| CN103533579B (en) | The scheduling processing method and dispatch server of data flow in streaming media service | |
| CN108200602A (en) | Multiple access method based on Load-aware in a kind of wireless self-networking |
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 |