This patent claims priority to European Patent Application No. 10290130.3, filed Mar. 12, 2010, which is hereby incorporated by reference herein in its entirety.
This application is related to U.S. patent application Ser. Nos. 13/045,125, 13/045,078, 13/045,088, 13/045,099, all of which are filed concurrently herewith, and all of which are hereby incorporated by reference herein in their entireties.
This application is related to European Patent Application Nos. 10290129.5 (docket no. 37466-EP-EPA), 10290131.1 (docket no. 37759-EP-EPA), 10290128.7 (docket no. 37760-EP-EPA), 10290132.9 (docket no. 37760-1-EP-EPA), 10290133.7 (docket no. 37760-2-EP-EPA), all of which were filed on Mar. 12, 2010, and all of which are hereby incorporated by reference herein in their entireties.
Various embodiments described herein relate to apparatus, and methods associated with wireless communication. Some embodiments relate to Global System for Mobile Communications (GSM) networks including general packet radio service (GPRS) and enhanced GPRS (EGPRS) networks. Some embodiments relate to mobile station (MS) access techniques. Some embodiments relate to communications and data transmissions on a random-access channel (RACH).
In the wireless environment where multiple devices can request to access the network at the same time, it is necessary for the network to resolve this contention. Currently a random number may be included by the device in its initial request in order to minimize the risk of confusion as to which device is being responded to.
There are, however, a limited number of bits available for the random number reference in the request message, so there exists a significantly high probability that multiple devices use the same random number in the same RACH time slot and that there will be a contention that should be resolved to avoid having multiple devices transmitting on the same dedicated channel. A device which loses a contention resolution (i.e. discovers that it has been transmitting on resources that were not intended for it) may have consumed significant power and incurred delay in transmitting data which was not processed or forwarded by the network. Thus a need exists for an efficient method for contention resolution in terms of time, power consumption and signaling overhead in a wireless network.
The following description and the drawings sufficiently illustrate specific embodiments to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. Portions and features of some embodiments may be included in, or substituted for, those of other embodiments. Embodiments set forth in the claims encompass all available equivalents of those claims.
The timing advance may be an amount of time (or estimate thereof) that the mobile station 102 may advance its transmission of the initial access burst 103 so that the initial access burst 103 is received by the base station 104 within a single time slot of the RACH 105 (i.e., rather than across more than one time slot which may result when the timing advance is unknown). The timing advance depends on the signal propagation delay between the mobile station 102 and the base station 104. The timing advance may be a timing advance that is associated with a serving cell. In some embodiments, the timing advance may be applied to any transmitted burst desired to be received within a time period (e.g. time slot) of a time-division multiplexed uplink channel.
In some embodiments, the parameters defining the RACH 105 that are transmitted in the notification 101 may include among other things, indication of the time slots of a physical channel that comprise the RACH 105. In these embodiments, the mobile station may transmit the initial access burst 103 to include a shortened identifier. The shortened identifier may be used to identify the mobile station 102. These embodiments are discussed in more detail below.
Because the RACH 105 is a random-access channel in which mobile stations 102 are not assigned specific channel resources thereon for transmission of initial access bursts 103, collisions may occur. Embodiments discussed in more detail below may reduce or eliminate the probability of such collisions.
Data transmitted in the initial access burst 103 on the RACH 105 may have a network destination within the communication network 100 rather than for use by base station 104. The use of the RACH 105 for the transmission of smaller amounts of data, as in MTC, may result in a significant reduction in the amount of network resources that are conventionally used for transmission of data. In these embodiments, the signaling conventionally required for channel resource requests may be reduced or eliminated and a temporary block flow (TBF) may not need to be established. In some embodiments discussed in more detail below, the signaling and network resources associated with acknowledgements may also be reduced or eliminated.
The RACH 105 is an uplink-only channel in which access is contention-based and access may not require a known timing advance. With contention-based access, mobile stations 102 may autonomously select when to transmit on the RACH 105 and there may be no device-specific scheduling. Access on the RACH 105 may assume the timing advance is not known. Contention-based access on RACH 105 permits mobile stations 102 to trigger a request for uplink resources based on requirements (rather than, for example, being scheduled periodic uplink resources which may not be needed). With contention-based access, there may be a risk that two or more mobile stations 102 will transmit overlapping access bursts.
Transmission 202 may be a normal-burst transmission from the base station 104 and may be used by the mobile stations 102 to synchronize its time-base 203, although this is not a requirement. The mobile stations 102 may use other base station transmissions, such as synchronization transmissions from the network, to synchronize their time-base 203.
The network may determine and assign a timing advance value to a mobile station 102 after the initial access procedure which may be part of an initial timing advance estimation procedure so that subsequent communications on the control and data channels are received within designated time slots. In this way, normal bursts may be used and the use of significant guard bits can be avoided. The network may also regularly update the timing advance value based on the timing variance of access bursts sent on the uplink control channel. In case of GPRS and EGPRS configured networks, the timing advance may be updated using packet timing advance control channels (PTCCH) based on the timing variance of access bursts sent on the uplink PTCCH. This is a continuous timing advance update procedure that may require additional signalling. The network may also monitor the delay of normal bursts and access bursts sent by the mobile station 102 on various control channels (e.g., in case of explicit polling by network for the access bursts).
The access request message 109 transmitted on the RACH channel 105 may include information for establishing a subsequent connection in the data field 324 rather than user data having a network destination. For example, data field 324 may include an establishment cause, a request for either one-phase or two-phase access and/or a random reference. Since the data field 324 is part of an access request message 109, the data field 324 does not include user data that has a network destination. User data is data other than control data and other information conventionally included on a RACH. User data has a network destination (i.e., beyond the base station or base station controller). Data field 324 may include data for use only by the base station 104 or a network controller, such as a base station controller (not shown in
The conventional access request message 109 may be retransmitted (for example, in case no response is received from the network) up to a maximum number of times which may be indicated by the network in a RACH control parameter information element. The spacing between successive attempts may be configured to reduce or minimize collisions with other mobile stations. After transmitting an access request message 109, a mobile station 102 may listen to a broadcast channel (BCCH) and to a downlink common control channel time slot for an immediate assignment message from the network for assignment of network resources. The network may also send an immediate assignment reject message when no resources are available.
In accordance with some embodiments, the mobile station 400 may be configured to transmit data on a random access channel. In these embodiments, the processing circuitry 406 may configure an initial access burst, such as initial access burst 103 (
In some embodiments, the shortened identifier that may be included in the initial access burst 103 on the RACH 105 may be determined by either the mobile station 102 or the base station 104 based on a full-length (e.g., a 32-bit) identifier that uniquely identifies the mobile station 102. In these embodiments, the shortened identifier may be based on a 32-bit international mobile subscriber identity (IMSI), a temporary logical link identifier (TLLI), a temporary mobile subscriber identity (TMSI), or some other identifier of the mobile station 102. For example, the shortened identifier may comprise the last 5 bits of the full-length identifier. In these embodiments, the shortened identifier may be determined by either the mobile station 102 or the base station 104.
In some embodiments, the shortened identifier may be substantially shorter than a full-length IMSI or TLLI identifier. In some embodiments, the shorted identifier may be assigned by the network and may be determined based on the particular cell or cell ID. In some embodiments, a partial identifier may be used in combination with a RACH group (discussed below) to identify the mobile station and reduce contention resolution. In some embodiments, a hash function may be used (i.e., a hash of the full-length identifier or a shortened identifier. In some alternate embodiments, the full-length identifier may be used in the initial access burst 103 on the RACH 105.
In some embodiments, the notification 101 may include the shortened identifier for use by the mobile station 102 to identify the mobile station in the initial access burst 103. In these embodiments, the base station 104 may provide a shortened identifier to the mobile station 102 for use on the RACH 105, although this is not a requirement. In some embodiments, the shortened identifier may be provided in addition to or instead of the parameters defining the RACH 105 transmitted in the notification 101.
In some embodiments, mobile station 400 may be part of a portable wireless communication device, such as a personal digital assistant (PDA), a laptop or portable computer with wireless communication capability, a web tablet, a wireless telephone, a wireless headset, a pager, an instant messaging device, a digital camera, an access point, a television, a smart phone, or other device that may receive and/or transmit information wirelessly.
Antennas 408 may comprise one or more directional or omnidirectional antennas, including, for example, dipole antennas, monopole antennas, patch antennas, loop antennas, microstrip antennas or other types of antennas suitable for transmission of RF signals. In some embodiments, instead of two or more antennas, a single antenna with multiple apertures may be used. In these embodiments, each aperture may be considered a separate antenna. In some multiple-input multiple-output (MIMO) embodiments, antennas 408 may be effectively separated to take advantage of spatial diversity and the different channel characteristics that may result between each of antennas 408 and the antennas of a transmitting station.
Although mobile station 400 is illustrated as having several separate functional elements, one or more of the functional elements may be combined and may be implemented by combinations of software-configured elements, such as processing elements including digital signal processors (DSPs), and/or other hardware elements. For example, some elements may comprise one or more microprocessors, DSPs, application specific integrated circuits (ASICs), radio-frequency integrated circuits (RFICs) and combinations of various hardware and logic circuitry for performing at least the functions described herein. In some embodiments, the functional elements of mobile station 400 may refer to one or more processes operating on one or more processing elements.
In some embodiments this registration may be carried out between the device and the base station rather than at the network level.
In some embodiments, the mobile station may determine the RACH group and/or the ID autonomously. For example, the RACH group and ID may be based on the IMSI and the MS may not then need to receive the RACH group and ID from the network.
In some embodiments, the device may be the only member of the RACH group, which enables the network to identify the device based solely on membership in the RACH group.
In some embodiments, if the device fails to access the network after a certain number of attempts, the device may fall back to repeating the registration using the legacy RACH network access procedure.
Although the individual operations of procedure 500, 600, 700 and 900 are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Furthermore, some operations may be optional.
Embodiments may be implemented in one or a combination of hardware, firmware and software. Embodiments may also be implemented as instructions stored on a computer-readable storage medium, which may be read and executed by at least one processor to perform the operations described herein. A computer-readable medium may include any tangible medium for storing in a form readable by a machine (e.g., a computer). For example, a computer-readable medium may include read-only memory (ROM), random-access memory (RAM), magnetic disk storage media, optical storage media, and flash-memory devices.
Although many embodiments described herein relate to GSM networks, including GPRS and EGPRS networks, embodiments are generally applicable to any wireless network that uses a TDMA random-access channel.
The Abstract is provided to comply with 37 C.F.R. Section 1.72(b) requiring an abstract that will allow the reader to ascertain the nature and gist of the technical disclosure. It is submitted with the understanding that it will not be used to limit or interpret the scope or meaning of the claims. The following claims are hereby incorporated into the detailed description, with each claim standing on its own as a separate embodiment.
Number | Date | Country | Kind |
---|---|---|---|
10290130 | Mar 2010 | EP | regional |
Number | Name | Date | Kind |
---|---|---|---|
5818829 | Raith et al. | Oct 1998 | A |
6633559 | Asokan et al. | Oct 2003 | B1 |
6772112 | Ejzak | Aug 2004 | B1 |
6870858 | Sebire | Mar 2005 | B1 |
6963544 | Balachandran et al. | Nov 2005 | B1 |
7392051 | Rajala et al. | Jun 2008 | B2 |
7433334 | Marjelund et al. | Oct 2008 | B2 |
7843895 | Park et al. | Nov 2010 | B2 |
8085725 | Zhou | Dec 2011 | B2 |
8238895 | Sorbara et al. | Aug 2012 | B2 |
8243667 | Chun et al. | Aug 2012 | B2 |
8284725 | Ahmadi | Oct 2012 | B2 |
8363671 | Korhonen et al. | Jan 2013 | B2 |
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 et al. | Apr 2004 | A1 |
20040184440 | Higuchi et al. | Sep 2004 | A1 |
20040196826 | Bao et al. | Oct 2004 | A1 |
20040248575 | Rajala et al. | Dec 2004 | A1 |
20050030919 | Lucidarme et al. | Feb 2005 | A1 |
20060035634 | Swann et al. | Feb 2006 | A1 |
20060072520 | Chitrapu et al. | Apr 2006 | A1 |
20070064665 | Zhang et al. | Mar 2007 | A1 |
20070115816 | Sinivaara | May 2007 | A1 |
20070147326 | Chen | Jun 2007 | A1 |
20070149206 | Wang et al. | Jun 2007 | A1 |
20070165567 | Tan et al. | Jul 2007 | A1 |
20070224990 | Edge et al. | Sep 2007 | A1 |
20070265012 | Sorbara et al. | Nov 2007 | A1 |
20070291696 | Zhang et al. | Dec 2007 | A1 |
20080049708 | Khan et al. | Feb 2008 | A1 |
20080080627 | Korhonen et al. | Apr 2008 | A1 |
20080084849 | Wang et al. | Apr 2008 | A1 |
20080107055 | Sim et al. | May 2008 | A1 |
20080188220 | DiGirolamo et al. | Aug 2008 | A1 |
20080225785 | Wang et al. | Sep 2008 | A1 |
20080240028 | Ding et al. | Oct 2008 | A1 |
20080267127 | Narasimha et al. | Oct 2008 | A1 |
20080273610 | Malladi et al. | Nov 2008 | A1 |
20090046676 | Krishnaswamy et al. | Feb 2009 | A1 |
20090109937 | Cave et al. | Apr 2009 | A1 |
20090141685 | Berglund | Jun 2009 | A1 |
20090197587 | Frank | Aug 2009 | A1 |
20090201868 | Chun et al. | Aug 2009 | A1 |
20090232107 | Park et al. | Sep 2009 | A1 |
20090233615 | Schmitt | Sep 2009 | A1 |
20090252125 | Vujcic | Oct 2009 | A1 |
20100041393 | Kwon et al. | Feb 2010 | A1 |
20100054235 | Kwon et al. | Mar 2010 | A1 |
20100074246 | Harada et al. | Mar 2010 | A1 |
20100099393 | Brisebois et al. | Apr 2010 | A1 |
20100112992 | Stadler et al. | May 2010 | A1 |
20100120443 | Ren | May 2010 | A1 |
20100130220 | Laroia et al. | May 2010 | A1 |
20100159919 | Wu | Jun 2010 | A1 |
20100202354 | Ho | Aug 2010 | A1 |
20100220713 | Tynderfeldt et al. | Sep 2010 | A1 |
20100254356 | Tynderfeldt et al. | Oct 2010 | A1 |
20100284376 | Park et al. | Nov 2010 | A1 |
20110038361 | Park et al. | Feb 2011 | A1 |
20120250659 | Sambhwani | Oct 2012 | A1 |
Number | Date | Country |
---|---|---|
0951192 | Oct 1999 | 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 |
2187578 | May 2010 | EP |
2831009 | Apr 2003 | FR |
2448889 | Nov 2008 | GB |
200614735 | May 2006 | 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 |
2008097626 | Aug 2008 | WO |
2008136488 | Nov 2008 | WO |
2009059518 | May 2009 | WO |
2009088873 | Jul 2009 | WO |
2009155833 | Dec 2009 | WO |
Entry |
---|
European Patent Office, “Extended European Search Report,” issued in connection with EP Application No. 10290130.3, dated Aug. 30, 2010, (8 pages). |
Patent Cooperation Treaty, “International Search Report,” issued by the International Searching Authority in connection with PCT application No. PCT/IB2011/051004, mailed Jun. 1, 2011 (4 pages). |
Patent Cooperation Treaty, “Written Opinion of the International Searching Authority,” issued by the International Searching Authority in connection with PCT/IB2011/051004, mailed Jun. 1, 2011 (9 pages). |
“3rd Generational Partnership Project; 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 Generational 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 Generational 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 Generational 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 Generational 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 Generational 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 Generational 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). |
European Patent Office, “Communication pursuant to Article 94(3) EPC,” issued in connection with European Application No. 10290130.3, dated Nov. 13, 2012, (5 pages). |
Patent Cooperation Treaty, “International Preliminary Report on Patentability,” issued by the International Searching Authority in connection with PCT application No. PCT/IB2011/051004, dated Sep. 18, 2012 (9 pages). |
Taiwan Patent Office, “Office Action,” issued in connection with Taiwain Patent Application No. 100108161 on Jul. 19, 2013, 10 pages. |
F. Andreasen, “Session Description Protocol (SDP) Simple Capability Declaration,” Network Working Group, RFC 3407, Oct. 2002, 11 pages. |
“Long Term Evolution Protocol Overview,” Freescale Semiconductor, document No. LTEPTCLOVWWP, Oct. 2008, 21 pages. |
Number | Date | Country | |
---|---|---|---|
20110222492 A1 | Sep 2011 | US |