Broadcast-initiated bipartite frame multi-access protocoll

Abstract: A hybrid of controlled access and random access schemes using frequency hopping spread spectrum communication techniques is implemented in an indoor digital data radio communication system between mobile stations and a computer system. A hop in the frequency hopping spread spectrum communication system is subdivided into two intervals so that different media-access protocols can be used in each interval. The protocol uses a centralized control scheme in one interval and a decentralized scheme in the other, and the intervals may be varied depending on the load of the system.

Description: The present invention generally relates to indoor digital data radio communication between a plurality of stations for the purpose of communicating among the stations and accessing various resources attached to the stations. In the specifically disclosed environment, a plurality of mobile stations communicate with one or more fixed base stations attached to a computer system, such as a local area network. More particularly, the invention relates to a system in which the base station exercises control over access to the radio channel by periodically broadcasting messages that demarcate fixed intervals of time, called "frames". Furthermore, such messages subdivide frames in a variable manner so as to allow flexible allocation of time to three modes of use of the channel: base station-to-remote transmission, fixed time-slotted allocation of time to various remote stations, and an interval in which remote station may access the channel using various contention mechanisms. It is very often the case that indoor data radio systems are installed for the purpose of permitting communications between mobile stations and applications and data residing in the computer system of a business enterprise. For example, the business enterprise may include a warehouse storing a diverse inventory. Mobile stations in the form of hand held computers and radio transceivers having bar code readers are used to check the quantities of inventoried products, and the data thus collected is transmitted to a base station for input to the computer system. A typical structure has mobile stations communicating to a fixed station acting as a gateway or bridge between the radio environment and a conventional local area network (LAN). The fixed station relays messages to other LAN-attached resources. Communications are rarely directly between mobile stations; rather, messages are exchanged with applications residing in fixed nodes. In this structure, it is natural to add certain radio system management functions to those of the gateway, including coördination of the mobile stations' access to the common radio channel. This augmented gateway is referred to herein as a base station. In indoor digital data radio systems, a key problem is providing efficient access to the channel, as that channel is limited in capacity and shared by all its users. Static channel allocation means, such as frequency division multiplex (FDM) or fixed time division multiplex (TDM), are inefficient for many forms of computer-to-computer traffic, known to be bursty in nature, while other services (e.g., speech transmission, control applications, etc.) require a fixed upper bound on maximum latency for channel access, best satisfied by periodic guaranteed access to the channel. Efficient radio channel usage is the basic requirement for a practical indoor radio data network. The different types of traffic from various data terminals are usually bursty in nature and not predictable. Random access schemes are known for their short response time when channel load is light. When channel load increases, random access schemes become inefficient and may be unstable. On the other hand, controlled access schemes, such as polling, achieve much better channel use efficiency when loads are heavy. However, polling schemes suffer from overhead as the polling cycle has to be reduced to meet response time requirements. A protocol for indoor digital data radio systems therefore should have the following characteristics: 1) short access time if the channel is lightly loaded, 2) good channel utilization if the channel is heavily loaded, 3) unconditionally stable, 4) simple to implement, and 5) matched well to typical traffic patterns, where most traffic is outbound from a base station attached to a LAN to the mobile stations. One form of indoor data radio uses a transmission technique known as "spread spectrum", authorized by the U.S. Federal Communications Commission (FCC) in its regulations, part 15.247, for use in certain frequency bands without user license. Spread spectrum communications offer several advantages including low density power spectra and interference rejection. There are several types of spread spectrum systems including direct sequence digital systems, frequency hopping systems, time hopping systems, pulsed frequency modulated (or chirp) systems, and various hybrids. Of these, the direct sequence digital systems and the frequency hopping systems are perhaps the more widely implemented. In a direct sequence digital system, a fast pseudorandom code generator is used to modulate slower digital data which, in turn, modulates a carrier. In a frequency hopping system, a coherent local oscillator is made to jump from one frequency to another undert the influence of a pseudorandom code generator. The subject invention may be implemented using either direct sequence digital or frequency hopping types of spread spectrum communications systems. A description of these and other types of spread spectrum communications systems may be found, for example, in Spread Spectrum Systems, 2nd Ed., by Robert C. Dixon, John Wiley & Sons (1984), and Spread Spectrum Communications, Vol. II, by M. K. Simon et al., Computer Science Press (1985). The preambles of claims 1 and 8 are based on the disclosure of US-A-4 161 786 disclosing a dual mode communication system. This dual mode system is based on a time division multiple access communication between a plurality of terminals coupled to a common singnal path wherein digital signals may be transferred in time slots in a repetitive framed sequence between linked terminals. In this dual mode system a certain number of these time slots are to be used in a dynamic allocation operation with static slot assignments with a set of terminals adapted for this dynamic allocation. In this first mode of said dual mode system the slot allocation function is to be distributed over several slot allocation capable terminals addressed by one first slot allocation terminal used as a start point for this administration workload distribution. Further, US-A-4 987 571 relates to a slotted CSMA contention technique for a radio communication system having a central base station and a plurality of remote terminals. The communication channels are divided into major frames being divided into two minor frames being again divided into microslots. The description discusses a technique of prioritizing longer periodic messages on selectively assigned minor frames and of avoiding collisions between messages. Still further, the Article "Second IEE National Conference on Telecommmunications", 2 April 1998, York, GB, pages 288-293, XP130148, A. Marshall et al. "An Experimental Testbed for a Direct Sequence Spread Spectrum Local Area Network" relates to experimental testing of direct sequence spread spectrum networks. In connection with local area networks, various spread spectrum techniques such as frequency hopping and direct sequence are discussed. Finally, EP-A-0 134 544 contains a paragraph relating to a subdivision of network activity into two regions, one assigned to a circuit-switched communications and one to packet-switched communications. It is an object of the present invention to provide a protocol for channel access in a digital data radio system which reduces response time when traffic load is light and increases channel use efficiency when traffic load is intense. Other objectives of the invention include the support of traffic with latency constraints, the ability to configure a system in different applications with different characteristics, and the ability to guarantee "fairness" under heavy load. According to the invention as laid down in the claims, there is provided a hybrid of controlled access and random access schemes using spread spectrum communication techniques. More specifically, a frame is subdivided into two intervals so that different media-access protocols can be used in each interval. While in principle any protocol could be used in the two intervals, a preferred embodiment of the protocol uses a centralized control scheme in one interval and a decentralized scheme in the other. The relative duration of the intervals may be varied to accommodate varying load conditions. A preferred embodiment of the invention is implemented using a frequency hopping spread spectrum communication system. In the frequency hopping spread spectrum system, the carrier frequency of the transmitter changes at intervals of time, remaining constant between those instants. The period of constant frequency is called a "hop", and it is only during these hops that messages may be exchanged. Because the hops are of finite duration, they impose a structure on the use of the radio channel; that is, no transmission may occur across a hop boundary. Hops therefore impose a framing structure on time. The invention provides "transparent connectivity" between client and server programs, in that neither program need be aware of the presence of the wireless link. The "configuration" objective of the invention is accomplished by setting the boundary between intervals at system configuration time. Thus, in a multiple-dumb-terminal application, the base station could be set to poll only, while in a portable PC (personal computer) application, the base station could be set to only allow contention access. The "fairness" objective of the invention is achieved by shifting from contention to polling or allocation as the load increases, thus guaranteeing that no remote station ever gets "locked out" even though a particular remote station might be a weaker contender than others. The foregoing and other objects, aspects and advantages will be better understood from the following detailed description of a preferred embodiment of the invention with reference to the drawing, in which: Fig. 1 is a pictorial diagram showing an indoor radio digital data communication system of the type in which the invention is implemented; Fig. 1A is a block diagram of the system shown in Fig. 1 illustrating the basic components of a mobile station and a base station; Fig. 2 is a block diagram of the radio system used in the implementation of a preferred embodiment of the invention; Fig. 3 is a data framing diagram showing the protocol implemented by the preferred embodiment of the invention; Fig. 3A is a data framing diagram showing a modification of the basic protocol illustrated in Fig. 3; Figs. 4A and 4B, taken together, are a flow diagram of the logic of the process by which the base station adjusts intervals as a function of traffic load and other factors; Figs. 5A and 5B, taken together, are a flow diagram of the logic of the protocol processing by a base station; and Figs. 6A and 6B, taken together, are a flow diagram of the logic of the protocol processing by a mobile station. Referring now to the drawing, and more particularly to Fig. 1, there is shown an indoor radio system allowing communication between a plurality of mobile stations 10, 12, 14, and 16 and applications and data residing in a computing system. The computing system typically includes a server 18, with attached monitor 20 and keyboard 22, of a local area network (LAN), generally indicated by reference numeral 24, having a plurality of attached workstations or personal computers (not shown for simplicity). Also attached to the LAN are one or more gateways 26 and 28 with which the mobile stations 10, 12, 14, and 16 communicate. These gateways, referred to as base stations, are augmented according to the invention to provide certain radio system management functions which coordinate the mobile stations' access to the common radio channel. Communications between mobile stations is supported via relay through the base stations 26 and 28. As shown in more detail in Fig. 1A, a base station 26 or 28, which may be a conventional microcomputer, has a LAN adapter 30 inserted in a bus slot and connected to LAN cabling 32. The server 18, typically also a conventional microcomputer and including one or more direct access storage devices (DASDs) such as hard disks (not shown), also has a LAN adapter 34 inserted in a bus slot and connected to LAN cabling 32. The LAN adapters 30 and 34 and the LAN cabling 32 together with LAN software constitute the LAN 24. The LAN 24 is of conventional design and does not form part of the invention. The base station 26 or 28 also has an RF transceiver adapter 36 implemented as a printed circuit card which is inserted in a bus slot of the base station. The transceiver adapter 36 includes a spread spectrum transceiver of conventional design. The transceiver adapter 36 has an antenna 38 by which a radio link 40 is established with one or more remote or mobile stations 10, 12, 14, or 16. The mobile station may itself be a hand held or lap top computer of conventional design and, like the base station, it is provided with an antenna 42 and a transceiver adapter 44, also implemented as a printed circuit card which is inserted in a bus slot of the computer. The transceiver adapter 44, like transceiver adapter 36, includes a spread spectrum transceiver of similar design. The base station and the mobile stations are further provided with software, generally indicated by reference numerals 46 and 48, respectively, which support their respective transceiver adapters. Fig. 2 shows the radio system common to both the mobile stations and the base stations of Fig. 1. The radio system includes a transceiver adapter 36 or 44 connected to a computer 50 via the computer's bus interface 52. The transceiver section is itself divided into an RF transceiver 54, which may be a commercially available spread spectrum transceiver, and a dedicated microprocessor system 56 which controls the transceiver via an interface 58. The microprocessor system 56 further includes a system interface 60 which interfaces the transceiver section to the computer section 50. The microprocessor system includes a dedicated microprocessor 62 containing high-resolution time interval determination hardware or "timers" typical of real-time microprocessor systems. Microprocessor 62 is connected by a memory bus 64 to program storage 66 and data storage 68 as well as to interfaces 58 and 60 providing attachment to bus interface 52 and RF transceiver 54, respectively. Program storage 66 is typically read only memory (ROM), while data storage 68 is static or dynamic random access memory (SRAM or DRAM). Packets received or to be sent are held in data storage 68 and communicated to or from the RF transceiver 54 via interface 58 under control of serial channels and a direct memory access (DMA) controller (not shown) which is part of the microprocessor 62. The function of these serial channels is to encapsulate data and control information in an HDLC (high-level data link control) packet structure and provide the packet in serial form to the RF transceiver 54. For more information on the HDLC packet structure, see, for example, Mischa Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley (1988). When a packet is received through the RF transceiver 54, the serial channels check the packet destination address, check for errors, and deserialize the packet to data storage 68. The serial channels must have the capability to recognize a specific adaptor address as well as a broadcast address. Specific microprocessors with appropriate serial channel and timer facilities include the Motorola 68302 and the National HPC46400E microprocessors. The computer 50 runs an operating system 70 which supports one or more user application programs 72. The operating system 70 may include a communications manager 74, or the communications manager 74 may itself be an application program installed on the computer. In either case, the communications manager 74 controls a device driver 76 via the operating system 70. The device driver 76, in turn, communicates with the transceiver adapter 36 or 44 via bus interface 52. Fig. 3 shows the protocol implemented by the invention. While the protocol is equally applicable to radio frequency (RF), infrared (IR), or wired transmission systems with broadcast capability, and to either conventional or spread-spectrum modulation techniques, slow-frequency-hopped spread spectrum radio systems have a natural affinity for the protocol since those systems share a structure to time with the protocol. However, the invention has been implemented using direct sequence spread spectrum systems which may be readily adapted to the protocol. With reference to Fig. 3, there are five intervals defining a "hop". The first (and last) interval, G, is the interval during which the transmitter carrier frequency is changing. Note that the G interval is needed only for frequency hopping systems. This interval has a duration H. The next interval, X 1 , is the interval during which the base station broadcasts a special message to all the mobile stations identifying the beginning of the following, or B, interval. The B interval is the interval during which, by convention, only the base station may initiate transmission and mobile stations may respond only when required by the message protocol. For example, the mobile station may acknowledge a message outbound from the base or may respond when polled. The B interval has a duration T 1 . The B interval is followed, in turn, by the X 2 interval which is the interval during which the base station broadcasts a special message to all the mobile stations identifying the end of the B interval and, by implication, the beginning of the C interval. The message also conveys the length of the C interval and, optionally, the length of the B interval as well. The X 2 broadcast message is not strictly necessary. Information about the entire hop structure can be conveyed in the X 1 interval. The X 2 message is included to support operation of simplified remote stations capable of only contention-mode operation. These stations wait for the X 2 message and contend subsequently. The C interval is the interval during which any station, including (or optionally excluding) the base station, may contend for the channel and transmit a message without the consent of the base station. For example, a CSMA/CA (carrier sense multiple access with collision avoidance) protocol may be used in this interval. The C interval is approximately of duration T 2 . If a mobile station sends a message and receives an acknowledgement, it can assume the message has been received correctly. If not, it will contend again. There is a guard interval at the end of the C interval during which a mobile station with a particular message may not transmit. If T msg is the time to transmit a particular message and T ack is the time to transmit an acknowledgement and T turnaround is the time between the end of a transmission of a message and the initiation of the transmission of an acknowledgement, then the guard interval is T msg + T ack + T turnaround . Note that because T msg is a function of the length of the message to be transmitted, the guard interval may be different for different mobile stations having a message to send. The guard interval is not wasted; rather, messages and acknowledgements are sent and received right up to the end of the C interval. By varying the time T 2 , the base station can expand or contract the contention interval. If the system is very lightly loaded and most of the traffic is inbound to the base station, it is advantageous to mobile response time to lengthen the time period T 2 . Conversely, if the system is heavily loaded and most of the traffic is outbound, the time period T 2 should be minimized. The time period T 2 should not be reduced to zero, however, as it is the only mechanism by which a newly activated mobile station can register itself to the base station. Additionally, a further subdivision of the B interval, in which remote-to-base traffic is carried in allocated time slots, may be made as shown in Fig. 3A. In Fig. 3A, the B interval is subdivided into B 1 and B 2 subintervals, and the B 2 subinterval is, in turn, subdivided into a plurality of time slots, each time slot being allocated to a specific remote station. Requests for an allocated slot may be made by a remote station in response to a poll during the B 1 subinterval, or the requests may be made during the C interval. Once confirmed by a message from the base station, slot allocation guarantees that the remote station can transmit to the base station during its allocated time slot. By varying the boundary between the B 2 subinterval and the C interval, the suitability of the system to different types of traffic can be adjusted. As the traffic load for steady, predictable traffic (e.g., real-time audio and video) increases, the boundary can be moved to lengthen the B 2 subinterval and shorten the C interval, thereby increasing the number of allocatable time slots. Conversely, as the traffic becomes less predictable, the boundary can be moved to lengthen the C interval, providing greater bandwidth for contention-based traffic. From Fig. 3, it will be appreciated that the "hop" is divided into to two subdivisions, one of which supports a controlled access scheme and the other of which supports a random access scheme. The invention may operate in any one of three modes: one in which only the X 1 message is sent, one in which only the X 2 message is sent, and one in which both are sent. In the case where only the X 1 message is sent, the X 1 message constitutes the header section of a frame. It identifies the start of the information frame, carries a unique identification of the base station, identifies the frequency hopping pattern, and defines the length of the B and C intervals. Optionally the X 1 message also carries general broadcasting and system control information. In operation, each mobile station waits for the X 1 message. When received, a mobile station sets an internal timer for T 1 and for T 1 + T 2 so that it knows when the contention interval begins and when to schedule its next frequency change. Broadcast reception of messages is not guaranteed, only likely. Radio conditions may be such that a particular mobile station does not hear the broadcast message X 1 . Because a mobile station cannot transmit autonomously without first hearing the X 1 message and letting T 1 elapse, it will remain quiet for the entire frame. Alternatively, if the mobile station is polled by the base station during interval B, it may respond, but in no case can it contend in the C interval. It must remember T 1 + T 2 from the last frame so that it knows when to hop, and it will listen in the next frame for the X 1 message. If no X 1 message is heard for a number of consecutive frames, the mobile station must assume that it has lost hop synchronization with the rest of the system and enter a synchronization acquisition mode. Each frame time period of length T = T 1 + T 2 can also be a frequency hopping period for implementation under FCC regulation part 15. A fixed length of time T is recommended but not necessary. A fixed length of time T is especially useful in the following cases: 1) When several frequency hopping patterns are used in overlapped operation in a multicell radio system, a fixed length of time T makes interference separation much more feasible. In this case, the frequency hopping pattern information in the header section can be used to identify the hopping sequence for a mobile terminal to follow. 2) If all radios in a system are hopping with the same pattern, a fixed length of time T permits different cells to hop in synchronism but at different phases of the hopping pattern. This eliminates interference between cells. A tradeoff needs to be made in selecting the length of time T. A large time T makes the system overhead smaller, and a small time T makes the system response time smaller. Instead of the X 1 message, the system can transmit the X 2 message only. The content of the X 2 message can be similar to that of the X 1 message except that mobile stations receiving the X 2 message can immediately begin contention. This may be an advantage in some applications. For the case of transmitting the X 2 message only, suppose the base station polls a mobile station near the end of the B interval, and the mobile station responds with a lengthy message. (Generally, the protocol must prohibit these responses from being too lengthy.) It may be that the response is active even as the period T 1 expires. With only X 1 messages, this may be a problem, but with X 2 messages, the base station can then originate the X 2 message as soon as the response is complete, making sure to include a shortened T 2 period in the X 2 message. The effect will be to diminish the contention interval for one hop's duration. In the third mode of operation, both X 1 and X 2 messages can be used to simplify the implementation of the mobile station and to provide redundancy. The X 1 message would then signal the beginning of the B interval, and the X 2 message, the C interval. In a specific implementation of the invention, the X 1 message only was used. An advantage of the X 1 message over the X 2 message is that the time of occurrence of the X 1 message is known to the mobile stations which, in order to save power, may power down their receivers until the time the X 1 message is expected. This also reduces susceptibility to spurious reception of X-type messages. The combination of X 1 and X 2 messages is the safest and simplest to implement at the mobile stations. X 2 messages only can provide some simplicity for contention-only mobiles. The dynamic adjustment of the relative durations of the B and C intervals depending on the load of the system is an important aspect of the subject invention. Since all messages involve the base station, the base station can recorded the relative traffic intensity (number of messages) in each of the B and C intervals. The recording is typically done by keeping running tallies of the number of messages in each interval over a predetermined time period. At the end of the time period, the base station evaluates the tallies accumulated for each interval and, based on this information and other related factors, makes a decision as to whether the length of each interval is to be varied. As a specific example, consider the modified protocol shown in Fig. 3A. If the number of messages from the base station to the mobile stations is large, the base station may choose to lengthen the B 1 subinterval and correspondingly shorten the B 2 subinterval and C interval. Conversely, if the C interval is heavily utilized and the mobile stations have little demand for allocated slots, the C interval can be lengthened at the expense of the B 2 subinterval. Since the length of the B1 interval need only be sufficient to exhaust the base station's transmit queue for a particular frame, the base station may dynamically vary the length of this subinterval for each frame. The base station must estimate the length of the B 1 subinterval at the time the X 1 message is broadcast. This estimate is based on the number and length of the messages in the transmit queue at the start of the frame. Other measures of traffic may also be taken into consideration by the base station. For example, a decision to lengthen the B 2 subinterval would most effectively be made on the basis of the number of outstanding slot allocation requests made by mobile stations. In addition, mobile stations may monitor the delay experienced in attempting to use the C interval (or the collisions they experience) and report this information to the base station either in response to periodic requests from the base station for status or as a field in the packet itself. Alternatively, the base station can determine the average transmit queue lengths for itself and all the active remotes. The queue lengths for the remote stations can be determined by periodic reporting or by including queue lengths in all packets transmitted to the base station. Figs. 4A and 4B, taken together, are a flow diagram showing the logic of the adjustment of the proportions of the lengths of the B 1 and B 2 subintervals and the C interval. Source code in an appropriate computer language, such as C, Pascal or BASIC, supported by the base station computer can be written from the flow diagram by a computer programmer skilled in the particular computer language used. Referring now to Fig. 4A, the process begins by a routine process of system initialization during which tally counters for the B 1 and B 2 subintervals and the C interval are set to zero and a period counter is preset to a predetermined time period. Then, in function block 80, the tally counters are advanced for messages during each of the B 1 and B 2 subintervals and the C interval. Periodically, the period timer is checked in decision block 82, and when the period timer has expired, the number of messages in the base station transmit queue is checked in function block 86. In addition, the base station checks in function block 88 the reported delays from the mobile stations. The information thus accumulated, i.e., the number actual of messages for each interval, the relative numbers of messages between intervals, the length of the transmit queue, and the delays reported by the mobile stations, is used to determine whether an adjustment in the intervals is required. The adjustment criteria may be determined empirically for a specific application. A test is made in decision block 90 to determine if any adjustment criteria are met, and if not, then the tally counters and the period timer are reset in function block 92 before the process loops back to function block 80. If any adjustment criteria are met, then the process goes to Fig. 4B, as indicated by the C connector. In Fig. 4B, a series of tests are made. The first is made in decision block 94 to determine if subinterval B 1 is to be changed. If so, the adjustment is made in function block 96. Next, a test is made in decision block 98 to determine if subinterval B 2 is to be changed. If so, the adjustment is made in function block 100. Finally, a test is made in decision block 102 to determine if interval C is to be changed. If so, the adjustment is made in function block 104. At this point, a return is made to Fig. 4A, as indicated by the D connector, and function block 92. The foregoing description assumes that the mobile stations are synchronized with the base station. The process by which a mobile station initially establishes contact with a base station will now be described. The description is given for slow-frequency hopped systems, which are generally the more difficult to synchronize. Mobile stations have an apriori knowledge of the set of carrier frequencies that are available in a given system. For example, in the 915 Mhz ISM band (902-928 MHz), slow-frequency hopped (SLH) systems have a maximum channel width of 0.5 MHz, yielding 52 channels spaced 0.5 MHz apart. After various initialization procedures have been accomplished, a mobile station that wishes to contact a base station tunes its receiver to one of the available channels and waits for the receipt of the X 1 or X 2 messages. With hop lengths of T 1 + T 2 + H = 50 milliseconds, for example, the average length of time a mobile station must wait is 52x50x0.5 = 1300 milliseconds, or 1.3 seconds. Upon receiving the X 1 or X 2 message, the mobile station then learns the hop duration, base station identifier, and hopping pattern from the content of the message. The mobile station then changes receiver frequency appropriately at the end of the hop and awaits the X 1 or X 2 message on the next hop. After some number of hops, where all or almost all of the X 1 or X 2 messages have been received successfully, the mobile station declares itself synchronized to the base station. If a sufficient number of X 1 or X 2 messages are not received on successive hops, the mobile station then returns to a single frequency listening mode in order to re-acquire the base station or an alternate base station. Referring now to Figs. 5A and 5B, the logic of the base station program implementing the protocol is illustrated in flow diagram form. The flow diagram is for the modified protocol as shown in Fig. 3A, and those skilled in the art will recognize that the simpler and alternative forms of the protocol may be readily implemented based on the logic of the modified protocol. Source code in an appropriate computer language, such as C, Pascal or BASIC, supported by the base station computer can be written from the flow diagram by a computer programmer skilled in the particular computer language used. The process begins in Fig. 5A by a routine process of system initialization, after which phase B 1 is entered. At the beginning of phase B 1 , the phase identification is set to phase B 1 , the timer set for the phase B 1 duration, and message X 1 is broadcast, as indicated in function block 106. Messages to the various mobile stations are transmitted from the transmit queue and acknowledgements are received from the polled mobile stations in function block 108. Periodically, the phase timer is checked in decision block 110 to determine if time has expired. If not, the process loops back to function block 108 to continue transmitting messages from the transmit queue. When the phase timer has expired, phase B 2 begins by setting the phase identification to B 2 and setting the timer for the B 2 duration in function block 112. Received messages are placed in a receive queue, and acknowledgements are transmitted to the mobile stations from which the messages are received, as indicated in function block 114. Periodically, the phase timer is checked in decision block 116 to determine if the timer has expired. If not, the process loops back to function block 114 to continue receiving messages. When the phase timer has expired, the process goes to Fig. 5B, as indicated by the connector A. Phase C begins at the top of Fig. 5B by setting the phase identification to C and setting the timer to the duration of the C interval in function block 118. The base station then transmits the X 2 broadcast message at function block 120 notifying the mobile stations of the beginning of the C interval. During the C interval, messages received from the mobile stations are put in the receive queue, and acknowledgements are transmitted to those mobile stations from which messages have been received, as indicated by function block 122. Mobile stations transmitting messages and not receiving an acknowledgement assume that their message has not been received. In that case, the message is retained in the mobile stations transmit queue for retransmission during the next frame. Periodically, the phase timer is checked in decision block 124 to determine if the timer has expired. If not, the process loops back to function block 122 to continue receiving messages from the mobile stations. When the timer has expired, hop processing is performed during the G interval in function block 126. This processing is in accordance with the schedule broadcast in the X 1 message. The process then goes to phase B 1 in function block 128, and the same protocol is repeated during the next frame. The software for the mobile stations is similar as shown by the flow diagram in Figs. 6A and 6B. System initialization is first performed, and then the system waits for the X 1 message in function block 130. When the X 1 message is received, the phase identification is set for B 1 and the timer duration is set for the B 1 interval in function block 132. During this interval, messages received from the base station are stored in a receive queue, and acknowledgements are sent to the base station in function block 134. Periodically, the phase timer is checked in decision block 136 to determine if the timer has expired. If not, the process loops back to function block 134 to continue to receive messages that may be transmitted by the base station. When the timer has expired, phase B 2 is entered by setting the phase identification to B 2 and setting the timer to the B 2 interval duration in function block 138. Then, in function block 140, the slot timer is set to the beginning of the allocated time slot for the mobile station. The system waits for the slot timer in decision block 142 and, continuing to Fig. 6B as indicated by the B connector, when the slot timer times out, the mobile station transmits a message from its message queue and receives an acknowledgement from the base station in function block 144. The system next waits for the phase timer in decision block 146. Phase C commences when the X 2 broadcast message is received, as determined in decision block 148. The X 2 broadcast message is expected after the phase timer times out in decision block 146. In the mobile station, phase C is initiated by setting the phase identification to C, setting the phase timer to the phase duration, and setting the slot timer to a random multiple of the slot width in function block 150. Phase C implements a slotted ALOHA protocol as described, for example, by Mischa Schwartz, supra. The system then waits for the slot timer in decision block 152. The mobile station transmits from the transmit queue and receives an acknowledgement in function block 154 in response to the slot timer. As mentioned, if the mobile station does not receive an acknowledgement, it assumes that the message was not received. In that case, the message is retained in the transmit queue for transmission during the next frame. Thereafter, the system waits for the phase timer in decision block 156. When the phase timer times out, hop processing is performed in function block 158 according to the data received in the X 1 message, and the process goes to phase B 1 for the next frame in function block 160.

Claims: A communication system comprising: a plurality of stations (10, 12, 14, 16, 26, 28) each including a transceiver (36, 44); said communication system comprising a computer system (24); characterized in said communication system being an indoor digital data radio communication system and said transceivers being spread spectrum radio frequency transceivers (36, 44); said plurality of stations including a base station (26, 28) being included in said computer system (24) and a plurality of remote stations (10, 12, 14, 16); said base station (26, 28) comprising means for exercising control over access to a radio communication channel, said means including means for defining a plurality of frames during which messages and data are transmitted over a radio channel, each of said frames being demarcating into two intervals (B, C), one (B) for controlled access by the base station and one (C) for contention access by the remote stations, and means for varying said two intervals (B, C) depending on message traffic load of the system. The communication system recited in claim 1 wherein said one interval (B) for controlled access is further divided into two subintervals (B1, B2), said base station including means for polling said remote stations during a first (B1) of said two subintervals, and said remote stations being allocated a time slot during a second (B2) of said two subintervals by said base station for transmitting to said base station. The communication system recited in claim 1 or 2 wherein said means for varying said two intervals includes means for measuring a number of messages during each interval over a predetermined period of time; and means for comparing a relative number of messages for each said interval. The communication system recited in anyone of claims 1 to 3 wherein said base station (26, 28) further includes a transmit queue for temporarily storing messages to be transmitted to said remote stations and wherein said means for varying further comprises means for checking a number of messages in said transmit queue as a criteria for varying said intervals. The communication system recited in anyone of the preceding claims wherein said remote stations (10, 12, 14, 16) include means for accumulating data on delays encountered by said remote stations (10, 12, 14, 16) in successfully transmitting messages to said base station (26, 28) during the interval (C) for contention access, said remote stations (10, 12, 14, 16) transmitting said data to said base station (26, 28) during the interval (B) for controlled access, and wherein said means for varying further comprises means for checking said data on delays encountered by said remote stations (10, 12, 14, 16) as a criteria for varying said intervals (B, C). The communication system recited in anyone of the preceding claims wherein said transceivers (36, 44) are hopped spread spectrum transceivers, said frames being defined by frequency hops. The communication system recited in anyone of the preceding claims wherein said transceivers (36, 44) are direct sequence digital spread spectrum transceivers. A method for communication between a plurality of stations (10, 12, 14, 16) each including a transceiver (44) and a computer system (24) including a transceiver (36), characterized in said communication method being an indoor digital data radio communication method and said transceivers (36, 44) being spread spectrum radio frequency transceivers; said plurality of stations (10, 12, 14, 16) being remote stations and said computer system (24) comprising a base station (26, 28) including said transceiver (36); said base station (26, 28) exercising control over access to a radio communication channel by performing said communication method; said communication method comprising the steps of defining a plurality of frames during which messages and data are transmitted over said radio communication channel, each of said frames being demarcated into two intervals (B, C), one (B) for controlled access by the base station (26, 28) and one (C) for contention access by the remote stations (10, 12, 14, 16), and varying said two intervals (B, C) depending on message traffic load of the system. The communication method recited in claim 8 further comprising the step of broadcasting by said base station (26, 28) prior to said controlled access interval (C) a message (X1) to said remote stations (10, 12, 14, 16) identifying a beginning and a duration (T1) of said controlled access interval (B). The communication method recited in claim 8 or 9 further comprising the step of broadcasting by said base station (26, 28) prior to said contention access interval (C) a message (X2) to said remote stations (10, 12, 14, 16) identifying an end of said controlled access interval (B) and a duration (T2) of said contention access interval (C). The communication method recited in claim 8, 9 or 10 further comprising the steps of: measuring by said base station (26, 28) a number of messages during each interval (B, C) over a predetermined period of time; comparing by said base station (26, 28) a relative number of messages for each said interval (B, C); and determining by said base station (26, 28) whether said intervals (B, C) should be varied depending on relative message traffic intensity of each said interval (B, C).

Inventors: BANTZ DAVID FREDERICK, CATO ROBERT THOMAS, HUANG CHIA-CHI, BANTZ, DAVID FREDERICK, CATO, ROBERT THOMAS, HUANG, CHIA-CHI
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES
Application year: 1992
Main classification: H04L12
IPC codes: H04L12, H04B1, H04L5, H04B7, H04J3, H04W74