EP2382730A1 - Planification de transmission en liaison descendante dans des réseaux à ondes porteuses multiples - Google Patents

Planification de transmission en liaison descendante dans des réseaux à ondes porteuses multiples

Info

Publication number
EP2382730A1
EP2382730A1 EP08875578A EP08875578A EP2382730A1 EP 2382730 A1 EP2382730 A1 EP 2382730A1 EP 08875578 A EP08875578 A EP 08875578A EP 08875578 A EP08875578 A EP 08875578A EP 2382730 A1 EP2382730 A1 EP 2382730A1
Authority
EP
European Patent Office
Prior art keywords
slots
transmission
active connection
logical
downlink transmission
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
EP08875578A
Other languages
German (de)
English (en)
Other versions
EP2382730B1 (fr
Inventor
Marco Caretti
Claudio Cicconetti
Ivano Salvatore Collotta
Paolo Tongiani
Luciano Lenzini
Enzo Mingozzi
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.)
Telecom Italia SpA
Original Assignee
Telecom Italia SpA
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 Telecom Italia SpA filed Critical Telecom Italia SpA
Publication of EP2382730A1 publication Critical patent/EP2382730A1/fr
Application granted granted Critical
Publication of EP2382730B1 publication Critical patent/EP2382730B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0064—Rate requirement of the data, e.g. scalable bandwidth, data priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0037—Inter-user or inter-terminal allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/006—Quality of the received signal, e.g. BER, SNR, water filling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling

Definitions

  • the present invention relates in general to the field of telecommunications, more particularly to multi-carrier networks like OFDMA (Orthogonal Frequency Division Multiple Access) wireless networks, and even more particularly to the management of radio resources in such networks.
  • the present invention concerns a method and system for scheduling downlink data transmission into the available resources.
  • Typical application scenarios for the present invention includes, but are not limited to, beyond-3G cellular systems.
  • FDMA Frequency-Division Multiple Access
  • FDMA/TDMA digital narrowband Frequency and Time Division Multiple Access
  • CDMA Code-Division Multiple Access
  • BWA Broadband Wireless Access
  • OFDM Orthogonal Frequency Division Multiplexing
  • OFDMA combines the TDMA and FDMA schemes; the time domain is segmented into groups of OFDMA symbols, and each symbol is segmented into sub-carriers.
  • the number of symbols and sub-carriers which are allocated to a single transmitter vary according to the transmitter's needs (i.e. according to the amount of traffic data to be transmitted).
  • the transmission rate (i.e. the adopted modulation and coding scheme) on those carriers is set to meet the transmitter's needs and capabilities.
  • OFDMA transmission systems are those compliant to the IEEE 802.16 family of standards, which relate to fixed and mobile BWA.
  • US 2005/0265223 discloses a method and apparatus for scheduling downlink channels in an orthogonal frequency division multiple access system.
  • Terminals compute a plurality of channel capacities and search for a channel with a maximum capacity.
  • the terminals send, to a base station, feedback information including a channel number and a capacity value of the channel with the maximum capacity.
  • the base station performs a first channel allocation process for allocating a channel with an optimal capacity to each terminal on the basis of the feedback information.
  • the base station performs a second channel allocation process for allocating an adjacent channel to a corresponding terminal using the window bit when the terminal is not allocated a channel in the first channel allocation process.
  • US 2007/060178 discloses systems and methods of scheduling sub-carriers in an OFDMA system in which a scheduler takes into account channel conditions experienced by the communication devices to optimize channel conditions.
  • the scheduler can partition a set of sub- carriers spanning an operating bandwidth into a plurality of segments.
  • the segments can include a plurality of global segments each of which includes a distinct non-contiguous subset of the sub- carriers spanning substantially the entire operating bandwidth.
  • One or more of the global segments can be further partitioned into a plurality of local segments that each has a bandwidth that is less than a channel coherence bandwidth.
  • the scheduler determines channel characteristics experienced by each communication device via reporting or channel estimation, and allocates one or more segments to communication links for each device according to the channel characteristics.
  • the Applicant has tackled the problem of scheduling transmissions in an OFDMA environment, and particularly in downlink transmissions, from a network base station to user terminals, like mobile stations.
  • the Applicant has found a peculiar structure for the downlink transmission sub-frame that can be advantageously exploited for implementing a power-aware opportunistic downlink scheduling method, satisfying the requirement of no QoS degradation and the goal of high throughput for best-effort traffic. Exploiting such peculiar frame structure, the Applicant has devised a method of scheduling transmissions in a multi-carrier transmission system, comprising, for each downlink transmission frame:
  • the method may comprise: - assigning a credit to the active connection, said credit expressing an amount of slots that accumulated in preceding downlink transmission frames during which the active connection was not serviced;
  • the credit may be updated by subtracting a number of slots used for downlink transmission to said active connection.
  • Said predetermined number of slots may be equal for every active connection.
  • Said predetermined number of slots may be a function of a perceived downlink transmission channel quality and of the number of slots per logical band.
  • a timer may be assigned to data which have to be transmitted to said active connection with priority; when the timer lapses, said data are transmitted before performing operations a), b) and c).
  • the data may be retransmitted before the data to be transmitted with priority.
  • a transmission scheduler for scheduling transmissions in a multi-carrier transmission system, the transmission scheduler being operable to:
  • a base station of a multi-carrier transmission system comprising the above transmission scheduler.
  • a multi-carrier transmission system comprising the above base station.
  • Figure 1 is a pictorial representation of a communication network in which the present invention can be applied;
  • Figure 2 depicting a structure of a frame according to an embodiment of the present invention;
  • Figure 3 shows a detail of the frame structure of Figure 2, with data regions of equal shape and size, according to an embodiment of the present invention
  • Figure 4 shows data structures used by a scheduling algorithm according to an embodiment of the present invention
  • Figure 5 is a schematic flowchart of a phase of the scheduling algorithm according to an embodiment of the present invention.
  • Figures 6, 7 and 8 shows an example of logical band selection according to an embodiment of the present invention
  • Figure 9 is a schematic flowchart reassuming a scheduling method according to an embodiment of the present invention.
  • FIG. 1 is a schematic, simplified pictorial representation of a communication network in which the present invention can be applied, particularly an IEEE 802.16 cellular network.
  • the communication network globally denoted 100, comprises a plurality of base stations 105, typically spread across a geographic area, each one covering a respective portion of the geographic area, referred to as a "cell", in order to serve users' mobile stations, like the mobile stations (MSs) 110i,..., 11On, ..., 11ON (e.g., cellular phones), that happen to be located in the cells.
  • the base stations 105 are connected to the core network 115, which in some network architectures may include base station controllers, controlling the base stations 105, and mobile switching centers, four routing calls.
  • the embodiments of the present invention described in the following are particularly concerned with the downlink transmission, i.e. the transmission from the network's base stations to the users' mobile stations.
  • the IEEE 802.16 standard has a connection- oriented MAC (Media Access Control) protocol, where every uni-directional connection can be uniquely identified in the cell and has its own set of QoS parameters.
  • the transmission of variable- length packets is supported by means of a convergence layer, which can also perform header suppression functions.
  • One or more MAC Service Data Units (SDUs) can then be encapsulated into a single MAC Protocol Data Unit (PDUs).
  • PDUs MAC Protocol Data Unit
  • MAC SDUs can also be fragmented.
  • H-ARQ Hybrid Automatic Repeat Request
  • MAC PDUs are then concatenated into an H-ARQ sub-burst (sub-burst, for short), which is appended a Cyclic Redundancy Check (CRC) trailer, is encoded and then transmitted over the air.
  • CRC Cyclic Redundancy Check
  • the correct/incorrect decoding of an H-ARQ sub-burst is indicated by the recipient mobile station by means of a dedicated logical sub-channel in uplink. Failed sub-bursts can be re-transmitted by the base station up to a maximum number of times.
  • Each base station is responsible for sharing its available radio resources among the mobile stations associated to the serving cell on a short time scale, corresponding to a so-called "frame".
  • a frame 200 can be viewed as a bi-dimensional rectangle which extends over the time and frequency domains.
  • the generic frame 200 consists of a number of time slots, the duration of each time slot corresponding to one OFDM symbol; in the frequency domain, the spectrum is divided into equally-spaced sub-carriers; sets of sub-carriers are logically combined into so-called "sub-channels”.
  • the minimum unit for transmission is referred to as a "slot", and consists of one or more time slots, in the time domain, and one sub-channel, in the frequency domain.
  • the generic frame 200 includes, in time sequence, a downlink sub-frame 200DL and an uplink sub-frame 200UL.
  • the downlink sub-frame 200DL includes, in time sequence, a preamble portion 205, a downlink signaling portion 210, a downlink data portion 215; the uplink sub-frame 200UL includes an uplink data portion 220 and an uplink signaling portion 225.
  • the downlink sub- frame 200DL is separated from the uplink sub-frame 200UL by a IxIRx transition gap 230, while two frames (i.e., the uplink sub-frame 200UL of a frame and the downlink sub-frame 200DL of the next frame) are separated by an RxIIx transition gap 235.
  • the data portion 215 of the downlink sub-frame 200DL is divided into a number L of different chunks 305i - 305L, also referred to as "data regions", as depicted in Figure 3; the chunks, i.e. the data regions 305i - 305L are rectangular in shape, and their sizes depends on the downlink sub-frame 200DL duration, on the permutation scheme, and on the amount of downlink signaling (downlink signaling portion 210).
  • a respective logical band 31 Oi - 31OL corresponds to each data region 305i - 305L, the generic logical band being mapped to exactly one respective data region; the mapping of the logical bands 31 Oi - 31OL to the data regions 305i - 305L is advertised in a MAC (Media Access Control) control message called DL-MAP ("DownLink Map"), which is part of the downlink signaling portion 210 and is a broadcast message which defines the downlink access.
  • MAC Media Access Control
  • Each logical band 31 Oi - 31OL can be transmitted by the base station with a different power level, also referred to as boosting level; the boosting level of the generic logical band 310i - 31OL can be set based on different factors, like for example inter-cell interference or QoS for the single connection.
  • Algorithms are used to compute the boosting levels for the different logical bands 31 Oi - 31OL; a description of such algorithms is omitted because not considered relevant to the understanding of the invention embodiment here presented.
  • the data regions can have an arbitrary size and position within the frame, in the frame structure according to the herein described embodiment of the present invention and depicted in Figures 2 and 3, the shape of all the data regions is the same: the data region duration is equal to the number of time slots in the downlink data portion 215 of the frame (corresponding to the FUSC - Full-Usage Sub-Channelization zone of the frame), while the frequency span is equal to ML of the bandwidth, being L the number of logical bands.
  • Scheduling data regions of fixed size instead of data regions of arbitrary shape and position has several advantages, among which: (/) the allocation, i.e.
  • each logical band is reserved a set of logical sub-channels, data transmitted on a given logical band can be boosted while guaranteeing power stability over time;
  • inter-cell coordination can be performed so that boosting in a given cell is not under-/over-compensated by the downlink power allocation of interfering cells.
  • mapping each logical band to one data region makes the process of estimating the worst-case size of the DL-MAP straightforward.
  • each data region requires one Information Element (IE), whose size depends on the number of H-ARQ (Hybrid-Automatic Repeat Request) sub-bursts transmitted and the MCS (Modulation and Coding Scheme) used.
  • IE Information Element
  • the size of the logical bands 31 Oi - 31OL is selected so that one H-ARQ sub- burst of target size can be transmitted at the lowest MCS. Therefore, the minimum size of the DL- MAP is derived as that resulting from L data regions with a single H-ARQ sub-burst each.
  • the DL-MAP size is selected based on the average DL-MAP as obtained from simulations under different network and load configurations, possibly enlarged by a tolerance factor, e.g. equal to 1.2.
  • This capacity can be employed by the base station for transmitting broadcast non-periodic MAC control messages that are not subject to regular scheduling.
  • a scheduling method according to an embodiment of the present invention will be5 described hereinafter.
  • the scheduling method is in particular implemented by means of a scheduling algorithm and is performed by the generic base station.
  • S be the number of slots for each of the L logical bands 31 Oi - 31OL; the total number of slots per frame is thus equal to S x L .
  • the number L of logical bands may be
  • OFDM symbols may be reserved for the MAC control messages plus synchronization preamble, so that the number S of slots may be 28.
  • each mobile station has only one connection established, either real-time or best-effort.
  • Real-time connections convey traffic 5 from applications that require a minimum rate to operate correctly; examples of such applications are digitized voice and video streaming. Best-effort connections do not have this requirement.
  • the algorithm described herebelow can be extended to the case of multiple connections per mobile station in a straightforward manner.
  • N be the number of mobile stations with an active connection.
  • a connection is said to be active if there are data waiting to be 0 transmitted buffered at the sending station.
  • active mobile stations are considered those having an active connection.
  • An active list 405 is kept which contains identifiers of the active connections; in the example here considered, since as mentioned it is assumed that each mobile station may have one connection only active, the active list 405 corresponds to a list of active mobile stations.
  • the active list 405 is structured as explained below.
  • All MAC SDUs received from upper layers in the ISO OSI stack are enqueued as regular data into respective per-connection queues Qi,..., Q n ,..., QN ; thus, for each connection, i.e., under the current assumption of one connection possible for any mobile station, for each mobile station
  • ⁇ n credit assigned to the mobile station 11O n , expressed in terms of slots, that accumulated over the last rounds while the mobile station 11O n was not eligible for scheduling; the credit ⁇ n is set equal to 0 while a mobile station 11O n is not active.
  • q n quantum of the mobile station 11O n , expressed in terms of slots, which is the number of slots that the generic active mobile station 11O n is granted whenever it is selected for scheduling.
  • the quanta are equal for all the mobile stations, and are set equal to S; however, different policies can be devised to enable service differentiation or tuning the scheduler's opportunism, as described later.
  • AMC Adaptive Modulation and Coding
  • ⁇ mn which is a system parameter that defines when a logical band is considered to be “full”, as explained below. This parameter is used to determine the terminating condition of the scheduling algorithm. The impact on the performance of ⁇ mn may be evaluated via simulation.
  • the scheduling algorithm comprises a phase encompassing a selection of the logical band for transmitting data.
  • the logical band selection is described hereinafter, with the aid of the schematic flowchart of Figure 5.
  • the status and queue of each mobile station are logically stored in mobile station descriptors 415i,..., 415 n ,..., 415 ⁇ /.
  • the base station visits the mobile station descriptors in, e.g., round-robin order, based on the time when the mobile stations became active.
  • the active list 405 is the list of the pointers 410i,..., 41O n ,..., 410N to the mobile station descriptors
  • a new element is added to the tail of the active list 405 when an idle mobile station becomes active.
  • An element is removed from the active list 405 when the pointed mobile station does not have any more enqueued SDUs to receive.
  • a "feasible set" ⁇ n is defined (block 505) as the set of logical bands 310i,..., 31OL that the mobile station 11O n can actually exploit for receiving data (i.e. having a boosting level b at which the mobile station 11O n can receive data, i.e. bps b " > 0 ) and that have a number of slots available for transmission greater than ⁇ mn , /.e.:
  • ⁇ n ⁇ l ⁇ bpsl > 0 ⁇ ⁇ ( > ⁇ mm ⁇ .
  • the scheduling algorithm visits each mobile station descriptor 415i,..., 415n,..., 415N (block 510) by cycling through the active list 405 in a circular manner, until one of the following conditions becomes true:
  • N o , i.e. the active list 405 becomes empty
  • the scheduling algorithm first selects the logical band to be used for transmission to the mobile station 11O n .
  • the number of slots S 1 that can be scheduled for transmission to the mobile station 110 n in the logical band / are:
  • ⁇ ⁇ Q n ,bps b n ⁇ ,a 1 is the number of slots that can be actually used by the mobile station 11O n if it is served in the logical band /, depending on the backlogged SDUs, the MCS and the residual. Any MAC overhead, including packing/fragmentation and H-ARQ correction codes, is taken into account by the function ⁇ (•) .
  • the first reduced feasible set ⁇ [ includes all the logical bands that require minimum boosting.
  • the first reduced feasible set ⁇ [ is further reduced to a second reduced feasible set ⁇ B " (block 525), defined as follows:
  • the second reduced feasible set ⁇ B " only includes the logical bands of first reduced feasible set ⁇ ' n for which the base station can transmit the maximum amount of data to the mobile station 11O n .
  • the logical band T actually used for transmission is selected in the first reduced feasible set ⁇ ' n as (block 530): > a i ) ⁇ -
  • / is the logical band that leaves the smallest residual, among those that can occupy as many slots as possible in the logical band.
  • the logical band T actually used for transmission may be selected in the first reduced feasible set ⁇ [ as the logical band that leaves a residual equal to or smaller than a predetermined residual value.
  • the mobile station credit is updated as follows (block 535):
  • the credit ⁇ n of the mobile station is then assessed (block 540). If the credit ⁇ n is not enough to fully occupy the selected logical band T, i.e. if ⁇ B ⁇ s ⁇ (block 540, exit branch N) then the mobile station does not receive any service in this round (block 545). This is also the case if the reduced feasible sets ⁇ [ and ⁇ B " of the mobile station 11O n were empty. In case the credit ⁇ n is enough to fully occupy the selected logical band T, i.e. if ⁇ ⁇ > S 1 (block 540, exit branch N), then the mobile station receives service (block 550) and its credit is updated as follows (block 555):
  • the mobile station descriptor is then visited in the next round (block 560).
  • the second condition to derive the first reduced feasible set ⁇ ' n depends on the SDUs backlogged on the mobile station 11O n . Four cases are considered, which are illustrated in the table at the right of Figure 7.
  • the credit ⁇ n of the mobile station 11O n is compared to the number of slots to be transmitted in the selected logical band T . Transmission actually takes place only in case the mobile station has accumulated enough credit, otherwise it is skipped.
  • the quanta may be set statically to be equal to the same number of slots, in order to provide wireless fairness among users, which are given a fair share of the wireless resources, i.e. slots, while their mobile stations are active. Since users can experience (very) different channel conditions, receiving the same amount of slots does not necessarily lead to throughput fairness during short periods. In fact, users with more efficient MCSs will be able to receive a greater amount of bytes in the unit of time compared to users with less efficient MCSs. The Applicant believes this behavior to be correct, since challenged users should not penalize the overall system performance by being granted large shares to overcome their bad channel conditions. This is especially true if the channel is likely to change over a wide range of conditions, which would also lead to throughput fairness over large periods.
  • the more efficient is the MCS employed for transmitting data to a mobile station the smaller becomes the number of slots that the mobile station is granted at each visit.
  • the quanta can be set according to any function of the perceived channel quality and the number of slots per logical band and other parameters:
  • the quantum q n of the mobile station 11O n can be set equal to q 0 - ⁇ > n , where q 0 is a reference quantum and ⁇ > n is the weight assigned to the mobile station 11O n . In this way, during any time interval while two mobile stations / and j are continuously active, the ratio between the number of slots granted thereto will be equal to ⁇ ,/ ⁇ 7 .
  • H-ARQ sub-bursts fail to be received by the recipient mobile station, a negative acknowledgment is received by the base station, which has to retransmit the H-ARQ sub-burst with the same MCS, until the maximum number of H-ARQ retransmissions is exceeded. Since a mobile station has to cumulate enough credit before it is entitled to transmit a H-ARQ sub-burst, in a preferred embodiment of the present invention it is considered not fair to treat H-ARQ retransmissions as if it were SDUs that have never been transmitted. Furthermore, scheduling new SDUs of a mobile station before its H-ARQ retransmissions can lead to the saturation of the stop- and-wait slots of the mobile station.
  • H-ARQ retransmissions are scheduled to take place before running the scheduling algorithm described in the foregoing, which instead only applies to "regular" enqueued SDUs.
  • This may for example be achieved by promoting the H-ARQ sub-burst that are to be retransmitted inserting them into per- mobile station H-ARQ buffers, as prescribed by the IEEE 802.16 standard. Since it is likely that only a small portion of the transmitted H-ARQ sub-bursts fail to be received, it is believed unnecessary to devise a policy to decide in which order they have to be scheduled for retransmission, since all of them will fit into the logical bands.
  • two strategies can be used to select which boosting level to use: retransmitting each H-ARQ sub-burst into a logical band with the same boosting level used for its first transmission, if possible; or retransmitting the H-ARQ sub-burst into a logical band with boosting level O, if possible.
  • T n urgency time, in seconds.
  • an urgent list 4210 is kept at the base station, as depicted in Figure 4, which, in an embodiment of the present invention, is implemented as a FIFO (First-ln, First-Out) o list.
  • a timer is started that expires after T n seconds. Scheduling is performed according to the procedure described above with no special treatment of the mobile station until the timer expires.
  • an element is added to the tail of the urgent list 4210, which 5 specifies the identifier of the real-time connection and the nominal SDU size C n .
  • the urgent list 420 is then served before regular scheduling, i.e. immediately after H-ARQ retransmissions are scheduled for transmission.
  • the amount of service for each connection in the urgent list 420 is preferably limited to C n bytes.
  • the logical band is selected via the usual rules for best-effort scheduling, while the credit is not modified in the process.
  • the scheduling method starts at the beginning of every frame (block 905), and comprises three phases. H-ARQ sub-bursts waiting to be retransmitted are scheduled first, and the H-ARQ retransmissions are served in a FIFO order (block 910). Then, any pending urgent data from real-time connections are scheduled (block 915); the connections with urgent data are served in the same order in which their timer expired. Finally, regular data are served (block 920). If the frame becomes exhausted in any of these three phases, the scheduling terminates immediately.
  • a typical application scenario for the present invention are beyond-3G cellular systems, so in the following we shall often refer to this kind of system.
  • the invention is also applicable to different categories of communication systems, including non-cellular networks.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention porte sur un procédé de planification de transmissions dans un système de transmission à ondes porteuses multiples qui comprend, pour chaque trame de transmission en liaison descendante : la division de la trame de transmission en liaison descendante (200DL) en une pluralité de régions de données (30S1-SOSL) comportant chacune un nombre égal de créneaux temporels, chaque région de données correspondant à une bande logique respective (3101-310L); pour une connexion actuellement active : a) la création d'un premier ensemble de bandes logiques non entièrement occupées pour une transmission et ayant un niveau d'amplification minimal nécessaire pour amener la transmission à pouvoir être reçue par un terminal récepteur; b) l'extraction, à partir du premier ensemble, d'un second ensemble de bandes logiques disponibles pour attribuer le nombre maximal de créneaux temporels pour la transmission en liaison descendante à ladite connexion active, et c) la sélection de la bande logique pour la transmission en liaison descendante à la connexion active à partir du second ensemble comme étant la bande logique qui, après l'attribution des créneaux temporels à la connexion considérée, laisse un nombre résiduel de créneaux égal ou inférieur à un résidu minimal prédéterminé dans la bande logique, par exemple le plus petit nombre résiduel de créneaux.
EP08875578A 2008-12-31 2008-12-31 Planification de transmission en liaison descendante dans des réseaux à ondes porteuses multiples Active EP2382730B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/068380 WO2010075901A1 (fr) 2008-12-31 2008-12-31 Planification de transmission en liaison descendante dans des réseaux à ondes porteuses multiples

Publications (2)

Publication Number Publication Date
EP2382730A1 true EP2382730A1 (fr) 2011-11-02
EP2382730B1 EP2382730B1 (fr) 2013-02-27

Family

ID=41202435

Family Applications (1)

Application Number Title Priority Date Filing Date
EP08875578A Active EP2382730B1 (fr) 2008-12-31 2008-12-31 Planification de transmission en liaison descendante dans des réseaux à ondes porteuses multiples

Country Status (4)

Country Link
US (1) US8320320B2 (fr)
EP (1) EP2382730B1 (fr)
CN (1) CN102308513B (fr)
WO (1) WO2010075901A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8301177B2 (en) * 2009-03-03 2012-10-30 Intel Corporation Efficient paging operation for femtocell deployment

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4256158B2 (ja) * 2002-12-26 2009-04-22 パナソニック株式会社 無線通信装置及び無線通信方法
KR100689454B1 (ko) * 2004-05-14 2007-03-08 삼성전자주식회사 직교 주파수 분할 다중 접속 무선 통신 시스템에서 하향링크 채널 스케쥴링 방법 및 장치와 시스템
US8098632B2 (en) * 2005-01-21 2012-01-17 Samsung Electronics Co., Ltd. Apparatus and method for downlink scheduling in a SDMA-enabled OFDMA wireless network
JP4836951B2 (ja) * 2005-06-24 2011-12-14 パナソニック株式会社 マルチキャリア通信における無線通信基地局装置および無線通信方法
US9209956B2 (en) * 2005-08-22 2015-12-08 Qualcomm Incorporated Segment sensitive scheduling
WO2007084862A2 (fr) * 2006-01-13 2007-07-26 Qualcomm Incorporated Multiplexage et commande d'attributions distribués et localisés
JP4347300B2 (ja) * 2006-01-17 2009-10-21 株式会社エヌ・ティ・ティ・ドコモ 送信装置および送信方法
GB2447431B (en) * 2007-01-26 2009-01-07 Toshiba Res Europ Ltd Wireless communications network
US8145271B2 (en) * 2007-03-01 2012-03-27 Ntt Docomo, Inc. Base station apparatus and communication control method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2010075901A1 *

Also Published As

Publication number Publication date
WO2010075901A1 (fr) 2010-07-08
EP2382730B1 (fr) 2013-02-27
US8320320B2 (en) 2012-11-27
CN102308513B (zh) 2014-04-09
CN102308513A (zh) 2012-01-04
US20110261778A1 (en) 2011-10-27

Similar Documents

Publication Publication Date Title
Pedersen et al. Punctured scheduling for critical low latency data on a shared channel with mobile broadband
US20200260451A1 (en) Telecommunications apparatuses and methods
EP1906548B1 (fr) Procédé et appareil pour planifier des données selon leur puissance dans un système de communication
US11337232B2 (en) Method and device in wireless communication
US8144720B2 (en) Uplink radio resource allocation in the presence of power limited users
KR101087929B1 (ko) 무선 통신 시스템에서의 중첩 코딩
US20080080465A1 (en) Transmission time interval allocation for packet radio service
EP2314015A2 (fr) Système et procédé d'ajustement de schéma de modulation et de codage pour un canal de données partagé lte
US20070070905A1 (en) Adaptive bin-packing for wireless communications
US8503295B2 (en) Base station and access control method for cellular wireless communication
WO2005122496A1 (fr) Mappage de voie physique partagee dependant du service
CN110876128A (zh) 一种被用于无线通信的节点中的方法和装置
WO2018024150A1 (fr) Dispositif utilisateur de communication à faible latence, procédé d'utilisation dans une station de base, et appareil
JP5787369B2 (ja) 優先度及びシグナリング電力に基づくリソース割り当て
US8320320B2 (en) Method and system for downlink transmission scheduling in multi-carrier networks
Bai et al. Scheduling and resource allocation in OFDM and FBMC systems: An interactive approach and performance comparison
Filin et al. QoS-guaranteed cross-layer adaptive transmission algorithms for the IEEE 802.16 OFDMA system
WO2010049007A1 (fr) Procédé de planification de données
Rasied et al. Dynamic Resource Block Allocation Techniques for Simultaneous EMBB and URLLC Traffic
KR20050083085A (ko) 직교 주파수 분할 다중 접속 방식의 이동 통신 시스템에서트래픽 데이터 스케줄링 장치 및 방법
Tykhomyrov et al. Decreasing the MAP overhead in the IEEE 802.16 OFDMA system
EP1971171A1 (fr) Procédé d'attribution de ressources dans un système d'accès multiple par répartition en fréquence distribuée
KR101083227B1 (ko) 그룹을 형성하는 복수의 단말에 무선자원을 할당하는 방법
KR101267160B1 (ko) 통신 시스템에서 데이터 송신 장치 및 방법
Bai et al. A QoS-providing resource allocation scheme in multiuser multicarrier systems

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20110726

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 598967

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130315

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602008022624

Country of ref document: DE

Effective date: 20130425

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 598967

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130227

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130607

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130527

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130627

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130527

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20130227

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130528

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130627

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20131128

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602008022624

Country of ref document: DE

Effective date: 20131128

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131231

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20131231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20081231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130227

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 8

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20151231

PGRI Patent reinstated in contracting state [announced from national office to epo]

Ref country code: IT

Effective date: 20170710

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230528

P02 Opt-out of the competence of the unified patent court (upc) changed

Effective date: 20230603

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20231227

Year of fee payment: 16

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SE

Payment date: 20231227

Year of fee payment: 16

Ref country code: IT

Payment date: 20231220

Year of fee payment: 16

Ref country code: FR

Payment date: 20231227

Year of fee payment: 16

Ref country code: FI

Payment date: 20231227

Year of fee payment: 16

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20231229

Year of fee payment: 16