|Numéro de publication||US4987571 A|
|Type de publication||Octroi|
|Numéro de demande||US 07/384,611|
|Date de publication||22 janv. 1991|
|Date de dépôt||25 juil. 1989|
|Date de priorité||25 juil. 1989|
|État de paiement des frais||Payé|
|Numéro de publication||07384611, 384611, US 4987571 A, US 4987571A, US-A-4987571, US4987571 A, US4987571A|
|Inventeurs||William D. Haymond, Roderick J. Sillett, Robert M. Lukas|
|Cessionnaire d'origine||Motorola, Inc.|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (5), Référencé par (116), Classifications (8), Événements juridiques (4)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
The present invention relates generally to communication systems and, more particularly, to a slotted CSMA communication system arrangement wherein periodic and aperiodic messages are prioritized prior to transmission by a plurality of remote terminal units while eliminating disruptive collisions therebetween.
Communications which process data information are enjoying ever increasing usage. Data only systems are becoming more prevalent but others may accommodate both data and voice. Typically such data systems comprise a base station with full duplex capability, a network control processor (NCP), a system host computer, and a plurality of portable radio data terminals operating essentially in half duplex mode.
In these data systems, suitable channel access protocol techniques are required to minimize interference as between the remote radio data terminals themselves and to keep the system operating at optimum efficiency. Many methods, or protocols, have been developed to address this problem, all with certain advantages and certain disadvantages.
For example, one such protocol that has enjoyed wide-spread application, is known in the art and is commonly referred to in the literature as "non-persistent busy tone (bit) multiple access". In essence, this protocol arrangement permits channel contention between radio data terminals and, when one such terminal gains channel access and begins to transmit data, the central station or controller informs/advises the other terminals in the system of such circumstance by way of setting "inhibit bits" at predetrermined locations or positions in the outbound data stream. When a particular data terminal encounters these inhibit bits, it waits for some period of time, for example, a random time, before contending again for access to the channel. In this way, the system operates with minimum or at least reduced interference and an orderly process is established for all participating data terminals in the system to utilize the available system capacity.
This system control technique, also referred to as slotted CSMA contention protocol, has a number of variations, such as non-persistent slotted CSMA, persistent slotted CSMA, p-persistent slotted CSMA, and virtual time slotted CSMA. In any event, however, this CSMA contention protocol arrangement, and its many variations, effectively schedule transmissions from the remote device population to minimize collisions between messages on the inbound channel and also minimize the unused space between messages. However, such collisions do occur and diminish the efficiency and reliability of the system. Moreover, all such messages are treated equally and the remote unit wishing to transmit, whether it be a reocurring or periodic, message, or simply an aperiodic message, must nevertheless contend for access to the inbound channel with all of the other remote units.
It will be appreciated then, that what is needed is a protocol or traffic control arrangement which includes mechanisms for prioritizing access to the inbound channel so as to prevent these destructive and unwanted collisions between inbound messages, whether they be periodic or aperiodic and to arrange the traffic in such a way that the aperiodic message may be utilized to fill in the gaps between the other or regularly occurring messages being transmitted by the system data terminals on the inbound channel.
Accordingly, it is an object of the present invention to provide a radio data communication system operating with a channel access protocol wherein the messages transmitted by a plurality of remote units are prioritized as between periodic and aperiodic messages.
A more particular object of the present invention is to provide a radio data communication system of the foregoing type wherein the long periodic messages are temporarily, but selectively assigned to a particular time slot so as to avoid completely collisions between respective periodic messages and wherein collisions between periodic and aperiodic as well as aperiodic to aperiodic are effectively minimized by such prioritization technique as well.
In practicing the invention, a radio data system is provided which utilizes inbound and outbound communication channels and wherein a slotted CSMA contention arrangement is effected as between a plurality of remote radio data terminal units transmitting on the inbound channel, which includes the inbound channel being divided into a plurality of standardized microslots and wherein the outbound channel is adapted to convey the inbound channel busy status information. This system arrangement includes means for effectively prioritizing access to the inbound channel between a mixture of long periodic messages and shorter aperiodic messages. Priority is given to the longer periodic messages on a selectively assigned minor or subframe in a set major frame so that collisions between periodic messages are eliminated completely. Further, additional collisions between such periodic messages and those of an aperiodic nature, or even between the latter, as between themselves, are effectively minimized. Moreover, the long periodic messages are guaranteed access to the channel within a predetermined maximum channel access time; and the efficiency of the system is further optimized by using the shorter aperiodic messages to fill the gaps between the longer periodic messages.
The features of the present invention which are believed to be novel are set forth with particularity in the appended claims. The invention, itself, however, together with further objects and advantages thereof, may best be understood by reference to the accompanying drawings, in which:
FIG. 1 is a block diagram of a data communication system incorporating the advantageous characteristics of the present invention;
FIG. 2 is a graphic representation of what typical message traffic may be observed on inbound and outbound channels;
FIG. 3 is a graphic representation of the structure of the inbound and outbound channels showing the division into major frames, minor frames, microslots and data words;
FIG. 4 is a graphic representation of the outbound channel at the data word level showing the inclusion of busy status bits interspersed with the data words;
FIG. 5 is a graphic representation of the events by way of example occurring on a time sequence basis for a remote terminal monitoring the outbound channel and transmitting an aperiodic message at the appropriate time;
FIG. 6 is a similar time sequence diagram showing inter alia, a remote terminal monitoring the outbound channel and transmitting a periodic transmission at the appropriate time;
FIG. 7 is a still another time sequence diagram showing both aperiodic and periodic messages being transmitted by remote terminals at the appropriate but permitted time; and
FIG. 8 is a flow chart showing how the periodic and aperiodic messages are handled by a remote terminal unit in accordance with the present invention.
Referring now to the drawings, a data radio system 10 is referenced in FIG. 1, which may be considered as embodying the advantageous operating characteristics of the present invention. The system has a centrally located base station 12, comprising a transmitter 14 and receiver 16, operating in full duplex mode and which communicates with, by modem 18, and is controlled by a network control processor (NCP) 20. The NCP in turn communicates with the host computer as indicated. A plurality of portable radio data terminals 24 are also part of the system 10, operating in half duplex mode, which receive messages on the outbound channel F2 and transmits messages to the base station 12 on the inbound channel F1.
To manage the data traffic on the referenced communication system 10, of the type described, a channel access protocol must be adopted and applied. The radio data terminals 24 individually seek channel access by transmitting data packets on the inbound channel. The protocol arrangement begins by having the base station/NCP 20 inform/advise the other (and listening) system terminals 24 of this circumstance and by setting busy bits located at predetermined positions in the outbound stream. These bits may be referred to as "inhibit bits" and correspond to a conventional busy tone. If another terminal has a data message to be sent, it first monitors the outbound channel and will sense these inhibit bits when set. Upon such occurrence, the terminal waits a predetermined time (usually random), after which it monitors the channel and retries. This predetermined time is referred to as inhibit delay time and may be set somewhere between 0 and a given time T. At some point, perhaps after repeated attempts, the referenced terminal will find or sense no inhibit bits, indicating the channel is free and will then commence to transmit its intended data message packet.
The graphic representation of radio data traffic operating with the referenced CSMA contention technique is shown in FIG. 2. Messages are shown as occurring on both inbound and outbound channels. Without more, however, it will be noted that, for the inbound channel, there will be gaps between messages, such as indicated at 30 and 32, whenever one radio data terminal has finished transmitting its messages and another terminal has not requested channel access. At other times, more than one data terminal will attempt to transmit its appropriate data packet at the same time to request channel access, resulting in destructive collisions such as represented at reference 34.
The system obviously would be more effective, at least in terms of utilization, if a terminal would transmit its message, when channel access is gained, completely and without interruption. However, for long messages, channel access would then be denied to other contending data terminals for unacceptably long periods of time. On the other hand, the transmitting of such long messages in segments subjects such attempted periodic segment transmission to destructive collisions between those segments and messages of other contending terminal units. Moreover, gaps in message transmissions would still likely occur representing less than full channel utilization. The former represents less than effective traffic control to prevent message collisions and the latter is less than an optimum plan for scheduling of messages.
For any high performance contention technique or protocol to be effective, it will be appreciated, that the system remote data terminals transmitting on the inbound channel must be carefully controlled and coordinated to minimize the gaps between messages that may otherwise occur, as well as preventing any disruptive collisions between any two such remote terminals attempting to transmit at the same time.
A slotted CSMA contention protocol has been developed in accordance with the present invention which advantageously addresses the foregoing problems. In the present arrangement, an effective mechanism is provided for mixing long periodic messages with somewhat shorter aperiodic messages, and wherein the long periodic messages are given priority of transmission over the aperiodic type. Moreover, the aperiodic messages are utilized to more effectively fill in the gaps between such periodic messages to enhance system channel utilization.
In the present system, the inbound and outbound channels are first divided in the time domain into major frames, as illustrated in FIG. 3. Each major frame is then divided into small n minor frames such as indicated at 40. The minor frames are in turn divided into microslots such as shown at 42. Each microslot is then divided further into data words referenced at 44. For the inbound channel, the microslot contains only data words. However, as will be seen in FIG. 4, for the outbound channel the microslot may contain both data words 44 interspersed with busy bits 46.
Accordingly, the various remote radio data terminals 24 are effectively synchronized to these microslots 42 by requiring such remote units 24 to transmit only at the beginning of a particular microslot. The length of the microslot is typically set to be slightly longer in interval than the inherent time delay between a remote data terminal beginning transmission and any other such remote terminal monitoring the outbound channel and noting the busy status indicator go active (presence of busy bits). This synchronization is achieved over the outbound channel by the central base station station/controller, beginning a new outbound message only at the start of a microslot. Since all messages begin with a synchronization bit sequence, this sequence, when received, establishes the basic microslot timing reference. The remote radio data terminals may then keep their own internal timing, which may then be adjusted as required each time an outbound message is achieved.
Since by system design, message transmissions begin only at the start of a microslot 42, and with the microslot length being longer than the time required for the subsequent change in inbound channel status to be reflected in the busy status bits transmitted on the outbound channel, the busy channel status is likely to change during a microslot and is stable only at the end of a microslot. Remote devices 24 must sense busy status at the end of a microslot 42, and ignore busy status bits earlier in the microslot, since there is no relevant information to be gained from the presence of any busy bits at that time. It is important to minimize the possibility of channel errors causing a false busy bit inactive indication, which in turn could result in a remote terminal transmitting when the channel is already busy, and thus colliding both messages. To prevent this, the remote terminal 24 reads the last m busy bits prior to the microslot boundary, and requires that all m busy bits be inactive before the channel is considered to be not busy. It will be noted that if PE is the probability of a bit error on the channel, then the probability that m busy bits are all in error is (PE)m. The value of m is a system parameter which is configured based on the expected bit error rate of the outbound channel.
Another important aspect of the present invention is the provision for prioritizing messages. This prioritization is effected between long periodic messages and somewhat shorter in length aperiodic messages. The long message may be considered as one extending in duration longer than one minor frame 40. A message longer than this referenced time period must be split up into segments, each lasting for one minor frame and then transmitted on a regularly occurring time slot. Hence, the reference to the same as a periodic message. Aperiodic messages are those of one minor frame duration or less.
Message priority is achieved by permitting the periodic message transmission to begin at the start of the first microslot 42 after the channel is sensed to be not busy. If the busy status is active at the end of the second microslot, indicating a periodic message transmission has begun elsewhere, the remote terminal desiring to transmit the aperiodic message must reschedule its transmission.
Whether periodic or aperiodic in nature, a message transmission must begin at the start of a microslot boundary when the channel is not busy. For transmitting periodic messages, the only requirement is that the previous microslot show the inbound channel to be not busy. For aperiodic message, having a further requirement is imposed, namely, that there be two consecutive microslot showing a not busy status immediately prior to the start of the transmission of the message.
FIG. 5 shows, as an example, the time sequence of events that may occur for the transmission of an aperiodic message. As illustrated, line 1 indicates the minor frame under consideration; line 2, the number of the microslot; line 3, the status of the so numbered microslots; and line 4, the timing of the referenced messages. Accordingly, a remote device or terminal is shown as actively transmitting a message on the inbound channel during microslots 131 and 132. The busy status indicator appropriately showing a busy status. Shortly after that message ends, the busy status indicator changes state to reflect the availability of the channel. Other remote radio terminals examining the presence of busy bits at the end of microslots 131 and 132 would find them present but would show an absence thereof at the end of microslot 133 and 134, indicating that the channel is not busy. Such remote terminals 24 desiring to transmit aperiodic messages will see two successive microslots with the busy bits inactive and thus free to begin a transmission. In the example of FIG. 5, remote terminal X has a scheduling algorithm which permits the message transmission to begin at the start of microslot 134. Since the message to be transmitted is aperiodic in nature, the remote terminal must wait one further microslot during which the busy status is inactive before transmitting at the start of microslot 135. If microslot 134 had a busy status active indicating that the inbound channel was in fact occupied or busy, then terminal X would be forced to reschedule its transmission to some other time. Also, in FIG. 5, and as by an example, remote terminal Y is shown as beginning transmission at the start of the second microslot following the cessation of transmission by remote terminal X which is also the beginning of minor frame A+1, which is its assigned time slot.
It should be noted that remote terminals transmitting only aperiodic messages need not be aware that the channel is in fact available for periodic message transmission and do not need to synchronize to major frame or minor frame boundaries. On the other hand, very long messages from computers or digitized voice conversations that extend beyond a duration of one minor frame must be divided into segments each one frame long. For the source device, i.e., the base station/controller 12, the effective bit rate over the channel becomes the raw channel rate divided by n, the number of minor frames in a major frame. The advantage of this approach is that while the remote source device is guaranteed periodic channel access and a certain average bit rate over the channel, transmission does not permit access to the channel by others. A number of remote source devices which can gain access to the inbound channel during a major frame in this fashion is simply equal to the number of minor frames per major frame, or n devices. Again as an example, this could permit n users to talk over the channel simultaneously using digital voice. The effect would be similar to using n independent channels, one per voice user. Alternatively, it could permit the same number of computers to access the channel on an equal basis, not one computer blocking other computers from accessing the channel. Periodic message containing digital voice information is time critical in nature, hence periodic messages are given priority over aperiodic messages.
For a remote radio data terminal to transmit a periodic message, it must first transmit an aperiodic data packet or message to the central device requesting permission to transmit a periodic message. The central station/controller 12 responds either negatively or affirmatively with another aperiodic message transmitted over the outbound channel. Assuming the response is affirmative, the aperiodic response message will contain a time stamp which indicates the minor frame being assigned and its location in terms of microslots from the initial aperiodic request. The remote terminal is enabled thereby to count down the microslots as instructed and marks the referenced time accordingly. This time marks the start of the minor frame assigned to that remote device for periodic messages and it will thereafter attempt the periodic transmission in the same manner as an aperiodic transmission with the exception that, instead of using the scheduling algorithm that would otherwise obtain, it begins the transmission on the next microslot after sensing the channel being not busy. The time marked represents the start of the minor frame reserved for that remote terminal. From that single time mark, the remote terminal thereafter knows the start of its minor frame in that major frame and every major frame thereafter and will retain the same until the message is completed and the reserved time slot is thereupon withdrawn for use elsewhere.
FIG. 6 is a graphic representation illustrating the events by way of example that may surround the transmission of a periodic message as initiated by remote terminal X. The central controller 12 gives the remote terminal a time mark which allows it to locate the start of minor frame A, for example, which is assigned to the terminal for periodic transmissions during that time slot for each major frame. This assignment prevents entirely any collisions between periodic transmissions. Since microslot 133 preceding the start of the minor frame A is not busy, remote terminal X may begin its transmission at the start of microslot 134, as indicated. In the example given, the transmission ends one microslot prior to the end of the minor frame A, resulting in the last microslot of the frame showing a not busy status. This permits remote terminal Y, which is assigned minor frame A+1, in the example being considered, to begin its transmission at the start of that referenced frame.
Since no messages are occupying the inbound channel during microslots 131 through 133, it may be possible for an aperiodic message transmission to begin during microslot 134 and collide with the prioritized periodic transmission under consideration. Accordingly, to prevent this, and to give priority to the assigned periodic transmission, the central station/controller 12 sets the channel status to busy during microslot 132, even though the channel is not busy. This effectively prevents an aperiodic message transmission during the duration of microslot 134, but still permits the periodic transmission, and thereby effectively guarantees that a collision between aperiodic and periodic message will in fact not occur.
FIG. 7 is a similar graphic representation intended to illustrate the circumstance in which an aperiodic message transmission may begin in microslot 132, two microslots prior to the start of the assigned minor frame A. This is the last microslot in which a conflicting aperiodic message could begin. In the worst case, an aperiodic message of maximum length, i.e., one minor frame, ends two microslots prior to the start of the next minor frame. This still permits the assigned periodic transmission to begin one microslot prior to the start of the next minor frame, and thereby avoid the collision with another periodic message assigned to the next minor frame. However, it will be noted that it also delays both periodic transmissions by one minor frame less one microslot, which in fact is the maximum delay possible under the present arrangement. If all minor frames are assigned, then all remote terminals transmitting periodic messages will experience this delay until such time as one minor frame becomes free. At that time, the remaining terminals transmitting periodic messages will, in the absence of aperiodic message traffic have an opportunity to begin their transmissions at the start of their assigned minor frame, and the referenced delay no longer is present. In the presence of an aperiodic message traffic, delays obviously then will vary between zero to the maximum delay described hereinabove.
When a remote terminal has completed its sequence of periodic transmission, it transmits a short control message to the central station/controller 12 indicating that it has no further need of the assigned minor frame. At this time, the minor frame is then free to be assigned to some other remote terminal. If this control message is lost or corrupted on the channel, provision is made in the central station/controller to automatically reassign the minor frame if it has not been used for appropriate time period, adjustable, of course, to meet the desired operating conditions.
FIG. 8 is a flow chart to indicate in somewhat simplistic form the manner in which periodic and aperiodic messages may be handled by the respective remote radio data terminals 24. When a remote terminal has a periodic message ready to transmit, it waits for its assigned minor frame such as indicated at step 54, after which it must wait again for one not busy microslot at step 56. It may then begin the periodic transmission at the start of the next microslot as shown at step 58.
A remote device with an aperiodic message ready to transmit contends for the channel by transmitting the appropriate data packet after which the CSMA scheduler at step 60, and depending on the nature thereof (nonpersistent, persistent, P-persistent, virtual time, or the like) delays the transmission. At the end of this delay, the remote terminal waits for two consecutive not busy microslots at step 62 and then is permitted to begin its transmission at the start of the next microslot as before at step 58.
Accordingly, in this manner, a radio data communication system is provided with a slotted CSMA protocol arrangement wherein the inbound and outbound channels are divided into frames and microslots and wherein provision is made to effectively prioritize between periodic and aperiodic messages. By the described arrangement herein, the collision between any periodic messages are eliminated completely. Moreover, such collisions between periodic and aperiodic as well as between aperiodic messages themselves are substantially minimized. Further, the aperiodic messages are scheduled in a manner wherein the gaps that would otherwise obtain between the occurrence of messages on the inbound channel are effectively reduced to thereby increase the optimum efficiency of the system as a whole.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US4352183 *||29 oct. 1980||28 sept. 1982||U.S. Philips Corporation||Information transmission system|
|US4516239 *||15 mars 1982||7 mai 1985||At&T Bell Laboratories||System, apparatus and method for controlling a multiple access data communications system including variable length data packets and fixed length collision-free voice packets|
|US4612637 *||23 juil. 1984||16 sept. 1986||U.S. Philips Corporation||Multiple-access communications system|
|US4646082 *||14 sept. 1984||24 févr. 1987||Motorola, Inc.||Inbound acknowledgement stack|
|US4757460 *||14 juin 1985||12 juil. 1988||Zenith Electronics Corporation||Communications network with individualized access delays|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US5124985 *||6 déc. 1989||23 juin 1992||Small Power Communication Systems Research Laboratories Co., Ltd.||Radiocommunication system using time-division digital frames|
|US5166929 *||18 juin 1990||24 nov. 1992||Northern Telecom Limited||Multiple access protocol|
|US5173899 *||28 nov. 1988||22 déc. 1992||British Telecommunications Public Limited Company||Tdma communications network of transmitting information between a central station and remote stations|
|US5214647 *||8 févr. 1991||25 mai 1993||Nec Corporation||CSMA type communication system|
|US5251209 *||28 mars 1991||5 oct. 1993||Sprint International Communications Corp.||Prioritizing attributes in integrated services networks|
|US5329531 *||18 juin 1993||12 juil. 1994||Ncr Corporation||Method of accessing a communication medium|
|US5384775 *||8 déc. 1993||24 janv. 1995||Micom Communications Corp.||Apparatus for, and method of, packing and unpacking information in transmission lines|
|US5420851 *||24 nov. 1993||30 mai 1995||At&T Corp.||Method of multiple access|
|US5436901 *||25 févr. 1994||25 juil. 1995||Otis Elevator Company||Synchronous time division multiplexing using jam-based frame synchronization|
|US5439075 *||9 mars 1994||8 août 1995||Otis Elevator Company||Elevator active suspension system|
|US5481537 *||31 mars 1994||2 janv. 1996||Crisler; Kenneth J.||Transmission signalling technique for a reservation request|
|US5535207 *||20 mai 1994||9 juil. 1996||Motorola, Inc.||Method of dynamically allocating time slots on a packet data communications channel|
|US5561669 *||26 oct. 1994||1 oct. 1996||Cisco Systems, Inc.||Computer network switching system with expandable number of ports|
|US5572201 *||5 août 1994||5 nov. 1996||Federal Signal Corporation||Alerting device and system for abnormal situations|
|US5586150 *||24 nov. 1993||17 déc. 1996||Rajupandaram K. Balasubramaniam||Method and apparatus for symbol synchronization in multi-level digital FM radio|
|US5594720 *||27 déc. 1994||14 janv. 1997||Lucent Technologies Inc.||Multiple access cellular communication with dynamic slot allocation and reduced co-channel interferences|
|US5602836 *||27 déc. 1994||11 févr. 1997||Lucent Technologies Inc.||Multiple access cellular communication with circular interleaving and reduced dropped-packet runlengths|
|US5619531 *||14 nov. 1994||8 avr. 1997||Research In Motion Limited||Wireless radio modem with minimal interdevice RF interference|
|US5710979 *||28 sept. 1995||20 janv. 1998||Nec Corporation||Monitoring a local station with first and second messages used when the local station is in normal operation and is not and is busy|
|US5727020 *||13 nov. 1996||10 mars 1998||Research In Motion Limited||Wireless radio modem with minimal interdevice RF interference|
|US5768254 *||29 sept. 1995||16 juin 1998||Lucent Technologies Inc.||Multiple access cellular communication with signal cancellation to reduce co-channel interference|
|US5818830 *||29 déc. 1995||6 oct. 1998||Lsi Logic Corporation||Method and apparatus for increasing the effective bandwidth of a digital wireless network|
|US5896561 *||23 déc. 1996||20 avr. 1999||Intermec Ip Corp.||Communication network having a dormant polling protocol|
|US5917854 *||20 août 1997||29 juin 1999||Research In Motion Limited||Wireless radio modem with minimal interdevice RF interference|
|US6011784 *||18 déc. 1996||4 janv. 2000||Motorola, Inc.||Communication system and method using asynchronous and isochronous spectrum for voice and data|
|US6046993 *||7 sept. 1995||4 avr. 2000||Telefonaktiebolaget Lm Ericsson||Method to adapt a synchronous transmission|
|US6049548 *||28 avr. 1997||11 avr. 2000||Stanford Telecommunications, Inc.||Multi-access CS-P/CD-E system and protocols on satellite channels applicable to a group of mobile users in close proximity|
|US6181947 *||23 févr. 1998||30 janv. 2001||U.S. Philips Corporation||System for the wireless transmission of a frame-synchronized signal between a radio base station and at least one mobile terminal|
|US6236662 *||4 mai 1998||22 mai 2001||Bae Systems Aerospace Inc.||Multirate time reservation multi-access protocol|
|US6246693 *||22 janv. 1999||12 juin 2001||Virginia Tech Intellectual Properties, Inc.||One-way packet communication channel with retransmissions|
|US6256319 *||28 févr. 1997||3 juil. 2001||Avaya Technology Corp.||“Plug and play” telephone system|
|US6370123||21 janv. 1998||9 avr. 2002||Lucent Technologies, Inc.||Method and system for half-duplex wireless communication|
|US6430158 *||19 janv. 1999||6 août 2002||Sony Corporation||Wireless communication method, wireless communication apparatus and wireless communication control apparatus|
|US6505052 *||1 févr. 2000||7 janv. 2003||Qualcomm, Incorporated||System for transmitting and receiving short message service (SMS) messages|
|US6614773 *||2 déc. 1997||2 sept. 2003||At&T Corp.||Packet transmissions over cellular radio|
|US6754196||20 avr. 1998||22 juin 2004||Lsi Logic Corporation||Method and apparatus for increasing the effective bandwidth within a digital wireless network|
|US6895249 *||10 juil. 2001||17 mai 2005||Qualcomm Incorporated||Method and apparatus for broadcasting position location data in a wireless communication system|
|US6973056||9 juil. 2001||6 déc. 2005||Sgs-Thomson Microelectronics S.R.L.||Information transmitting and receiving method and corresponding transmitter and receiver|
|US7099671 *||25 oct. 2001||29 août 2006||Texas Instruments Incorporated||Collaborative mechanism of enhanced coexistence of collocated wireless networks|
|US7116707 *||5 nov. 1998||3 oct. 2006||Cisco Technology, Inc.||Modem failover without call loss|
|US7215681||11 sept. 2002||8 mai 2007||Itt Manufacturing Enterprises Inc.||Adaptive channel access for carrier sense multiple access based systems|
|US7383038||18 juil. 2003||3 juin 2008||Broadcom Corporation||Modular, portable data processing terminal for use in a radio frequency communication network|
|US7386002||22 janv. 2004||10 juin 2008||Broadcom Corporation||Redundant radio frequency network having a roaming terminal communication protocol|
|US7535921||9 sept. 2005||19 mai 2009||Broadcom Corporation||Redundant radio frequency network having a roaming terminal communication protocol|
|US7537167||19 juin 2000||26 mai 2009||Broadcom Corporation||Modular, portable data processing terminal for use in a radio frequency communication network|
|US7548553||9 sept. 2005||16 juin 2009||Broadcom Corporation||Redundant radio frequency network having a roaming terminal communication protocol|
|US7586893 *||12 nov. 2002||8 sept. 2009||Sony Corporation||Radio communication system, radio communication control method, radio communication apparatus, control method for radio communication apparatus, and computer readable medium utilizing a divided transmission frame|
|US7633919||24 oct. 2006||15 déc. 2009||Broadcom Corporation||Communication network providing wireless and hard-wired dynamic routing|
|US7688845 *||4 avr. 2005||30 mars 2010||Abb Oy||Method and arrangement of arranging traffic in telecommunications system|
|US7706396 *||26 mai 2004||27 avr. 2010||Abb Oy||Method and device for data transfer in telecommunication system|
|US7757956||25 juil. 2006||20 juil. 2010||Broadcom Corporation||Modular, portable data processing terminal for use in a radio frequency communication network|
|US7853254||3 juin 2008||14 déc. 2010||Broadcom Corp.||Modular, portable data processing terminal for use in a radio frequency communication network|
|US7873739 *||19 nov. 2004||18 janv. 2011||Honeywell International Inc.||Voting mechanism for transmission schedule enforcement|
|US7907577||13 mai 2002||15 mars 2011||Broadcom Corporation||Communication network providing wireless and hard-wired dynamic routing|
|US7916747||15 mai 2008||29 mars 2011||Broadcom Corporation||Redundant radio frequency network having a roaming terminal communication protocol|
|US7983231 *||28 sept. 2007||19 juil. 2011||At&T Intellectual Property Ii, L.P.||Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions|
|US7983232||28 sept. 2007||19 juil. 2011||At&T Intellectual Property Ii, L.P.||Wireless LANs and neighborhood capture|
|US7992788||26 mai 2009||9 août 2011||Broadcom Corporation||Method used by a communication device for use in a communication channel|
|US7995544 *||28 sept. 2007||9 août 2011||At&T Intellectual Property Ii, L.P.||Wireless LANs and neighborhood capture|
|US8064415||13 juil. 2007||22 nov. 2011||At&T Intellectual Property Ii, L.P.||Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions|
|US8068449||29 nov. 2011||At&T Intellectual Property Ii, L.P.||Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation|
|US8068470||29 nov. 2011||At&T Intellectual Property Ii, L.P.||Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions|
|US8111682||23 juil. 2007||7 févr. 2012||At&T Intellectual Property Ii, L.P.||“Shield”: protecting high priority channel access attempts in overlapped wireless cells|
|US8130770||1 oct. 2007||6 mars 2012||At&T Intellectual Property Ii, L.P.||Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation|
|US8315274 *||29 mars 2006||20 nov. 2012||Honeywell International Inc.||System and method for supporting synchronous system communications and operations|
|US8532079||15 nov. 2011||10 sept. 2013||At&T Intellectual Property Ii, L.P.||Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions|
|US8649321||15 nov. 2011||11 févr. 2014||At&T Intellectual Property Ii, L.P.||Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation|
|US8687642||21 nov. 2011||1 avr. 2014||At&T Intellectual Property Ii, L.P.|
|US8699510||6 déc. 2011||15 avr. 2014||At&T Intellectual Property Ii, L.P.||‘Shield’: protecting high priority channel access attempts in overlapped wireless cells|
|US8913597||15 nov. 2011||16 déc. 2014||AT&T Intellectual Property II, L.P. via a transfer from AT&T Corp.||Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions|
|US9179477||10 févr. 2014||3 nov. 2015||At&T Intellectual Property Ii, L.P.|
|US9191971||14 avr. 2014||17 nov. 2015||At&T Intellectual Property Ii, L.P.||‘Shield’: protecting high priority channel access attempts in overlapped wireless cells|
|US20020072378 *||10 juil. 2001||13 juin 2002||Peter Gaal||Method and apparatus for broadcasting position location data in a wireless communication system|
|US20020097741 *||9 juil. 2001||25 juil. 2002||Maurizio Tonella||Information transmitting and receiving method and corresponding transmitter and receiver|
|US20030010736 *||10 juil. 2001||16 janv. 2003||Richard Hope||Drying rack attachable to a dryer door|
|US20030072295 *||13 déc. 2002||17 avr. 2003||Maxemchuk Nicholas Frank||Packet transmissions over cellular radio|
|US20030083095 *||25 oct. 2001||1 mai 2003||Jie Liang||Collaborative mechanism of enhanced coexistence of collocated wireless networks|
|US20030091019 *||12 nov. 2002||15 mai 2003||Sony Corporation||Radio communication system, radio communication control method, radio communication apparatus, control method for radio communication apparatus, and computer program|
|US20030112767 *||13 mai 2002||19 juin 2003||Meier Robert C.||Communication network providing wireless and hard-wired dynamic routing|
|US20040018851 *||18 juil. 2003||29 janv. 2004||Koenck Steven E.||Modular, portable data processing terminal for use in a radio frequency communication network|
|US20040047314 *||11 sept. 2002||11 mars 2004||Li Chris Cho-Pin||Adaptive channel access for carrier sense multiple access based systems|
|US20040169583 *||22 janv. 2004||2 sept. 2004||Meier Robert C.||Redundant radio frequency network having a roaming terminal communication protocol|
|US20040218619 *||26 mai 2004||4 nov. 2004||Kaj Salo||Method and device for data transfer in telecommunication system|
|US20050169299 *||4 avr. 2005||4 août 2005||Kaj Salo||Method and arrangement of arranging traffic in telecommunications system|
|US20050239474 *||25 oct. 2001||27 oct. 2005||Jie Liang||Collaborative mechanism of enhanced coexistence of collocated wireless networks|
|US20050278457 *||19 nov. 2004||15 déc. 2005||Honeywell International Inc.||Voting mechanism for transmission schedule enforcement|
|US20060007951 *||9 sept. 2005||12 janv. 2006||Meier Robert C||Redundant radio frequency network having a roaming terminal communication protocol|
|US20060062240 *||9 sept. 2005||23 mars 2006||Meier Robert C||Redundant radio frequency network having a roaming terminal communication protocol|
|US20060176896 *||10 févr. 2005||10 août 2006||Callaway Edgar H Jr||Method and apparatus for transmitting data within a communication system|
|US20070001007 *||25 juil. 2006||4 janv. 2007||Koenck Steven E||Modular, Portable Data Processing Terminal for Use in a Radio Frequency Communication Network|
|US20070121529 *||24 oct. 2006||31 mai 2007||Broadcom Corporation||Communication network providing wireless and hard-wired dynamic routing|
|US20070133430 *||4 déc. 2006||14 juin 2007||Kim Dae H||Periodic media reservation method for QoS data having periodic transmission characteristic in wireless local area network|
|US20070230501 *||29 mars 2006||4 oct. 2007||Honeywell International, Inc.||System and method for supporting synchronous system communications and operations|
|US20070263581 *||23 juil. 2007||15 nov. 2007||Mathilde Benveniste||"shield": protecting high priority channel access attempts in overlapped wireless cells|
|US20080013508 *||13 juil. 2007||17 janv. 2008||Mathilde Benveniste||Fixed deterministic post-backoff for cyclic prioritized multiple access (cpma) contention-free sessions|
|US20080013509 *||13 juil. 2007||17 janv. 2008||Mathilde Benveniste||Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (cpma) contention-free sessions|
|US20080013515 *||28 sept. 2007||17 janv. 2008||Mathilde Benveniste||Staggered startup for cyclic prioritized multiple access (cpma) contention-free sessions|
|US20080013522 *||28 sept. 2007||17 janv. 2008||Mathilde Benveniste||Wireless lans and neighborhood capture|
|US20080019329 *||1 oct. 2007||24 janv. 2008||Mathilde Benveniste||Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation|
|US20080019343 *||28 sept. 2007||24 janv. 2008||Mathilde Benveniste||Wireless lans and neighborhood capture|
|US20080274731 *||3 juin 2008||6 nov. 2008||Koenck Steven E||Modular, portable data processing terminal for use in a radio frequency communication network|
|US20080285489 *||15 mai 2008||20 nov. 2008||Broadcom Corporation||Redundant radio frequency network having a roaming terminal communication protocol|
|US20080291873 *||20 mai 2008||27 nov. 2008||Mathilde Benveniste||Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation|
|US20090221235 *||5 févr. 2009||3 sept. 2009||Qualcomm Incorporated||Dynamic reference frequency for fractional-n phase-locked loop|
|US20100082860 *||26 sept. 2008||1 avr. 2010||Yahoo! Inc.||System and method for updating the status of an asynchronous, idempotent message channel|
|US20100282852 *||20 juil. 2010||11 nov. 2010||Koenck Steven E||Modular, portable data processing terminal for use in a radio frequency communication|
|USRE37301 *||22 janv. 1999||31 juil. 2001||Nortel Networks Limited||Multiple access protocol|
|DE19526549B4 *||20 juil. 1995||5 avr. 2007||Motorola Ltd., Basingstoke||Kommunikationsvorrichtung und Verfahren mit adaptiver Burstübertragungszeit|
|DE102014214459A1 *||23 juil. 2014||28 janv. 2016||Bayerische Motoren Werke Aktiengesellschaft||Kollisionsfreies Medienzugriffsverfahren|
|EP0496428A2 *||24 janv. 1992||29 juil. 1992||Micom Communications Corp.||Apparatus for, and method of, packing and unpacking information in transmission lines|
|EP0523362A2 *||3 juin 1992||20 janv. 1993||International Business Machines Corporation||Broadcast-initiated bipartite frame multi-access protocoll|
|EP0751639A1 *||30 juin 1995||2 janv. 1997||SGS-THOMSON MICROELECTRONICS S.r.l.||Method, transmitter and receiver for transmitting and receiving information; information broadcasting, in particular RDS (Radio Data System)|
|EP0878923A2 *||18 nov. 1997||18 nov. 1998||Northrop Grumman Corporation||Half-duplex communication system for telemetry modems|
|EP0938202A1 *||24 janv. 1992||25 août 1999||Micom Communications Corp.||Apparatus for, and a method of, packing and unpacking information in transmission lines|
|WO1997035408A2 *||10 mars 1997||25 sept. 1997||Philips Electronics Nv||Message collision arbitration using minislots|
|WO1998023040A2 *||17 nov. 1997||28 mai 1998||Stanford Telecomm Inc||Novel multi-access cs-p/cd-e system and protocols on satellite channels applicable to a group of mobile users in close proximity|
|Classification aux États-Unis||370/445, 370/462, 375/222, 370/459|
|Classification internationale||H04L12/56, H04W74/08|
|25 juil. 1989||AS||Assignment|
Owner name: MOTOROLA, INC., SCHAUMBURG, IL A CORP. OF DE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNORS:HAYMOND, WILLIAM D.;SILLETT, RODERICK J.;LUKAS, ROBERT M.;REEL/FRAME:005104/0887
Effective date: 19890629
|3 févr. 1994||FPAY||Fee payment|
Year of fee payment: 4
|12 mai 1998||FPAY||Fee payment|
Year of fee payment: 8
|1 juil. 2002||FPAY||Fee payment|
Year of fee payment: 12