CN102932308B - Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system - Google Patents

Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system Download PDF

Info

Publication number
CN102932308B
CN102932308B CN201210433360.1A CN201210433360A CN102932308B CN 102932308 B CN102932308 B CN 102932308B CN 201210433360 A CN201210433360 A CN 201210433360A CN 102932308 B CN102932308 B CN 102932308B
Authority
CN
China
Prior art keywords
user
satisfaction
sub
channel
resource
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.)
Expired - Fee Related
Application number
CN201210433360.1A
Other languages
Chinese (zh)
Other versions
CN102932308A (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.)
Shenzhen Tinno Wireless Technology Co Ltd
Original Assignee
Chongqing University of Post 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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201210433360.1A priority Critical patent/CN102932308B/en
Publication of CN102932308A publication Critical patent/CN102932308A/en
Application granted granted Critical
Publication of CN102932308B publication Critical patent/CN102932308B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses in a kind of OFDM relay system under mixed service scene, based on resource scheduling system and the method for user quality experience.Relate to OFDM relay system.The present invention, according to the real time business (rtPS) requirement to average delay and the non-real-time service (nrtPS) requirement to Mean Speed, sets up unified user satisfaction model for user, the satisfaction current to reflect user.Distribute to, by sub-channel, the user that satisfaction increasing degree is maximum on this sub-channel and improve system entirety user satisfaction.Adopt method of the invention, it is possible to solve current mobile communication system only considers from system perspective, ignore user's impression, the problem causing the wasting of resources, it is achieved based on the resource scheduling algorithm of user QoE.<!--1-->

Description

Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system
Technical field
The present invention relates to mobile communication technology field, be specifically related to OFDM relay system scheduling of resource, it is achieved the maximized technical scheme of system user total satisfactory grade.
Background technology
In Next-Generation Wireless Communication Systems, it is be covered as target realizing data transmission at a high speed and seamless universe.When frequency spectrum resource is rare and expensive, only improve the availability of frequency spectrum by channeling, can be only achieved this target.OFDMA technology (OFDMA), with the ability of its good anti-multipath effect, becomes the focus that people pay close attention to.Decapacitation enough better reduces beyond the frequency selective fading that multipath effect causes, and in OFDM network, frequency band is divided into multiple subcarrier, and each subcarrier is separate so that the Radio Resource method of salary distribution is more flexible, improves system spectrum utilization rate.In order to realize seamless coverage in legacy network, it is necessary to increasing base station (BS) quantity, this can cause the increase of expense.And relay (Relay) network and while reducing network cost, network coverage can be expanded, and there is good motility.Fig. 1 is the topological structure schematic diagram of OFDMA relay system.In FIG: BS is cell base station, RS is relaying, and UE is user, and on BS and RS, respectively user sets up buffer area to deposit user data.
Wireless resource scheduling algorithm plays vital effect in the lifting of wireless network performance, and particularly in OFDM relay system, multiple subcarriers and two-hop link make source scheduling mode more flexible.Rational resource scheduling algorithm can largely promote power system capacity, it is ensured that user fairness.
At present, channel condition information, queue length or what user QoS carried out it are all based on greatly for the dispatching algorithm of OFDM relay system.These resource scheduling algorithms are all from system perspective, with maximum system performance for target, without considering user's subjective experience quality, it is impossible to carry out rational Radio Resource distribution according to user's request urgency level.In this case, introduce QoE(QualityofExperience) concept.QoE can be understood as a kind of with Consumer's Experience or the service evaluation method being perceived as standard.It, by the impact of service, user and environment, by the method for half quantification, directly reflects user's satisfaction to resources available or service.That is, the satisfaction of user is not only how many resources objectively distributed by system affects, it is additionally subjected to the impact of the subjective consciousness of people, such as, when user obtains abundant resource, when satisfaction is higher, continue as this user resource allocation, the amplification of user satisfaction can be more and more less, if resource scheduling algorithm traditionally, will result in the unfairness of resource distribution.
The theory of current QoE is also immature, and different research worker attempts from different angles QoE to be made quantitatively evaluating, therefore occurs in that much different quantization methods and appraisal procedure.Simultaneously the requirement of service is differed by different user, and such as real time business is higher to delay requirement, requires relatively low to Mean Speed, and non-real-time service or BE business are relatively low and require higher to Mean Speed to delay requirement.Identical resource distributes to different types of user, and the lifting of the satisfaction of user is without identical.This also brings very big challenge for being scheduling Radio Resource distributing under mixed service scene.
Summary of the invention
The present invention is directed to the above-mentioned technical problem existed in prior art, it is intended in OFDM relay system under mixed service scene, set up unified user satisfaction model, and according to user satisfaction, Radio Resource is allocated, thus improving system whole efficiency.
The technical solution adopted for the present invention to solve the technical problems is: set up buffer area to deposit user data in base station (BS) and relaying (RS), BS end arranges channel condition information collection module and queue state information's collection module, collect the channel condition information of each bar link in two-hop link and the queue state information of BS and RS end buffer area, and estimate users satisfaction degree.It is allocated according to user satisfaction sub-channel.
User communicates with base station by relaying, and relaying arranges buffer area to deposit the data that base station sends, and at next sub-slots, data is forwarded.Channel condition information between the contribution link of base station and the queue state information of buffer area, and estimate user satisfaction, carry out resource distribution further according to user satisfaction.Concrete dispatching method following steps:
Channel condition information extraction unit and queue state information's extraction unit extract the time delay of user's qos requirement respectively, speedThe maximum delay can tolerated with active user, calculate the average delay of user's current time slotsAnd Mean Speed
The different requirements to time delay and Mean Speed respectively according to real time business and non-real-time service, average delay or the Mean Speed of user are normalized by user satisfaction estimation unit, set up user satisfaction equation:
MOS m ( t ) = log 2 ( &PartialD; m &CenterDot; a &CenterDot; D max m - D m ( t ) &OverBar; D req m + ( 1 - &PartialD; m ) &CenterDot; a &CenterDot; R m ( t ) &OverBar; R req m )
To maximize user satisfaction for optimization aim, and with user cache district queue length lower limit and the user satisfaction upper limit for restrictive condition, set up object function:
Determine the current satisfaction of user;
Feedback information receives channel condition information and the RS end queue length information that unit receives in feedback channel in two-hop link;
Scheduling allocation units distributes each sub-channels according to the current satisfaction of user and channel condition information, and relaying link user resource is scheduling.
Length of data queue according to base station and relay carries out scheduling of resource.
Feedback information receives unit and obtains channel condition information and RS end queue state information the first jumping from feedback channel, initializes and obtains set of sub-channels and be combined into X;The sub-channel n that channel condition is best is chosen from available subchannels;Select BS end queue length and the user m of RS end queue length disparity;Sub-channel n is distributed to user m, updates user's BS end and RS end data queuing message, sets of sub-channels be updated to X '=X n;Until set of sub-channels is combined into sky.
Every subchannel is distributed to satisfaction on this sub-channel and promotes maximum user, to improve system user satisfaction.
Obtaining channel condition information the second jumping from feedback channel, initialize set of sub-channels and be combined into X, user's set is U;From available subchannels, an optional subchannel n, distributes to user by sub-channel;To real-time traffic users, calculate user's average delay, and according to formula:Calculate the user satisfaction increasing degree after sub-channel n distributes to this user, to non-real-time service user, calculate user's Mean Speed, and according to formula:Calculate the user satisfaction increasing degree after sub-channel n distributes to this user, wherein, MOSmT () is the current satisfaction of user,The user satisfaction after this user is distributed to for sub-channel n;Select the user m that Δ MOS (t) is maximum, sub-channel n is distributed to user m, update queue state information and the Mean Speed of user m;Until set of sub-channels is combined into sky.
The present invention also proposes in a kind of OFDM relay system resource scheduling system under mixed service scene, this system includes: feedback information receives unit, channel condition information extraction unit, queue state information's extraction unit, user satisfaction estimation unit and scheduling of resource unit, channel condition information extraction unit and queue state information's extraction unit and extracts the time delay of user's qos requirement respectively, speedThe maximum delay can tolerated with active user, calculate the average delay of user's current time slotsAnd Mean Speed;Average delay or the Mean Speed of user are normalized by user satisfaction estimation unit, set up user satisfaction equation:
;To maximize user satisfaction for optimization aim, and with user cache district queue length lower limit and the user satisfaction upper limit for restrictive condition, set up object function, it is determined that the current satisfaction of user;Feedback information receives channel condition information and the RS end queue length information that unit receives in feedback channel in two-hop link;Scheduling of resource unit distributes each sub-channels according to the current satisfaction of user and channel condition information, and relaying link user resource is scheduling.
The present invention is under mixed service scene, unified user satisfaction model is set up for variety classes user, and take a kind of based on user satisfaction, to maximize the resource regulating method that system user total satisfactory grade is target, it is achieved that Radio Resource is reasonably distributed.
Accompanying drawing explanation
Fig. 1 is the topological structure schematic diagram of the cell mobile communication systems of relay station
Fig. 2 is scheduling mechanism system structure schematic diagram in the specific embodiment of the invention
Fig. 3 is that in the specific embodiment of the invention, repeated link first jumps scheduling of resource flow chart
Fig. 4 is that in the specific embodiment of the invention, repeated link second jumps scheduling of resource flow chart
Detailed description of the invention
For making technical scheme advantage describe clearly, referring to accompanying drawing, the specific embodiment of the present invention is described in further detail.
Fig. 1 is the application scenarios of the present invention, as it is shown in figure 1, system includes base station (BS), relaying (RS) and user (UE), it is assumed that owing to the distance all UE of reason communicate only by RS and BS, it is impossible to directly communicate with BS.BS end and RS end are both provided with buffer memory interval, to deposit user data.System adopts OFDM access way, bandwidth is divided into the sub-channel of multiple independent orthogonal on frequency domain, in time domain, a time slot is divided into the data transmission that two sub-slots are respectively used on BS-RS link and RS-UE link.
Fig. 2 is BS client information collection module and scheduler module schematic diagram.Including: feedback information receives unit 201, temporary data storage unit 202, channel condition information extraction unit 203, queue state information's extraction unit 204, user satisfaction estimation unit 205 and scheduling of resource unit 206.
Feedback information receives unit to be responsible for receiving feedack in feedback channel, including the channel condition information in two-hop link and RS end queue length information.
Temporary data storage unit is used for accessing ephemeral data, such as user's Mean Speed, BS end and RS end queue average length etc..
Channel condition information extraction unit and queue state information's extraction unit extract channel condition information and queue state information respectively.Including: the time delay of user's qos requirement, speedThe maximum delay can tolerated with active user, obtain the average delay of user's current time slotsAnd Mean Speed,The Little theorem can passed through in queueing theory is released,Can be tried to achieve by setting time window.
User satisfaction estimation unit is responsible for the current satisfaction of user is estimated, concrete grammar is the qos requirement according to channel condition information, queue state information, ephemeral data and variety classes user, calculates user satisfaction.
Scheduling allocation units is responsible for distributing each sub-channels according to the current satisfaction of user and channel condition information.
User communicates with base station by relaying, and relaying arranges buffer area to deposit the data that base station sends, and at next sub-slots, data is forwarded.Channel condition information between the contribution link of base station and the queue state information of buffer area, and estimate user satisfaction, carry out resource distribution further according to user satisfaction.
Present system includes active user and non real time user, and they are different to qos requirement, and real time business is higher to delay requirement, and Mean Speed is required higher by non real time user.But analyzing from user perspective, real time business and non-real-time service have identical characteristic, it is simply that the resource obtained user to a certain extent after, be further continued for as user resource allocation, the amplification of user satisfaction can be gradually reduced.According to this characteristic, set up unified user satisfaction model.Average delay or the Mean Speed of user are normalized by user satisfaction estimation unit, set up unified satisfaction equation:
MOS m ( t ) = log 2 ( &PartialD; m &CenterDot; a &CenterDot; D max m - D m ( t ) &OverBar; D req m + ( 1 - &PartialD; m ) &CenterDot; a &CenterDot; R m ( t ) &OverBar; R req m )
Wherein, MOSmT () represents the user m satisfaction in t, according to wide variety of subjective assessment standard, " averaged power spectrum score value " (MOS) between 1 to 4.5, and by MOS serialization.A is constant, and the value of a ensures MOSmThe value of (t) arbitrary value in [1,4.5] closed interval.Represent user type,Expression user is active user,Expression user is non real time user.
To maximize system user satisfaction for optimization aim, and with user cache district queue length lower limit and the user satisfaction upper limit for restrictive condition, set up object function and estimate the current satisfaction of user:
Wherein, I (t)mCan reflecting the user m resource obtained, under multiservice environment, corresponding real time business is relevant with user's Mean Speed with user's average delay respectively with non-real-time service.Represent minimum-rate or the time delay of user's qos requirement,Represent user type, when user is real time business, when user is non real time user.A is constant, it is possible to ensure the value of user satisfaction within the specific limits.As I (t)mMore than or equal toTime user be in satisfactory state, otherwise user be unsatisfied with.Represent and jump onto the speed of acquisition at t user m at repeated link second,Represent and relay the queue length of user m, MOS in buffer memory in tmT () represents the satisfaction at t user m, T0For slot length, M is number of users.Restrictive condition can ensure that when RS end subscriber queue does not have data or user satisfaction to reach the highest, no longer distributes excess resource for user, to avoid distributing too much resource.
Owing to object function is a non-convex mixed integer optimization problem, it is difficult to directly obtain optimal solution, the present embodiment can adopt a kind of dispatching algorithm promoting amplitude based on satisfaction.May be used without additive method well known to those skilled in the art to solve.
Feedback information receives unit and receives feedack in feedback channel, including the channel condition information in two-hop link and RS end queue length information.
Scheduling allocation units distributes each sub-channels according to the current satisfaction of user and channel condition information, and relaying link user resource is scheduling.
For ensureing the balance of base station end buffer area data and relay buffer area data, carrying out scheduling of resource according to the length of data queue of base station and relay, its specific implementation method is as follows:
Being in this detailed description of the invention as shown in Figure 3, repeated link first jumps user resources scheduling flow figure, and this scheduling process comprises the following steps:
Step 301: feedback information receives unit and obtains channel condition information and RS end queue state information the first jumping from feedback channel, initializes and obtains set of sub-channels and be combined into X;
Step 302: choose the sub-channel n that channel condition is best from available subchannels;
Step 303: selecting BS end queue length and the user m of RS end queue length disparity, obtaining user's m method can according to formula:Determine.Wherein,WithRepresenting the length of data queue of BS end and RS end respectively, q is constant, and M is system user number.
Step 304: sub-channel n distributes to user m, updates user's BS end and RS end data queuing message, sets of sub-channels be updated to X '=X n.
Step 305: judge whether sets of sub-channels is empty, if then do not continued executing with step 304 point sub-channel for sky, until set of sub-channels is combined into sky.
Fig. 4 is in present embodiment, and repeated link second jumps user resources scheduling flow figure.According to optimization aim, adopting the dispatching algorithm of a kind of suboptimum, every subchannel is distributed to satisfaction on this sub-channel and promotes maximum user, to improve system user satisfaction, its specific implementation method is as follows:
Step 401: obtain channel condition information the second jumping from feedback channel, initializes set of sub-channels and is combined into X, and user's set is U;
Step 402: an optional subchannel n from available subchannels;
Step 403: each user during user is gathered, according toJudge its user type, as performed step 404 for real-time traffic users, otherwise perform step 405;
Step 404: calculate the user's average delay after sub-channel n distributes to this user (can calculate according to Little theorem), and calculate relative users satisfaction.According to formula:Calculate the user satisfaction increasing degree after sub-channel n distributes to this user.Wherein MOSmT () is the current satisfaction of user;
Step 405: calculate the user's Mean Speed after sub-channel n distributes to this user, and calculate relative users satisfaction.According to formula:Calculate the user satisfaction increasing degree after sub-channel n distributes to this user.Wherein MOSmT () is the current satisfaction of user;
Step 406, selects the user m that Δ MOS (t) is maximum, sub-channel n distributes to user m, updates queue state information and the Mean Speed of user m;
Step 407: judge user's m satisfaction be whether 4.5 or RS end queue be sky.Such as satisfied execution step 408, otherwise perform 409;
Step 408: update user set, make U '=U m;
Step 409: judge whether sets of sub-channels is empty, if then do not continued to divide sub-channel as stated above for sky, otherwise terminates.
The above, be only presently preferred embodiments of the present invention, is not intended to limit protection scope of the present invention.

Claims (9)

1. resource regulating method under mixed service scene in an OFDM relay system, it is characterized in that, comprise the steps: that channel condition information extraction unit and queue state information's extraction unit extract channel condition information and queue state information respectively, including: the time delay of user satisfaction qos requirementSpeedThe maximum delay can tolerated with active userObtain the average delay of user's current time slotsAnd Mean SpeedAverage delay or the Mean Speed of user are normalized by user satisfaction estimation unit, set up user satisfaction equation:
MOS m ( t ) = log 2 ( &part; m &CenterDot; a &CenterDot; D m a x m - D m ( t ) &OverBar; D r e q m + ( 1 - &part; m ) &CenterDot; a &CenterDot; R m ( t ) &OverBar; R r e q m ) ; To maximize user satisfaction for optimization aim, and with user cache district queue length lower limit and the user satisfaction upper limit for restrictive condition, set up object function, it is determined that the current satisfaction of user;Feedback information receives channel condition information and the relay queue length information that unit receives in feedback channel in two-hop link;Scheduling allocation units distributes each sub-channels according to the current satisfaction of user and channel condition information, and relaying link user resource is scheduling, wherein, and MOSmT () represents the user m satisfaction in t, a is constant,Represent user type, when user is real time businessWhen user is non real time user
2. resource regulating method under mixed service scene according to claim 1, it is characterised in that the object function of described foundation is:
m a x &Sigma; m = 1 M log 2 ( a I ( t ) m I 0 m ) It is limited to R R S m ( t ) &le; 2 &CenterDot; Q R S m ( t ) T 0 a n d MOS m ( t ) < 4.5 , Wherein I (t)mRepresent the user m resource obtained,Represent minimum-rate or the time delay of user's qos requirement,Represent and jump onto the speed of acquisition at t user m at repeated link second,Represent and relay the queue length of user m, MOS in buffer memory in tmT () represents the satisfaction at t user m, T0For slot length, M is number of users.
3. resource regulating method under mixed service scene according to claim 1, it is characterized in that, described relaying link user resource is scheduling particularly as follows: the length of data queue according to base station and relay carries out scheduling of resource, every subchannel is distributed on this sub-channel satisfaction and promotes maximum user.
4. resource regulating method under mixed service scene according to claim 3, it is characterized in that, length of data queue according to base station and relay carries out scheduling of resource, specifically include: feedback information receives unit and obtains channel condition information and relay queue state information the first jumping from feedback channel, initialize acquisition set of sub-channels and be combined into X;The sub-channel n that channel condition is best is chosen from available subchannels;Select base station end queue length and the user m of relay queue length disparity;Sub-channel n distributing to user m, updates user base station end and relay data queue information, sets of sub-channels updates, until set of sub-channels is combined into sky.
5. resource regulating method under mixed service scene according to claim 3, it is characterized in that, every subchannel is distributed to the maximum user of satisfaction lifting on this sub-channel specifically include: obtain channel condition information the second jumping from feedback channel, initializing set of sub-channels and be combined into X, user's set is U;From available subchannels, an optional subchannel n, distributes to user by sub-channel;To real-time traffic users, calculate user's average delay, to non-real-time service user, calculate user's Mean Speed, and according to formula:Calculate the user satisfaction increasing degree after sub-channel n distributes to this user, wherein, MOSmT () is the current satisfaction of user,The user satisfaction after this user is distributed to for sub-channel n;Select the user m that Δ MOS (t) is maximum, sub-channel n is distributed to user m, update queue state information and the Mean Speed of user m;Until set of sub-channels is combined into sky.
6. resource scheduling system under mixed service scene in an OFDM relay system, it is characterized in that, this system includes: feedback information receives unit, channel condition information extraction unit, queue state information's extraction unit, user satisfaction estimation unit and scheduling of resource unit, channel condition information extraction unit and queue state information's extraction unit extract channel condition information and queue state information respectively, including: the time delay of user's qos requirementSpeedThe maximum delay can tolerated with active userObtain the average delay of user's current time slotsAnd Mean SpeedAverage delay or the Mean Speed of user are normalized by user satisfaction estimation unit, set up user satisfaction equation:
MOS m ( t ) = log 2 ( &part; m &CenterDot; a &CenterDot; D m a x m - D m ( t ) &OverBar; D r e q m + ( 1 - &part; m ) &CenterDot; a &CenterDot; R m ( t ) &OverBar; R r e q m ) ; To maximize user satisfaction for optimization aim, and with user cache district queue length lower limit and the user satisfaction upper limit for restrictive condition, set up object function, it is determined that the current satisfaction of user;Feedback information receives channel condition information and the relay queue length information that unit receives in feedback channel in two-hop link;Scheduling of resource unit distributes each sub-channels according to the current satisfaction of user and channel condition information, and relaying link user resource is scheduling, wherein, and MOSmT () represents the user m satisfaction in t, a is constant,Represent user type, when user is real time businessWhen user is non real time user
7. system according to claim 6, it is characterised in that the object function of described foundation is:
m a x &Sigma; m = 1 M log 2 ( a I ( t ) m I 0 m ) It is limited to R R S m ( t ) &le; 2 &CenterDot; Q R S m ( t ) T 0 a n d MOS m ( t ) < 4.5 , Wherein, I (t)mRepresent the user m resource obtained,Represent minimum-rate or the time delay of user's qos requirement,Represent and jump onto the speed of acquisition at t user m at repeated link second,Represent and relay the queue length of user m, MOS in buffer memory in tmT () represents the satisfaction at t user m, T0For slot length, M is number of users.
8. system according to claim 6, it is characterized in that, described to relaying link user resource be scheduling specifically including, feedback information receive unit from feedback channel obtain first jumping channel condition information and relay queue state information, initialize obtain set of sub-channels be combined into X;The sub-channel n that channel condition is best is chosen from available subchannels;Select base station end queue length and the user m of relay queue length disparity;Sub-channel n distributing to user m, updates user base station end and relay data queue information, sets of sub-channels updates, until set of sub-channels is combined into sky.
9. system according to claim 6, it is characterised in that described be scheduling specifically including to relaying link user resource, obtains channel condition information the second jumping from feedback channel, initializes set of sub-channels and be combined into X, and user's set is for U;From available subchannels, an optional subchannel n, distributes to user by sub-channel;To real-time traffic users, calculate user's average delay, to non-real-time service user, calculate user's Mean Speed, and according to formula:Calculate the user satisfaction increasing degree after sub-channel n distributes to this user, wherein, MOSmT () is the current satisfaction of user,The user satisfaction after this user is distributed to for sub-channel n;Select the user m that Δ MOS (t) is maximum, sub-channel n is distributed to user m, update queue state information and the Mean Speed of user m;Until set of sub-channels is combined into sky.
CN201210433360.1A 2012-11-02 2012-11-02 Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system Expired - Fee Related CN102932308B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210433360.1A CN102932308B (en) 2012-11-02 2012-11-02 Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210433360.1A CN102932308B (en) 2012-11-02 2012-11-02 Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system

Publications (2)

Publication Number Publication Date
CN102932308A CN102932308A (en) 2013-02-13
CN102932308B true CN102932308B (en) 2016-07-27

Family

ID=47647011

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210433360.1A Expired - Fee Related CN102932308B (en) 2012-11-02 2012-11-02 Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system

Country Status (1)

Country Link
CN (1) CN102932308B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020041883A1 (en) * 2018-08-29 2020-03-05 Carleton University Enabling wireless network personalization using zone of tolerance modeling and predictive analytics

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103795610B (en) * 2013-12-31 2017-01-04 浙江大学 The instant messaging dispatching method of a kind of Consumer's Experience justice and device
US11736973B2 (en) 2018-08-29 2023-08-22 Carleton University Enabling wireless network personalization using zone of tolerance modeling and predictive analytics
CN110556841B (en) * 2019-08-29 2022-11-04 天津大学 Island microgrid frequency controller design method considering wireless communication time delay

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101505482A (en) * 2009-02-23 2009-08-12 北京邮电大学 Semi-distribution type resource distribution method and system
CN102036356A (en) * 2009-09-27 2011-04-27 北京邮电大学 Multi-service diversity dispatching method of multi-hop coordination network
CN102612149A (en) * 2011-01-25 2012-07-25 华为技术有限公司 Wireless resource distribution method for relay cell, base station and system
WO2012119626A1 (en) * 2011-03-08 2012-09-13 Panasonic Corporation Propagation delay difference reporting for multiple component carriers

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101505482A (en) * 2009-02-23 2009-08-12 北京邮电大学 Semi-distribution type resource distribution method and system
CN102036356A (en) * 2009-09-27 2011-04-27 北京邮电大学 Multi-service diversity dispatching method of multi-hop coordination network
CN102612149A (en) * 2011-01-25 2012-07-25 华为技术有限公司 Wireless resource distribution method for relay cell, base station and system
WO2012119626A1 (en) * 2011-03-08 2012-09-13 Panasonic Corporation Propagation delay difference reporting for multiple component carriers

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020041883A1 (en) * 2018-08-29 2020-03-05 Carleton University Enabling wireless network personalization using zone of tolerance modeling and predictive analytics

Also Published As

Publication number Publication date
CN102932308A (en) 2013-02-13

Similar Documents

Publication Publication Date Title
CN101529754B (en) The method and apparatus using random access procedure distributing radio resource in mobile communication system
CN101836480B (en) Multiplexing multiple unsolicited grant service (UGS) users onto a same radio resource
CN104284407B (en) Poewr control method based on full duplex relaying in the cellular network of embedded D2D
CN102098746B (en) Multi-cell resource allocation method introducing mobile resource reserve mechanism
CN101902817A (en) Uplink radio resource dispatching method and device for wireless communication system
CA2790671A1 (en) Method for scheduling guaranteed bit rate service based on quality of service
CN101610578B (en) Method and system for avoiding receiving and sending interference
CN103988542A (en) A method and a system for bandwidth aggregation in an access point
CN101064538B (en) Power control method for time-division synchronous CDMA communication system
CN105491510B (en) The shared business discharging method of resourceoriented in a kind of intensive isomery cellular network
CN110062351A (en) Transmit the method and its terminal device of data
CN102932308B (en) Mixed service Scene dispatch method and dispatching patcher in a kind of OFDM relay system
CN106572497B (en) Heuristic D2D resource allocation method based on proportional fairness algorithm
CN101610491A (en) Avoid receiving and sending the method and system of interference
CN101951555B (en) Radio resource management method used in enhanced multimedia multicast/ broadcast service
Su et al. Tac-U: A traffic balancing scheme over licensed and unlicensed bands for Tactile Internet
CN102056305B (en) User grouping and resource allocation method for wireless relay network
Strinati et al. Green communications: an emerging challenge for mobile broadband communication networks
JP5844385B2 (en) Method and corresponding system for providing a random access channel in a wireless network for communication
CN102665254A (en) Selection method of access of CDMA (Code Division Multiple Access)/WLAN (Wireless Local Area Network) heterogeneous network based on user gain
CN101883363A (en) Resource allocation method, device and system
CN104113922A (en) Wireless network distribution method
Benchaabene et al. Comparative analysis of downlink scheduling algorithms for LTE femtocells networks
CN104640229A (en) UE accessing method, UE and base station
Doppler et al. Adaptive soft reuse for relay enhanced cells

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20170405

Address after: 518053 Guangdong city of Shenzhen province Nanshan District overseas Chinese town in Eastern Industrial Zone H3 building 501B

Patentee after: Shenzhen Tinno Wireless Technology Co., Ltd.

Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2

Patentee before: Chongqing University of Posts and Telecommunications

CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160727

Termination date: 20181102