|Publication number||USRE37301 E1|
|Application number||US 09/235,576|
|Publication date||Jul 31, 2001|
|Filing date||Jan 22, 1999|
|Priority date||Jun 18, 1990|
|Also published as||CA2043705A1, CA2043705C, DE69127140D1, DE69127140T2, EP0462572A2, EP0462572A3, EP0462572B1, US5166929|
|Publication number||09235576, 235576, US RE37301 E1, US RE37301E1, US-E1-RE37301, USRE37301 E1, USRE37301E1|
|Inventors||Wing F. Lo|
|Original Assignee||Nortel Networks Limited|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (11), Non-Patent Citations (1), Referenced by (45), Classifications (16), Legal Events (6)|
|External Links: USPTO, USPTO Assignment, Espacenet|
Many multiple access schemes have been devised to allow a group of terminals to communicate with a central station using a shared channel. One of these schemes, called random multiple access, relies on randomly transmitted messages from a group of terminals to a central station without perfect coordination between terminals. For example, in a cellular radio environment, each cell is served by a base station communicating with multiple mobile stations. Each cell has the use of a set of radio frequency channels. At least one channel is dedicated for the purpose of setting up radio phone calls in each cell. This “setup” channel is shared by all the mobile stations to communicate with the base station. The setup channel is a full duplex channel with separate frequencies in the forward (base to mobile) and reverse (mobile to base) directions. The forward setup channel is used by the base station to transmit messages to all the mobiles. This channel is a broadcast channel in which all the mobile stations can receive all the messages transmitted from the base station. The reverse channel is a random contention multiple access channel, in which mobile stations may transmit messages to the base station with relatively little coordination. The access is random in the sense that mobile stations are not assigned a fixed transmission schedule. The access is based on contention in which mobile stations with messages to transmit will try to seize channel openings as the appear. If multiple mobile stations decide to transmit at the same time, the messages may collide and mutually destroy each other. There is also a possibility that one of the messages is received with significantly higher power than the others and is correctly received at the base station. In any case the mobile stations whose transmissions are not successful have to retransmit after some random delay.
Existing multiple access protocols of this sort include the ALOHA, CSMA, ICSMA-CD access protocols, among others. Because of the random transmission nature and inevitable collisions that may occur, no random access protocols can reach 100% throughput efficiency. The random delay after a collision also introduces additional messaging delay between a terminal and a central station.
In the North American analog cellular system the base station and mobile stations transmit on separate frequencies to form a full duplex channel. The base station broadcasts the status of the multiple access setup channel to all the mobiles communicating with base periodically. A busy/idle bit inserted every 11 bits in the base to mobile transmission indicates if the mobile station (terminal) to base station multiple access channel was busy or idle in the last period. Such timely feedback enables a mobile station to make sure the channel is idle before transmitting again. A mobile station continues to monitor the busy/idle bit during transmission. If the busy/idle bit does not change from indicating idle to indicating busy within a short window at the beginning of a message transmission, the transmitting mobile station assumes a collision and the transmission is immediately aborted. However, the problem associated with this approach is that the busy/idle bit does not distinguish between a collision state and a real idle state. Without such information, the mobile station cannot make more efficient decisions on when to start or abort a transmission. Many of the multiple access protocols have a slotted variation. In a slotted protocol, the channel is divided into fixed size time slots. In the slotted ALOHA protocol, each slot is long enough to include a fixed size message. A variation of the slotted ALOHA called Reservation ALOHA allows a message of multiple slots (words) in length to be transmitted without interruption once the first word of the message is successfully transmitted. In Reservation ALOHA, if a station has successfully transmitted in a predetermined time slot, all the subsequent slots are implicitly reserved for that station until the station stops transmission. The problem with this scheme is that is expands one idle slot to indicate the channel's relinquishment. Such use of channel resources is inefficient.
There is accordingly a need for a new multiple access protocol which will enhance transmission efficiency, while reducing the access delay.
Accordingly, it is an object of the present invention to provide a new access protocol which improves transmission efficiency, while reducing access delay.
Another object of the present invention is to provide a new multiple access protocol in which a short data field is used to send feedback information from the central station to terminals providing information on the status of the access channel.
Yet another object of the present invention is to provide a new multiple access protocol in which a short data field is used in every base to mobile station burst to indicate the relinquishment of the multiple access channel and eliminates the necessary idle slot between messages.
The new access protocol of the present invention utilizes a feedback field to provide the status of the multiple access channel from the base station to the transmitting mobile station to improve performance. This feedback information identifies the outcome of the last mobile to base transmission slot as being either
containing one successful transmission, or
In the case of a field containing one successful transmission, the feedback information also identifies the transmitting mobile station. The detailed feedback information allows all mobiles to make between decisions regarding whether to start a new message transmission or to continue transmission of the current message. This will in turn improve the throughput and delay performance of the protocol.
The current invention also uses a short field in every base to mobile station burst to indicate if the multiple access channel is open for contention in the next slot. This eliminates the necessary idle slot between messages and further enhances the throughput and delay performance of the protocol, especially at transmitting short messages.
Accordingly, it is an aspect of the present invention to provide a method of providing feedback information indicative of the status of a multiple access channel between a group of terminals and a central station, comprising the step of:
forwarding on said access channel, from said central station to said terminals, an information code indicative of the status of said channel and of the outcome of the last terminal to central station message transmission.
According to another aspect of the present invention, there is provided a transmission protocol for providing feedback information indicative of the status of a multiple access channel between a group of terminals and a central station, comprising:
an information code transmitted on said access channel between said central station and said terminals, said information code being indicative of the status of said access channel and of the outcome of the last terminal to central station message transmission.
FIG. 1 is an illustration showing the relative timing of forward and reverse channel transmission bursts according to the access protocol of the present invention;
FIG. 2a is an illustration showing a successful burst transmission without collision on the reverse channel;
FIG. 2b is an illustration of a burst transmission resulting in collision of bursts from two terminals, followed by a successful retransmission;
FIG. 2c is an illustration of burst transmission with one successful and unsuccessful transmission, with retransmission after random delay by the unsuccessful terminal;
FIG. 2d is a flow chart of the present invention showing the method used by a mobile station to transmit a message to the base station.
FIG. 3 is an illustration of the use of the new protocol where multiple access channels are being used.
As indicated above, in a cellular radio environment each cell is served by a base station communicating with multiple mobile stations. The setup channel is a full duplex channel with separate frequencies in the forward (base to mobile) and reverse (mobile to base) directions. The forward setup channel is used by the base station to transmit messages to the mobiles. This channel is a broadcast channel in which all the mobile stations can receive all the messages transmitted from the base station. The reverse channel is a random contention multiple access channel, in which mobile stations may transmit messages to the base station with relatively little coordination.
In the present embodiment of the invention, a new multiple access protocol is used in the setup channel. As shown in FIG. 1, both the forward channel 10 and reverse channel 11 are divided into timeslots. The forward and reverse channel time slots are arranged in such a way that after a mobile station transmits a burst 12 on reverse channel 1, an acknowledgement burst 13 from the base station will be transmitted and received by the mobile station before the mobile transmits burst 14. The time slots need not occupy the complet channel, Duration not used by the forward or reverse channel can be allocated to other services or form other pairs of time division multiple access channels.
For each burst of transmission in both directions, two fields are used to support the multiple access protocol. In the forward direction, these are the forward access/acknowledgement (FAA) field 15 and the forward “more” (FAA) field 16. In the reverse direction, these are the reverse access/acknowledgement (RAA) field 17 and the reverse “more” (RM) field 18. In the reverse channel, the RAA field carries an abbreviated identifier of the mobile station. This identifier need not uniquely identify the mobile station as long as the probability of mis-identification is much less than the probability of correct identification. If the identifier in the RAA field does not uniquely identify the transmitting mobile station, the rest of the message must contain a full identifier which will uniquely identify the mobile station. Messages in either direction may be of one or more bursts (words). The RM is a binary field which is set of Open if the current message is not continued on the next burst, otherwise the RM is set to Reserved.
In the forward direction, the FAA field is sued to reflect the result of access in the last received slot in the reverse channel. If the last received slot i the reverse channel contained a successful transmission burst, the FAA will provide an acknowledgement code which is the same as the content of the RAA field of the last slot received by the base station. If the last reverse channel slot received is idle, the FAA will contain a distinct idle code which is different from all possible abbreviated identities of mobiles. If multiple mobile stations transmitted in the last reverse channel slot resulting in mutual destruction of the collided messages, a distinct Collision code which is different from all possible abbreviated mobile identifies will be transmitted.
The FM field holds a the binary value representing either an Open or Reserved state. The value or state representing Open indicates the next reverse channel slot is available for contention access. The value representing Reserved indicates the next reverse channel slot is reversed for the mobile station whose abbreviated identifier is transmitted in the FAA field of the current forward burst. The base station will set the FAA and FM Fields according to the result of the last reversed slot, as follows:
Last Reverse Access
Channel Slot Status
by radio channel
n/a indicates not applicable.
X indicates don't care.
A mobile station with a message to send to the base station will use the following algorithm to determine when to transmit, as best shown in FIG. 2(d);
1) Wait until the FM field indicates the next slot is open for contention.
2) Transmit the first word of the message in the next reverse slot with RAA set to the mobile station's abbreviated identifier.
3) in the next forward burst check if the FAA field is equal to the mobile station's abbreviated identifier,
continue to transmit the current message in
the consecutive reverse slots.
abort the transmission of the rest of the
message and wait a random period according
to some retransmission algorithm.
go to step 1 and try again.
As an example of implementation, the FAA can be assigned a 7-bit field which can hold an arbitrary value ranging from 0 to 127 (decimal). The abbreviated identifier uses the last two digits of the telephone number of a mobile station. The valid abbreviated identifier therefore can range between 00 (decimal) to 99 (decimal). The idle and Collision codes for the FAA field must be set to number that are greater than 99, since numbers 00 to 99 are reserved for abbreviated identifiers. In this embodiment, an idle code field number of 120 (decimal) and a collision code filed number of 127 (decimal) is used. It will be understood by those knowledgeable in this art that the above idle and collision codes are arbitrary and may be assigned differently. The RAA field can have the same-length as the FAA with a valid abbreviated identifier range of 0 to 99 decimal. Both the RM and FM can be assigned a one bit filed with 0 indicating Open and 1 indicating Reserved.
FIG. 2(a) shows a successful transmission of bursts without collisions. In the forward channel 20, bursts 21 and 22 are transmitted and received to and by mobile stations A, B and C. Mobile A sends a burst 23 to the base station. It contains an abbreviated identifier RAA=72 i.e. The mobile's last two telephone number digits and a reverse field RM=0 indicating only one burst is sent. In the acknowledgement burst 24 sent by the base station, on the forward channel, the FAA filed indicates that transmission was received since station's A abbreviated identifier is transmitted. The FM field is set to 0 indicating to all mobiles that the next reverse channel slot is available for contention access since only one burst was to be sent by station A. Upon receiving burst 24 from the forward channel, mobile station B identifies that the reverse channel is available and sends a burst 25 having a field with the identifier RAA=37 and RM=1. A field with RM =1 indicates that at least one additional burst will be transmitted. The next burst 26 sent on the forward channel 20 by the base station includes an acknowledgement field identifier FAA=37 and a reserved field FM=1 indicating to all mobiles that the next burst is reserved for the mobile with ID 37. Upon receiving burst 26, mobile station B identifies that the previous burst was successfully received by the base station and sends burst 27, again including the identifier RAA =37 and reserved field RM =1. The base station responds again in the forward channel with a similar burst 28. Mobile station B sends it last burst 29 for that message. The burst includes the same identifier field RAA=37 but includes a field RM=0 indicating that again the next reverse channel slot will be available for contention access. The base station responds with a burst 30 indicating to all mobiles that the next reverse channel slot is now available for contention access. If no mobile station sends a burst, the next two bursts 31 and 32 from the base station indicate the status of the channel as being idle.
FIG. 2(b) shows a burst transmission scenario in which a collision destroys messages from mobile station B and C. A subsequent successful retransmission of the messages is also shown. Upon receiving burst 40 from the base station indicating that the channel is idle, station B sends burst 41 and station C sends burst 42. Since both are sent simultaneously, a collision occurs resulting in destruction of the bursts. At the base station, a stats burst 43 indicating that a collision has occurred is transmitted. Upon receipt of burst 43, transmission from both mobiles is terminated. After a randomly selected delay, both mobile stations will try a retransmission of a burst. In the example of FIG. 2(b), mobile station C is the first to retransmit its burst after identifying that the channel is IDLE again. In this example, a one-word message is sent by station C. Again after a random delay, mobile B sends its message, which consist of a two-word message, i.e. bursts 44 and 45.
FIG. 2(c) shows a burst transmission in which a prospective collision event results in the successful transmission of one message to the base station but the loss of the other burst. This is reflected in the next burst transmitted by the base station with the FAA code set to the abbreviated identifier of the successful mobile station (i.e. station A). The above scenario can occur even though both messages where sent at the same time. This is possible if the burst of one station is of much greater relative power than that of the other station. The burst from the station having lower power will be discarded as noise by the base station.
In FIG. 2(C), station A transmits burst 50 and station B transmits burst 51. Since the base station's acknowledgement burst includes identifier 72, station A identifies a successful transmission. However, station B identifies an unsuccessful transmission and therefore terminates the transmission of its second burst. After a random delay, mobile station B will retransmit its message, i.e. bursts 52 and 53.
A typical cellular system 60 in which the present invention may be used is disclosed in FIG. 3. The cellular system 60 is connected to a public telephone network central office (CO) 62. The area served by the cellular system 60 is typically divided into multiple cells 64. Each cell 64 is served by a base station 66. The base stations 66 are connected to a mobile telephone exchange (MTX) 68 via trunk lines 70 that are used to carry both traffic and signaling information. Each cell 64 serves a large number of mobile stations 72 of which only a small fraction would be engaged in conversation at any one time. The mobile telephone exchange 68 is connected to the central office 62 via a trunk line 74.
The present invention is used in the set-up channel between the base station 66 and a mobile station 72. Similarly, it could be used in the communication access channel of trunk line 70 between base station 66 and the mobile telephone exchange 68. Also, between MtX 68 and the central office 62. The protocol of the present invention is thus not limited to either wire or wireless based communication access channels. Therefore, it will be understood to those knowledgeable in the art that, while the invention has been described with reference to a particular embodiment, modifications may be made without departing from the spirit or scope of the present invention.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4352955 *||Jan 30, 1980||Oct 5, 1982||Nippon Electric Co., Ltd.||Control signal transmission system for use in a mobile radio communication system|
|US4356484 *||Aug 8, 1980||Oct 26, 1982||Licentia Patent Verwaltungs-G.M.B.H.||Method for transmitting data in a time multiplex transmission|
|US4477809 *||Jun 18, 1982||Oct 16, 1984||General Electric Company||Method for random-access radio-frequency data communications|
|US4612637 *||Jul 23, 1984||Sep 16, 1986||U.S. Philips Corporation||Multiple-access communications system|
|US4704734 *||Feb 18, 1986||Nov 3, 1987||Motorola, Inc.||Method and apparatus for signal strength measurement and antenna selection in cellular radiotelephone systems|
|US4736371 *||Dec 29, 1986||Apr 5, 1988||Nec Corporation||Satellite communications system with random multiple access and time slot reservation|
|US4759016 *||May 4, 1987||Jul 19, 1988||Nec Corporation||TDMA communication system having common local path medium and local time slot for intraoffice calls|
|US4774707 *||Sep 10, 1986||Sep 27, 1988||General Electric Company||Random access communication system with scheduled data transmission and asynchronous contention scheduling|
|US4774708 *||Dec 22, 1986||Sep 27, 1988||Nec Corporation||Station of a TDMA communication network capable of quickly changing communication traffic without causing an overlap between transmission bursts|
|US4866788 *||Oct 23, 1987||Sep 12, 1989||Michel Mouly||Process for controlling retransmission of messages from transmitting stations belonging to a cellular system|
|US4987571 *||Jul 25, 1989||Jan 22, 1991||Motorola, Inc.||Data communication system with prioritized periodic and aperiodic messages|
|1||*||Datapro Research Corporation, "An Overview of Cellular Telephone Service", Apr. 1988.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6577618 *||Feb 5, 1997||Jun 10, 2003||Telefonaktiebolaget L.M. Ericsson (Publ)||Packet control channel feedback support for contention and reservation based access|
|US6700878 *||Mar 26, 1999||Mar 2, 2004||Koninklijke Philips Electronics N.V.||Communication network with improved access protocol|
|US6954448 *||Feb 1, 2001||Oct 11, 2005||Ipr Licensing, Inc.||Alternate channel for carrying selected message types|
|US6963580 *||Feb 16, 2001||Nov 8, 2005||At&T Corp.||Method and apparatus for controlling access to a communication channel|
|US7457307 *||Aug 3, 2005||Nov 25, 2008||At&T Intellectual Property Ii, L.P.||Method and apparatus for controlling access to a communication channel|
|US7468972 *||Feb 22, 2001||Dec 23, 2008||Hughes Network Systems, Llc||Method and system for providing efficient data transmission based upon a contention protocol|
|US7502351||Sep 26, 2005||Mar 10, 2009||Ipr Licensing, Inc.||Alternate channel for carrying selected message types|
|US7551920 *||Sep 18, 2003||Jun 23, 2009||Sprint Spectrum L.P.||Signal strength-based call forwarding for wireless phones|
|US7881328||Nov 7, 2008||Feb 1, 2011||At&T Intellectual Property Ii, L.P.||Method and apparatus for controlling access to a communication channel|
|US7936728||May 3, 2011||Tantivy Communications, Inc.||System and method for maintaining timing of synchronization messages over a reverse link of a CDMA wireless communication system|
|US7978646 *||Jul 12, 2011||Telefonaktiebolaget Lm Ericsson (Publ)||Hybrid contention-based and schedule-based access to a communication link|
|US7989115||Dec 14, 2007||Aug 2, 2011||Gore Enterprise Holdings, Inc.||Highly stable fuel cell membranes and methods of making them|
|US8134980||May 22, 2007||Mar 13, 2012||Ipr Licensing, Inc.||Transmittal of heartbeat signal at a lower level than heartbeat request|
|US8139546||Apr 27, 2010||Mar 20, 2012||Ipr Licensing, Inc.||System and method for maintaining wireless channels over a reverse link of a CDMA wireless communication system|
|US8155096||Nov 30, 2001||Apr 10, 2012||Ipr Licensing Inc.||Antenna control system and method|
|US8175120||May 8, 2012||Ipr Licensing, Inc.||Minimal maintenance link to support synchronization|
|US8241814||Aug 14, 2012||W. L. Gore & Associates, Inc.||Highly stable fuel cell membranes and methods of making them|
|US8274954||Sep 25, 2012||Ipr Licensing, Inc.||Alternate channel for carrying selected message types|
|US8369277||Mar 13, 2012||Feb 5, 2013||Intel Corporation||Signaling for wireless communications|
|US8437330||May 7, 2013||Intel Corporation||Antenna control system and method|
|US8509268||Dec 22, 2011||Aug 13, 2013||Intel Corporation||Minimal maintenance link to support sychronization|
|US8638877||Nov 29, 2011||Jan 28, 2014||Intel Corporation||Methods, apparatuses and systems for selective transmission of traffic data using orthogonal sequences|
|US8687606||Aug 10, 2012||Apr 1, 2014||Intel Corporation||Alternate channel for carrying selected message types|
|US8792458||Mar 19, 2012||Jul 29, 2014||Intel Corporation||System and method for maintaining wireless channels over a reverse link of a CDMA wireless communication system|
|US8848626||Oct 20, 2010||Sep 30, 2014||Telefonaktiebolaget Lm Ericsson (Publ)||Scheduling retransmissions for contention-based access|
|US9014118||Jan 28, 2013||Apr 21, 2015||Intel Corporation||Signaling for wireless communications|
|US9042400||Jun 30, 2008||May 26, 2015||Intel Corporation||Multi-detection of heartbeat to reduce error probability|
|US9210616||May 16, 2011||Dec 8, 2015||Ipr Licensing, Inc.||Application specific traffic optimization in a wireless link|
|US9225395||Apr 12, 2013||Dec 29, 2015||Intel Corporation||Antenna control system and method|
|US9247510||Dec 20, 2013||Jan 26, 2016||Intel Corporation||Use of correlation combination to achieve channel detection|
|US9301274||Jul 10, 2013||Mar 29, 2016||Intel Corporation||Minimal maintenance link to support synchronization|
|US9307532||Apr 20, 2015||Apr 5, 2016||Intel Corporation||Signaling for wireless communications|
|US20010043618 *||Feb 16, 2001||Nov 22, 2001||Herman Chien||Method and apparatus for controlling access to a communication channel|
|US20020101839 *||Feb 1, 2001||Aug 1, 2002||Tantivy Communications, Inc.||Alternate channel for carrying selected message types|
|US20020114313 *||Feb 22, 2001||Aug 22, 2002||William Walsh||Method and system for providing efficient data transmission based upon a contention protocol|
|US20040009785 *||Mar 26, 2003||Jan 15, 2004||Tantivy Communications, Inc.||Reverse link initial power setting using effective radiated power message to compute path loss|
|US20060018293 *||Sep 26, 2005||Jan 26, 2006||Ipr Licensing, Inc.||Alternate channel for carrying selected message types|
|US20070072036 *||Sep 26, 2005||Mar 29, 2007||Thomas Berta||Solid polymer electrolyte and process for making same|
|US20080229037 *||Dec 4, 2007||Sep 18, 2008||Alan Bunte||Systems and methods for creating copies of data, such as archive copies|
|US20090092155 *||Nov 7, 2008||Apr 9, 2009||At&T Corp||Method and apparatus for controlling access to a communication channel|
|US20090103558 *||Oct 19, 2007||Apr 23, 2009||Zangi Kambiz C||Hybrid Contention-Based and Schedule-Based Access to a Communication Link|
|US20090155662 *||Dec 14, 2007||Jun 18, 2009||Durante Vincent A||Highly Stable Fuel Cell Membranes and Methods of Making Them|
|US20100086675 *||Dec 9, 2009||Apr 8, 2010||Thomas Berta||Solid Polymer Electrolyte and Process for Making Same|
|US20110216707 *||Sep 8, 2011||Ipr Licensing, Inc.||Application specific traffic optimization in a wireless link|
|US20110236793 *||Sep 29, 2011||Durante Vincent A||Highly Stable Fuel Cell Membranes and Methods of Making Them|
|U.S. Classification||370/448, 370/450, 455/517, 370/443, 370/459, 370/447, 455/450, 455/509, 370/348|
|International Classification||H04L12/56, H04W28/08, H04W72/14|
|Cooperative Classification||H04W74/008, H04W74/0833, H04W74/02|
|Dec 23, 1999||AS||Assignment|
Owner name: NORTEL NETWORKS CORPORATION, CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTHERN TELECOM LIMITED;REEL/FRAME:010567/0001
Effective date: 19990429
|Aug 30, 2000||AS||Assignment|
Owner name: NORTEL NETWORKS LIMITED, CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTEL NETWORKS CORPORATION;REEL/FRAME:011195/0706
Effective date: 20000830
Owner name: NORTEL NETWORKS LIMITED,CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTEL NETWORKS CORPORATION;REEL/FRAME:011195/0706
Effective date: 20000830
|Apr 5, 2002||AS||Assignment|
Owner name: JPMORGAN CHASE BANK, TEXAS
Free format text: SECURITY AGREEMENT;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:012745/0929
Effective date: 20020404
|Apr 16, 2002||AS||Assignment|
Owner name: NORTEL NETWORKS LIMITED, CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTEL NETWORKS CORPORATION;REEL/FRAME:012762/0799
Effective date: 20020404
|Apr 27, 2004||FPAY||Fee payment|
Year of fee payment: 12
|Aug 7, 2012||AS||Assignment|
Owner name: APPLE INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ROCKSTAR BIDCO, LP;REEL/FRAME:028741/0644
Effective date: 20120511