Timing advance enhancements for cellular communications

Information

  • Patent Grant
  • 10972988
  • Patent Number
    10,972,988
  • Date Filed
    Monday, October 30, 2017
    7 years ago
  • Date Issued
    Tuesday, April 6, 2021
    3 years ago
Abstract
A disclosed example method involves, when a device is operating in a stationary mode and before a need of the device to communicate data, determining whether a stored timing advance is valid. When the stored timing advance is not valid, a valid timing advance is determined before the need of the device to communicate the data.
Description
BACKGROUND

Cellular wireless communications systems such as those defined by the General Packet Radio Service (GPRS) and its successors provide communications for mobile systems (MS) (e.g., phones, computers, or other portable devices) over a service provider's core network or backbone by means of base stations (BS) connected to the core network that relay communications to and from the MS via a wireless link. The geographic area over which a particular BS is able to communicate wirelessly (i.e., via the air interface) is made up of one or more zones of radio coverage referred to as cells. In order to perform a data transfer, an MS connects to the network in a serving cell hosted by a specific BS of which it is in range. The connection may move to other cells served by the same or by a different BS when conditions warrant (e.g., a change of location as the MS moves from one cell to another) with a handover process.


A BS may provide uplink channels and/or downlink channels for multiple MS's by time division and frequency division multiplexing. In a GPRS system, for example, the BS may periodically broadcast bursts of control data on a defined broadcast control channel (BCCH) over one or more frequency channels that divide time into discrete segments called frames and contain time slots used for data transmission between the BS and an MS. The time slots of each frame on each defined frequency channel constitute the physical channels through which data transfer between an MS and a BS takes place. Logical channels, defined by the type of information they carry, may be further defined as corresponding to particular physical channels and are used to carry traffic (i.e., voice or packet data) and control data in uplink and downlink directions. The MS listens to control signals broadcast by the BS and maintains synchronization therewith in order to receive and transmit data over particular logical channels.


In order for an MS to initiate access to the network, either to initiate a data transfer or respond to a page from the BS sent over a paging channel, it may contend for medium access by transmitting an access request message to the BS on a particular channel defined for that purpose, referred to in GPRS as a random access channel (RACH). If the access request message is successfully received, the BS responds over an access grant channel and assigns downlink and/or uplink channels that are used to transfer data between the BS and MS. The assigned downlink or uplink channels constitute a virtual connection between the BS and MS that lasts for the duration of the data transfer in the cell the MS is camped, referred to as a temporary block flow (TBF).


Although the MS can maintain synchronization with downlink frames received by it from the BS, synchronization of uplink frames transmitted by the MS with the BS requires that the propagation delay be taken into account. The MS may therefore transmit its data with a specified timing offset that corresponds to the time it takes for a signal to reach the BS, referred to as the timing advance (TA). The TA is essentially a negative offset, at the MS, between the start of a received downlink frame and a transmitted uplink frame. The BS can determine the appropriate TA from the arrival times of signals transmitted by the MS with a predetermined TA (e.g., a TA value of 0 corresponding to no timing advance or some other predetermined TA value) and communicate this information to the MS.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a mobile-originated transfer in the moving mode;



FIG. 2 illustrates a mobile-originated transfer in the stationary mode;



FIG. 3 illustrates a mobile-terminated transfer in the moving mode;



FIG. 4 illustrates a mobile-terminated transfer in the stationary mode;



FIG. 5 illustrates a mobile-terminated transfer in the stationary mode with immediate assignment of downlink and uplink channels; and



FIG. 6 shows the components of an exemplary mobile station.





DETAILED DESCRIPTION

In GPRS/EDGE systems, the RACH is a logical channel that is the uplink portion of a bidirectional common control channel (CCCH). Access to the RACH is contention-based, meaning that a device autonomously selects when to transmit on the channel and there is the possibility of collisions between transmissions from different devices. Contention-based access permits devices to trigger a request for uplink resources based on requirements rather than, for example, being scheduled periodic uplink resources which may not be used. When transmitting data to the BS, the MS may transmit the data in the form of what are referred to as normal bursts that are almost as long as a time slot. Due to the propagation time from the MS to the BS, it is necessary for an MS transmitting normal bursts to use the appropriate TA value. This appropriate TA value is not known, however, by the MS during the initial access phase when transmitting over the RACH. Therefore the current GSM/EDGE procedure requires the MS to use access bursts instead of normal bursts over the RACH. Access bursts have a guard interval that is sufficiently long to cover for the unknown propagation delay in traveling to the BS and necessarily carry less information than a normal burst. The network assigns an appropriate TA value to the MS after the initial access procedure, which can be referred to as an initial timing advance estimation procedure. The network may also update the TA value using packet timing advance control channels (PTCCH channels) based on the e.g. timing variance of the training sequence of access bursts sent on the uplink PTCCH, which can be referred to as continuous timing advance update procedures. Both procedures are an overhead signaling expense that it would be desirable to avoid if the appropriate TA value is known by the MS prior to the initial access and/or it could be assumed that this TA value has not changed.


In current GPRS/EDGE systems, the appropriate TA value for an MS is calculated by the BS and communicated to the MS upon each initial access of the network by the MS in order to take account of possible movement by the MS. The TA may also be continuously updated during a TBF by requiring the mobile station to transmit access bursts in the uplink at specific occasions and the network to estimate the timing variance of these bursts over the PTCCH or the PACCH. These current initial timing advance estimation and continuous timing advance update procedures are not efficient and may not be needed, however, for MS's that are either fixed at a certain location or whose movement is expected to be confined within a certain area. Described below are modifications to the operating behavior of the BS, MS, and/or network that reduce the extent of these TA updating procedures for such fixed MS's. The MS may be configured to operate in either a moving mode or a stationary mode, where current TA updating procedures are followed in the moving mode and modified in the stationary mode. Although the description is with reference to a GPRS/EDGE system, the modifications could be incorporated into other similar services as appropriate.


1. Fixed TA Value for Mobile-originated (MO) Transfers in Stationary Mode


In the stationary mode, the initial timing advance procedure is not to be performed on every initial access to radio resources in a given cell as is done in the moving mode. In this context, “initial access” means the first transmission associated with the transmission of data from the MS to the network in that cell, when no other data transfer is ongoing. For example, a transmission on the RACH used as part of TBF establishment in response to receiving data from higher protocol layers for transmission is an initial access. An initial access could also occur during contention-based data transfers with no TBF being established. Rather, in the stationary mode, the MS stores the TA value received during an earlier access in the cell and uses this TA value for subsequent data transfer on that cell. In addition to performing the initial timing advance estimation procedure during initial accesses, additional triggers for doing so may also be defined such as resetting and power cycling of the device or upon receipt of a trigger signal via a specific user interface provided to permit the user to trigger the initial timing advance estimation procedure when needed. The normal initial TA estimation may also be performed if a threshold number of attempts to access resources (using a stored TA) on a cell fail. It also should be noted that modifications to the TA estimation and updating procedures described here are not intended to modify the existing procedures for maintaining or acquiring synchronization with the cell (e.g., by monitoring the appropriate synchronization channels).


Since the TA is associated with a given cell, the normal initial TA estimation procedure (RACH with access bursts, etc.) needs to be performed after cell reselection before transmitting data (i.e. any transmission other than using existing access bursts). Due to the possibility that the device moves between the time of cell reselection and data transfer, the TA is only estimated once the device is ready to start data transmission. However, for an MS operating in the stationary mode, the additional delay and signaling associated with TA determination that normally immediately precedes data transmission can be avoided by performing TA determination in advance. In addition or alternatively, a periodic TA estimation (e.g., by means of RACH with access bursts) may be performed so as to not lose synch with a given cell, for example, due to encountering changes in the channel conditions or the radio environment, or to update the TA in the case of movement by the MS. A TA estimation procedure may also be performed only if a data transfer is initiated but the last TA estimation is older than a specified time interval in order to avoid accessing the RACH just to acquire a new TA value. By having the TA available in advance of needing to transmit data, features which use knowledge of the TA when transmitting data such as using normal bursts over the RACH to transmit data or using modified access can be incorporated into the system.


2. Fixed TA Value for Mobile-terminated (MT) Transfers in Stationary Mode


In the GMM ready state, the network knows the cell in which the mobile is camped, and therefore can immediately transmit an assignment message in that cell that may immediately assign a downlink channel to the MS. FIG. 1 shows the legacy situation that also applies when the MS is operating in the moving mode. In response to the immediate assignment message, the MS transmits access bursts over the RACH to acquire a TA value and acknowledge the assignment. The MS can then request an uplink channel on which it can transmit using normal bursts with the acquired TA value. FIG. 2 shows the situation when the MS operates in the stationary mode with a stored TA value. The TA acquisition step with access bursts is skipped as the MS requests an uplink channel using normal bursts with its stored TA value. In the GMM standby state, the network only knows which routing area/location area the device is in, and hence has to page in multiple cells. FIG. 3 shows the legacy situation that also corresponds to the MS operating in the moving mode. The MS responds to a paging request by requesting a downlink channel and a valid TA value using access bursts over the RACH. FIG. 4 shows the situation when the MS operates in the stationary mode to receive an immediate assignment of a downlink channel with the page and responds with normal bursts using the stored TA to receive assignment of an uplink channel. In this case, the paging procedure may be modified to include data in the paging channel, and the response (which may acknowledge the downlink data and/or request uplink resources) is sent with normal bursts using the stored TA. Avoiding TA update signaling in these situations may reduce the time for uplink TBF establishment and/or completion of the TBF for downlink data transfer since the acknowledgement information sent by the MS cannot be transmitted until the TA is known in the legacy case.


In either a ready state or standby state mobile-terminated transfer, if the network is aware that a bi-directional data transfer (e.g., by means of an uplink and downlink TBF) is required (e.g., based on knowledge that the device operates only for short data transfers which are always acknowledged by a peer entity), both an uplink and downlink channel can be assigned with an immediate assignment as shown in FIG. 5. Again, there is no need for a resource request and subsequent assignment before uplink data can be transmitted.


Since a non-mobile MS may not need to do as many cell reselections as a fully mobile MS and power constraints may not be as stringent, an MS in the stationary mode may be configured to perform a cell update procedure on cell reselections even in the standby state. This would allow the network to be always aware of the cell in which the MS is camped so that the network can use the downlink assignment procedure described above even in the standby state. As a fallback procedure the network can backup to a normal paging mechanism if the MS for any reason does not answer to the immediate assignment. Alternatively, an MS in the stationary mode may be configured to operate only in a ready state with no standby state so as to perform cell updates in the usual manner per the current GPRS/EDGE specification.


3. Reversion to Moving Mode from Stationary Mode


An MS can be configured to decide to perform the optimized procedures described above or perform procedures as currently defined if it determines that the TA value has changed from its last known value. That is, the MS may be configured to revert from the stationary mode to the moving mode if it determines that its stored TA value is probably not correct (or if it cannot determine that the stored TA value probably is correct) and that a new TA value is required. Techniques for determining a change in the correct TA value could be based upon elapsed time and/or sensor measurements indicating movement by the MS. A rough estimate of if the correct TA value has changed can be made based on the time a data transfer is initiated in relation to either the time the stored TA value was last updated or the time at which last successful data transfer occurred to validate the stored TA value. Received signal strength measurements from neighbor cells can be used as a location “fingerprint”, such that if they have not changed (within some tolerance), there is high probability that the device has not moved so far that its correct TA in the serving cell is changed. An example algorithm could be performed by the MS as follows:

    • 1. MS successfully establishes TBF (and therefore knows timing advance).
    • 2. At end of TBF, MS stores TA plus serving cell ID plus one or more of: a) a neighbor cell list with corresponding signal strength measurements and b) a timestamp
    • 3. When new data is to be transmitted; MS looks for serving cell ID in its stored list. If not present, MS uses normal RACH procedures. If present and time_now−timestamp<threshold and/or neighbor cell and signal measurement list are within threshold of stored list, MS uses stored TA


Another technique for detecting movement by the MS could use an accelerometer to detect if the device has moved significantly enough to possibly cause the stored TA value to be invalid. For example, an MS could use an accelerometer to determine whether at least some motion has occurred or not such that if some motion is detected, then the previous TA value is considered invalid. Alternatively, accelerometer input may be used to trigger further evaluation (such as based on neighbor cell measurements, GPS, etc.) to determine whether the TA has changed. Alternatively, GPS or other satellite-based navigation may be used to determine the location of the device, both when the TA is determined and when the subsequent data transfer is to be initiated.


Besides reverting to the moving mode in order to acquire a new TA before a data transfer, the MS may perform such reversion and TA updating may be performed when it is convenient. Also, since an MS may perform cell reselection without actually moving, it may store multiple valid entries for different serving cells simultaneously.


4. Low-rate PTCCH


Currently, the PTTCH channel is used for MSs in packet transfer mode to receive continuous timing advance updates. In the uplink, on periodic designated frames in the PTCCH (i.e. on a designated PTCCH sub-channel), the MS transmits an access burst. In response to this, the network indicates whether the TA needs to be increased or decreased. For MS's operating in the stationary mode, less frequent PTCCH sub-channel occurrences could be provided by the network that provides no TA updating when the MS in packet transfer mode is almost certain not to have moved between consecutive PTCCH sub-channel occurrences as specified by the existing standards but still allow for variations over time. A similar (but possibly occurring even less frequently) PTCCH sub-channel could be used by an MS in the stationary mode and in packet idle mode to allow the MS to validate or modify a stored TA value. This would be beneficial as it may increase the likelihood of a valid TA being available, and hence permit the use of optimized schemes such as sending data on an RACH-like channel without setting up a TBF.


5. Additional Concepts


The use of the optimized procedures using a stored TA value by an MS as described above may be made dependent on network permission (e.g., as received in broadcast system information or sent point-to-point). An MS may indicate its ability to use these procedures in its capabilities that are signaled to the network For example, the MS may indicate to the network that it is capable of operating in the stationary mode, and the network would then apply any or all of the procedures described above for a device capable of utilizing a stored TA value. In another example, such MS's may be further classified as “zero-mobility” devices whose position is fixed or as “low-mobility” devices whose maximum speed and/or range of movement is below some specified threshold value. According to this scheme, a zero-mobility device in stationary mode may operate with more of the optimized timing advance procedures as described above than a low-mobility device (which may operate in stationary mode from time to time). For example, after the MS communicates its classification to the network, the network could omit the use of existing continuous timing advance procedure for MS's indicating zero mobility but apply it, or a low-rate PTCCH optimized form of the procedure, for devices with low mobility.


If an optimized procedure with a stored TA fails such that no valid response occurs within a certain time period and/or in response to a certain number of attempts, the MS may be configured to revert to the non-stationary mode so that legacy procedures are applied. An MS may also autonomously determine that its TA value is no longer valid. In that case, if the network attempts an optimized assignment of resources, the MS may respond as per legacy paging procedures (i.e. using access bursts on RACH).


A new cause code could be used in the corresponding request message sent over the RACH to indicate this is a response to an optimized assignment. Once the MS has received a TA in response to the RACH transmissions, it may then carry on using the assigned resources.


In the embodiments described herein, a stored TA value may be determined using conventional means (e.g., as calculated by the BS) by other procedures such as, for example, using a combination of location information (e.g., GPS) combined with a cell location database (and hence calculating the distance from the device to the BS), manual configuration, or static configuration. It should also be appreciated that the stored TA value so determined may not be as accurate as that that would be obtained by convention procedures, but may be a less accurate estimation. That is, the optimized timing advance procedures described herein should be interpreted as including both cases where the TA value is exactly known (within the limits of accuracy of existing TA representation/signaling) and cases where the stored TA value is a less accurate estimate of the actual propagation delay compensation, for example, within some specified degree of error, since many of the benefits can arise even when the TA is not exactly known. For example, if the MS has no TA information at all, the bursts transmitted by the MS must be very short in order to ensure they fit within a timeslot at the BS. Even with an estimated (but not necessarily exact) TA value, however, the length of the burst can be increased (and hence more data transmitted). Said another way, the optimized timing advance procedures described herein may also apply even when the accuracy of the determined TA is not sufficient to ensure that a conventional normal burst, when transmitted using the determined TA, will be received by the BS within a single timeslot. The degree of permitted error in the TA estimation depends on the length of the burst being sent (and vice versa). In some embodiments, the length of the burst (or equivalently, the maximum permitted TA estimation error) is specified by the network. In some embodiments, the MS adapts the length of its burst in accordance with a determination of the likely accuracy of its estimated TA. (e.g., based on time since the TA was last known to be an exact value (e.g. within the accuracy of the conventional means of determining the TA), based on distance moved, or based on differences in signal strength measurements of the serving and/or neighboring cells).


EXEMPLARY EMBODIMENTS


FIG. 6 shows the components of an exemplary mobile station 100. A processor 10 is coupled to an associated memory 12 and controls the operation of a wireless transceiver 20 in order to communicate via the air interface with the network. An exemplary base station 200 contains similar components plus a network subsystem for communicating with the network core 300. The processor and memory may be implemented as a microprocessor-based controller with memory for data and program storage, implemented with dedicated hardware components such as ASICs (e.g., finite state machines), or implemented as a combination thereof. The MS may also be equipped with additional components such as an accelerometer or GPS unit. As the terms are used herein, a description that a particular device such as an MS or BS is to perform various functions or is configured to perform various functions refers to either code executed by a processor or to specific configurations of hardware components for performing particular functions.


The MS may comprise a processor coupled to a radio transceiver for accessing a base station (BS) via an air interface in order to communicate with the network, wherein the processor is configured to receive transmissions from the BS and synchronize therewith and further configured to transmit bursts using a specified timing advance (TA) in order to compensate for propagation delay where the specified TA value may be zero (i.e., no timing advance) or a value obtained by various means. In one embodiment, the processor is configured to operate in a stationary mode in which the bursts are transmitted using a previously stored TA value when autonomously transmitting over a random access channel (RACH) or other control channel, for example, when establishing a connection with the BS.


In another embodiment, the MS processor is configured to: 1) receive transmissions from the BS that define frames for containing time slots that may be defined as particular logical channels for carrying traffic or control information between the BS and MS in uplink or downlink directions; 2) transmit during the time slot of a particular channel using a normal burst or an access burst, the latter having a longer guard interval and shorter data field, and to transmit bursts using a specified timing advance (TA) relative to the frame in order to compensate for propagation delay; and 3) operate in either a moving mode or a stationary mode and communicate its current operating mode to the BS. In the moving mode, the MS initiates access to the network by transmitting, for example, a channel request message, to the BS using an access burst with a zero or otherwise specified TA value over a random access channel (RACH) or other control channel defined by the BS. In the case where the transmission is a channel request message, the MS receives from the BS an access grant message with a calculated TA value and assignment of one or more logical channels for further communications, stores the calculated TA value, and continues communications over the assigned channels with normal bursts using the stored TA value. In the stationary mode, the MS processor initiates access to the network by transmitting e.g. a channel request message to the BS over the RACH or other control channel using a previously stored TA value. In the case where the transmission is a channel request message, the MS receives from the BS an access grant message and assignment of one or more logical channels for further communications, and continues communications over the assigned channels with normal bursts using the stored TA value. The MS processor may also be configured to store multiple TA values for use in different cells.


The MS processor may, if in either the stationary or moving mode and after receiving an access grant message from the BS, establish a virtual connection with the BS using assigned logical channels for continuing uplink or downlink data transfer in a non-contention based manner, referred to as a temporary block flow (TBF). The MS processor may be further configured to, if in the stationary mode, transfer data to the BS using normal bursts with the stored TA in a contention based manner over an RACH or other control channel.


The MS processor may be configured to operate in the stationary mode in preference to the moving mode if a calculated TA value has been previously stored and to revert to the moving mode if a specified number of attempts to access the network in the stationary mode have failed and/or if a specified time interval has elapsed since the TA value was stored or since the last successful data transfer occurred to validate the stored TA value. The MS processor may be also be configured to: 1) periodically initiate an uplink access procedure in order to update its TA value (e.g., by sending a channel request message with a specific channel request cause or any other message that may be used or defined for obtaining an updated TA value, by initiating a cell update procedure or any procedure that would result in the provision of an updated timing advance by the network) towards the BS over an RACH or other control channel and receive an updated TA value—the period at which such uplink accesses may be initiated being either pre-defined, configured or controlled by the network, 2) if a specified time interval has elapsed since the currently stored TA value was stored, transmit a TA request message to the BS over an RACH or other control channel and receive an updated TA value, 3) switch to the moving mode for the next network access in order to receive an updated TA value upon reset or power cycling, and/or 4) switch to the moving mode for the next network access in order to receive an updated TA value upon receipt of a command from a user interface.


The MS processor may also be configured to operate in the stationary mode in preference to the moving mode if a calculated TA value has been previously stored and to revert to the moving mode upon detecting an indication that movement relative to the BS has occurred. Upon reverting to the moving mode, the MS processor may transmit a TA request message to the BS over an RACH or other control channel, receive an updated TA value, and switch to the stationary mode. Movement relative to the BS may be detected by: 1) measurements of the strength of signals transmitted by neighboring cells, 2) an accelerometer, and/or 3) a GPS unit. In one embodiment, the MS includes a GPS unit and is configured to determine its location from the GPS unit when a TA is stored and before a network access is initiated in order to determine if movement has occurred. In another embodiment, the MS includes an accelerometer and a global positioning system (GPS) unit and is configured to determine its location from the GPS unit when a TA is stored and if triggered by accelerometer signals and/or measurements of neighboring cell transmissions indicative of movement in order to determine if movement has occurred.


The MS processor may be configured to, if in the stationary mode and attached to the BS in a ready state, receive an immediate assignment of a downlink channel from the BS and transmit a request for an uplink channel using a normal burst with the stored TA value. The MS processor may be configured to, if in the stationary mode and attached to the BS in a standby state, receive a paging message with an immediate assignment of a downlink channel from the BS and transmit a request for an uplink channel using a normal burst with the stored TA value. The MS processor may be configured to, if in the stationary mode and attached to the BS, receive an immediate assignment of both downlink and uplink channels from the BS. The MS processor may be configured to, if in the stationary mode, perform periodic cell update procedures by communicating with the BS in either a ready or standby state.


In one embodiment, the MS processor is configured to, store a TA value received from the BS and the ID of the serving cell in a TA table that associates the ID with the stored TA value. If the ID of the serving cell is present in the TA table when data is be transmitted to a BS, the MS operates in the stationary mode with the associated TA value and operates in the moving mode otherwise. In another embodiment, the MS processor is configured to store a TA value received from the BS and the ID of the serving cell in a TA table that associates the ID with the stored TA value and with a timestamp that is reset with each successful data transfer. If the ID of the serving cell is present in the ID list and a specified maximum time interval has not elapsed since the associated timestamp, the MS processor then operates in the stationary mode with the associated TA value and operates in the moving mode otherwise. In another embodiment the MS processor is configured to store a TA value received from the BS and the ID of the serving cell in a TA table that associates the ID with the stored TA value and with stored signal measurements received from one or more of the serving and neighboring cells. If the ID of the serving cell is present in the TA table and if a comparison of current signal measurements from serving and/or neighboring cells with the stored signal measurements associated with the ID is a within a specified threshold when data is to be transmitted to a BS, the MS processor operates in the stationary mode with the associated TA value and operates in the moving mode otherwise.


The MS processor may be configured to, in a packet transfer mode, transmit an access burst on periodic designated frames of a packet timing advance control channel (PTCCH) and receive from the BS in response an indication as to whether the stored TA value needs to be increased or decreased, where the rate at which access bursts are transmitted over the PTCCH may be reduced for the stationary mode than for the moving mode. The MS processor may be further configured to, in the stationary mode, periodically transmit an access burst on periodic designated frames of a packet timing advance control channel (PTCCH) and receive from the BS in response an indication as to whether the stored TA value needs to be increased or decreased. The MS processor may be further configured to, if in the stationary mode and attached to the BS, revert to the moving mode for responding to an immediate assignment of downlink or uplink channels from the BS if an indication is detected that the stored TA value is no longer valid.


It should be appreciated that the various embodiments described above may also be combined in any manner considered to be advantageous. Also, many alternatives, variations, and modifications will be apparent to those of ordinary skill in the art. Other such alternatives, variations, and modifications are intended to fall within the scope of the following appended claims.

Claims
  • 1. A method comprising: transmitting, from a network, an indication permitting devices to operate in a stationary mode; andin response to transmitting the indication, receiving, from a device, a first message indicating an initial access by the device to transmit uplink data to the network, wherein the first message comprises uplink data transmitted from the device, and the device has not performed a random access transmission associated with the initial access prior to sending the first message, wherein the first message is transmitted from the device using a valid timing advance (TA) value stored at the device, and the TA value is determined to be valid based on whether a pre-determined time interval has elapsed since the TA value was stored or since the stored TA value has been used for a last successful data transfer.
  • 2. The method of claim 1, wherein determining that the stored TA value is valid further includes at least one of: determining whether a pre-determined number of attempts to access the network have failed using the stored TA value, or whether the device has a current location different from an original location where the stored TA value was determined for a previous data transfer.
  • 3. The method of claim 1, wherein the device performs a random access transmission over a contention-based RACH to determine a valid TA value in response to the device determining that the TA value stored at the device is invalid.
  • 4. The method of claim 3, wherein the device performs the random access transmission over the contention-based RACH using a zero TA value.
  • 5. The method of claim 1, wherein the TA value stored at the device is non-zero.
  • 6. The method of claim 1, wherein the indication permitting devices to operate in a stationary mode is transmitted in a broadcast message.
  • 7. A network node, comprising: a memory; andat least one hardware processor communicatively coupled with the memory and configured to: transmit, from the network node, an indication permitting devices to operate in a stationary mode; andin response to transmitting the indication, receive, from a device, a first message indicating an initial access by the device to transmit uplink data to the network, wherein the first message comprises uplink data transmitted from the device, and the device has not performed a random access transmission associated with the initial access prior to sending the first message, wherein the first message is transmitted from the device using a valid timing advance (TA) value stored at the device, and the TA value is determined to be valid based on whether a pre-determined time interval has elapsed since the TA value was stored or since the stored TA value has been used for a last successful data transfer.
  • 8. The device of claim 7, wherein determining that the stored TA value is valid further includes at least one of: determining whether a pre-determined number of attempts to access the network node have failed using the stored TA value, or whether the device has a current location different from an original location where the stored TA value was determined for a previous data transfer.
  • 9. The device of claim 7, wherein the device performs a random access transmission over a contention-based RACH to determine a valid TA value in response to the device determining that the TA value stored at the device is invalid.
  • 10. The device of claim 9, wherein the device performs the random access transmission over the contention-based RACH using a zero TA value.
  • 11. The device of claim 7, wherein the TA value stored at the device is non-zero.
  • 12. The device of claim 7, wherein the indication permitting devices to operate in a stationary mode is transmitted in a broadcast message.
  • 13. A non-transitory computer-readable medium containing instructions which, when executed, cause a network node to perform operations comprising: transmitting, from the network node, an indication permitting devices to operate in a stationary mode; andin response to transmitting the indication, receiving, from a device, a first message indicating an initial access by the device to transmit uplink data to the network, wherein the first message comprises uplink data transmitted from the device, and the device has not performed a random access transmission associated with the initial access prior to sending the first message, wherein the first message is transmitted from the device using a valid timing advance (TA) value stored at the device, and the TA value is determined to be valid based on whether a pre-determined time interval has elapsed since the TA value was stored or since the stored TA value has been used for a last successful data transfer.
  • 14. The non-transitory computer-readable medium of claim 13, wherein determining that the stored TA value is valid further includes at least one of: determining whether a pre-determined number of attempts to access the network node have failed using the stored TA value, or whether the device has a current location different from an original location where the stored TA value was determined for a previous data transfer.
  • 15. The non-transitory computer-readable medium of claim 13, wherein the device performs a random access transmission over a contention-based RACH to determine a valid TA value in response to the device determining that the TA value stored at the device is invalid.
  • 16. The non-transitory computer-readable medium of claim 15, wherein the device performs the random access transmission over the contention-based RACH using a zero TA value.
  • 17. The non-transitory computer-readable medium of claim 13, wherein the TA value stored at the device is non-zero.
Priority Claims (1)
Number Date Country Kind
10290131 Mar 2010 EP regional
RELATED APPLICATIONS

This is a continuation of U.S. patent application Ser. No. 15/136,104, filed on Apr. 22, 2016, which is a continuation of U.S. patent application Ser. No. 14/488,484, filed on Sep. 17, 2014, which is a continuation of U.S. patent application Ser. No. 13/045,125, filed on Mar. 10, 2011, which claims priority to European Patent Application No. 10290131.1, filed Mar. 12, 2010, all of which are hereby incorporated herein by reference in their entireties. This application is related to U.S. Patent Applications bearing (U.S. patent application Ser. No. 13/045,165, now U.S. Pat. No. 8,730,886), (U.S. patent application Ser. No. 13/045,078), (U.S. patent application Ser. No. 13/045,088), (U.S. patent application Ser. No. 13/045,099), all of which were filed on Mar. 10, 2011, and all of which are hereby incorporated by reference herein in their entireties. This application is related to European Patent Application Nos. 10290129.5, 10290130.3, 10290128.7, 10290132.9, 10290133.7, all of which were filed on Mar. 12, 2010, and all of which are hereby incorporated by reference herein in their entireties.

US Referenced Citations (127)
Number Name Date Kind
5818829 Raith et al. Oct 1998 A
6633559 Asokan Oct 2003 B1
6772112 Ejzak Aug 2004 B1
6813280 Vanttinen et al. Nov 2004 B2
6870858 Sebire Mar 2005 B1
6963544 Balachandran Nov 2005 B1
7280828 Shah Oct 2007 B1
7392051 Rajala Jun 2008 B2
7433334 Marjelund et al. Oct 2008 B2
7843895 Park Nov 2010 B2
8085725 Zhou Dec 2011 B2
8095161 Sandberg Jan 2012 B2
8238895 Sorbara Aug 2012 B2
8243667 Chun Aug 2012 B2
8249009 Ishii et al. Aug 2012 B2
8284725 Ahmadi Oct 2012 B2
8363671 Korhonen Jan 2013 B2
8498347 Kawamura et al. Jul 2013 B2
8848653 Edge et al. Sep 2014 B2
8867497 Hole Oct 2014 B2
9332511 Hole May 2016 B2
9807715 Venkob Oct 2017 B2
20020071480 Marjelund et al. Jun 2002 A1
20020080758 Landais Jun 2002 A1
20020126630 Vanttinen et al. Sep 2002 A1
20030002457 Womack et al. Jan 2003 A1
20030117995 Koehn et al. Jun 2003 A1
20030133426 Schein et al. Jul 2003 A1
20040077348 Sebire Apr 2004 A1
20040184440 Higuchi et al. Sep 2004 A1
20040196826 Bao et al. Oct 2004 A1
20040248575 Rajala Dec 2004 A1
20040264421 Sato Dec 2004 A1
20050025095 Kim Feb 2005 A1
20050030919 Lucidarme et al. Feb 2005 A1
20050075112 Ball Apr 2005 A1
20060035634 Swann et al. Feb 2006 A1
20060072520 Chitrapu Apr 2006 A1
20060084443 Yeo Apr 2006 A1
20060164986 Rinne Jul 2006 A1
20070021136 Allen Jan 2007 A1
20070064665 Zhang et al. Mar 2007 A1
20070115816 Sinivaara May 2007 A1
20070136279 Zhou et al. Jun 2007 A1
20070147326 Chen Jun 2007 A1
20070149206 Wang Jun 2007 A1
20070165567 Tan Jul 2007 A1
20070224990 Edge Sep 2007 A1
20070265012 Sorbara Nov 2007 A1
20070291696 Zhang et al. Dec 2007 A1
20080002660 Jeong Jan 2008 A1
20080043669 Gallagher Feb 2008 A1
20080049708 Khan Feb 2008 A1
20080080627 Korhonen et al. Apr 2008 A1
20080084849 Wang Apr 2008 A1
20080107055 Sim et al. May 2008 A1
20080188220 DiGirolamo et al. Aug 2008 A1
20080225785 Wang Sep 2008 A1
20080233992 Oteri et al. Sep 2008 A1
20080240028 Ding Oct 2008 A1
20080267127 Narasimha Oct 2008 A1
20080267131 Kangude Oct 2008 A1
20080273610 Malladi Nov 2008 A1
20080316961 Bertrand Dec 2008 A1
20090042582 Wang Feb 2009 A1
20090046629 Jiang Feb 2009 A1
20090046676 Krishnaswamy et al. Feb 2009 A1
20090109908 Bertrand Apr 2009 A1
20090109937 Cave et al. Apr 2009 A1
20090111445 Ratasuk Apr 2009 A1
20090141685 Berglund Jun 2009 A1
20090141701 Dalsgaard Jun 2009 A1
20090197587 Frank Aug 2009 A1
20090201868 Chun Aug 2009 A1
20090220017 Kawamura et al. Sep 2009 A1
20090232107 Park Sep 2009 A1
20090232236 Yamamoto et al. Sep 2009 A1
20090233615 Schmitt Sep 2009 A1
20090239568 Bertrand Sep 2009 A1
20090252125 Vujcic Oct 2009 A1
20090305699 Deshpande Dec 2009 A1
20090316638 Yi et al. Dec 2009 A1
20090318175 Sandberg Dec 2009 A1
20100041393 Kwon Feb 2010 A1
20100054235 Kwon Mar 2010 A1
20100074130 Bertrand Mar 2010 A1
20100074246 Harada Mar 2010 A1
20100080184 Tseng Apr 2010 A1
20100099393 Brisebois et al. Apr 2010 A1
20100112992 Stadler et al. May 2010 A1
20100118816 Choi et al. May 2010 A1
20100120443 Ren May 2010 A1
20100130220 Laroia May 2010 A1
20100137013 Ren Jun 2010 A1
20100159919 Wu Jun 2010 A1
20100172299 Fischer Jul 2010 A1
20100184420 Reinhold Jul 2010 A1
20100184445 Tseng Jul 2010 A1
20100195574 Richeson et al. Aug 2010 A1
20100202354 Ho Aug 2010 A1
20100220713 Tynderfeldt Sep 2010 A1
20100254356 Tynderfeldt Oct 2010 A1
20100273448 Iwamura Oct 2010 A1
20100284376 Park Nov 2010 A1
20100330962 Han Dec 2010 A1
20110019628 Tseng Jan 2011 A1
20110038361 Park Feb 2011 A1
20110069800 Ohta Mar 2011 A1
20110092215 Back Apr 2011 A1
20110107172 Chapman et al. May 2011 A1
20110149907 Olsson Jun 2011 A1
20110188422 Ostergaard Aug 2011 A1
20110190011 Choi Aug 2011 A1
20110200032 Lindstrom Aug 2011 A1
20110222475 Hole Sep 2011 A1
20110222492 Borsella Sep 2011 A1
20110223932 Hole Sep 2011 A1
20110274040 Pani Nov 2011 A1
20110287768 Takamatsu Nov 2011 A1
20110305197 Park et al. Dec 2011 A1
20120057568 Lim Mar 2012 A1
20120129497 De Benedittis May 2012 A1
20120250659 Sambhwani Oct 2012 A1
20120322448 Chin Dec 2012 A1
20120329440 Chin Dec 2012 A1
20150003430 Hole Jan 2015 A1
20160242133 Venkob Aug 2016 A1
Foreign Referenced Citations (43)
Number Date Country
2791858 Sep 2011 CA
1338192 Feb 2002 CN
101154992 Apr 2008 CN
101162957 Apr 2008 CN
101188465 May 2008 CN
101330452 Dec 2008 CN
101390431 Mar 2009 CN
951192 Oct 1999 EP
0963125 Dec 1999 EP
1246399 Oct 2002 EP
1791307 May 2007 EP
2023548 Feb 2009 EP
2034755 Mar 2009 EP
2043391 Apr 2009 EP
2101538 Sep 2009 EP
2104339 Sep 2009 EP
2104393 Sep 2009 EP
2141938 Jan 2010 EP
2187578 May 2010 EP
2831009 Apr 2003 FR
2448889 Nov 2008 GB
200614735 Aug 2008 TW
201026131 Jul 2010 TW
9405095 Mar 1994 WO
9826625 Jun 1998 WO
0054536 Sep 2000 WO
0079823 Dec 2000 WO
0111907 Feb 2001 WO
0117283 Mar 2001 WO
0163839 Aug 2001 WO
2005039201 Apr 2005 WO
2007109695 Sep 2007 WO
2007110483 Oct 2007 WO
2007147788 Dec 2007 WO
2008085146 Jul 2008 WO
2008097626 Aug 2008 WO
2008136488 Nov 2008 WO
2008156321 Dec 2008 WO
2009059518 May 2009 WO
2009072956 Jun 2009 WO
2009088873 Jul 2009 WO
2009088160 Jul 2009 WO
2009155833 Dec 2009 WO
Non-Patent Literature Citations (30)
Entry
“3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Mobile radio interface Layer 3 specification; Core network protocols; Stage 3 (Release 9),” 3GPP TS 24.008 V9.1.0, Dec. 18, 2009, 595 pages.
Panasonic: “DRX and DTX Operation in LTE_Active,” 3GPP Draft; R2-060888, 3rd Generation Partnership Project (3GPP), Athens, Greece, Mar. 27-31, 2006, 3 pages.
3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Mobile radio interface layer 3 specification; Radio Resource Control (RRC) protocol (Release 9), 3GPP TS 44.018 V9.3.0, Dec. 18, 2009, 428 pages.
“3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; General Packet Radio Service (GPRS); Mobile Station (MS)-Base Station System (BSS) interface; Radio Link Control/Medium Access Control (RLC/MAC) protocol (Release 9),” 3GPP TS 44.060 V9.2.0, Dec. 18, 2009, 596 pages.
LG Electronics: “Uplink resource request for uplink scheduling,” 3GPP Draft; R1-060922 UL Request_With TP, 3rd Generation Partnership Project (3GPP), Athens, Greece, Mar. 27-31, 2006, 4 pages.
3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Vocabulary for 3GPP Specifications (Release 9), 3GPP TR 21.905 V9.4.0, Dec. 19, 2009, 57 pages.
3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Radio Subsystem Synchronization (Release 9), 3GPP TS 45.010 V9.0.0, Nov. 2009, 31 pages.
3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Channel Coding (Release 9), 3GPP TS 45.003 V9.0.0, Dec. 2009, 321 pages.
3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Multiplexing and Multiple Access on the Radio Path (Release 9), 3GPP TS 45.002 V9.2.0, Nov. 2009, 108 pages.
White Paper, “Long Term Evolution Protocol Overview,” Freescale Semiconductor, Oct. 2008, 21 pages.
F. Andreasen, “Session Description Protocol (SOP) Simple Capability Declaration,” Network Working Group, RFC 3407, Oct. 2002, 11 pages.
Office Action issued in Canadian Application No. 2,792,737 dated Apr. 24, 2014, 2 pages.
Notice of Allowance issued in Canadian Application No. 2,792,737 dated Dec. 8, 2014, 1 page.
Extended European Search Report issued in European Application No. 10290131.1 dated Sep. 3, 2010, 7 pages.
Examination Report issued in European Application No. 10290131.1 dated Nov. 20, 2012, 5 pages.
Communication Pursuant to Article 94(3) EPC issued in European Application No. 10290131.1 dated Nov. 26, 2015.
Communication Pursuant to Article 94(3) EPC issued in European Application No. 10290131.1 dated May 8, 2017.
Search Report for Patent Application issued in Taiwanese Application No. 100108153 dated Nov. 9, 2013, 1 page.
Notice of Allowance issued in Taiwanese Application No. 100108153 dated Nov. 11, 2013, 4 pages.
International Search Report issued in International Application No. PCT/IB2011/051006 dated Jun. 9, 2011, 3 pages.
Written Opinion of the International Searching Authority issued in International Application No. PCT/IB2011/051006 dated Jun. 9, 2011, 8 pages.
Written Opinion of the International Preliminary Examining Authority issued in International Application No. PCT/IB2011/051006 dated Mar. 29, 2012, 6 pages.
International Preliminary Report on Patentability issued in International Application No. PCT/IB2011/051006 dated Jul. 20, 2012, 8 pages.
Indian Examiner's Report Under Sections 12 & 13 of the Patents Act, 1970 and the Patents Rule 2003, issued in Indian Application No. 7834/CHENP/2012 dated Sep. 28, 2018, 6 pages.
Communication Pursuant to Article 94(3) EPC issued in European Application No. 10290131.1 dated Nov. 12, 2018, 9 pages.
Communication Pursuant to Article 94(3) EPC issued in European Application No. 10290131.1 dated Oct. 10, 2019, 8 pages.
Office Action issued in Chinese Application No. 201611114495.6 dated Jan. 8, 2020, 4 pages (With English Translation).
Hearing Notice issued in Indian Application No. 7834/CHENP/2012 on Jun. 23, 2020, 2 pages (With English Translation).
Partial European Search Report issued in European Application No. 20190083.4 dated Oct. 29, 2020, 17 pages.
Extended European Search Report issued in European Application No. 20190083.4 dated Feb. 25, 2021, 21 pages.
Related Publications (1)
Number Date Country
20180063804 A1 Mar 2018 US
Continuations (3)
Number Date Country
Parent 15136104 Apr 2016 US
Child 15797246 US
Parent 14488484 Sep 2014 US
Child 15136104 US
Parent 13045125 Mar 2011 US
Child 14488484 US