WO2016085377A1 - Prévention de fausse demande de programmation - Google Patents

Prévention de fausse demande de programmation Download PDF

Info

Publication number
WO2016085377A1
WO2016085377A1 PCT/SE2014/051424 SE2014051424W WO2016085377A1 WO 2016085377 A1 WO2016085377 A1 WO 2016085377A1 SE 2014051424 W SE2014051424 W SE 2014051424W WO 2016085377 A1 WO2016085377 A1 WO 2016085377A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource
scheduling
indicated
occasion
detecting
Prior art date
Application number
PCT/SE2014/051424
Other languages
English (en)
Inventor
Patrik Rask
Fredrik Huss
Dániel PELYHE
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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 Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to US15/526,491 priority Critical patent/US10660116B2/en
Priority to PCT/SE2014/051424 priority patent/WO2016085377A1/fr
Priority to EP14906866.0A priority patent/EP3225068B1/fr
Publication of WO2016085377A1 publication Critical patent/WO2016085377A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • 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
    • 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:
  • TTIs Transmission Time Intervals
  • LTE Long-Term Evolution
  • orthogonal frequency-division multiplexing (OFDM) modulation is employed, and the scheduler of the eNodeB dynamically assigns OFDM resource blocks to UEs for uplink or downlink transmission.
  • 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.
  • 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.
  • This object is attained in a first aspect of the present invention by a method at a scheduling node in a wireless communication network of scheduling mobile terminals submitting Scheduling Requests (SRs) in SR resources.
  • the method 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.
  • 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
  • SR Signal-to-Interference-plus-Noise Ratio
  • the indication of interference maybe 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. If 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.
  • PDCCH Physical Downlink Control Channel
  • 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 o to 7.
  • the SR prohibit timer value is given in number of SR period(s).
  • a value of o 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.
  • the second UE after having waited at least until the second scheduling occasion, it is determined whether the second UE is indicated to in fact have requested scheduling by submitting an SR in the second SR resource, i.e. that the SR is not likely to be a result of interference from the first SR.
  • 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.
  • the first UE no longer causes interference to the second SR resource
  • another neighbouring third UE may cause interference in the same way the first UE did at the previous first scheduling occasion.
  • any false detection of an SR in the second SR resource, this time caused by the third UE may again be avoided by awaiting scheduling of the second UE at least until a third scheduling occasion.
  • 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. As has been described, 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. On the other hand, in the event of poor channel quality, it may be necessary to lower the detection threshold to be able to detect a correctly submitted SR in an SR resource.
  • 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.
  • Figure l illustrates the concept of resource blocks used in LTE
  • Figure 2a illustrates a communications network in which the present invention may be implemented
  • Figure 2b-e illustrates various implementations of a scheduler according to embodiments of the present invention
  • Figure 3 illustrates PUCCH transmission using RB pair
  • Figure 4 illustrates modulation and physical channel mapping for various PUCCH formats
  • Figure 5 illustrates UE SR submission without SR resource interference
  • Figure 6a 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
  • Figure 6b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to an embodiment of the present invention
  • Figure 7a illustrates a scenario at a next second scheduling occasion, where no interference is caused
  • Figure 7b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to another embodiment of the present invention
  • Figure 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
  • Figure 9a 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;
  • Figure 9b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to still another embodiment of the present invention.
  • Figure 10 illustrates a scheduling node according to an embodiment of the present invention.
  • Figure 1 illustrates the concept of resource blocks used in LTE as previously has been described.
  • Figure 2a illustrates a basic communication network 10 in which the present application can be implemented. It should be noted that Figure 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 eNodeBi, of a first cell 12 schedules of resources of mobile terminals 13, 14, 15, referred to as UEi, UE2 and UE3, respectively, in the first cell 12.
  • eNodeBi 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.
  • eNodeBi allocates one or more resource blocks at a scheduling time intervals - or scheduling occasions - to the UEs in the first cell 12.
  • scheduling information in the form of which resource blocks to be allocated, may be sent by eNodeBi of the first cell 12 over the X2 communication interface to a base station 19 of a second neighbouring cell 20, referred to as eNodeB2.
  • the neighbouring base station eNodeB2 will in its turn schedule resources for the mobile terminals 21, 22, 23, referred to as UE4, UE5 and UE6, respectively (in practice a large number of UEs) of the neighboring cell 20, possibly taking into account the scheduled allocations of eNodeBi of the first cell 12.
  • any one or more of UE4, UE5 and UE6 moves towards the first cell 12, they may be handed over to the eNodeBi, in which case eNodeBi will take over the scheduling of UE4, UE5 and/ or UE6.
  • the method of scheduling mobile terminals according to embodiments of the present invention at a scheduling node is typically performed by a scheduling node, such as at the base stations 11, 19, is typically performed by a scheduling node, such as at the base stations 11, 19, is typically performed by a scheduling node, such as at the base stations 11, 19, is typically performed by a scheduling node, such as at the base stations 11, 19, is typically performed by a scheduling node, such as at the base stations 11, 19, 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.
  • RAM Random Access Memory
  • Flash memory Flash memory
  • the processing unit 16 and the storage medium 17 are included in the first base station 11.
  • 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.
  • a suitable computer program product such as a Digital Versatile Disc (DVD) or a memory stick.
  • 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.
  • the second base station 19 typically comprises a corresponding processing unit and memory unit comprising a computer program executable by the processing unit.
  • 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
  • RAN Radio Access Network
  • EPC Evolved Packet Core
  • SGW Serving Gateway
  • MME Mobility Management Entity
  • Packet Data Packet Data
  • PGW Network Gateway
  • the eNodeB 11 comprises a scheduler 24 which typically is embodied by the processing unit 16 of Figure 2a.
  • Figure 2b illustrates the scheduler 24 as a physical unit in the eNodeB 11
  • Figure 2c illustrates the scheduler 24 as a physical unit separate from the eNodeB 11
  • Figure 2d illustrates the scheduler 24 as a virtual unit in the eNodeB 11
  • Figure 2e 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 l/ia/ib.
  • Figure 4 illustrates modulation and physical channel mapping for PUCCH format ⁇ /ia/ib. In each slot, 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 ⁇ /ia/ib 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/ la/ lb is processed in order to separate the signals from the users that are
  • 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.
  • Figure 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 Figure 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.
  • PUCCH Physical Uplink Control Channel
  • Figure 6a illustrates a situation where a first UE, UEi, is indicated to cause interference to an SR resource of a second UE, UE2. That is, UEi 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 UE2. It should be noted that UEi with SR resource index 4 not necessarily must be located directly adjacent, in terms of neighboring resource index, to UE2 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.
  • Figure 6b 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 Figure 6a illustrating a "strong" UEi neighbouring a “weak” UE2.
  • a scheduler at eNodeBi detects that the SR received from UEi in the first SR resource at SR resource index 4 is indicated to interfere with a second SR resource at index 3 with which UE2 is associated.
  • the indication of UEi causing interference is obtained by detecting that a magnitude of the SR of UEi exceeds a certain interference threshold TINT in terms of e.g. SINR.
  • the indication may be obtained by detecting that a magnitude of the SR of UEi is an offset TOFF greater than a magnitude of a signal of UE2.
  • 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.
  • eNodeBi detects that a cyclic shift of the SR of the first SR resource associated with UEi, which is located in the same RB pair as the second SR resource associated with UE2, is susceptible to timing error and thus causes
  • 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.
  • eNodeBi detects that an orthogonal code of the SR of the first SR resource associated with UEi, which is located in the same RB pair as the second SR resource associated with UE2, is susceptible to frequency error and thus causes interference to the second SR resource.
  • the determination whether UEi causes interference or not is performed by detecting that a magnitude of the SR of UEi exceeds a certain interference threshold TINT.
  • step S102 UEi is scheduled at a first scheduling occasion, since the SR resource associated with UEi comprises an SR.
  • the scheduler of eNodeBi will in step S103 await scheduling of UE2 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 o to 7.
  • the SR prohibit timer value is given in number of SR period(s).
  • a value of o means that no timer is configured for SR
  • FIG. 7a illustrates a scenario at the next second scheduling occasion, where UEi indeed was scheduled at the preceding first scheduling occasion of Figure 6a (and no longer submits an SR requesting scheduling). In an exemplifying embodiment, this could be determined by concluding whether a l6 signal of the SR resource of UEi is below the interference threshold value TINT.
  • FIG. 7b illustrates a flowchart of the method of scheduling mobile terminals submitting SRs in SR resources according to a further embodiment of the present invention.
  • eNodeBi now determines in step S104 whether the second SR resource, i.e. the resource associated with UE2, is indicated to comprise an SR. If so, UE2 is scheduled at this second scheduling occasion instep S105. If not, any signal in the SR resource of UE2 at the first scheduling occasion was most likely caused by interference from UEi.
  • the determining whether the second SR resource is indicated to comprise an SR in step S104 is made by detecting at the scheduler whether a magnitude of a signal of the second SR resource exceeds a scheduling threshold value TSCH.
  • the magnitude of the signal in terms of e.g. SINR, exceeds the scheduling threshold value TSCH, the signal is considered to comprise an SR, and the scheduler schedules UE2 accordingly.
  • the SINR of the SR resource of UE2 exceeds TSCH, and the scheduler thus schedules UE2 in step S105 at the second scheduling occasion.
  • Figure 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 Figure 6a.
  • the scheduler after having performed steps S101, S102 and S103 as previously described, the scheduler further detects at the second scheduling occasion whether the first SR resource still comprises an SR in step Si04a. If UEi has still not been scheduled, or requests further resources, it is determined whether the SINR (in this example), exceeds the interference threshold value TINT.
  • SINR in this example
  • step Si04b await scheduling of UE2 for yet another scheduling occasion, since a potentially detected SR in the second SR resource maybe false due to the interference still caused by UEi. If not, the scheduler proceeds to steps S104 and S105 as previously described with reference to Figure 7a.
  • the second SR resource associated with UE2 is subject to interference at repeated scheduling occasions, i.e. UEi continues to submit SRs in the first SR resource at the second, third, fourth occasion and so on
  • UE2 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 UE2 from being scheduled.
  • Figure 9a illustrates yet a scenario at the next second scheduling occasion, where UEi indeed was scheduled at the preceding first scheduling occasion of Figure 6a (and no longer submits an SR requesting scheduling).
  • a third UE, UE3 is now indicated to cause interference to the SR resource of UE2.
  • this could be determined by concluding whether a signal of the SR resource of UE3 exceeds the interference threshold value TINT.
  • Figure 9b 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.
  • step S104 the scheduler further detects at the second scheduling occasion whether the first SR resource still comprises an SR in step Si04a, as previously have been described with reference to Figure 8.
  • UE 1 has been scheduled, and the scheduler l8 further detects at step S104C at the second scheduling occasion whether a third SR associated with UE3 is indicated to cause interference to the second SR resource associated with UEi.
  • eNodeBi awaits scheduling of UE2 in step Si04d until a subsequent third scheduling occasion.
  • the base station eNodeBi then proceeds, at the third scheduling occasion, to steps S104 and S105 as previously described.
  • any false detection of an SR in the second SR resource, this time caused by UE3, may again advantageously be avoided by awaiting scheduling of UE2 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 schedulng 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 Figure 2a) be
  • the detecting means 110 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

L'invention concerne un nœud de programmation et un procédé de programmation de terminaux mobiles soumettant des demandes de programmation (SR) dans des ressources SR au nœud de programmation d'un réseau de communication sans fil. L'invention concerne également un programme informatique exécutant le procédé selon la présente invention, et un produit programme d'ordinateur comprenant un support lisible par ordinateur sur lequel le programme informatique est enregistré. L'invention concerne d'autre part un procédé de programmation de terminaux mobiles (13, 14, 15) soumettant des demandes de programmation (SR) dans des ressources SR à un nœud de programmation (11) d'un réseau de communication sans fil. Le procédé consiste à : détecter (S101) qu'une SR reçue d'un premier terminal mobile (13) dans une première ressource SR est déterminée comme interférant avec au moins une seconde ressource SR ; programmer (S102) le premier terminal mobile (13) à une première opportunité de programmation et attendre (S103) la programmation d'un second terminal mobile (14) associé à la seconde ressource SR au moins jusqu'à une seconde opportunité de programmation.
PCT/SE2014/051424 2014-11-28 2014-11-28 Prévention de fausse demande de programmation WO2016085377A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US15/526,491 US10660116B2 (en) 2014-11-28 2014-11-28 False scheduling request prevention
PCT/SE2014/051424 WO2016085377A1 (fr) 2014-11-28 2014-11-28 Prévention de fausse demande de programmation
EP14906866.0A EP3225068B1 (fr) 2014-11-28 2014-11-28 Prévention de fausse demande de programmation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/SE2014/051424 WO2016085377A1 (fr) 2014-11-28 2014-11-28 Prévention de fausse demande de programmation

Publications (1)

Publication Number Publication Date
WO2016085377A1 true WO2016085377A1 (fr) 2016-06-02

Family

ID=56074763

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2014/051424 WO2016085377A1 (fr) 2014-11-28 2014-11-28 Prévention de fausse demande de programmation

Country Status (3)

Country Link
US (1) US10660116B2 (fr)
EP (1) EP3225068B1 (fr)
WO (1) WO2016085377A1 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
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
CN113677031B (zh) * 2020-05-13 2024-02-27 中国移动通信集团重庆有限公司 终端上行资源调度方法、装置、计算设备及计算机存储介质
WO2022027650A1 (fr) * 2020-08-07 2022-02-10 华为技术有限公司 Procédé, appareil et système de communication

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009105003A1 (fr) * 2008-02-21 2009-08-27 Telefonaktiebolaget Lm Ericsson (Publ) Ajustement de niveau de détection radio pour des signaux de demande sur la base d’une fausse détection observée
WO2013091137A1 (fr) * 2011-12-21 2013-06-27 Telefonaktiebolaget L M Ericsson (Publ) Procédé, nœud de réseau, programme d'ordinateur et produit programme d'ordinateur pour le décodage d'un signal

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2075973B1 (fr) * 2007-12-28 2018-08-15 Telefonaktiebolaget LM Ericsson (publ) Identification d'une séquence de symboles de référence reçus
US8483149B2 (en) * 2008-12-05 2013-07-09 Nokia Siemens Networks Oy Resource allocation technique for physical uplink control channel blanking
RU2523189C2 (ru) * 2009-06-29 2014-07-20 Телефонактиеболагет Лм Эрикссон (Пабл) Способ и устройство в системе беспроводной связи
US9532373B2 (en) 2011-08-22 2016-12-27 Telefonaktiebolaget Lm Ericsson (Publ) Collision resolution for PUCCH scheduling requests
JP5792580B2 (ja) * 2011-10-14 2015-10-14 株式会社Ｎｔｔドコモ 基地局及び通信制御方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009105003A1 (fr) * 2008-02-21 2009-08-27 Telefonaktiebolaget Lm Ericsson (Publ) Ajustement de niveau de détection radio pour des signaux de demande sur la base d’une fausse détection observée
WO2013091137A1 (fr) * 2011-12-21 2013-06-27 Telefonaktiebolaget L M Ericsson (Publ) Procédé, nœud de réseau, programme d'ordinateur et produit programme d'ordinateur pour le décodage d'un signal

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ERICSSON: "Scheduling Requests in E-UTRAN", 3GPP TSG- RAN WG2 #56BIS, R2-070056, 12 January 2007 (2007-01-12), Sorrento, Italy, XP050133173 *
See also references of EP3225068A4 *

Also Published As

Publication number Publication date
EP3225068A1 (fr) 2017-10-04
EP3225068B1 (fr) 2019-09-04
US10660116B2 (en) 2020-05-19
EP3225068A4 (fr) 2018-07-04
US20170339708A1 (en) 2017-11-23

Similar Documents

Publication Publication Date Title
US11558893B2 (en) Low latency physical uplink control channel with scheduling request and channel state information
US11350451B2 (en) Method of handling communication in unlicensed spectrum and related communication device
US9894654B2 (en) Defining sub-subchannels for data communication using separately provided frequency and time resources and related wireless terminals and network nodes
US10863487B2 (en) Uplink control channel sending method, uplink control channel receiving method, and apparatus
EP2995147B1 (fr) Dci compact pour les communications du type machine
AU2015316199B2 (en) Radio access node, communication terminal and methods performed therein
JP2019118120A (ja) 拡張コンポーネントキャリアのためのチャネル状態情報プロシージャ
AU2018238318A1 (en) Base station, terminal, and communication method
WO2014049917A1 (fr) Terminal de communication sans fil, dispositif de station de base et procédé d'attribution de ressources
WO2014148835A1 (fr) Procédé de transmission et de réception de signal par communication de dispositif à dispositif dans un système de communication sans fil et son dispositif
US10863449B2 (en) Uplink channel sending method and apparatus
US20160242039A1 (en) Methods, Computer Programs, Network Nodes and Communication Device
EP3225068B1 (fr) Prévention de fausse demande de programmation
WO2019099388A1 (fr) Équipements d'utilisateurs, stations de base et procédés

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14906866

Country of ref document: EP

Kind code of ref document: A1

REEP Request for entry into the european phase

Ref document number: 2014906866

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE