The present invention relates to methods, apparatus and computer programs for operating a user equipment. The exemplary and non-limiting embodiments of this invention relate generally to wireless communication systems, methods, devices and computer programs and specific embodiments relate to cell reselection in a radio network by a user equipment (UE).
A problem in wireless networks has been identified in which a stationary user equipment (UE) attempts to camp on a cell for which it cannot establish a connection. This problem is known in the art as the Chiba issue, as it was brought to light in view of UEs receiving a stronger signal from a Node B located across Tokyo bay in Japan's Chiba prefecture than the signal it receives from a NodeB located in the UE's own Kanagawa prefecture, as shown in
Document R2-130436 by NTT DOCOMO, Inc. entitled RACH transmission Failure issue (3GPP TSG-RAN WG2 Meeting #81; St. Julian, Malta; 28 Jan. to 1 Feb. 2013) sets forth further detail on the Chiba issue with respect to
Document R2-130436 also details that it is difficult to address this by changing the existing reselection parameters that are broadcast by the network, because this change would affect UEs which should be served by the cell in location area B, and also UEs which are moving from location area A to location area B (for example on a boat in Tokyo Bay).
A different solution is proposed in a change request to 3GPP TS 25.331 by NTT DOCOMO, Inc. at document R2-130440 entitled Handling of the current cell when the UE failed in RRC connection establishment (3GPP TSG-RAN WG2 Meeting #81; St. Julian, Malta; 28 Jan. to 1 Feb. 2013). This proposed change to TS25.311 would have the UE bar the cell when the UE fails to complete a primary RACH (PRACH) preamble transmission after reaching its maximum allowed number of PRACH re-transmissions. The inventors consider that this proposed solution would result in UEs incorrectly barring cells in deployments of cells other than the Tokyo Bay-type deployment, which would lead to different UEs camping on the wrong cell if they had barred the correct cell for the wrong reason. A different solution is set forth below.
The examples detailed herein are in the context of a UE operating in a radio network utilizing the Universal Terrestrial Radio Access (UTRA) radio access technology, but this is only one example in order to provide a practical context for describing the inventive concepts detailed herein. These teachings may be utilized with other types of radio access technologies, such as for example Evolved UTRAN (E-UTRAN, sometime referred to as Long Term Evolution or LTE and including LTE-Advanced), Global System for Mobile Communications (GSM), Wideband Code Division Multiple Access (WCDMA) and the like. The specific names of messages and of various network entities in the examples below follow the nomenclature for UTRA networks (UTRANs) and these names also are not limiting to the broader teachings presented below but are for clarity of explanation.
According to a first aspect of the present invention, there is provided a method for operating a user equipment (UE), the method comprising: applying a temporary offset to a cell selection and/or a cell re-selection criterion or criteria in response to determining that a condition is satisfied for a user equipment (UE); and thereafter evaluating the cell for selection or re-selection according to the respective cell selection or cell re-selection criterion or criteria with the applied offset.
According to a second aspect of the present invention, there is provided apparatus for operating a user equipment (UE), the apparatus comprising a processing system configured to cause the apparatus at least to: apply a temporary offset to a cell selection and/or a cell re-selection criterion or criteria in response to determining that a condition is satisfied for a user equipment (UE); and thereafter evaluate the cell for selection or re-selection according to the respective cell selection or cell re-selection criterion or criteria with the applied offset.
According to a third aspect of the present invention, there is provided a computer program comprising a set of computer instructions comprising: code for applying a temporary offset to a cell selection and/or a cell re-selection criterion or criteria in response to determining that a condition is satisfied for a user equipment (UE); and code for thereafter evaluating the cell for selection or re-selection according to the respective cell selection or cell re-selection criterion or criteria with the applied offset.
According to a fourth aspect of the present invention, there is provided a method for operating a user equipment (UE), the method comprising: imposing a restriction for evaluating a cell for selection or re-selection in response to determining that a condition is satisfied for a user equipment (UE); and removing the restriction in response to determining that the UE is non-stationary.
According to a fifth aspect of the present invention, there is provided apparatus for operating a user equipment (UE), the apparatus comprising a processing system configured to cause the apparatus at least to: impose a restriction for evaluating a cell for selection or re-selection in response to determining that a condition is satisfied for a user equipment (UE); and remove the restriction in response to determining that the UE is non-stationary.
According to a sixth aspect of the present invention, there is provided a computer program comprising a set of computer instructions comprising: code for imposing a restriction for evaluating a cell for selection or re-selection in response to determining that a condition is satisfied for a user equipment (UE); and code for removing the restriction in response to determining that the UE is non-stationary.
The processing systems described above may comprise at least one processor and at least one memory including computer program code.
There may be provided a computer readable memory tangibly storing a set of computer instructions as described above.
Further features and advantages of the invention will become apparent from the following description of preferred embodiments of the invention, given by way of example only, which is made with reference to the accompanying drawings.
In accordance with a first embodiment of the invention, the UE applies an offset to the cell when performing cell selection/reselection evaluation. With reference to
In one implementation the condition for applying the offset is the UE detecting the Chiba-type failure condition based on a predetermined number of failed PRACH attempts. In other embodiments some other failure condition can be used as this condition to apply the offset.
In another implementation the offset can be applied only when the UE has received system information, from the cell to which the offset would be applied in the selection/reselection evaluation (cell B in
As a non-limiting example, a new information element (IE) can be added to the UTRAN cell's broadcast system information block 11 (SIB11), or SIB11bis, or SIB12 to carry this offset information. For the case of the system information having a single bit/flag, the flag would indicate to the UE to apply the offset. For the case of the system information having the offset value, the new IE in the SIB would indicate that offset value.
In still another implementation of this first embodiment, the condition is that the UE is of a specific type, for example a machine-type communication (MTC) device that is immobile such as a smart meter or a vending machine MTC device. In this case, UEs of that type know to always apply the offset, of the relevant cell may broadcast in system information which types of UEs are to apply the offset, or the relevant cell may broadcast the indication of the offset or its actual value and only UEs of the type specified in published radio standards know they are to apply that offset. The device type may be a property configured in the device by the operator or may correspond to a subscription type as two non-limiting examples of UE type.
In a further implementation of this first embodiment, the condition is that the speed of the UE is below a threshold speed. This threshold speed may be set to be slightly above zero to capture only stationary UEs that can meet this condition, or it may be set higher to capture also slow moving UEs as having this condition.
Especially considering that some UEs which these teachings seek to use the offset may be low-cost machine-type communication (MTC) devices in a UTRAN or EUTRAN system which are not likely to have the appropriate hardware/software to detect their own speed directly, any given UE can use a proxy for its own speed to see if this condition is fulfilled. For example, the speed condition may be fulfilled if the UE detects that it has counted zero reselections over a fixed period of time. In that case such a UE would detect that it is stationary and know that it is to apply the offset, which makes this UE camping on the current cell more stable since it will not reselect until later when it moves (if at all). This can prevent unnecessary reselection in the stationary UE case. This is a slightly different use of the offset, because the bias imposed by the offset makes the stationary UE stay on the cell rather than cause the signal strength of the “wrong” cell to be weaker from the perspective of the UE's reselection evaluation.
For the case where the condition is also to capture slow moving UEs, which is more generic for a heterogeneous scenario such as may arise in UTRAN and EUTRAN, the offset would be applied upon detection of a slow speed for which the proxy can be fewer than X reselections over fixed time period, where X is some predetermined integer number. This implementation also enables small cell specific parameters to be used to bias the slower moving UEs towards camping on the small/pico cell.
Any of the above implementations for the condition: number of failed PRACH attempts; presence of the offset indication/value in system information; UE type; and UE speed below a threshold; can be used alone or two or more of them may be used in any given deployment of these teachings.
The following examples of the offset itself are specific to UTRAN and with reference to the Chiba issue detailed in the background and at
In the UTRA system, the cell selection criteria is met when the signal level Srxlev>0 and when the received signal quality Squal>0; where:
Squal=Qqualmeas−(Qqualmin+QqualminOffset)
Srxlev=Qrxlevmeas−(Qrxlevmin+QrxlevminOffset)−Pcompensation
In the above, Qqualmeas and Qrxlevmeas are the respective signal quality and level of the cell as measured by the UE; other variables are set by the network or by a published standard. The parameters QqualminOffset and QrxlevminOffset are not conditionally applied as is the offset according to these teachings. To avoid confusion, hereinafter the offset applied according to these teachings is referred to as a temporary offset, designated in the various formulas below as Temp_offset.
One way to implement these teachings for cell selection in UTRA is to modify the cell selection criteria in 3GPP TS 25.304 to include an additional offset Temp_offset as in the equations immediately below. An equivalent implementation is to increase the value of Qqualminoffset temporarily.
Squal=Qqualmeas−(Qqualmin+QqualminOffset+Temp_offset)
Srxlev=Qrxlevmeas−(Qrxlevmin+QrxlevminOffset+Temp_offset)−Pcompensation
These teachings can be implemented for EUTRA systems using similar modifications for cell selection criteria specified at 3GPP TS36.304.
Cell re-selection criteria is performed in different ways. However, intra-frequency ranking is defined in UTRA as follows:
(serving cell) Rs=Qmeas,s+Qhysts+Qoffmbms
(neighbor cell) Rn=Qmeas,n−Qoffsets,n+Qoffmbms−TOn*(1−Ln)
For cell re-selection in UTRA the UE selects the cell with the highest value of R. One way to implement these teachings for cell re-selection in UTRA is to apply a temporary offset to the particular cell when the problem is detected by the UE and/or when indicated by the network, which is then applied in this example by modifying 3GPP TS25.304 as follows:
(serving cell) Rs=Qmeas,s+Qhysts+Qoffmbms−Temp_offset
(neighbor cell) Rn=Qmeas,n−Qoffsets,n+Qoffmbms−Temp_offset−TOn*(1−Ln)
If for example the condition to be satisfied is the cell indicating in system information that the offset is to be applied, then assuming the UE's serving cell but not the neighbor cell broadcast the offset indication it follows that the UE would use the Rs immediately above and the conventional Rn without the offset (or equivalently the Rn immediately above with an offset of zero since the neighbor cell did not broadcast one). To use these teachings to resolve the actual Chiba issue shown at
The EUTRAN re-selection criteria are very similar and a similar modification could be made to 3GPP TS36.304 to implement these teachings for cell re-selection, for both heterogeneous deployments and for stationary UEs.
Consider one implementation in which the condition is two-fold: the UE's PRACH attempts fail three consecutive times, and the cell broadcasts in system information the value for the temporary offset. This can be implemented for example with the following algorithm which may be set forth in a published radio specification so that all UEs follow it:
2>if V300 is greater than N300:
In the above algorithm, V300 is the UE's running timer for awaiting a response to the PRACH that the UE sent uplink which initiates this timer, N300 is the maximum time the UE waits after which the UE concludes the attempt has failed if the UE has not received any response, 3 is the predetermined number (maximum number) of PRACH attempts to meet one of the conditions to apply the offset, and the UE has received the offset value in SIB type 11 which is the other condition to apply the offset.
The above algorithm also has a reset feature to remove the offset, which is implemented by the final clause until the UE has detected 2 cell selections or reselections. This is an example of an implementation of the second embodiment of the invention which is detailed hereinafter. This second embodiment may be implemented with the first embodiment or separately.
The solution proposed by documents R2-130436 and R2-130440 (see the background section above) is that the UE make a determination that a given cell is “not for use” for a fixed period of time during which that cell is barred from selection/re-selection by that UE. The second embodiment of this invention can for example be used with the cell-barring portion of that proposed solution. For this reason, rather than discuss this second embodiment in terms of the condition or conditions being met to apply the offset, it is more generally described with respect to the condition or conditions for applying the restriction being met where the “restriction” encompasses the offset as described above for the first embodiment as well as other kinds of restrictions such as barring a cell from evaluation for selection/re-selection for example.
According to this second embodiment of these teachings, after applying any restrictions due to the condition(s) being met (such as the RACH failure condition for example), the UE then counts its successful reselections and, once a threshold number of successful reselections is met, the UE removes any restrictions that were imposed due to meeting the condition(s) originally. This second embodiment ensures that any UE moving out of the problem area identified at
This second embodiment also has utility beyond resolving only the specific Chiba issue. For example, in a heterogeneous network having macro and small cells, if the condition for applying a restriction is UE speed then a change in the UE speed would in short order naturally change the UE's number of re-selections over the specified time period, enabling the restriction to be removed when most appropriate for a give UE.
Consider for example that a UE has determined that some condition is satisfied for applying a restriction concerning cell selection/re-selection. The restriction can be barring the cell from further selection/re-selection evaluation, for example after 3 failed PRACH attempts. In this case the implementing algorithm can be as follows:
2>if V300 is greater than N300:
The final clause of the above algorithm implements the second embodiment of these teachings on top of the cell-barring solution suggested by documents R2-130436 and R2-130440. To implement the first embodiment of these teachings also, the cell barring in the above algorithm can be changed to applying a temporary offset to the cell selection/re-selection criteria. And further according to the implementations for the first embodiment, the conditions under which that offset restriction is imposed can be one or more of: a) system information telling the UE this is a problem cell and to apply the offset, or b) the UE seeing from its UE type (such as the UE's subscription type or its device type or its device configuration) that it may have a problem with certain cells and will know to apply the offset, or c) from failing to succeed after some predetermined number of PRACH attempts, or d) the UE speed is below a speed threshold.
The second embodiment of this invention could also be used in circumstances other than resolving the Chiba issue. In general, any specific behaviour applied under a particular condition or set of conditions is reset upon detection of mobility over a certain threshold (for example, a threshold number of cell re-selections). This can be useful in scenarios in which a UE detects whether it is static or moving and applies specific mobility parameters for the case it finds that it is a stationary UE (such as most MTC devices are expected to be), yet applies the common parameters for the case it finds it is moving.
In another example mentioned above, a UE moving through different size cells in a heterogeneous network can use specific re-selection parameters when slow moving below some non-negligible threshold which is chosen to bias those UEs to the small cells, and, once the UE increases speed to exceed the threshold, the biasing mechanism is removed and so will not re-select to a small cell through which it will pass too quickly but rather stay on the larger macro cell.
The above first and second embodiments provide the technical effect of enabling different UE behaviour depending on whether the UE is stationary or moving. These embodiments also address the Chiba issue while limiting impact of the Chiba solution to other networks; some implementations can limit the effects of deploying them only to stationary devices within the Chiba area itself or similar lakeside type areas. A further technical effect is that certain embodiments of these teachings, such as where mobility is the condition, can be implemented quite easily in legacy systems like UTRAN and EUTRAN because they entail no additional signalling to implement. For those implementations where there is a signalling impact (system information), these offer an additional technical effect in that the network maintains positive control over when to implement the failure detection and associated actions. Even these implementations should be simple to adopt because the new signalling is only in system information rather than dedicated control signalling.
Block 406 summarizes one non-limiting implementation of the second embodiment whereby the UE determines it is moving at a speed greater than the threshold speed as in block 404 by determining the UE has had more than a first predetermined number of reselections over a predetermined period of time.
Some of the non-limiting implementations for the first embodiment detailed above are also summarized at
Block 406 summarizes that the condition stated at block 402 can be a predetermined number of failed attempts to send a random access request to the cell (which in the above examples is the UE sending a preamble on the RACH), or the UE being of a specified type, or the UE speed being less than a threshold speed. In the case of UE speed as the condition, the examples above showed that the UE can determine its speed is less than the threshold speed by determining that it had fewer than a predetermined number of reselections over a predetermined period of time. Or for the case the UE gets a connection it can use handovers for this aspect, determining it had fewer handovers than the predetermined number. Block 406 further summarizes that the condition of block 402 can be that the UE received in system information from the cell an indication that the offset should be used for the cell, in which case the indication can be a flag or the value for the offset, or the indication can carry more information than just the value, such as the UE or subscription class to which the offset applies for example. In other embodiments the offset value can be in system information but it is only applied if some other condition or conditions are also satisfied.
In some implementations, satisfying the condition as stated at block 402 means satisfying two or more of the specific conditions summarized at block 406, or other conditions. The various embodiments and implementations of these teachings as summarized at
Block 408 adds the optional reset feature to the
Block 506 provides a few non-limiting examples of how the UE can determine it is non-stationary. In one implementation the UE can detect that it has undergone at least one reselection (or handover) to determine it is non-stationary. In another implementation the UE can count that it has had more than a predetermined number of reselections or handovers (whether over a predetermined period of time or with no time reference) to determine that it is non-stationary.
Block 508 adds specific non-limiting implementations for the restriction of block 502. In one implementation the restriction is the temporary offset from the first embodiment which is applied to a cell selection and/or a cell re-selection criteria. This is used by evaluating the cell for selection or re-selection according to the respective cell selection or cell re-selection criteria with the applied offset. In another implementation at block 508, the restriction is the UE barring the cell from being evaluated for selection and re-selection.
The processes represented at each of
The logic diagram of
Such blocks and the functions they represent are non-limiting examples, and may be practiced in various components such as integrated circuit chips and modules, and the exemplary embodiments of this invention may be realized in an apparatus that is embodied as an integrated circuit. The integrated circuit, or circuits, may comprise circuitry (as well as possibly firmware) for embodying at least one or more of a data processor or data processors, a digital signal processor or processors, baseband circuitry and radio frequency circuitry that are configurable so as to operate in accordance with the exemplary embodiments of this invention.
Such circuit/circuitry embodiments include any of the following: (a) hardware-only circuit implementations (such as implementations in only analog and/or digital circuitry) and (b) combinations of circuits and software (and/or firmware), such as: (i) a combination of processor(s) or (ii) portions of processor(s)/software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a user equipment/UE, to perform the various functions summarized at
Reference is now made to
The UE 20 includes processing means such as at least one data processor (DP) 20A, storing means such as at least one computer-readable memory (MEM) 20B storing at least one computer program (PROG) 20C, and first communication means such as a transmitter TX 20D and a receiver RX 20E for bidirectional wireless communications with the access node 22 using the operative radio access technology. All of the relevant wireless communications are via one or more antennas 20F. Also stored in the MEM 20B at reference number 20G are the computer code or algorithms for the UE to apply the restriction (which according to the first embodiment is the offset) and to reset/remove that restriction once the UE undergoes some predetermined number of re-selections after first imposing the restriction, according to exemplary embodiments above.
The access node 22 also includes processing means such as at least one data processor (DP) 22A, storing means such as at least one computer-readable memory (MEM) 22B storing at least one computer program (PROG) 22C, and communication means such as a transmitter TX 22D and a receiver RX 22E for bidirectional wireless communications with the UE 20 via one or more antennas 22F. The Access Node 22 stores at block 22G in certain embodiments its own computer software code or algorithms to include the indication of the offset in system information, such as for example in a new information element shown by example at
Also at
While not particularly illustrated for the UE 20 or the access node 22, those devices are also assumed to include as part of their wireless communicating means a modem and/or a chipset and/or an antenna chip which may or may not be inbuilt onto a radiofrequency (RF) front end module within those devices 20, 22 and which also operates according to the teachings set forth above.
At least one of the PROGs 20C in the UE 20 is assumed to include a set of program instructions that, when executed by the associated DP 20A, enable the device to operate in accordance with the exemplary embodiments of this invention, as detailed above and particularly summarized at
In general, the various embodiments of the UE 20 can include, but are not limited to personal portable digital devices having wireless communication capabilities, including but not limited to cellular and other mobile phones, navigation devices, laptop/palmtop/tablet computers, digital cameras and music devices, Internet appliances, USB dongles and data cards.
Various embodiments of the computer readable MEMs 20B, 22B, 26B include any data storage technology type which is suitable to the local technical environment, including but not limited to semiconductor based memory devices, magnetic memory devices and systems, optical memory devices and systems, fixed memory, removable memory, disc memory, flash memory, DRAM, SRAM, EEPROM and the like. Various embodiments of the DPs 20A, 22A, 26A include but are not limited to general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and multi-core processors.
Various modifications and adaptations to the foregoing exemplary embodiments of this invention may become apparent to those skilled in the relevant arts in view of the foregoing description. While the exemplary embodiments have been described above in the context of the UTRAN and WCDMA systems, as noted above the exemplary embodiments of this invention are not limited for use with only these particular types of wireless radio access technology networks.
The above embodiments are to be understood as illustrative examples of the invention. Further embodiments of the invention are envisaged. It is to be understood that any feature described in relation to any one embodiment may be used alone, or in combination with other features described, and may also be used in combination with one or more features of any other of the embodiments, or any combination of any other of the embodiments. Furthermore, equivalents and modifications not described above may also be employed without departing from the scope of the invention, which is defined in the accompanying claims.
Number | Date | Country | Kind |
---|---|---|---|
1305740.1 | Mar 2013 | GB | national |