WO2001033739A1

WO2001033739A1 - Prioritization scheme for csma/ca

Info

Publication number: WO2001033739A1
Application number: PCT/US2000/030487
Authority: WO
Inventors: Kevin J. Negus
Original assignee: Proxim, Inc.
Priority date: 1999-11-04
Filing date: 2000-11-03
Publication date: 2001-05-10
Also published as: AU1584901A

Abstract

A channel access system is described in which a number of slots within a contention window are available for assignment to streaming data transmitters (52, 54). The other slots are selected by the other transmitters (56, 58) according to a CSMA/CA transmit protocol.

Description

Prioritization Scheme for CSMA/CA

Background

The present invention relates to channel access methods for wireless communication systems.

A popular channel access method for wireless Local Area Network (LAN) devices is Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA). This method works by having the time since the last activity on the shared channel divided into equal length slots. Each transmitting node in the network generates a random number, then counts the activity slots until the number is reached. At that point, the node can grab the channel and other nodes must suspend their count until the channel is free again. If by chance the two nodes generate the same random number, and thus collide with each other on the channel, they would determine that the packet transfer is unsuccessful through an acknowledgment process and generate a new random number to start counting slots from zero the next time the channel is free. Typically, the range of the random number is increased after a collision. The CSMA system is illustrated with respect to Figs. 1A , IB , and 2.

Looking at Figure 1A, after transmission 22 is finished, a period 24 occurs in which no transmissions are done. After a period 24, the slotted contention window 25 occurs. The transmitting units begin transmitting at a randomly determined contention window slot. Figure IB shows the use of a request-to-send (RTS) and clear-to-send (CTS) signals that help avoid the hidden node problem. A node sends a RTS signal 26 before transmitting. The destination node then sends a CTS signal 28 indicating the length of the data block 30. Nodes out of the range of the source can still avoid transmitting during the time indicated by the CTS signal.

Figure 2 shows the operation of the contention window. Nodes 1, 2, and 3 all wish to transmit. The nodes randomly generate slot numbers. Node 1 has slot number #5, and it starts transmitting in slot number #5. Nodes 2 and 3 detect the transmissions of Node 1 and thus do not begin transmitting at their randomly selected slot numbers.

The goal of CSMA/CA in most system protocols is to provide fairness of access to the channel for all nodes in the network. This suits computer data networking applications very well. An example where CSMA/CA does not work well is for cordless telephone networks. In this situation, symmetric two-way streams of relatively low bandwidth must be transmitted and received on a regular intervals with very low latency or delays. CSMA/CA has unpredictable and, in theory, unbounded latency.

A common choice for telephone networks is Time Division Multiple Access, or TDMA. In TDMA, the channel is divided into predetermined time slots that are specifically allocated to certain transmitting nodes exclusively on a repetitive basis. The allocation typically requires a node to act as a central controller. TDMA is a cumbersome and inefficient choice for data networking. Most computer network nodes do not need to use the channel at any given time.

Some CSMA/CA and TDMA combination networks have been suggested. None of the suggested methods are effective for the new types of streaming media. Streaming media data includes digital audio player data to one or more digital speakers or headsets. A streaming video stream, such as the picture phone, is another example. It is desired to have a channel access method with low packet failure rate (PFR) and low latency to deal with a wireless LAN environment when both computer data type transmission and streaming data transmissions are used.

Summary of the Present Invention

The present invention is a system in which a controller allocates a number of contention window slots to streaming transmitter units. The number of assigned contention-window slots varies, based upon the number of streaming transmitter units which need to transmit. The streaming transmitter units can transmit beginning at the assigned contention slots assuring the streaming transmitter units of the low latencies required for the generally compacted streaming media data.

The controller also sends an indication of the unassigned contention window slots to other transmitter units. In one embodiment, an indication of the first unassigned contention window slot is used. The other transmitter units produce random contention-window slot numbers greater than or equal to the first unassigned contention window slot and do a CSMA/CA-type medium contention for the remaining slots.

Another embodiment of the present invention concerns a dumb receiver unit to receive the streaming data transmissions. The dumb receiver unit could be, for example, headphones. The dumb receiver unit will typically be unable to send an acknowledgment in the medium access control (MAC) signaling. In this embodiment, a surrogate unit is used. The surrogate unit receives signals meant for the dumb receiver unit. The dumb receiver unit produces a surrogate acknowledgment to send to the transmit unit. The surrogate acknowledgment is not as good as an acknowledgment from the receiver unit, but it does give some indication whether the channel conditions are clear enough to send the data to the dumb unit. Since a dumb unit need not produce acknowledgments, it can be much cheaper than a receiving unit that produces acknowledgments. The power required for transmitting a signal is much greater than the power required to receive a signal.

Brief Description of the Drawings

Figs. 1A-1B are diagrams that show a conventional CSMA/CA channel access protocol. Fig. 2 is a diagram that shows a conventional CSMA/CA channel access protocol.

Figs. 3 A and 3B illustrate the channel access protocol of one embodiment of the present invention.

Fig. 4 is a flowchart illustrating the method of one embodiment of the present invention.

Figs. 5A-5B are diagrams illustrating different numbers of time slots assigned to a streaming transmitter units within a contention window.

Fig. 6A-6B are diagrams illustrating the operation of the system of the present invention. Fig. 7 is a diagram that illustrates the use of a surrogate unit to provide surrogate acknowledgments to data transmitted to a dumb device.

Detailed Description of the Preferred Embodiment

Figs. 3 A and 3B illustrate the channel access system of the present invention. Looking at Fig. 3A, this system has a controller unit 50. The controller unit 50 receives contention-window assigned slot requests from streaming transmitter units 52 and 54. The controller 50 sends contention- window slot assignments addressed to the requesting streaming transmitter units 52 and 54. In this example, streaming transmitter 1 is given contention-window slot assignment 1 , and streaming transmitter 3 is given contention-window slot assignment 3. Other units 56 and 58 are not given fixed slot assignments. Units 56 and 58 receive an indication of the unassigned slots. For example, an indication of the first unassigned contention-window slot, in this case slot number 4, indicates that slots 1-3 are assigned to streaming data units. Contention-window slot 4 is the first slot which is not assigned to a streaming transmitter. The wireless units 56 and 58 produce a random slot number to transmit the data which they wish to transmit. The random number must be equal to or greater than the slot number 4. In this example, the start number N is 4 and the wireless units 56 and 58 select a random number which is equal to or greater than 4.

Figures 6A and 6B illustrate the operation of the system of the present invention. Looking at Figure 6A, all three nodes A, B and C wish to transmit. There are three assigned contention- window slots. Contention window slot #2 is assigned to Node A. Nodes B and C do not have assigned slots and randomly select contention-window slots #5 and #7 respectively. The randomly selectable slots are all greater than the assigned slots. In this case, Node A with assigned slot #2 will always be able to transmit before the nodes that are not assigned contention- window slots. This produces a low latency for the data transmission of Node A.

In Figure 6B, Node A does not wish to transmit. Nodes B and C do wish to transmit and randomly select slots #5 and #7 respectively. In this case Node B will begin to transmit starting in contention-window slot #5 blocking Node B from transmitting. Note that the channel access method of the present invention has two types of data transmission: the streaming data transmission starting at the assigned contention-window slots requiring a request to and an assignment from the controller; and the random CSMA/CA-type transmissions that don't require a contention-window slot assignment.

Fig. 4 is a flowchart illustrating a method of the present invention. In step 60, the streaming data units request a contention-window slot assignment from the controller unit. In step 62, the controller unit assigns contention-window slots to the streaming units that desire to transmit data. The number of assigned contention- window slots available varies and may be limited by the controller. Once the number of streaming data units which need the assigned contention- window time slots is determined, an indication of the unassigned contention- window slots is broadcast by the controller unit.

In step 63, the transmitting units contend for the medium. If a streaming data unit wishes to transmit, the streaming dat unit that wishes to transmit and has the lowest contention-window slot number will be able to transmit. Otherwise, the transmitter unit with the lowest randomly selected contention-window slot will be able transmit.

Figs. 5A-5B illustrate the use of the assigned and unassigned contention- window slots. In Fig. 5A, four slots are assigned and slot five is the first contention- window slot available for other transmitting units. In Fig. 5B,, two slots are assigned and slot two is the first contention-window slot available for other transmitting units. Fig. 7 illustrates another embodiment of the present invention. In Fig. 7, streaming transmitter device 80 transmits to a dumb receiver device 82. An example of a dumb receiver device is a microphone system which receives streaming audio from the streaming transmitter device 80. In a preferred embodiment, the dumb device is set up such that it does not produce acknowledgments. This reduces the requirement for the dumb device to transmit. Transmitting signals is quite power-intensive compared receiving signals. In order to save power, the dumb device receives but does not transmit data. The streaming transmitter 80 does not receive acknowledgments from the dumb device 82. In some cases this is acceptable; however, in other cases it is desirable that the streaming transmitter can modify its transmissions so as to improve the transmission, for example by changing frequencies or by increasing power. In the present invention, a surrogate unit 84 receives the data transmitted by the streaming transmitter 80 and produces a surrogate medium-access-control (MAC) acknowledgment sent to the streaming transmitter 80. The streaming transmitter 80 then knows that the data is transmitted at least as far as the surrogate unit. The transmitting unit 80 can retransmit data during periods of high interference or increase the transmitting power if the data is not being received by the surrogate unit 84. Note that the surrogate unit 84 can operate for a number of different dumb devices. The surrogate unit is not in the same position as the dumb device and thus some data transmissions will be received by the surrogate unit and not be received by the dumb device and vice versa. However, the system of the present invention gives a certain amount of information which can be used by the transmitting unit 80.

It will be appreciated by those of ordinary skill in the art that the invention can be implemented in other specific forms without departing from the spirit or character thereof. The presently disclosed embodiments are therefore considered in all respects to be illustrative and not restrictive. The scope of the invention is illustrated by the appended claims rather than the foregoing description, and all changes that come within the meaning and range of equivalents thereof are intended to be embraced herein.

Claims

Claims:

1. A method of operating a wireless communication system comprising: in a controller, receiving streaming data contention-window slot assignment requests from streaming transmitter units; in the controller, assigning contention-window slot numbers to the requesting streaming transmitter units; in the controller, sending an indication of available contention-window slots to other transmitter units; and in the other transmitter units, using a randomly selected contention-window slot to begin transmitting wherein the randomly selected contention window slot is selected from contention-window slots other than the assigned contention-window slots.

2. The method of Claim 1, wherein the indication of the available contention-window slots is an indication of the first unassigned slot.

3. The method of Claim 2 wherein the randomly selected slot is selected from slots greater than or equal to the first unassigned slot.

4. The method of Claim 1 wherein the streaming data is audio data.

5. The method of Claim 1 wherein the streaming data is video data.

6. The method of Claim 1 wherein the number of assigned contention- window slots is limited.

7. A wireless communication system comprising: a controller adapted to receive streaming data contention-window slot requests from streaming transmitter units, the controller adapted to assign contention-window time slot numbers to requesting streaming transmitter units and send an indication of available contention- window slots to other transmitter units; at least one streaming transmitter unit adapted to begin transmitting in a contention-window time slot assigned by the controller; and at least one other transmitter unit adapted to begin transmitting in a randomly selected contention-window slot, the randomly selected contention- window slot being selected from slots other than the assigned slots, the at least one streaming transmitter unit and at least one other transmitter unit sensing the transmit medium and not beginning to transmit in a contention window if a another unit has begun transmitting.

8. The wireless communication system of Claim 7, wherein the indication of available contention- window slots is an indication of the first unassigned contention-window slot.

9. The wireless communication system of Claim 7 wherein the streaming data transmitted by the streaming transmitter unit comprises audio data.

10. The wireless communication system of Claim 7 wherein the streaming data transmitted by the streaming transmitter unit comprises video data.

11. The wireless communication system of Claim 7 wherein a limited number of assignable contention-window slots are available.

12. A wireless communication system comprising: a transmitter unit wirelessly transmitting data to a dumb receiver unit; the dumb receiver unit adapted to receive data from the transmitter unit but not adapted to send an acknowledgment signal to the transmitter unit; and a surrogate unit adapted to acknowledge the reception of data intended for the dumb receiver unit with a surrogate acknowledgment signal to the transmitter unit.

13. The wireless communication system of Claim 12 wherein there are multiple dumb receiver units for each surrogate unit.

14. The wireless communication system of Claim 12 wherein the dumb receiver unit is unable to transmit data.

15. The wireless communication system of Claim 12 wherein the surrogate unit is a control unit for the system.

16. The wireless communication system of Claim 12 wherein the acknowledgment signal is a medium-access-control acknowledgment signal.