CN107426772A - A kind of dynamic contention window method of adjustment, device and equipment based on Q study - Google Patents

A kind of dynamic contention window method of adjustment, device and equipment based on Q study Download PDF

Info

Publication number
CN107426772A
CN107426772A CN201710537493.6A CN201710537493A CN107426772A CN 107426772 A CN107426772 A CN 107426772A CN 201710537493 A CN201710537493 A CN 201710537493A CN 107426772 A CN107426772 A CN 107426772A
Authority
CN
China
Prior art keywords
fire temperature
handling capacity
contention window
window size
initial
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
Application number
CN201710537493.6A
Other languages
Chinese (zh)
Other versions
CN107426772B (en
Inventor
田辉
闫晓婧
秦城
范绍帅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201710537493.6A priority Critical patent/CN107426772B/en
Publication of CN107426772A publication Critical patent/CN107426772A/en
Application granted granted Critical
Publication of CN107426772B publication Critical patent/CN107426772B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/08Load balancing or load distribution
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/08Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/06Testing, supervising or monitoring using simulated traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/08Testing, supervising or monitoring using real traffic

Abstract

The embodiments of the invention provide a kind of dynamic contention window method of adjustment, device and equipment based on Q study, this method includes:A, Initial Channel Assignment access parameter and initial chicken fire temperature;B, under initial competitor window size, transmit and obtain the first handling capacity of packet transmission;C, under the first handling capacity, simulated annealing algorithms are taken, obtain the first contention window size;D, under the first contention window size, the second handling capacity of packet transmission is obtained;E, the second handling capacity and target throughput are updated into Q value tables according to preset formula, and utilizes preparatory condition, update initial chicken fire temperature, the chicken fire temperature after being updated;When the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken fire temperature, perform B to E, chicken fire temperature after repeating renewal Q values table and being updated, until when the chicken fire temperature after renewal is less than or equal to minimum threshold, stop renewal Q value tables, obtain optimal competition window.

Description

A kind of dynamic contention window method of adjustment, device and equipment based on Q study
Technical field
The present invention relates to wireless communication technology field, is adjusted more particularly to a kind of dynamic contention window based on Q study Method, apparatus and equipment.
Background technology
With the popularization of mobile terminal device, the portfolio of cellular mobile network carrying also increases substantially.In order to meet to use The various business demand in family, cellular mobile network need the rapid growth of more frequency spectrum resources adaptation mobile network's flows.Award The frequency resource of power frequency range can not meet the various business demand of user, and operator starts with unauthorized frequency gradually Section completes auxiliary access to meet growing portfolio.Authorize auxiliary access (Licensed Assisted Access, letter LAA) network is referred to as that operator provides a kind of good approach using unauthorized frequency range, in order to ensure that LAA is unauthorized with other , it is necessary to judge whether channel is occupied using energy monitoring by the network equipment, eNB base stations need the fair co-existence of spectrum systems The size of continuous Competition adjustment window is wanted, to ensure data success and correctly transmit.At the same time, cordless communication network skill Art (Wireless Fidelity, abbreviation Wi-Fi) can also realize the transmission of data, with the popularization of Wi-Fi environment, user Mobile network's campus network can not only be saved, moreover it is possible to meet various business demand at any time.
The protocol of LAA systems is more powerful, due to mixed automatic retransfer technology, channel condition information Feedback mechanisms such as (Channel State Information, abbreviation CSI) so that LAA systems with other networks simultaneously In the presence of, for example, with Wi-Fi simultaneously in the presence of, the access probability of the channel access likelihood ratio Wi-Fi channels of LAA systems is bigger, The handling capacity of LAA network system channels is bigger, and the volume of transmitted data of own channel can be caused big, easily cause channel burdens, and And pair it can be produced with network coexisted other wireless network access technologies of LAA compared with strong jamming.
The content of the invention
The purpose of the embodiment of the present invention be to provide a kind of dynamic contention window method of adjustment based on Q study, device and Equipment, to realize the size of effective dynamic Competition adjustment window, the handling capacity of LAA eNB base stations is effectively limited, mitigates number According to the burden of transmission.Concrete technical scheme is as follows:
The embodiments of the invention provide a kind of dynamic contention window method of adjustment based on Q study, applied to LAA base stations, Methods described includes:
Step A, Initial Channel Assignment access parameter and initial chicken fire temperature;The channel access parameter includes:Initial competitor Window size, Q values table, target throughput;
Step B, under the initial competitor window size, transmission packet simultaneously obtains the first of packet transmission and gulped down The amount of telling;
Step C, under first handling capacity, simulated annealing algorithms are taken, obtain the first contention window size;
Step D, under first contention window size, obtain the second handling capacity of the packet transmission;
Step E, second handling capacity and the target throughput are updated into the Q values table, and profit according to preset formula With preparatory condition, the initial chicken fire temperature, the chicken fire temperature after being updated are updated;
When the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken fire temperature, Above-mentioned steps B to step E is performed, repeats the chicken fire temperature after updating the Q values table and being updated, until the chicken fire after renewal When temperature is less than or equal to minimum threshold, stops updating the Q values table, obtain optimal competition window.
Specifically, described under first contention window size, obtain the packet transmission channel second handles up Amount, including:
Under first contention window size, the packet transmission channel is obtained by Markov method model Second handling capacity.
Specifically, described update the Q values table by second handling capacity and the target throughput according to preset formula, Including:
Calculate the value at cost of the packet transmission;The value at cost is second handling capacity and the target throughput The absolute value of difference;
According to the value at cost, under first contention window size, the Q values table is updated according to preset formula, Q value tables after being updated, the preset formula include Q (s1, a1)+α [c+ γ minQ (s2, a2)-Q (s1, a1)], wherein, c =| s2-s0 |, α, γ are the constant between 0 to 1, and s0 represents target throughput, and s1 represents the first handling capacity, and s2 represents second Handling capacity, a1 represent the first contention window size value, and a2 represents the second contention window size value.
Specifically, the preparatory condition includes:The absolute value of second handling capacity and the difference of target throughput is less than Predetermined threshold value.
The embodiments of the invention provide a kind of dynamic contention window adjusting apparatus based on Q study, described device includes:
Initialization module, for Initial Channel Assignment access parameter and initial chicken fire temperature;The channel access parameter includes: Initial competitor window size, Q values table, target throughput;
Transport module, under the initial competitor window size, transmission packet simultaneously to obtain the packet transmission The first handling capacity;
Computing module, under first handling capacity, taking simulated annealing algorithms, it is big to obtain the first competition window It is small;
Acquisition module, under first contention window size, obtaining the second handling capacity of the packet transmission;
Update module, for second handling capacity and the target throughput to be updated into the Q values according to preset formula Table, and preparatory condition is utilized, update the initial chicken fire temperature, the chicken fire temperature after being updated;
Loop module, for when the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as Initial chicken fire temperature, perform above-mentioned transport module to update module, repetition and update the Q values table, until the chicken fire temperature after renewal When degree is less than or equal to minimum threshold, stops the chicken fire temperature after updating the Q values table and being updated, obtain optimal contention window Mouthful.
Specifically, the acquisition module is specifically used under first contention window size, pass through Markov method Model obtains the second handling capacity of the packet transmission channel.
Specifically, the update module includes:
First renewal submodule, the value at cost specifically for calculating the packet transmission;The value at cost is described the The absolute value of two handling capacities and the target throughput difference;
Second renewal submodule, specifically for according to the value at cost, under first contention window size, will described in Q value tables update according to preset formula, the Q value tables after being updated, and the preset formula includes Q (s1, a1)+α [c+ γ minQ (s2, a2)-Q (s1, a1)], wherein, c=| s2-s0 |, α, γ are the constant between 0 to 1, and s0 represents target throughput, s1 The first handling capacity is represented, s2 represents the second handling capacity, and a1 represents the first contention window size value, and a2 represents that the second competition window is big Small value.
Specifically, the loop module is specifically used for second handling capacity and the absolute value of the difference of target throughput is small When predetermined threshold value, the initial chicken fire temperature is updated.
The embodiments of the invention provide a kind of electronic equipment, including processor, communication interface, memory and communication bus, Wherein, the processor, the communication interface, the memory complete mutual communication by the communication bus;
The memory, for depositing computer program;
The processor, during for performing the program deposited on the memory, realizing and being learnt as described above based on Q Dynamic contention window adjustment method and step.
The embodiments of the invention provide a kind of computer-readable recording medium, the computer-readable recording medium memory storage There is computer program, the dynamic competition window as described above based on Q study is realized when the computer program is executed by processor The method and step of mouth adjustment.
Dynamic contention window method of adjustment, device and equipment provided in an embodiment of the present invention based on Q study, including it is as follows Step:Step A, Initial Channel Assignment access parameter and initial chicken fire temperature;Wherein, channel access parameter includes:Initial contention window Mouth size, Q values table, target throughput;Step B, under initial competitor window size, LAA base stations transmission packet simultaneously obtains number According to the first handling capacity of bag transmission;Step C, under the first handling capacity, simulated annealing algorithms are taken, it is big to obtain the first competition window It is small;Step D, under the first contention window size, obtain the second handling capacity of packet transmission;Step E, by the second handling capacity and Target throughput updates Q value tables according to preset formula, and utilizes preparatory condition, initial chicken fire temperature is updated, after being updated Chicken fire temperature;When the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken fire temperature, Above-mentioned steps B to step E is performed, the chicken fire temperature after updating Q values table and being updated is repeated, until the chicken fire temperature after renewal During less than or equal to minimum threshold, stop renewal Q value tables, obtain optimal competition window.The embodiment of the present invention passes through sets target Handling capacity, the handling capacity of LAA channels is limited, initialize initial chicken fire temperature, when constantly updating Q value tables, constantly calculated every The chicken fire temperature of secondary data transfer, when chicken fire temperature is less than or equal to minimum threshold, stop renewal Q value tables, the Q values that will be obtained The competition window of table is as optimal competition window.Certainly, any product or method for implementing the present invention must be not necessarily required to together When reach all the above advantage.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the dynamic contention window method of adjustment provided in an embodiment of the present invention based on Q study;
Fig. 2 be the LAA and WiFi system provided in an embodiment of the present invention under different methods of adjustment handling capacity and Schematic diagram;
Fig. 3 is the structural representation of the dynamic contention window adjusting apparatus provided in an embodiment of the present invention based on Q study;
Fig. 4 is the structural representation of update module provided in an embodiment of the present invention;
Fig. 5 is electronic devices structure schematic diagram provided in an embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.It is based on Embodiment in the present invention, those of ordinary skill in the art are obtained every other under the premise of creative work is not made Embodiment, belong to the scope of protection of the invention.
In order to effectively limit the handling capacity of LAA eNB base stations, mitigate the burden of data transfer, realize effective dynamic The size of Competition adjustment window, the embodiments of the invention provide a kind of dynamic contention window method of adjustment based on Q study, device And equipment, it is described in detail individually below.
Fig. 1 is the flow chart of the dynamic contention window method of adjustment provided in an embodiment of the present invention based on Q study.
Step 101, Initial Channel Assignment access parameter and initial chicken fire temperature.
Method provided in an embodiment of the present invention is applied to LAA eNB base stations, and under wireless communication standard, base station prepares to pass Transmission of data bag, before transmission packet, Initial Channel Assignment access parameter and initial chicken fire temperature.Wherein, channel access parameter Including:Initial competitor window size, Q values table, target throughput.
The contention window size that initial competitor window size uses when being base station first time transmission packet, in the present embodiment In, initial competitor window sizes values are initialized as 2, i.e., base station first time transmission packet when the contention window size value that uses For 2.
Q value tables are the parameters in Q learning processes, and Q study is a kind of intensified learning method, specifically, can be using Q Practise to find optimal action selection strategy for any given Markovian decision process, the term of Q study includes state And action, Q values table are a matrix, every a line of wherein matrix represents the current state in eNB base stations, and each row represent eNB bases Stand and reach the action that next state may occur.In the present embodiment, Q value tables are initialized as to the square of 5 rows, 15 row Battle array, and the value of each element is 0 in matrix.
Target throughput is used for limiting the scope of LAA handling capacities, and it is to limit LAA handling capacity to set target throughput Can not be too big, so as to just define LAA channel access probability, the effect for the burden for mitigating data transfer is realized, in this implementation In example, the value of target throughput is initialized as 45Mps (MBPS).
Initial chicken fire temperature is a parameter of chicken fire algorithm, and simulated annealing algorithms can be used for solving optimization problem, In order to obtain optimal competition window, it is necessary to set an initial chicken fire temperature, this initial chicken fire temperature is constantly reduced to most Small threshold value, is set as 1 here, so as to obtain optimal competition window, in this step, is by initial chicken fire temperature initializing set 1000 degrees Celsius.
Step 102, under initial competitor window size, transmission packet and the first handling capacity for obtaining packet transmission.
LAA base stations are under initial competitor window size, transmission packet.Base station server obtains current data packet transmission First handling capacity, after channel access parameter is initialized, each LAA base stations have an initial competitor strategy, initial competitor The handling capacity of current competitive window is included in strategy, handling capacity as corresponding to initial competitor window.In order to obtain initial Under contention window size, the first handling capacity of LAA base station data transmission channels, can according to send packet in bit number, Divided by receive the time and send the difference of time, it is possible to obtain the first handling capacity of current competitive window.
Step 103, under the first handling capacity, simulated annealing algorithms are taken, obtain the first contention window size.
Obtain under initial competitor window size after the first handling capacity, judge the current state in base station, base station is according to working as Preceding first handling capacity, is set to s1 here, randomly selects a contention window size a1, while choose current first according to Q values table The minimum contention window size a2 of Q values under handling capacity s1.If Q (s1, a1) value is less than Q (s1, a2) value, then selects base station The contention window size a1 randomly selected is taken as the first contention window size;If Q (s1, a1) value is more than or equal to Q The value of (s1, a2), using e as the truth of a matter, two Q value differences values and current chicken fire Q10 choose random choosing for the probability of index for base station Taking contention window size a1, otherwise base station selection a2 is as the first contention window size as the first contention window size.
Step 104, under the first contention window size, the second handling capacity of packet transmission is obtained.
LAA base stations are under the first contention window size, transmission packet.Base station server obtains current data packet transmission Second handling capacity, in order to obtain under the first contention window size, the second handling capacity of LAA base station data transmission channels can be with According to the bit number sent in packet, divided by receive the time and send the difference of time, it is possible to obtain current competitive window The second handling capacity.
A kind of method for specifically under the first contention window size, obtaining the second handling capacity of packet transmission channel For:Under the first contention window size, the second handling capacity of packet transmission channel is obtained by Markov method model. Continue transmission and transmission packet, using Markov method model, according to horse under the first contention window size in LAA base stations Transition probability in Er Kefu probabilistic models between different conditions, bonding state equation of transfer, calculate present channel access probability, root It is believed that road access probability, obtains the second handling capacity.
Step 105, the second handling capacity and target throughput are updated into Q value tables according to preset formula, and utilize preparatory condition, Initial chicken fire temperature is updated, the chicken fire temperature after being updated.
After obtaining the second handling capacity, using the second handling capacity and target throughput, Q value tables are updated according to default formula The value of middle element.Assuming that under the first contention window size a1, the first handling capacity is s1, and the second handling capacity of acquisition is s2, root According to the s2 of acquisition, it is a2 to obtain the second contention window size, according to a2, s2 and target throughput s0, by Q values table according to default public affairs Formula is updated to Q (s1, a1)+α [c+ γ minQ (s2, a2)-Q (s1, a1)], wherein c=| s2-s0 |, α be 0 to 1 between it is any Parameter, represents learning rate, and α size controls the speed that Q values update;γ is the arbitrary parameter between 0 to 1, represents current Q It is worth influence of the size for future, minQ (s2, a2) is represented when contention window size is a2, chooses a minimum Q value.
A kind of method that second handling capacity and target throughput are specifically updated to Q value tables according to preset formula, including:Meter Calculate the value at cost of packet transmission;Value at cost is the absolute value of the second handling capacity and target throughput difference;According to value at cost, Under first contention window size, Q value tables are updated according to preset formula, the Q value tables after being updated.By first calculating value at cost Method, the second handling capacity and target throughput that will obtain take the absolute value of difference, as in the first contention window size Under value at cost, this value at cost is directly substituted into default more new formula and carries out calculating renewal, value at cost is set to c.Quote Value at cost renewal Q values table can more intuitively reflect the difference between the handling capacity of each data transfer and target throughput.
In embodiments of the present invention, Q values table is 5 rows, the matrix of 15 row, and handling capacity, the first behavior are represented per a line S1, the second behavior s2, the third line s3, fourth line s4, the, five behavior s5, wherein s1 scope be less than 30Mps, s2's Scope between 30Mps to 40Mps, s3 scope between 40Mps to 50Mps, s4 scope between 50Mps to 60Mps, S5 scope is that each to arrange the size for representing competition window, it is respectively 2 to be arranged from first row to the 15th more than or equal to 60Mps ~16.
Step 106, when the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken Fiery temperature, above-mentioned steps 102 are performed to step 105, the chicken fire temperature after updating Q values table and being updated are repeated, until renewal When chicken fire temperature afterwards is less than or equal to minimum threshold, stops renewal Q value tables, obtain optimal competition window.
After the Q value tables after being updated, if current handling capacity section where target throughput, by current chicken Fiery temperature is reduced to T2=β T1 (0<β<1), wherein T1 is current chicken fire temperature, and T2 is the chicken fire temperature after reducing, by T2 with The threshold value of the minimum temperature of setting is compared, and when T2 is more than minimum threshold, is performed above-mentioned steps 102 to step 105, is repeated Q value tables are updated, until when the chicken fire temperature after renewal is less than or equal to minimum threshold, stops renewal Q value tables, is gulped down according to current The amount of telling, it can be determined that the state of base station, such as when handling capacity is larger, the data volume of LAA base stations transmission is larger;It is smaller in handling capacity When, the data volume of LAA base stations transmission is smaller.In Q value tables under corresponding state, i.e., in certain a line of Q value tables, search minimum Q values, then be exactly optimal competition window corresponding to this minimum Q value, so as to obtain optimal competition window.
One kind specifically utilizes preparatory condition, updates initial chicken fire temperature, the method bag of the chicken fire temperature after being updated Include:Preparatory condition is when the absolute value of the second handling capacity and the difference of target throughput is less than predetermined threshold value, and LAA base stations utilize Simulated annealing algorithms, the chicken fire temperature after renewal is calculated, update chicken fire temperature, in the present embodiment, predetermined threshold value can be set as 5, i.e., when the absolute difference of the second handling capacity and target throughput is less than, chicken fire temperature is updated, target throughput is yes 45Mps, then it is appreciated that when the second handling capacity is between 40Mps to 50Mps, it is possible to update chicken fire temperature;When When chicken fire temperature after renewal is less than or equal to minimum threshold, stop renewal Q value tables.After updating Q value tables, by simulating chicken fire Algorithm calculates current chicken fire temperature, when chicken fire temperature in the updated is more than minimum threshold, using the chicken fire temperature after renewal as Initial chicken fire temperature, continues the calculating of chicken fire temperature, until when the chicken fire temperature after renewal is less than or equal to minimum threshold, In the present embodiment, minimum threshold can be set as 1 degree Celsius.Initial chicken fire temperature is set as 1000 degrees Celsius, so until When chicken fire temperature is less than or equal to 1 degree Celsius, stop renewal Q value tables.
When the chicken fire temperature after renewal is less than or equal to minimum threshold, stop renewal Q value tables, base station is handled up at this moment Under amount, and current handling capacity section where target throughput, competition window minimum in Q value tables is determined, as optimal Competition window.
Dynamic contention window method of adjustment provided in an embodiment of the present invention based on Q study, comprises the following steps:Step 101, Initial Channel Assignment access parameter and initial chicken fire temperature;Wherein, channel access parameter includes:Initial competitor window size, Q It is worth table, target throughput;Step 102, under initial competitor window size, LAA base stations transmission packet simultaneously obtains packet biography The first defeated handling capacity;Step 103, under the first handling capacity, simulated annealing algorithms are taken, obtain the first contention window size; Step 104, under the first contention window size, the second handling capacity of packet transmission is obtained;Step 105, by the second handling capacity Q value tables are updated according to preset formula with target throughput, and utilize preparatory condition, initial chicken fire temperature are updated, after obtaining renewal Chicken fire temperature;When the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken fire temperature Degree, above-mentioned steps 102 are performed to step 105, the chicken fire temperature after updating Q values table and being updated are repeated, until after renewal When chicken fire temperature is less than or equal to minimum threshold, stops renewal Q value tables, obtain optimal competition window.The embodiment of the present invention passes through Sets target handling capacity, the handling capacity of LAA channels is limited, initialize initial chicken fire temperature, when constantly updating Q value tables, no The disconnected chicken fire temperature for calculating each data transfer, when chicken fire temperature is less than or equal to minimum threshold, stop renewal Q value tables, will The competition window of obtained Q value tables is as optimal competition window.
In order to further illustrate that the embodiment of the present invention provides the validity of method, by taking the coexisting of LAA and WiFi system as an example, As shown in Fig. 2 abscissa is the handling capacity of LAA and WiFi system, ordinate is that CDF illustrates cumulative distribution function, represents probability Value.Fig. 2 show the handling capacity of LAA under different methods of adjustment and WiFi system and schematic diagram.201 curves represent in figure Be the handling capacity of LAA when keeping out of the way method of adjustment using static state and WiFi system and, the representative of 202 curves is exponential LAA and WiFi system when keeping out of the way method of adjustment handling capacity and, what 203 curves represented is provided using the embodiment of the present invention LAA and WiFi system during method handling capacity and, as shown in Figure 2, LAA of the invention and WiFi system handling capacity and Maximum, show that, in the case where LAA handling capacities reduce, WiFi handling capacities improve, so the handling capacity that both are added also increases therewith Add.
Fig. 2 illustrates in the Q learning algorithms and simulated annealing algorithms in based on intensified learning, adds dynamic contention window and adjusts Adjusting method, by the target throughput for setting LAA base stations and initial chicken fire temperature, dynamic adjusts eNB contention window sizes, limitation LAA base station throughputs are within the specific limits, there is provided the more channel access chances of WiFi system, improve LAA and WiFi systems Fairness coexists in system.
The embodiments of the invention provide a kind of dynamic contention window adjusting apparatus based on Q study, the structural representation of device Figure includes as shown in Figure 3:
Initialization module 301, for Initial Channel Assignment access parameter and initial chicken fire temperature;The channel access parameter bag Include:Initial competitor window size, Q values table, target throughput;
Transport module 302, under initial competitor window size, transmission packet simultaneously to obtain the first of packet transmission Handling capacity;
Computing module 303, under the first handling capacity, taking simulated annealing algorithms, obtain the first contention window size;
Acquisition module 304, under the first contention window size, obtaining the second handling capacity of packet transmission;
Update module 305, for the second handling capacity and target throughput to be updated into Q value tables according to preset formula, and utilize Preparatory condition, initial chicken fire temperature is updated, the chicken fire temperature after being updated;
Loop module 306, for when the chicken fire temperature after renewal is more than minimum threshold, the chicken fire temperature after renewal to be made For initial chicken fire temperature, above-mentioned transport module is performed to update module, repeats the chicken fire temperature after updating Q values table and being updated Degree, until when the chicken fire temperature after renewal is less than or equal to minimum threshold, stops renewal Q value tables, obtain optimal competition window.
Specifically, acquisition module 304 is specifically used under the first contention window size, obtained by Markov method model Take the second handling capacity of packet transmission channel.
Specifically, the structural representation of update module 305 includes as shown in Figure 4:
First renewal submodule 401, the value at cost specifically for calculating packet transmission;Value at cost be the second handling capacity and The absolute value of target throughput difference;
Second renewal submodule 402, specifically for according to value at cost, under the first contention window size, by Q values table according to Preset formula update, the Q value tables after update, preset formula including Q (s2, a2)+α [c+ γ minQ (s2, a3)-Q (s2, A2)], wherein, c=| s1-s0 |, α, γ are the constant between 0 to 1, and s0 represents target throughput, and s1 represents that first handles up Amount, a2 represent the first contention window size value, and s2 represents the second handling capacity, and a3 represents the second competition under the second handling capacity s2 Window size value.
Dynamic contention window adjusting apparatus provided in an embodiment of the present invention based on Q study, including:Initial Channel Assignment accesses Parameter and initial chicken fire temperature;Wherein, channel access parameter includes:Initial competitor window size, Q values table, target throughput; Under initial competitor window size, LAA base stations transmission packet and the first handling capacity for obtaining packet transmission;In the first handling capacity Under, LAA takes simulated annealing algorithms in base station, obtains the first contention window size;Under the first contention window size, data are obtained Wrap the second handling capacity of transmission;Second handling capacity and target throughput are updated into Q value tables according to preset formula, and utilize default bar Part, initial chicken fire temperature is updated, the chicken fire temperature after being updated;, will when the chicken fire temperature after renewal is more than minimum threshold Chicken fire temperature after renewal performs above-mentioned steps, repeats the chicken fire after updating Q values table and being updated as initial chicken fire temperature Temperature, until when the chicken fire temperature after renewal is less than or equal to minimum threshold, stops renewal Q value tables, obtain optimal competition window. The embodiment of the present invention limits the handling capacity of LAA channels, initial chicken fire temperature is initialized, not by sets target handling capacity During disconnected renewal Q value tables, the chicken fire temperature of each data transfer is constantly calculated, when chicken fire temperature is less than or equal to minimum threshold, Stop renewal Q value tables, using the competition window of obtained Q value tables as optimal competition window.
The embodiments of the invention provide a kind of electronic equipment, as shown in figure 5, including processor 501, communication interface 502, depositing Reservoir 503 and communication bus 504, wherein, processor, communication interface, memory completes mutual communication by communication bus;
Memory, for depositing computer program;
Processor, during for performing the program deposited on memory, realize the following dynamic competition window based on Q study The method and step of mouth adjustment:
Step A, Initial Channel Assignment access parameter and initial chicken fire temperature;Wherein channel access parameter includes:Initial competitor Window size, Q values table, target throughput;
Step B, under initial competitor window size, transmission packet and the first handling capacity for obtaining packet transmission;
Step C, under the first handling capacity, simulated annealing algorithms are taken, obtain the first contention window size;
Step D, under the first contention window size, obtain the second handling capacity of packet transmission;
Step E, the second handling capacity and target throughput are updated into Q value tables according to preset formula, update initial chicken fire temperature, Chicken fire temperature after being updated;
When the chicken fire temperature after renewal is more than minimum threshold, above-mentioned steps B to step E is performed, repeats to update Q value tables, Until when the chicken fire temperature after renewal is less than or equal to minimum threshold, stops renewal Q value tables, obtain optimal competition window.
Electronic equipment provided in an embodiment of the present invention, the handling capacity of limitation LAA transmissions is achieved by the steps of, The burden of transmission transmission is alleviated, including:Including:Initial Channel Assignment access parameter and initial chicken fire temperature;Wherein, channel access Parameter includes:Initial competitor window size, Q values table, target throughput;Under initial competitor window size, LAA base stations transmission number The first handling capacity transmitted according to wrapping and obtaining packet;Under the first handling capacity, LAA takes simulated annealing algorithms in base station, obtains First contention window size;Under the first contention window size, the second handling capacity of packet transmission is obtained;By the second handling capacity Q value tables are updated according to preset formula with target throughput, and utilize preparatory condition, initial chicken fire temperature are updated, after obtaining renewal Chicken fire temperature;When the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken fire temperature Degree, above-mentioned steps are performed, the chicken fire temperature after updating Q values table and being updated is repeated, until the chicken fire temperature after renewal is less than Or during equal to minimum threshold, stop renewal Q value tables, obtain optimal competition window.The embodiment of the present invention is handled up by sets target Amount, limits the handling capacity of LAA channels, initializes initial chicken fire temperature, when constantly updating Q value tables, constantly calculates per number According to the chicken fire temperature of transmission, when chicken fire temperature is less than or equal to minimum threshold, stop renewal Q value tables, by obtained Q value tables Competition window is as optimal competition window.
The embodiments of the invention provide a kind of computer-readable recording medium, computer-readable recording medium internal memory contains meter Calculation machine program, the method that the dynamic contention window adjustment based on Q study as above is realized when computer program is executed by processor Step.
Computer-readable recording medium provided in an embodiment of the present invention, including:Initial Channel Assignment access parameter and initial chicken Fiery temperature;Wherein, channel access parameter includes:Initial competitor window size, Q values table, target throughput;In initial competitor window Under size, LAA base stations transmission packet and the first handling capacity for obtaining packet transmission;Under the first handling capacity, simulation is taken Chicken fire algorithm, obtains the first contention window size;Under the first contention window size, the second of acquisition packet transmission handles up Amount;Second handling capacity and target throughput are updated into Q value tables according to preset formula, and utilize preparatory condition, updates initial chicken fire Temperature, the chicken fire temperature after being updated;When the chicken fire temperature after renewal is more than minimum threshold, by the chicken fire temperature after renewal As initial chicken fire temperature, above-mentioned steps are performed, the chicken fire temperature after updating Q values table and being updated are repeated, until after renewal Chicken fire temperature when being less than or equal to minimum threshold, stop renewal Q value tables, obtain optimal competition window.The embodiment of the present invention is led to Sets target handling capacity is crossed, limits the handling capacity of LAA channels, initializes initial chicken fire temperature, when constantly updating Q value tables, The chicken fire temperature of each data transfer is constantly calculated, when chicken fire temperature is less than or equal to minimum threshold, stops renewal Q value tables, Using the competition window of obtained Q value tables as optimal competition window.
The communication bus that above-mentioned electronic equipment is mentioned can be Peripheral Component Interconnect standard (Peripheral Pomponent Interconnect, abbreviation PCI) bus or EISA (Extended Industry Standard Architecture, abbreviation EISA) bus etc..The communication bus can be divided into address bus, data/address bus, controlling bus etc.. For ease of representing, only represented in figure with a thick line, it is not intended that an only bus or a type of bus.
The communication that communication interface is used between above-mentioned electronic equipment and other equipment.
Memory can include random access memory (Random Access Memory, abbreviation RAM), can also include Nonvolatile memory (non-volatile memory), for example, at least a magnetic disk storage.Optionally, memory may be used also To be at least one storage device for being located remotely from aforementioned processor.
Above-mentioned processor can be general processor, including central processing unit (Central Processing Unit, Abbreviation CPU), network processing unit (Ne twork Processor, abbreviation NP) etc.;It can also be digital signal processor (Digital Signal Processing, abbreviation DSP), application specific integrated circuit (Applica tion Specific Integrated Circuit, abbreviation ASIC), field programmable gate array (Field-Programmable Gate Array, Abbreviation FPGA) either other PLDs, discrete gate or transistor logic, discrete hardware components.
It should be noted that the device of the embodiment of the present invention, electronic equipment and storage medium are based on using above-mentioned respectively Device, electronic equipment and the storage medium of dynamic contention window method of adjustment based on Q study, then it is above-mentioned based on the dynamic of Q study All embodiments of state competition window method of adjustment are applied to the device, electronic equipment and storage medium, and can reach phase Same or similar beneficial effect.
It should be noted that herein, such as first and second or the like relational terms are used merely to a reality Body or operation make a distinction with another entity or operation, and not necessarily require or imply and deposited between these entities or operation In any this actual relation or order.Moreover, term " comprising ", "comprising" or its any other variant are intended to Nonexcludability includes, so that process, method, article or equipment including a series of elements not only will including those Element, but also the other element including being not expressly set out, or it is this process, method, article or equipment also to include Intrinsic key element.In the absence of more restrictions, the key element limited by sentence "including a ...", it is not excluded that Other identical element also be present in process, method, article or equipment including the key element.
Each embodiment in this specification is described by the way of related, identical similar portion between each embodiment Divide mutually referring to what each embodiment stressed is the difference with other embodiment.It is real especially for system For applying example, because it is substantially similar to embodiment of the method, so description is fairly simple, related part is referring to embodiment of the method Part explanation.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the scope of the present invention.It is all Any modification, equivalent substitution and improvements made within the spirit and principles in the present invention etc., are all contained in protection scope of the present invention It is interior.

Claims (10)

1. a kind of dynamic contention window method of adjustment based on Q study, it is characterised in that applied to LAA base stations, methods described bag Include:
Step A, Initial Channel Assignment access parameter and initial chicken fire temperature;The channel access parameter includes:Initial competitor window Size, Q values table, target throughput;
Step B, under the initial competitor window size, transmission packet simultaneously obtains the first of packet transmission and handled up Amount;
Step C, under first handling capacity, simulated annealing algorithms are taken, obtain the first contention window size;
Step D, under first contention window size, obtain the second handling capacity of the packet transmission;
Step E, second handling capacity and the target throughput are updated into the Q values table according to preset formula, and using in advance If condition, the initial chicken fire temperature, the chicken fire temperature after being updated are updated;
When the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial chicken fire temperature, perform Above-mentioned steps B to step E, the chicken fire temperature after updating the Q values table and being updated is repeated, until the chicken fire temperature after renewal During less than or equal to minimum threshold, stop updating the Q values table, obtain optimal competition window.
2. according to the method for claim 1, it is characterised in that it is described under first contention window size, obtain institute The second handling capacity of packet transmission channel is stated, including:
Under first contention window size, the second of the packet transmission channel is obtained by Markov method model Handling capacity.
3. according to the method for claim 2, it is characterised in that described by second handling capacity and the target throughput The Q values table is updated according to preset formula, including:
Calculate the value at cost of the packet transmission;The value at cost is second handling capacity and the target throughput difference Absolute value;
According to the value at cost, under first contention window size, the Q values table is updated according to preset formula, obtained Q value tables after renewal, the preset formula include Q (s1, a1)+α [c+ γ minQ (s2, a2)-Q (s1, a1)], wherein, c=| S2-s0 |, α, γ are the constant between 0 to 1, and s0 represents target throughput, and s1 represents the first handling capacity, and s2 represents that second gulps down The amount of telling, a1 represent the first contention window size value, and a2 represents the second contention window size value.
4. according to the method for claim 3, it is characterised in that the preparatory condition includes:
The absolute value of second handling capacity and the difference of target throughput is less than predetermined threshold value.
5. a kind of dynamic contention window adjusting apparatus based on Q study, it is characterised in that described device includes:
Initialization module, for Initial Channel Assignment access parameter and initial chicken fire temperature;The channel access parameter includes:Initially Contention window size, Q values table, target throughput;
Transport module, under the initial competitor window size, transmission packet simultaneously obtains the of the packet transmission One handling capacity;
Computing module, under first handling capacity, taking simulated annealing algorithms, obtain the first contention window size;
Acquisition module, under first contention window size, obtaining the second handling capacity of the packet transmission;
Update module, for second handling capacity and the target throughput to be updated into the Q values table according to preset formula, and Using preparatory condition, the initial chicken fire temperature, the chicken fire temperature after being updated are updated;
Loop module, for when the chicken fire temperature after renewal is more than minimum threshold, using the chicken fire temperature after renewal as initial Chicken fire temperature, above-mentioned transport module is performed to update module, the chicken fire temperature after repeatedly updating the Q values table and updated, Until when the chicken fire temperature after renewal is less than or equal to minimum threshold, stops updating the Q values table, obtain optimal competition window.
6. device according to claim 5, it is characterised in that the acquisition module is specifically used in first contention window Under mouth size, pass through the second handling capacity that Markov method model obtains the packet transmission channel.
7. device according to claim 6, it is characterised in that the update module includes:
First renewal submodule, the value at cost specifically for calculating the packet transmission;The value at cost gulps down for described second The absolute value of the amount of telling and the target throughput difference;
Second renewal submodule, specifically for according to the value at cost, under first contention window size, by the Q values Table updates according to preset formula, the Q value tables after being updated, the preset formula include Q (s1, a1)+α [c+ γ minQ (s2, A2)-Q (s1, a1)], wherein, c=| s2-s0 |, α, γ are the constant between 0 to 1, and s0 represents target throughput, and s1 is represented First handling capacity, s2 represent the second handling capacity, and a1 represents the first contention window size value, and a2 represents the second contention window size Value.
8. device according to claim 7, it is characterised in that the loop module be specifically used for second handling capacity with When the absolute value of the difference of target throughput is less than predetermined threshold value, the initial chicken fire temperature is updated.
9. a kind of electronic equipment, it is characterised in that including processor, communication interface, memory and communication bus, wherein, it is described Processor, the communication interface, the memory complete mutual communication by the communication bus;
The memory, for depositing computer program;
The processor, during for performing the program deposited on the memory, realize any described sides of claim 1-4 Method step.
10. a kind of computer-readable recording medium, it is characterised in that the computer-readable recording medium internal memory contains computer Program, the computer program realize claim 1-4 any described method and steps when being executed by processor.
CN201710537493.6A 2017-07-04 2017-07-04 Dynamic competition window adjusting method, device and equipment based on Q learning Active CN107426772B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710537493.6A CN107426772B (en) 2017-07-04 2017-07-04 Dynamic competition window adjusting method, device and equipment based on Q learning

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710537493.6A CN107426772B (en) 2017-07-04 2017-07-04 Dynamic competition window adjusting method, device and equipment based on Q learning

Publications (2)

Publication Number Publication Date
CN107426772A true CN107426772A (en) 2017-12-01
CN107426772B CN107426772B (en) 2020-01-03

Family

ID=60426803

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710537493.6A Active CN107426772B (en) 2017-07-04 2017-07-04 Dynamic competition window adjusting method, device and equipment based on Q learning

Country Status (1)

Country Link
CN (1) CN107426772B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108924944A (en) * 2018-07-19 2018-11-30 重庆邮电大学 The dynamic optimization method of contention window value coexists in LTE and WiFi based on Q-learning algorithm
CN109445903A (en) * 2018-09-12 2019-03-08 华南理工大学 Cloud computing energy-saving distribution implementation method based on the discovery of QoS feature
CN109803338A (en) * 2019-02-12 2019-05-24 南京邮电大学 A kind of dual link base station selecting method based on degree of regretting
CN111637444A (en) * 2020-06-05 2020-09-08 沈阳航空航天大学 Nuclear power steam generator water level control method based on Q learning
CN112637965A (en) * 2020-12-30 2021-04-09 上海交通大学 Game-based Q learning competition window adjusting method, system and medium
CN113316156A (en) * 2021-05-26 2021-08-27 重庆邮电大学 Intelligent coexistence method on unlicensed frequency band

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101466111A (en) * 2009-01-13 2009-06-24 中国人民解放军理工大学通信工程学院 Dynamic spectrum access method based on policy planning constrain Q study
US20150058265A1 (en) * 2013-08-23 2015-02-26 Vmware, Inc. Automated scaling of multi-tier applications using reinforced learning
CN105338652A (en) * 2015-09-25 2016-02-17 宇龙计算机通信科技(深圳)有限公司 Channel detection method based on contention window and device thereof
CN105636233A (en) * 2015-12-11 2016-06-01 山东闻远通信技术有限公司 LBT (Listen Before Talk) mechanism which synchronously takes uplink and downlink into consideration in LAA (Licensed-Assisted Access) system
CN106332094A (en) * 2016-09-19 2017-01-11 重庆邮电大学 Q algorithm-based dynamic duty ratio coexistence method for LTE-U and Wi-Fi systems in unauthorized frequency band
CN106656430A (en) * 2015-10-28 2017-05-10 中兴通讯股份有限公司 Listen before talk (LBT) parameter processing method, contention window adjusting method and device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101466111A (en) * 2009-01-13 2009-06-24 中国人民解放军理工大学通信工程学院 Dynamic spectrum access method based on policy planning constrain Q study
US20150058265A1 (en) * 2013-08-23 2015-02-26 Vmware, Inc. Automated scaling of multi-tier applications using reinforced learning
CN105338652A (en) * 2015-09-25 2016-02-17 宇龙计算机通信科技(深圳)有限公司 Channel detection method based on contention window and device thereof
CN106656430A (en) * 2015-10-28 2017-05-10 中兴通讯股份有限公司 Listen before talk (LBT) parameter processing method, contention window adjusting method and device
CN105636233A (en) * 2015-12-11 2016-06-01 山东闻远通信技术有限公司 LBT (Listen Before Talk) mechanism which synchronously takes uplink and downlink into consideration in LAA (Licensed-Assisted Access) system
CN106332094A (en) * 2016-09-19 2017-01-11 重庆邮电大学 Q algorithm-based dynamic duty ratio coexistence method for LTE-U and Wi-Fi systems in unauthorized frequency band

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108924944A (en) * 2018-07-19 2018-11-30 重庆邮电大学 The dynamic optimization method of contention window value coexists in LTE and WiFi based on Q-learning algorithm
CN108924944B (en) * 2018-07-19 2021-09-14 重庆邮电大学 LTE and WiFi coexistence competition window value dynamic optimization method based on Q-learning algorithm
CN109445903A (en) * 2018-09-12 2019-03-08 华南理工大学 Cloud computing energy-saving distribution implementation method based on the discovery of QoS feature
CN109445903B (en) * 2018-09-12 2022-03-29 华南理工大学 Cloud computing energy-saving scheduling implementation method based on QoS feature discovery
CN109803338A (en) * 2019-02-12 2019-05-24 南京邮电大学 A kind of dual link base station selecting method based on degree of regretting
CN109803338B (en) * 2019-02-12 2021-03-12 南京邮电大学 Dual-connection base station selection method based on regret degree
CN111637444A (en) * 2020-06-05 2020-09-08 沈阳航空航天大学 Nuclear power steam generator water level control method based on Q learning
CN111637444B (en) * 2020-06-05 2021-10-22 沈阳航空航天大学 Nuclear power steam generator water level control method based on Q learning
CN112637965A (en) * 2020-12-30 2021-04-09 上海交通大学 Game-based Q learning competition window adjusting method, system and medium
CN113316156A (en) * 2021-05-26 2021-08-27 重庆邮电大学 Intelligent coexistence method on unlicensed frequency band
CN113316156B (en) * 2021-05-26 2022-07-12 重庆邮电大学 Intelligent coexistence method on unlicensed frequency band

Also Published As

Publication number Publication date
CN107426772B (en) 2020-01-03

Similar Documents

Publication Publication Date Title
CN107426772A (en) A kind of dynamic contention window method of adjustment, device and equipment based on Q study
CN108306751A (en) Backhaul in wireless mesh network and forward pass communication
CN105432105B (en) A kind of method of power control, base station and user equipment
CN110035529A (en) A kind of method and communication device of resource distribution
CN108738141A (en) A kind of configuration method of physical accidental access channel parameter, network side equipment and terminal
CN104254137B (en) A kind of method and apparatus of competition window adjustment
CN110519849B (en) Communication and computing resource joint allocation method for mobile edge computing
CN104683262B (en) The processing method and equipment of a kind of packet
CN108307449A (en) A kind of processing method and equipment of RB ranks qos parameter
CN107733499A (en) Communication means and equipment for channel status information reports
CN106464604A (en) Systems, methods, and devices to support intra-application flow prioritization
CN108616925A (en) A kind of processing method and processing device of data flow
CN107147586A (en) Based on dynamic contention window method of adjustment, device and the equipment that Stochastic Game is theoretical
CN105430730B (en) Determine the method, apparatus and system and network access device of transmission power collection
CN107006067A (en) Limit surplus absolutely based on Base-Band Processing and distribute base-band resource capacity to cell
KR20200097770A (en) Service distribution method, network device and terminal device
WO2020063266A1 (en) Harq process id determination method and apparatus, terminal, and medium
CN105813187A (en) Information processing method and electronic device
CN103906238B (en) Bandwidth distribution method and apparatus, and server
CN106937326A (en) Method of coordinated transmission and first base station between base station
CN104380646B (en) Hybrid automatic repeat-request HARQ feedback method, user equipment and base station
Galtier Optimizing the IEEE 802.11 b performance using slow congestion window decrease
CN106712918A (en) Wireless communication resource allocation method and apparatus
CN106851694B (en) Dynamic optimal network selection method and device for heterogeneous network
CN106686646A (en) Method and apparatus of reporting measurement report of unauthorized cell

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant