US10660116B2 - False scheduling request prevention - Google Patents
False scheduling request prevention Download PDFInfo
- Publication number
- US10660116B2 US10660116B2 US15/526,491 US201415526491A US10660116B2 US 10660116 B2 US10660116 B2 US 10660116B2 US 201415526491 A US201415526491 A US 201415526491A US 10660116 B2 US10660116 B2 US 10660116B2
- Authority
- US
- United States
- Prior art keywords
- resource
- scheduling
- indicated
- occasion
- mobile terminal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active, expires
Links
- 230000002265 prevention Effects 0.000 title 1
- 238000000034 method Methods 0.000 claims abstract description 32
- 238000004590 computer program Methods 0.000 claims abstract description 19
- 238000004891 communication Methods 0.000 claims abstract description 17
- 125000004122 cyclic group Chemical group 0.000 claims description 18
- 230000005540 biological transmission Effects 0.000 description 8
- 238000001514 detection method Methods 0.000 description 7
- 108010076504 Protein Sorting Signals Proteins 0.000 description 3
- 238000013507 mapping Methods 0.000 description 3
- 239000002699 waste material Substances 0.000 description 2
- 238000001914 filtration Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 230000001131 transforming effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- H04W72/1226—
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
- H04L27/2626—Arrangements specific to the transmitter only
-
- H04W72/0413—
-
- H04W72/082—
-
- H04W72/1284—
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/02—Terminal devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
- H04W88/08—Access point devices
Definitions
- the invention relates to a scheduling node and a method at the scheduling node in a wireless communication network of scheduling mobile terminals submitting Scheduling Requests (SRs) in SR resources.
- the invention further relates to a computer program performing the method according to the present invention, and a computer program product comprising computer readable medium having the computer program embodied therein.
- Mobile terminals such as User Equipment (UE) are allocated Scheduling Request (SR) resources on a Physical Uplink Control Channel (PUCCH) to be able to inform a base station, such as e.g. an eNodeB, that the UE has data to be sent.
- SR Scheduling Request
- PUCCH Physical Uplink Control Channel
- the UE will submit an SR in a slot or resource of the PUCCH, and a scheduler of the eNodeB will subsequently attend to the SR and schedule the UE accordingly for data transmission.
- the SR resources on the PUCCH can be allocated using different strategies. There are four different ways to assign the allocations to the PUCCH:
- OFDM orthogonal frequency-division multiplexing
- the smallest physical resource in LTE is called a resource element and consists of one OFDM subcarrier over the duration of one OFDM symbol.
- An RB consists of 12 OFDM subcarriers over a 0.5 ms slot.
- the allocation of RBs is defined over Transmission Time Intervals (TTIs) of 1 ms and therefore the minimum scheduling unit is called an RB pair which consists of two RBs. Any number of RBs, from 1 to 110, can be allocated to a UE. This represents a bandwidth between 0.18 and 19.8 MHz.
- TTIs Transmission Time Intervals
- the allocation of SR resources can further be complemented with the use of cyclic shifts and orthogonal sequences.
- Each RB pair on the PUCCH has 12 different cyclic shifts and 3 orthogonal sequences making it possible to allocate 36 SR resources on the same TTI and the same RB if all orthogonal sequences and all cyclic shifts are used. In order not to waste RBs on the PUCCH, it is desirable to make use of all SR resources.
- the scheduler of the eNodeB when using SRs on the PUCCH to request resources for the UEs, it may happen that the scheduler of the eNodeB schedules a UE even though the UE did not submit an SR in an SR resource. Thus, the scheduler falsely detects a signal in the SR resource and considers the UE associated with said SR resource to have made a scheduling request. As a consequence, resources are allocated to users which effectively has not requested such allocation.
- An object of the present invention is to solve, or at least mitigate, this problem in the art and thus to provide an improved method and scheduling node for scheduling mobile terminals.
- a method at a scheduling node in a wireless communication network of scheduling mobile terminals submitting Scheduling Requests (SRs) in SR resources comprises detecting that an SR received from a first mobile terminal in a first SR resource is indicated to interfere with at least a second SR resource, scheduling the first mobile terminal at a first scheduling occasion and awaiting scheduling of a second mobile terminal associated with the second SR resource at least until a second scheduling occasion.
- SRs Scheduling Requests
- a scheduling node in a wireless communication network configured to schedule mobile terminals submitting SR in SR resources.
- the scheduling node comprising a processing unit and a memory, which memory contains instructions executable by the processing unit, whereby the scheduling node is operative to detect that an SR received from a first mobile terminal in a first SR resource is indicated to cause interference to at least a second SR resource, schedule the first mobile terminal at a first scheduling occasion, and await scheduling of a second mobile terminal associated with the second SR resource at least until a second scheduling occasion.
- an SR of a first mobile terminal in the following referred to as a UE
- a potentially incorrect scheduling of a second UE associated with the second SR resource can be avoided.
- the SR of the first SR resource leaks into the second SR resource, it may cause a scheduling node such as an eNodeB to falsely detect occurrence of an SR in the second SR resource and hence allocate resources to the second UE, even though the second UE has not requested such allocation.
- the indication of interference may be obtained by detecting that a magnitude of the SR of the first UE exceeds a certain interference threshold, thereby making it likely that a “strong” first UE in fact causes interference to the second SR resource.
- the detection of the magnitude of the SR may e.g. be undertaken by measuring received power or and/or Signal-to-Interference-plus-Noise Ratio (SINR).
- SINR Signal-to-Interference-plus-Noise Ratio
- the indication of interference may be obtained by detecting that a magnitude of the SR of the first UE is an offset greater than a magnitude of a signal of the second SR resource.
- the scheduler at the eNodeB detects that the SR of the first UE is likely to cause interference to one or more neighbouring SR resources, such as to the SR resource associated with the second UE, at a first scheduling occasion, the eNodeB will advantageously schedule the first UE at the first scheduling occasion, and await scheduling of the second UE at least until a second scheduling occasion occurs, e.g. 10 ms later depending on SR periodicity and SR prohibit timer.
- the falsely detected SR is associated with a UE that is estimated to have a poor radio channel and/or with a UE that is currently in a Discontinuous Reception (DRX) sleep mode, since the eNodeB in such a scenario will waste even more resources.
- DRX Discontinuous Reception
- the scheduling occasions are stipulated in the communications network by a set SR periodicity (such as 5 ms, 10 ms, 20 ms, etc.) and an SR prohibit timer.
- the SR prohibit timer can assume values from 0 to 7.
- the SR prohibit timer value is given in number of SR period(s).
- a value of 0 means that no timer is configured for SR transmission on the PUCCH, while a value of 1 corresponds to one SR period, a value of 2 corresponds to two SR periods and so on.
- the UE starts this timer after transmitting an SR. When this timer is running, the UE is not supposed to be transmitting a further SR on the PUCCH.
- the scheduler determines whether the second SR resource is indicated to comprise an SR. If so, the second UE is scheduled whereas if it is not, no scheduling will be undertaken.
- false detection of an SR in the first SR resource can advantageously be avoided.
- the determining whether the second SR resource is indicated to comprise an SR is made by detecting at the scheduler whether a magnitude of a signal of the second SR resource exceeds a scheduling threshold value. Hence, if at the second scheduling occasion the magnitude of the signal, in terms of e.g. received power or SINR, exceeds the scheduling threshold value, the signal is considered to comprise an SR, and the scheduler schedules the second UE accordingly.
- the scheduler further detects at the second scheduling occasion whether the first SR resource still comprises an SR, the magnitude of which exceeds the interference threshold value. If so, the second UE may have to wait for yet another scheduling occasion, since a potentially detected SR in the second SR resource may be false due to the interference still caused by the first UE. If not, i.e. if the first SR resource is silent, it is likely that the detected SR in the second SR resource in fact is an SR submitted by the second UE, and not a result of interference, and the second UE will thus be scheduled accordingly at the second scheduling occasion.
- the interference threshold advantageously may comprise an upper and a lower threshold value.
- the first SR is considered to cause interference while if it is to be detected that the first UE currently is silent on the PUCCH (and thus that the first UE has been scheduled), the magnitude of any signal detected in the first SR resource should be below the lower threshold value.
- the scheduler further detects at the second scheduling occasion whether a third SR associated with a third UE is indicated to cause interference to the second SR resource.
- a third SR associated with a third UE is indicated to cause interference to the second SR resource.
- the second UE in case the second SR resource is subject to interference at repeated scheduling occasions, the second UE is scheduled anyway after a predetermined number of scheduling occasions has passed, if it is determined that the second SR resource indeed comprises an SR. This is to avoid that any one or more neighbouring UEs which repeatedly request allocation will prevent the second UE from being scheduled.
- the interference threshold value and/or the scheduling threshold value may be adjusted, even dynamically in an on-the-fly manner, depending on a current radio environment and requirements of e.g. an operator of the wireless communication network.
- it is desirable to avoid detection of “false” SRs implying that it may be necessary to adjust, i.e. raise, the scheduling threshold in order to avoid such false SRs.
- the second UE indeed submits an SR in its associated SR resource at a first scheduling occasion, it will have the resubmit the SR at least at the next scheduling occasion (and potentially at another subsequent scheduling occasion) in case it is detected that the first UE (and potentially the third UE) causes interference to the second SR resource.
- this may avoid the allocation of resources to UEs which effectively have not requested such allocation.
- FIG. 1 illustrates the concept of resource blocks used in LTE
- FIG. 2 a illustrates a communications network in which the present invention may be implemented
- FIG. 2 b - e illustrates various implementations of a scheduler according to embodiments of the present invention
- FIG. 3 illustrates PUCCH transmission using RB pair
- FIG. 4 illustrates modulation and physical channel mapping for various PUCCH formats
- FIG. 5 illustrates UE SR submission without SR resource interference
- FIG. 6 a illustrates a scenario where a first UE is indicated to cause interference to an SR resource of a second UE at a first scheduling occasion
- FIG. 6 b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to an embodiment of the present invention
- FIG. 7 a illustrates a scenario at a next second scheduling occasion, where no interference is caused
- FIG. 7 b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to another embodiment of the present invention
- FIG. 8 illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to yet another embodiment of the present invention
- FIG. 9 a illustrates yet a scenario at the next second scheduling occasion, where a third UE is indicated to cause interference to an SR resource of the second UE;
- FIG. 9 b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to still another embodiment of the present invention.
- FIG. 10 illustrates a scheduling node according to an embodiment of the present invention.
- FIG. 1 illustrates the concept of resource blocks used in LTE as previously has been described.
- FIG. 2 a illustrates a basic communication network 10 in which the present application can be implemented.
- FIG. 2 a is an illustration only to describe a basic idea of the present invention, and that a communications network in practice typically comprises many different network elements and nodes.
- a base station 11 referred to as eNodeB 1
- eNodeB 1 of a first cell 12 schedules of resources of mobile terminals 13 , 14 , 15 , referred to as UE 1 , UE 2 and UE 3 , respectively, in the first cell 12 .
- eNodeB 1 of the first cell 12 will schedule a large number of mobile terminals and typically comprises a physical or virtual unit known as a scheduler for performing the scheduling.
- eNodeB 1 allocates one or more resource blocks at a scheduling time intervals—or scheduling occasions—to the UEs in the first cell 12 . Further, scheduling information, in the form of which resource blocks to be allocated, may be sent by eNodeB 1 of the first cell 12 over the X2 communication interface to a base station 19 of a second neighbouring cell 20 , referred to as eNodeB 2 .
- the neighbouring base station eNodeB 2 will in its turn schedule resources for the mobile terminals 21 , 22 , 23 , referred to as UE 4 , UE 5 and UE 6 , respectively (in practice a large number of UEs) of the neighboring cell 20 , possibly taking into account the scheduled allocations of eNodeB 1 of the first cell 12 . Further, as any one or more of UE 4 , UE 5 and UE 6 moves towards the first cell 12 , they may be handed over to the eNodeB 1 , in which case eNodeB 1 will take over the scheduling of UE 4 , UE 5 and/or UE 6 .
- the method of scheduling mobile terminals according to embodiments of the present invention at a scheduling node is typically performed by a processing unit 16 embodied in the form of one or more microprocessors arranged to execute a computer program 18 downloaded to a suitable storage medium 17 associated with the microprocessor, such as a Random Access Memory (RAM), a Flash memory or a hard disk drive.
- a processing unit 16 embodied in the form of one or more microprocessors arranged to execute a computer program 18 downloaded to a suitable storage medium 17 associated with the microprocessor, such as a Random Access Memory (RAM), a Flash memory or a hard disk drive.
- the processing unit 16 is arranged to carry out the method according to embodiments of the present invention when the appropriate computer program 18 comprising computer-executable instructions is downloaded to the storage medium 17 and executed by the processing unit 16 .
- the storage medium 17 may also be a computer program product comprising the computer program 18 .
- the computer program 18 may be transferred to the storage medium 17 by means of a suitable computer program product, such as a Digital Versatile Disc (DVD) or a memory stick.
- DVD Digital Versatile Disc
- the computer program 18 may be downloaded to the storage medium 17 over a network.
- the processing unit 16 may alternatively be embodied in the form of a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), a complex programmable logic device (CPLD), etc. Further, even though not shown in FIG. 2 a , the second base station 19 typically comprises a corresponding processing unit and memory unit comprising a computer program executable by the processing unit.
- DSP digital signal processor
- ASIC application specific integrated circuit
- FPGA field-programmable gate array
- CPLD complex programmable logic device
- the scheduling node could be performed by any other appropriate node, and not necessarily a Radio Access Network (RAN) node, such as an eNodeB, but for example an Evolved Packet Core (EPC) network node such as a Serving Gateway (SGW), a Mobility Management Entity (MME), a Packet Data Network Gateway (PGW), etc.
- RAN Radio Access Network
- EPC Evolved Packet Core
- SGW Serving Gateway
- MME Mobility Management Entity
- PGW Packet Data Network Gateway
- the functionality of the scheduling node according to embodiments of the present invention may even be distributed among a plurality of different nodes.
- the eNodeB 11 comprises a scheduler 24 which typically is embodied by the processing unit 16 of FIG. 2 a.
- FIG. 2 b illustrates the scheduler 24 as a physical unit in the eNodeB 11
- FIG. 2 c illustrates the scheduler 24 as a physical unit separate from the eNodeB 11
- FIG. 2 d illustrates the scheduler 24 as a virtual unit in the eNodeB 11
- FIG. 2 e illustrates the scheduler 24 as a virtual unit in a data center 25 .
- the Physical Uplink Control Channel is used in LTE in order to provide send control information in uplink from a UE to a base station (i.e. an eNodeB).
- the control information may consist of Scheduling Request (SR), Channel State Information (CSI) or Hybrid Automatic Repeat Request Acknowledgement (HARQ-ACK) feedback for downlink transmissions.
- SR Scheduling Request
- CSI Channel State Information
- HARQ-ACK Hybrid Automatic Repeat Request Acknowledgement
- the PUCCH is transmitted on a Resource Block (RB) pair that is allocated on the band edge.
- PUCCH format 2 is allocated in the first RB pairs, followed by PUCCH format 1/1a/1b.
- FIG. 4 illustrates modulation and physical channel mapping for PUCCH format 1/1a/1b.
- 4 symbols are used for data and 3 symbols for the reference signal. This is valid for normal cyclic prefix and when no Sounding Reference Signal (SRS) is present.
- the data symbol is multiplied with a length-12 reference signal sequence, scrambled depending on resource index, and spread with an orthogonal cover sequence.
- SRS Sounding Reference Signal
- multiple users that transmit PUCCH format 1/1a/1b are multiplexed on the same RB pair.
- the multiplexing uses Code Division Multiple Access (CDMA) by assigning different cyclic shifts and orthogonal cover sequences to the users.
- CDMA Code Division Multiple Access
- the cyclic shift affects the reference signal sequence which will introduce a time shift in the transmitted signal.
- the transmitted signals for the users that are multiplexed in an RB pair are orthogonal to each other.
- the received signal in an RB pair for PUCCH format 1/1a/1b is processed in order to separate the signals from the users that are multiplexed.
- the signals are truly orthogonal to each other in the eNodeB only under ideal conditions. These ideal conditions include perfect time alignment when received in the eNodeB, including no delay spread in the radio channel, no frequency error between the UE and eNodeB and no Doppler shift or Doppler spread. In practice, the conditions are typically not ideal, so the signals from the users are not perfectly orthogonal.
- FIG. 5 illustrates the received signals of four UEs at an eNodeB at SR resource indices 1 , 5 , 8 and 10 after matched filtering with the reference signal sequence and transforming the filtered result to time domain.
- the four UEs are assigned different cyclic shifts and can be separated from the time domain signal. Note that FIG. 5 illustrates ideal conditions when there is no leakage between the UEs, i.e. an SR in an SR resource associated with any one of the UEs does not cause interference to an SR resource of any one of the other UEs.
- Another type of leakage occurs it two UEs have the same cyclic shift and different orthogonal cover code. In that case, if there is a frequency error between a UE and the eNodeB or Doppler spread or Doppler shift in the channel, the UEs will not be orthogonal when de-spreading with the orthogonal cover code. Consequently, an SR of an SR resource associated with any one of the UEs may leak into, and thus cause interference to, an SR resource of any one of the other UEs.
- FIG. 6 a illustrates a situation where a first UE, UE 1 , is indicated to cause interference to an SR resource of a second UE, UE 2 . That is, UE 1 transmits a strong SR in its associated SR resource, which strong SR may cause interference to neighboring SR resources, such as the SR resource of UE 2 . It should be noted that UE 1 with SR resource index 4 not necessarily must be located directly adjacent, in terms of neighboring resource index, to UE 2 with SR resource index 3 for causing interference, but may very well cause interference to a potentially third UE (not shown) with SR resource index 2 .
- FIG. 6 b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to an embodiment of the present invention. Reference is further made to FIG. 6 a illustrating a “strong” UE 1 neighbouring a “weak” UE 2 .
- a scheduler at eNodeB 1 detects that the SR received from UE 1 in the first SR resource at SR resource index 4 is indicated to interfere with a second SR resource at index 3 with which UE 2 is associated.
- the indication of UE 1 causing interference is obtained by detecting that a magnitude of the SR of UE 1 exceeds a certain interference threshold T INT in terms of e.g. SINR.
- the indication may be obtained by detecting that a magnitude of the SR of UE 1 is an offset T OFF greater than a magnitude of a signal of UE 2 .
- the indication of interference may be obtained by detecting whether cyclic shift of two SR resources in a same RB pair are susceptible to timing error.
- eNodeB 1 detects that a cyclic shift of the SR of the first SR resource associated with UE 1 , which is located in the same RB pair as the second SR resource associated with UE 2 , is susceptible to timing error and thus causes interference to the second SR resource.
- the indication of interference may be obtained by detecting whether the orthogonal codes of two SR resources in a same RB pair are susceptible to frequency error.
- eNodeB 1 detects that an orthogonal code of the SR of the first SR resource associated with UE 1 , which is located in the same RB pair as the second SR resource associated with UE 2 , is susceptible to frequency error and thus causes interference to the second SR resource.
- the determination whether UE 1 causes interference or not is performed by detecting that a magnitude of the SR of UE 1 exceeds a certain interference threshold T INT .
- step S 102 UE 1 is scheduled at a first scheduling occasion, since the SR resource associated with UE 1 comprises an SR.
- the scheduler of eNodeB 1 will in step S 103 await scheduling of UE 2 at least until a next second scheduling occasion.
- the scheduling occasions are stipulated in the communications network by a set SR periodicity (such as 5 ms, 10 ms, 20 ms, etc.) and an SR prohibit timer.
- the SR prohibit timer can assume values from 0 to 7.
- the SR prohibit timer value is given in number of SR period(s).
- a value of 0 means that no timer is configured for SR transmission on the PUCCH, while a value of 1 corresponds to one SR period, a value of 2 corresponds to two SR periods and so on.
- the UE starts this timer after transmitting an SR. When this timer is running, the UE is not supposed to be transmitting a further SR on the PUCCH.
- FIG. 7 a illustrates a scenario at the next second scheduling occasion, where UE 1 indeed was scheduled at the preceding first scheduling occasion of FIG. 6 a (and no longer submits an SR requesting scheduling). In an exemplifying embodiment, this could be determined by concluding whether a signal of the SR resource of UE 1 is below the interference threshold value T INT .
- FIG. 7 b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to a further embodiment of the present invention.
- the determining whether the second SR resource is indicated to comprise an SR in step S 104 is made by detecting at the scheduler whether a magnitude of a signal of the second SR resource exceeds a scheduling threshold value T SCH .
- the magnitude of the signal in terms of e.g. SINR
- T SCH scheduling threshold value
- the signal is considered to comprise an SR, and the scheduler schedules UE 2 accordingly.
- the SINR of the SR resource of UE 2 exceeds T SCH , and the scheduler thus schedules UE 2 in step S 105 at the second scheduling occasion.
- FIG. 8 illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to still a further embodiment of the present invention.
- the interference scenario is that shown in FIG. 6 a .
- the scheduler after having performed steps S 101 , S 102 and S 103 as previously described, the scheduler further detects at the second scheduling occasion whether the first SR resource still comprises an SR in step S 104 a . If UE 1 has still not been scheduled, or requests further resources, it is determined whether the SINR (in this example), exceeds the interference threshold value T INT .
- step S 104 b await scheduling of UE 2 for yet another scheduling occasion, since a potentially detected SR in the second SR resource may be false due to the interference still caused by UE 1 . If not, the scheduler proceeds to steps S 104 and S 105 as previously described with reference to FIG. 7 a.
- the second SR resource associated with UE 2 is subject to interference at repeated scheduling occasions, i.e. UE 1 continues to submit SRs in the first SR resource at the second, third, fourth occasion and so on, UE 2 is scheduled anyway after a predetermined number of scheduling occasions has passed, if it is determined that the second SR resource indeed comprises an SR. This is to avoid that any one or more neighbouring UEs which repeatedly request allocation will prevent the UE 2 from being scheduled.
- FIG. 9 a illustrates yet a scenario at the next second scheduling occasion, where UE 1 indeed was scheduled at the preceding first scheduling occasion of FIG. 6 a (and no longer submits an SR requesting scheduling).
- a third UE, UE 3 is now indicated to cause interference to the SR resource of UE 2 .
- this could be determined by concluding whether a signal of the SR resource of UE 3 exceeds the interference threshold value T INT .
- FIG. 9 b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to yet a further embodiment of the present invention.
- UE 1 has been scheduled, and the scheduler further detects at step S 104 c at the second scheduling occasion whether a third SR associated with UE 3 is indicated to cause interference to the second SR resource associated with UE 1 . Since such indication is detected in that the SINR of UE 3 exceeds T INT , eNodeB 1 awaits scheduling of UE 2 in step S 104 d until a subsequent third scheduling occasion. The base station eNodeB 1 then proceeds, at the third scheduling occasion, to steps S 104 and S 105 as previously described.
- any false detection of an SR in the second SR resource, this time caused by UE 3 may again advantageously be avoided by awaiting scheduling of UE 2 at least until the third scheduling occasion.
- FIG. 10 shows a scheduling node 11 according to an embodiment of the present invention.
- the scheduling node 11 comprises detecting means 110 adapted to detect that an SR received from a first mobile terminal in a first SR resource is indicated to cause interference to at least a second SR resource, scheduling means 111 adapted to schedule the first mobile terminal at a first scheduling occasion, and waiting means 112 adapted to await scheduling of a second mobile terminal associated with the second SR resource at least until a second scheduling occasion.
- the detecting means 110 and/or the scheduling means 111 may comprise a communications interface for receiving and providing information to other devices.
- the scheduling node 11 may further comprise a local storage for storing obtained data.
- the detecting means 110 , scheduling means 111 and waiting means 112 may (in analogy with the description given in connection to FIG. 2 a ) be implemented by a processing unit embodied in the form of one or more microprocessors arranged to execute a computer program downloaded to a suitable storage medium associated with the microprocessor, such as a RAM, a Flash memory or a hard disk drive.
- the detecting means no and scheduling means 111 may comprise one or more transmitters and/or receivers and/or transceivers, comprising analogue and digital components and a suitable number of antennae for radio communication.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
-
- 1. In time domain: allocating different UEs to different Transmission Time Intervals (TTIs),
- 2. In frequency domain: use different Resource Blocks (RBs) for different UEs,
- 3. Different cyclic shifts: users can use the same RBs and the same TTI but be separated in cyclic shifts, and
- 4. Different orthogonal sequences: users with the same RB, same TTI, and same cyclic shift can use different orthogonal sequences to be separated from each other.
Claims (18)
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/SE2014/051424 WO2016085377A1 (en) | 2014-11-28 | 2014-11-28 | False scheduling request prevention |
Publications (2)
Publication Number | Publication Date |
---|---|
US20170339708A1 US20170339708A1 (en) | 2017-11-23 |
US10660116B2 true US10660116B2 (en) | 2020-05-19 |
Family
ID=56074763
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/526,491 Active 2035-03-23 US10660116B2 (en) | 2014-11-28 | 2014-11-28 | False scheduling request prevention |
Country Status (3)
Country | Link |
---|---|
US (1) | US10660116B2 (en) |
EP (1) | EP3225068B1 (en) |
WO (1) | WO2016085377A1 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10749813B1 (en) * | 2016-03-24 | 2020-08-18 | EMC IP Holding Company LLC | Spatial-temporal cloud resource scheduling |
US10333664B1 (en) * | 2016-09-19 | 2019-06-25 | Sprint Spectrum L.P. | Systems and methods for dynamically selecting wireless devices for uplink (UL) multiple-input-multiple-output (MIMO) pairing |
KR20200099070A (en) * | 2017-12-28 | 2020-08-21 | 광동 오포 모바일 텔레커뮤니케이션즈 코포레이션 리미티드 | Method for uplink data transmission, terminal device and network device |
CN113677031B (en) * | 2020-05-13 | 2024-02-27 | 中国移动通信集团重庆有限公司 | Terminal uplink resource scheduling method and device, computing equipment and computer storage medium |
WO2022027650A1 (en) * | 2020-08-07 | 2022-02-10 | 华为技术有限公司 | Communication method, apparatus and system |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2009105003A1 (en) | 2008-02-21 | 2009-08-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Adjustment of radio detection level for request signals based observed false detection |
US20100142467A1 (en) * | 2008-12-05 | 2010-06-10 | Nokia Siemens Networks Oy | Resource Allocation Technique For Physical Uplink Control Channel Blanking |
US20110128872A1 (en) * | 2007-12-28 | 2011-06-02 | Bengt Lindoff | Identifying A Sequence Of Received Signals |
US20120100864A1 (en) * | 2009-06-29 | 2012-04-26 | Telefonaktiebolaget L M Ericsson (Publ) | Method and Arrangement in a Wireless Communication System |
WO2013028113A1 (en) | 2011-08-22 | 2013-02-28 | Telefonaktiebolaget L M Ericsson (Publ) | Collision resolution for pucch scheduling requests |
WO2013054850A1 (en) | 2011-10-14 | 2013-04-18 | 株式会社エヌ・ティ・ティ・ドコモ | Base station and communication control method |
WO2013091137A1 (en) | 2011-12-21 | 2013-06-27 | Telefonaktiebolaget L M Ericsson (Publ) | Method, network node, computer program and computer program product for decoding a signal |
-
2014
- 2014-11-28 US US15/526,491 patent/US10660116B2/en active Active
- 2014-11-28 WO PCT/SE2014/051424 patent/WO2016085377A1/en active Application Filing
- 2014-11-28 EP EP14906866.0A patent/EP3225068B1/en active Active
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110128872A1 (en) * | 2007-12-28 | 2011-06-02 | Bengt Lindoff | Identifying A Sequence Of Received Signals |
WO2009105003A1 (en) | 2008-02-21 | 2009-08-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Adjustment of radio detection level for request signals based observed false detection |
US20110110240A1 (en) * | 2008-02-21 | 2011-05-12 | Gunnar Bergquist | Adjustment of radio detection level for request signals based observed false detection |
US20100142467A1 (en) * | 2008-12-05 | 2010-06-10 | Nokia Siemens Networks Oy | Resource Allocation Technique For Physical Uplink Control Channel Blanking |
US20120100864A1 (en) * | 2009-06-29 | 2012-04-26 | Telefonaktiebolaget L M Ericsson (Publ) | Method and Arrangement in a Wireless Communication System |
WO2013028113A1 (en) | 2011-08-22 | 2013-02-28 | Telefonaktiebolaget L M Ericsson (Publ) | Collision resolution for pucch scheduling requests |
WO2013054850A1 (en) | 2011-10-14 | 2013-04-18 | 株式会社エヌ・ティ・ティ・ドコモ | Base station and communication control method |
WO2013091137A1 (en) | 2011-12-21 | 2013-06-27 | Telefonaktiebolaget L M Ericsson (Publ) | Method, network node, computer program and computer program product for decoding a signal |
Non-Patent Citations (4)
Title |
---|
Ericsson, "Scheduling Request in E-UTRAN," 3GPP TSG-RAN WG2 #56bis, R2-070056, Jan. 15-19, 2007, Sorrento, IT. |
International Search Report and Written Opinion dated Sep. 11, 2015 in related International Application No. PCT/SE2014/051424. |
SESR-EP 14906866.0-dated May 22, 2018-pp. 7. |
SESR—EP 14906866.0—dated May 22, 2018—pp. 7. |
Also Published As
Publication number | Publication date |
---|---|
EP3225068A4 (en) | 2018-07-04 |
EP3225068B1 (en) | 2019-09-04 |
US20170339708A1 (en) | 2017-11-23 |
EP3225068A1 (en) | 2017-10-04 |
WO2016085377A1 (en) | 2016-06-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11558893B2 (en) | Low latency physical uplink control channel with scheduling request and channel state information | |
EP3651522B1 (en) | Method of handling communication in unlicensed spectrum and related communication device | |
KR101958320B1 (en) | Techniques for transmitting on multiple carriers of a shared radio frequency spectrum band | |
US9894654B2 (en) | Defining sub-subchannels for data communication using separately provided frequency and time resources and related wireless terminals and network nodes | |
US10701564B2 (en) | Signal retransmission apparatus and method and communication system | |
AU2015316199B2 (en) | Radio access node, communication terminal and methods performed therein | |
EP3468269B1 (en) | Uplink control channel transmission and reception method and apparatus | |
US20170079065A1 (en) | Downlink control information sending method and device, and downlink control information receiving method and device | |
EP3457797A1 (en) | Base station device, terminal device, and communication method therefor | |
US10863449B2 (en) | Uplink channel sending method and apparatus | |
EA027151B1 (en) | Terminal apparatus, base station apparatus, radio communication method and processor | |
US11026184B2 (en) | Terminal apparatus, base station apparatus, and communication method for transmitting resource information and transmission power control information to the terminal device with a grant-free access resource allocation or a scheduled access resource allocation | |
US10660116B2 (en) | False scheduling request prevention | |
US20160242039A1 (en) | Methods, Computer Programs, Network Nodes and Communication Device | |
WO2019099388A1 (en) | User equipments, base stations and methods | |
WO2021230193A1 (en) | User equipments, base stations and methods for priority rules of channel state information reports | |
JP2011097544A (en) | Mobile communication method, mobile station and radio base station | |
WO2021065692A1 (en) | User equipments, base stations and methods for cancellation of uplink signal(s) |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL), SWEDEN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HUSS, FREDRIK;PELYHE, DANIEL;RASK, PATRIK;SIGNING DATES FROM 20150112 TO 20150202;REEL/FRAME:042372/0712 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: ADVISORY ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |