Signalling in mobile telecommunications
11129089 · 2021-09-21
Assignee
Inventors
Cpc classification
H04J11/0069
ELECTRICITY
International classification
Abstract
In a method for use in a base station of a mobile telecommunications system, primary system information is maintained and is periodically broadcast while secondary system information is broadcast in response to a trigger event.
Claims
1. A method for a user equipment (UE), the method comprising: receiving first system information that is broadcast by a base station, and that comprises information relating to on-demand system information, wherein the on-demand system information comprises information that is transmitted by the base station but not broadcast in the first system information; transmitting, to the base station, a request message of a random access procedure based on the information relating to the on-demand system information, the request message being a request for the on-demand system information; and receiving, from the base station, the on-demand system information in response to the transmitted request message.
2. The method according to claim 1, wherein the request message comprises a random access channel (RACH) preamble.
3. The method according to claim 1, wherein the information relating to on-demand system information is a schedule information of the on-demand system information.
4. A method for a radio station, the method comprising: broadcasting, first system information that comprises information relating to on-demand system information, wherein the on-demand system information comprises information that is transmitted by the base station but not broadcast in the first system information; receiving a request message of a random access procedure that is transmitted from a user equipment (UE) based on the information relating to the on-demand system information, the request message being a request for the on-demand system information; and transmitting the on-demand system information in response to receiving the transmitted request message.
5. The method according to claim 4, wherein the request message comprises a random access channel (RACH) preamble.
6. The method according to claim 4, wherein the information relating to on-demand system information is a schedule information of the on-demand system information.
7. A user equipment (UE) comprising: a memory; and at least one processor coupled to the memory and configured to: receive first system information that is broadcast by a base station, and that comprises information relating to on-demand system information, wherein the on-demand system information comprises information that is transmitted by the base station but not broadcast in the first system information; transmit, to the base station, a request message of a random access procedure based on the information relating to the on-demand system information, wherein the request message is configured as a request for the on-demand system information; and receive, from the base station, the on-demand system information in response to the transmitted request message.
8. The UE according to claim 7, wherein the request message comprises a random access channel (RACH) preamble.
9. The UE according to claim 7, wherein the information relating to on-demand system information is a schedule information of the on-demand system information.
10. A radio station comprising: a memory; and at least one processor coupled to the memory and configured to: broadcast, first system information that comprises information relating to on-demand system information, wherein the on-demand system information comprises information that is transmitted by the base station but not broadcast in the first system information; receive a request message of a random access procedure that is transmitted from a user equipment (UE) based on the information relating to the on-demand system information, wherein the request message is configured as a request for the on-demand system information; and transmit the on-demand system information in response to receiving the transmitted request message.
11. The radio station according to claim 10, wherein the request message comprises a random access channel (RACH) preamble.
12. The radio station according to claim 10, wherein the information relating to on-demand system information is a schedule information of the on-demand system information.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
BEST MODE FOR CARRYING OUT THE INVENTION
(11) An exemplary embodiment will now be described with reference to the accompanying drawings.
(12) One of the main objectives for LIE BCH design is to optimize the usage of the available resources. This means that the LIE BCH design must try to reduce the resources required by BCH and try to eliminate duplication of information transmitted by the network where possible. In the joint RAN 1-RAN2 meeting in Cannes, the-cost per bit of sending BCH was discussed. The conclusion was that the cost of BCH transmission in terms of instantaneous power consumption could be very high. We have proposed a method is to help reduce this power consumption. This document proposes a BCH-on-demand concept which is an enhancement for the secondary BCH (S-BCH) transmission. In this scheme, S-BCH is transmitted both: periodically with a very large interval, and when there is a demand for it. This demand is indicated in the form of RACH sent by UEs that need the S-BCH information.
1. BCH-On-Demand Mechanism
(13) In UMTS, the main disadvantage of BCH is that it is transmitted regardless of whether UEs need the information or not. Typically, 5% of the base station power is used for BCH transmission, which is quite a significant proportion.
(14) Unlike primary BCH (P-BCH), which has to be transmitted frequently to enable UE to efficiently perform cell search procedure, S-BCH may not need to be transmitted regularly if there is no UE in the cell or if no UE wants to read it urgently. Thus, to further reduce the instantaneous power requirement for BCH and to optimize usage of network resources, it is proposed to have a periodic S-BCH with very long interval.
(15) In addition, to help reduce delay in obtaining S-BCH, it is proposed to also have an “on-demand S-BCH”. The content of periodic S-BCH and on-demand S-BCH would normally be the same. However, the content of on-demand S-BCH may be tailored to the intention of the UE requesting it, e.g. UEs that want on-demand S-BCH to make a call could send related parts of the system information.
(16) Although this proposal is mainly to allow idle UEs to request S-BCH to be transmitted, it does not preclude allowing connected UEs to request S-BCH to be scheduled e.g. via L2 or L3 signalling.
(17) For the on-demand S-BCH, UE can indicate it requires S-BCH by sending RACH preamble e.g. with a specific cause value or specific random ID.
(18) In the following sections, we discuss the different scenarios in which UE will need S-BCH. These are: Case 1: UE has S-BCH stored in memory and wants to connect to network; Case 2: UE does not have S-BCH of the cell and needs S-BCH to connect to network; Case 3: UE does not have S-BCH of the cell and needs S-BCH to remain in idle (and possibly connect to network at a later time)
(Note: This document considers the case where S-BCH scheduling information is provided on P-BCH. Other methods of providing scheduling information for S-BCH, such as L1/L2 control signalling could also be considered.)
1.1 Case 1: UE has S-BCH Stored in Memory and Wants to Connect to Network:
(19) When the UE has stored S-BCH information in memory, UE will not normally need to read S-BCH again for the same cell, unless the information has changed. If the information has not changed, UE may use this S-BCH information at a later time to initiate procedures e.g. tracking area update.
(20) This is the “normal” RACH procedure where UE sends RACH and receives RACH response with e.g. resource allocation information.
(21) In this case, the cause value or random ID used in the RACH preamble would indicate that UE does not require S-BCH.
(22) 1.2 Case 2: UE does not have S-BCH and Needs S-BCH to Connect to Network
(23) When the UE arrives in a new cell and needs to connect to the network e.g. to make a call, the UE has 2 alternatives to obtain S-BCH information:
(24) a. wait for the next periodic S-BCH;
(25) b. request for on-demand S-BCH by sending RACH preamble.
(26) The UE may wait for the next periodic S-BCH if waiting does not impact the performance of the procedure UE wants to perform.
(27) If the UE decides that it cannot wait for the periodic S-BCH and wants to request on-demand S-BCH, the sequence shown in
(28) 1. When an idle UE arrives in a cell, it reads the fixed pre-defined P-BCH that gives it information necessary to camp on the cell. The P-BCH may also provide scheduling information for the variable S-BCH. Within this scheduling information, there will be an indication of when the next periodic S-BCH will be available. UE can decide, based on this information and also on the procedure UE wants to perform, whether to wait for periodic S-BCH or request on-demand S-BCH to be sent.
(29) 2. Assuming the UE needs to make a call and the additional delay to wait for the next periodic S-BCH cannot be tolerated, the UE will send a RACH to request on-demand S-BCH transmission and to start the call. This could be indicated by a cause value in the RACH preamble.
(30) 3. Upon receiving RACH that indicates UE wants on-demand S-BCH and then proceed with another procedure, the eNB schedules resources for on-demand S-BCH and broadcasts this information on P-BCH. It may be possible for eNB to schedule only system information that a “call setup” UE would need, e.g. neighbor cell information. UE reads P-BCH to get scheduling information for on-demand S-BCH.
(31) 4. UE reads the on-demand S-BCH.
(32) 5. eNB sends RACH response to allocate resources for the UE.
(33) Note that this does not preclude eNB sending RACH response and on-demand S-BCH at the same time.
(34) 1.3 Case 3: UE does not have S-BCH and Needs S-BCH to Remain in Idle:
(35) Here, the case when an idle UE arrives in a cell and wants to remain in idle is considered. The UE needs to read S-BCH in order to get e.g. cell (re)selection parameters and other information needed to be in idle.
(36) In this case, as in Case 2, it may be possible for the UE to wait for the periodic S-BCH. Alternatively, UE may decide that it cannot wait for the periodic S-BCH and sends a RACH to get an on-demand S-BCH.
(37) The sequence of
(38) The differences between this procedure and procedure in Case 2: In step 2, the RACH preamble could contain a cause that indicates UE only needs on-demand S-BCH and does not want to continue to connect to the network. No RACH response message is needed
2. Advantages
2.1 S-BCH Resource Savings
(39) The main advantage of the BCH-on-demand mechanism is that it allows the network to save S-BCH resources when there are no UEs that require S-BCH transmission.
(40) To try and get an idea of the possible savings, the probability of on-demand S-BCH transmission in a particular interval is analyzed. If the mean arrival rate of UEs that needs on-demand S-BCH is λ UEs per second, then the probability that at least one UE arrives during an interval of T seconds is:
P(N>0)=1−e.sup.−λT
(41) It is assumed that P-BCH provides the on-demand S-BCH scheduling information, i.e. P-BCH period determines the upper bound of the on-demand S-BCH transmission. If T is the P-BCH period then P(N>0) is the S-BCH occupancy, i.e. the fraction of P-BCH transmissions in which the on-demand S-BCH is also transmitted.
(42) Referring to the RACH traffic model provided in R2-062160, RACH Contention and Retry Cases, NTT DoCoMo, NEC, if the case where 6 non-realtime service call attempts are used, the number of RACH attempts when 1000 UEs are camped in the cell is ˜40 “normal” RACH attempts per second. According to the procedure outlined in section 1.2 and 1.3 of this document, only a fraction of the total number of “normal” RACH attempts will require UE to request on-demand S-BCH.
(43) The on-demand S-BCH occupancy is plotted in the following graph for P-BCH interval of T=10 ms, which means that the maximum rate of on-demand S-BCH transmission is equal to 10 ms periodic S-BCH transmission. The graph also shows the S-BCH occupancy for periodic S-BCH with intervals of 10 ms and 20 ms. The x-axis represents the number of UEs requesting on-demand S-BCH arriving every second. The maximum range of 80 was used, which is double the value of “normal” RACH attempts discussed in the previous paragraph.
(44) From the graph, if the arrival rate of UEs requesting on-demand S-BCH is 40 UEs per second then the S-BCH occupancy saving compared with the 10 ms periodic S-BCH is about 70%. When compared with the 20 ms periodic S-BCH case, the resource saving is about 35% and, as a bonus, the maximum delay in acquiring on-demand S-BCH is halved.
(45) 2.2 Impact to RACH
(46) For Case 2, i.e, UEs that do not have S-BCH stored in memory and require S-BCH to connect to the network, it is possible to assume that this is not a frequent occurrence. The on-demand S-BCH scenario that may have an impact to the RACH loading and contention is Case 3, i.e. UEs that want S-BCH to remain in idle.
(47) To alleviate problems due to RACH contention, Case 3 UEs may be mandated to wait for the periodic S-BCH e.g. if the waiting time does not exceed a certain threshold.
(48) Further, a single RACH random ID may be reserved for Case 3, i.e. UEs requesting on-demand S-BCH and remaining idle. In this way, even when more than one UE sends RACH for the same purpose at the same time, this will not result in any contention for S-BCH. The eNB will interpret this as a single request and schedule the on-demand S-BCH normally.
(49) To further reduce impact of Case 3 RACHs to the overall RACH loading, it is possible to limit RACH allocation that allows UE to send RACH for this purpose. This is possible because delay in getting S-BCH transmission is not so critical for these UEs.
(50) 2.3 Timing Relationship and Impact to Call Setup Delay:
(51) In UMTS, the delay related to reading BCH information is bound by the BCH scheduling interval. To optimize the delay in reading BCH and the consumption of base station transmit power, a careful balance between the two requirements is needed. With the proposed combined periodic and on-demand S-BCH mechanism, the balance between the two requirements can be relaxed.
(52) The timing relationship between RACH, P-BCH and on-demand S-BCH is illustrated in
(53) The delay between RACH preamble and the P-BCH that contains the on-demand S-BCH scheduling information should not be more than 2 ms, as 2 ms is the comparable UMTS delay between RACH preamble and AICH [25.211].
(54) It can be seen from the timing relationship diagram that the delay reading on-demand S-BCH is bound by the scheduling interval for P-BCH, i.e. the interval for on-demand S-BCH scheduling information, and the interval between available RACH resource blocks.
(55) In case the UE arrival rate is very high, one way to avoid sending on-demand S-BCH too frequently is by setting either the on-demand S-BCH scheduling information interval or RACH allocation interval to give the maximum desired on-demand S-BCH frequency.
(56) 3. Conclusion
(57) The following modification to conventional 3GPP signalling is proposed: Secondary BCH is transmitted both periodically and on demand when UE sends a request either via non-synchronized RACH or other means e.g. L2/L3 signalling.
(58) Base Station
(59)
(60) Mobile Telephone
(61)