WO2000070814A1 - Apparatus and method for selecting a size of a contention window for wireless system - Google Patents

Apparatus and method for selecting a size of a contention window for wireless system Download PDF

Info

Publication number
WO2000070814A1
WO2000070814A1 PCT/US2000/013123 US0013123W WO0070814A1 WO 2000070814 A1 WO2000070814 A1 WO 2000070814A1 US 0013123 W US0013123 W US 0013123W WO 0070814 A1 WO0070814 A1 WO 0070814A1
Authority
WO
WIPO (PCT)
Prior art keywords
contention window
random access
detector
time slots
size
Prior art date
Application number
PCT/US2000/013123
Other languages
French (fr)
Inventor
Fujio Watanbe
Theodore Buot
Roland Kuntze
Jari Jokela
Original Assignee
Nokia Inc.
Nokia Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Inc., Nokia Corporation filed Critical Nokia Inc.
Priority to AU47130/00A priority Critical patent/AU4713000A/en
Publication of WO2000070814A1 publication Critical patent/WO2000070814A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/08Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
    • H04W74/0841Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/12WLAN [Wireless Local Area Networks]
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates generally to the communication of packet data on a random access channel defined in a frame-formatted, time-division, communication system in which time slots of which the frames are formed are dynamically allocated to form random access channels. More particularly, the present invention relates to apparatus, and an associated method, by which to incrementally alter the size of a contention window, used by a sending station operable in such a system, to send a packet of data within the boundaries defined by the contention window. Operation of an embodiment of the present invention advantageously selects the size of the contention window at least selectively to take into account the number of time slots allocated to form random access channels in a frame. Improved throughput rates and power consumption performance of the sending station is possible.
  • a communication system is operable to communicate information between a sending station and a receiving station by way of a communication channel.
  • a radio communication system is a communication system in which the communication channel by which information is communicated between the sending and receiving stations is formed upon a portion of the electromagnetic spectrum. Such a communication channel is sometimes referred to as a radio channel. Because a radio channel does not require a wireline connection for its formation, a radio communication system inherently permits an increase in communication mobility relative to communication systems which require wired connections to form a communication channel. Bandwidth limitations, which limit the communication capacity of many types of communication systems, are particularly acute in radio communication systems. Such bandwidth limitations in a radio communication system are typically due to limitations on the amount of the electromagnetic spectrum allocable to the radio communication system.
  • Such bandwidth limitation limits the increase of communication capacity of a radio communication system. Increase of the communication capacity of the system, therefore, is sometimes only possible by increasing the efficiency by which the allocated spectrum is used.
  • Other types of communication systems similarly can exhibit a communication capacity increase as a result of increase in the efficiency by which the communication channels formed between sending and receiving stations of such systems are utilized.
  • Digital communication techniques for instance, provide a manner by which to increase the efficiency by which to effectuate communications upon communication channels of a communication system.
  • Implementation of digital communication techniques in a radio communication system is particularly advantageous due to the particular needs to efficiently utilize the spectrum allocated to such a system.
  • Information which is to be communicated in a communication system utilizing digital communication techniques is typically digitized into discrete, digital bits. Groups of the digital bits are sometimes formatted into packets to form packets of data.
  • the packets of data are communicated by the sending station, either individually or in groups, at discrete intervals to a receiving station. Once received at the receiving station, the packets of data are concatenated together to recreate the informational content contained therein.
  • a packet of data shall herein refer both to a request packet as well as an information packet.
  • the receiving station when a packet of data is received at a receiving station, the receiving station returns an acknowledgment to the sending station to indicate whether the packet of data has been successfully communicated to the receiving station. If the packet of data is indicated not to have been successfully communicated, the packet is retransmitted.
  • the communication channel upon which the packet is transmitted need not be dedicated to a single sending-receiving station pair. Instead, a shared communication channel can be used to communicate packets of data communicated between a plurality of sending-receiving station pairs. Because of the shared nature of the shared channel, improved communication capacity is possible.
  • the shared channel is formed of a random access channel in which sending stations are permitted random access thereto to communicate a packet of data thereon. While permitting the random access to the shared channel to transmit packets of data thereon provides a simple manner by which to effectuate communication of packets of data, lack of coordination between separate sending stations of separate-receiving station pairs might result in collisions of packets of data. That is to say, separate sending stations might attempt to transmit separate packets of data during overlapping time periods. Typically, when a collision condition occurs, the packets of data interfere with one another to an extent to prevent the recreation of their information content subsequent to reception at receiving stations. Packet data communications are effectuated, for instance, in conventional LANs (local area networks).
  • LANs local area networks
  • Wireless networks operable in manners analogous to wired LANs have also been developed and are utilized to communicate packets of data over a radio link upon which a random access channel is defined.
  • a High Performance Local Area Network type 2 (HIPERLAN/2) standard promulgated by the ETSI BRAN (Broadband Radio Access Network) project sets forth a standard of operation of an exemplary wireless LAN.
  • Mobile terminals operable therein transmit packet data upon random access channels to an access point of the infrastructure of the wireless LAN. When a packet of data is successfully communicated to the access point, a feedback acknowledgment indicating the successful communication is returned to the mobile terminal. And, if a collision or other error condition occurs, a feedback acknowledgment indicating unsuccessful transmission of the packet is returned to the mobile terminal.
  • a packet of data is not successfully communicated to a receiving station, the packet is retransmitted, typically according to a retransmission scheme.
  • back-off schemes such as a binary exponential back-off scheme, have been implemented to minimize the occurrence of collisions by exploiting the feedback acknowledgments returned by the receiving station.
  • Back-off schemes generally provide an improved manner of effectuating retransmission of packets of data from sending stations.
  • An exemplary back-off scheme is described in the IEEE 802.1 1 standard.
  • a contention window is defined.
  • the contention window has boundaries and the packet of data is transmitted upon a channel within the contention window boundaries. If the packet is not successfully communicated, the size of the contention window is increased and the packet is retransmitted.
  • the aforementioned BRAN system includes a dynamic slot allocation (DSA) scheme in which random access channels allocated to a particular frame are dynamically allocated. Successive frames might have different allocations of random access channels.
  • DSA dynamic slot allocation
  • the present invention accordingly, advantageously provides apparatus and an associated method, by which to incrementally alter the size of a contention window within which a sending station of a packet data communication system transmits a packet of data.
  • the size of the contention window is incrementally adjusted in manners to reduce the possibility of the occurrence of a collision condition.
  • the size of the contention window at least selectably takes into account the number of time slots allocated to form a random access channel in a frame-formatted, time-division, communication system in which time-slots, of which the frames are formed, are dynamically allocated to form the random access channels.
  • apparatus is provided for a sending station of a two-way, multi-user communication system in which any of a plurality of sending stations transmits packets of data upon a shared channel to a receiving station.
  • the receiving station is operable at least to return a feedback acknowledgment to the sending station to indicate successful communication of the packet data to the receiving station and also alternately to indicate unsuccessful communication of the packet. Unsuccessful communication is due, e.g.
  • the sending station transmits a packet of data within a contention window, the size of which is dependent upon at least a selected one of various factors.
  • the size of the contention window is incrementally adjusted in manners to reduce the likelihood of occurrence of a collision condition.
  • the sending station transmits packets of data upon selected time slots defining random access channels of a MAC (medium access control) frame in which time slots are dynamically allocated on a frame-by-frame basis.
  • a mobile terminal operable in a radio communication system, such as a BRAN (broadband radio access network) system, to communicate packet data.
  • the radio communication system is a multi-user communication system in which a plurality of mobile terminals operate to communicate packet data.
  • the packet data is transmitted upon a random access channel upon which any of the mobile terminals, including selected mobile terminals selected by a central station, are permitted random access to communicate packets of data thereon. Because of the shared nature of the random access channel, packets of data transmitted upon the random access channel are susceptible to collision. Such an occurrence is referred to as a collision condition. Because a collision condition prevents successful effectuation of communication of the packet of data, the packet of data must be retransmitted.
  • a contention window is defined to include a selected number of random access channels. In the proposed BRAN system or another system which utilizes dynamic slot allocation, the number of random access channels formed within a single frame, can vary on a frame-by-frame basis.
  • Indications of the number of random access channels of which a frame is defined is, in part, determinative of the size of the contention window. If retransmission of a packet of data is required due to a collision condition, the contention window is incrementally increased in size, and the packet of data is transmitted upon a random access channel within the contention window of increased size. By increasing the size of the contention window, the likelihood of occurrence of a collision condition is reduced.
  • selection is made of an initial size of a contention window within which to transmit a packet of data.
  • a determination is made of the number of random access channels contained within a frame. If the number of random access channels contained within the frame is greater than a certain number, the contention window is initially selected to be of a size corresponding to the number of available random access channels within the frame. Otherwise, the contention window is selected to be of a size corresponding to the certain number. If the contention window is selected to be of an initial size of the certain number, the contention window spans more than one frame.
  • the packet of data is transmitted upon a random access channel within the contention window.
  • the size of the contention window is selectably a number of time slots or a number of frames.
  • the size of the contention window is selected to be of a multi-frame size, improved power performance of the sending station is possible.
  • the size of the contention window is selected to be exponentially related to the number of times in which the packet of data is attempted to be transmitted.
  • the size of the contention window is incrementally increased with each additional transmission attempt by exponentially increasing the number of random access channel-time slots of which the contention window is formed. Once the number of transmission attempts is greater than the selected value, the contention window is sized to be of a multiple number of frames.
  • the size of the contention window as a function of frame-size is exponentially increased.
  • the size of the contention window is a multiple number of frames.
  • the contention window size is incrementally increased by a multiple number of frames.
  • the contention window is sized as a function of a number of time slots forming random access channels. Subsequent contention window sizes are incrementally increased as a function of numbers of time slots forming random access channels.
  • the mobile terminal first selects the size of a contention window on a slot-basis, i.e., ClV(slot).
  • ClV(slot) When the Cl/l (slot) is used, and a selected random access slot, b, within the CW(slot) is selected, if b is greater than a selected number j, the size of the contention window is selected on a frame basis, i.e. , CWftrame)n, upon which to transmit a packet.
  • the selected number y can be selected to be double an average number of random access slots per frame.
  • the size of the Cl ⁇ frame) is based upon an integer value of [b/j + 1], the selected CW(frame) must be more than three frames within CW(frame).
  • the mobile terminal selects one of the available random access slots within such frame to transmit a packet.
  • the mobile terminal chooses to use a Cl/l ⁇ frame) whenever the selected random access slot within the ClA/(slot) is large so that a reduction in power consumption can be effectuated.
  • the size of the contention window is incrementally adjusted based upon the number of earlier, successful transmissions of packets of data.
  • broadcasts are made to the mobile terminal of the number of time slots allocated to form random access channels in a frame and also the results of a previous transmission of packet of data.
  • the size of the contention window is selected to be of a value dependent upon the number of transmission attempts, less a value related to the success of prior transmissions.
  • a manner is provided by which to select a size of a contention window.
  • the size of the contention window is incrementally adjusted responsive, in part, to the number of time slots allocated to form random access channels in a frame formatted in a dynamic slot allocation scheme.
  • apparatus, and an associated method for selecting a contention window within which to transmit a packet of data.
  • the packet of data is sent by a sending station to a receiving station upon a random access channel defined in a time-division communication system.
  • Frames, each formed of a plurality of time slots, are defined.
  • the frames have a dynamically-allocable number of time slots forming random access channels.
  • a detector is coupled to receive indications of the number of time slots allocated to form the random access channels of the frames.
  • the detector detects the number of time slots allocated to form the random access channel of at least a selected frame.
  • a contention window selector is coupled to receive indications of detection by the detector of the number of time slots allocated to form the random access channels of the selected frame.
  • the contention window selector is coupled to receive indications of detection by the detector of the number of time slots allocated to form the random access channels of the selected frame.
  • the contention window selector is selectably operable to select a size of the contention window responsive, at least in part, to the number of time slots detected by the detector.
  • Figure 1 illustrates a functional block diagram of a communication system in which an embodiment of the present invention is operable.
  • Figure 2 illustrates frame format of an MAC (medium access control) frame pursuant to which communications are formatted during operation of an exemplary implementation of the communication system shown in Figure 1.
  • MAC medium access control
  • Figure 3 illustrates a contention window formed during operation of an embodiment of the present invention and within which a packet of data is transmitted.
  • Figure 4 illustrates the formation of contention windows formed during operation of another embodiment of the present invention.
  • Figure 5 illustrates the formation of contention windows formed during operation of another embodiment of the present invention.
  • Figure 6 illustrates a method flow diagram listing the method of operation of an embodiment of the present invention.
  • a communication system shown generally at 10, provides for the communication of packet data between a mobile terminal 12 and an access point (AP) 14.
  • the communication system 10 is a multi-user communication system permitting of a plurality of mobile terminals 12 to communicate packet data with the access point 14. While only a single mobile terminal 12 is shown in the Figure, in an actual communication system, a plurality of such mobile terminals are operable to communicate packet data with the access point.
  • the communication system 10 shown in the Figure forms a radio communication system in which a radio link formed between the mobile terminal and the access point permits the formation thereon of communication channels to effectuate the packet data between the mobile terminal and the access point.
  • the communication system 10 is exemplary; in other implementations, the communication system 10 can be constructed in other manners and analogously represented. That is to say, the mobile terminal 12 is generally representative of a sending station operable to send a packet of data upon a random access channel, and the access point 14 is representative of a receiving station operable to receive the packet of data and to acknowledge whether the communication of the packet of data has been successfully effectuated.
  • Packet data generated by the mobile terminal is communicated upon a random access channel (RACH) 16, here defined upon the radio link formed between the mobile terminal and the access point.
  • RACH random access channel
  • the random access channel 16 is randomly accessible by the mobile terminal 12 shown in the Figure as well as other mobile terminals operable in the communication system.
  • Feedback acknowledgments are returned by the access point 14 by way of a broadcast, or other feedback (e.g., an inband control channel), channel (BCH) 18.
  • the feedback acknowledgment is, for example, binary indicating successful or unsuccessful communication of the packet of data, or the feedback information is ternary, indicating idle condition, successful communication, or unsuccessful communication.
  • Uplink (ULCH) and downlink (DLCH) channels 20 are also defined upon the radio link to extend between the mobile terminal and the access point. Other uplink and downlink information is communicated upon the channels 20.
  • the communication system 10 shown in the Figure is exemplary of a wireless (LAN) local area network, such as the wireless (LAN) set forth in the ETSI-promulgated BRAN (broadband radio access network) system standard.
  • a wireless LAN is installed, for instance, within a building structure with separate access points 14 installed at different floors of the building structure or at different portions of a single floor of the building structure.
  • the access point 14 forms a multiple-access transceiver, capable here at least to receive packets of data generated by a plurality of mobile terminals, of which the mobile terminal 12 is exemplary, and to broadcast feedback acknowledgments back to such mobile terminals.
  • the access point 14 is here shown to be coupled to a controller 22 which controls operation of the LAN and is, in turn, coupled to other communication systems, such as a macrocellular communication system, a PSTN (public-switched telephonic network), a TCP/IP network, or other communication system.
  • a controller 22 which controls operation of the LAN and is, in turn, coupled to other communication systems, such as a macrocellular communication system, a PSTN (public-switched telephonic network), a TCP/IP network, or other communication system.
  • PSTN public-switched telephonic network
  • TCP/IP Transmission Control Protocol/Internet Protocol
  • the mobile terminal 12 includes transmitter circuitry 28 and receiver circuitry 32.
  • the transmitter circuitry 28 is coupled to receive data sourced at a data source 34, either provided to the transmitter circuitry in packet form, or formatted into packet data at the transmitter circuitry.
  • the transmitter circuitry is operable, amongst other things, to transmit the data applied thereto by the data source 34 upon selected random access channels 16 for communication to the access point 14.
  • the receiver circuitry 32 is operable at least to receive feedback acknowledgments by the access point 14 on the broadcast channel 18.
  • the receiver circuitry is here shown further to be coupled to a data sink 36 to which other information received by the receiver circuitry 32 is applied.
  • the mobile terminal further includes a controller 38 which is operable, in part, to control operation of the transmitter and receiver circuitry 28 and 32 of the mobile terminal.
  • the controller is formed of a processing device, together with associated circuitry, at which algorithms are executed to perform the functions of the controller.
  • the controller is here shown to include functional elements, the functions of which are performed during operation of the controller.
  • the controller includes a detector 42 which is coupled to the receiver circuitry by way of the line 44.
  • the detector is operable to detect indications received by the receiver circuitry 32 of feedback acknowledgments broadcast to the mobile terminal on the broadcast channel 18. Indications of detections by the detector are provided to a contention window selector 46, here shown by way of the line 48.
  • the contention window selector is operable, at least to the indications of the detections made by the detector, to select a size of a contention window.
  • the contention window is of a size to include a selected number of time slots forming random access channels, or entire frames, and indications of the selected window size are provided by the contention window selector to the transmitter circuitry 28, here by way of the lines 52.
  • the access point 14 broadcasts upon the broadcast channel both an indication of whether a prior transmission of a packet of data has been successfully communicated to the access point, and also the number of time slots allocated to form random access channels within a particular frame.
  • the information is received by the receiver circuitry, and the detector is operable to detect the values of the feedback acknowledgment and the time slots allocated to form random access channels. Indications of these detections are provided to the contention window selector 46, and the contention window selector is operable, at least in part, responsive to such indications.
  • the contention window size selected by the selector 46 is provided to the transmitter circuitry which causes a packet of data sourced by the data source 34 to be inserted into a random access channel within the contention window selected by the selector.
  • the controller 38 is further shown to include an average number calculator 56 coupled to receive the indications of detections made by the detector on the line 48.
  • the average number calculator is operable to calculate an average number of time slots allocated to form random access channels over a plurality of frames. Values of the average calculated by the calculator 56 are provided to the contention window selector, here by way of the line 58. In one embodiment, selection of the size of the contention window by the selector 46 is further responsive to the average calculated by the calculator.
  • the controller 38 further includes a counter 62 coupled to the transmitter circuitry, here shown by way of the line 64.
  • the counter 62 is operable to count the number of transmission attempts by which a packet of data is attempted to be transmitted by the mobile terminal.
  • the count value of the counter 62 is provided to the detector 42, here by way of the line 66. And, the detector provides such value to the contention window selector.
  • the size of the contention window selected by the selector is, in part, responsive to the count value determined by the counter.
  • FIG. 2 illustrates a single MAC (medium access control) frame 72 defined in the BRAN system standard.
  • the MAC frame 72 is a frame formatted pursuant to a DSA (dynamic slot allocation) scheme.
  • the MAC frame 72 defines a TDD (time-division-duplex) communication scheme.
  • the MAC frame is formed of a plurality of successive time slots 76, and groups of the time slots 76 are partitioned into different portions.
  • a first portion 78 formed by the first group of time slots 76, form broadcast channels (BCHs) 18.
  • Second and third portions 82 and 84, formed of a second and third group of time slots 76, form the uplink and downlink (ULCH and DLCH) channels 20.
  • a fourth portion 86 formed of a fourth group of time slots 76, form random access channels (RACHs) 16.
  • RACHs random access channels
  • the access point 14 (shown in Figure 1 ) broadcasts on selected broadcast channels 16 of the first portion of the frame 72 feedback acknowledgments to mobile terminals and also indications of the number of time slots allocated to form random access channels 16 which form the fourth portion 86 of the frame. Broadcasts of such information on selected broadcast channels by the access point 14 are detected by the receiver circuitry 32 (shown in Figure 1 ) of a mobile terminal.
  • the detector 42 coupled to the receiver circuitry by way of the line 44, detects the values of the feedback acknowledgment and the number of random access channels contained in the frame and provides indications of such detection to the contention window selector 46. Responsive to such information, selection is made by the contention window of the size of the contention window.
  • a packet of data is caused to be communicated by the transmitter circuitry upon a random access channel within the boundaries of the contention window so-selected.
  • Figure 3 illustrates several sequentially positioned MAC frames
  • Contention windows are selected during operation of an embodiment of the present invention and packet data is caused to be transmitted upon various of the channels within the boundaries of the contention windows.
  • a 0, wherein a is the attempt number, determination is made as to the number of random access channels which are available within a frame. For instance when n random access channels are contained within an initial frame, a packet of data can be caused to be transmitted upon one of the available random access channels. If, for example, only one random access channel is available in the frame, the packet is caused to be transmitted upon the available channel.
  • traffic conditions in the communication system are significant, there is a likelihood of occurrence of a collision condition. Generally, when traffic conditions are high, the number of random access channels is relatively small. And, when the traffic conditions are low, the number of available random access channels is typically large.
  • the initial size of the contention window, CW is defined as follows:
  • n is the number of available random access channels per frame, variable on a frame-by-frame basis
  • m is a selected number, for instance, the average number of random access channels per frame
  • the selected number m is a fixed value, stored at the mobile terminal.
  • the selected value m is a system parameter, downloaded to the mobile terminal.
  • the selected number m is calculated by the average number calculator 56 and applied to the contention window selector 46 by way of the line 58.
  • the Figure also illustrates broadcast channel 20 information, namely feedback acknowledgment and random access channel numbering information. In the Figure, such broadcasts are indicated by the arrows 92, 94, and 96.
  • the contention window is defined to be of a size corresponding to the bracket 98 which encompasses five random access channels. For purposes of example, a packet of data is transmitted in the second random access channel of the left-most (as shown) frame.
  • Figure 4 illustrates another successive series of frames 72, each frame having a dynamically-allocated number of time slots allocated to form random access channels. Operation of an embodiment of the present invention also contemplates selection of the size of the contention window to be a multiple number of frames. By selecting the size of the contention window to correspond to that of a multiple number of frames, power consumption reduction at the mobile terminal is possible as the mobile terminal is permitted to enter into a sleep mode during portions of a frame instead of counting the number of random access channels in each of the frames.
  • a is the number of transmission attempts
  • k is a selected value defined, for instance, as a current traffic load or expiration time-related value.
  • Review of the above equations indicates that when the transmission attempt number is less than the selected value k, the size of the contention window is of a time slot number exponentially related to the transmission attempt number.
  • the contention window size is selected to be of a multiple number of frames, the multiple being exponentially related to the transmission attempt number. Because the size of the contention window is selected either to be of a size which is a function of a number of time slots, or a function of a number of frames, power consumption at the mobile terminal can be selectively reduced.
  • the brackets 106 represent contention windows which are of sizes which are of multiple numbers of time slots, exponentially related to the transmission attempt number.
  • the transmission attempt number equals the selected value k, here indicated at the time designated by the arrow 108
  • the sizes of the contention windows become multiples of numbers of frames.
  • the brackets 1 12 represent contention windows of sizes which are of multiple numbers of frames according to the above equation.
  • the size of the contention window is the size of the contention window
  • Figure 5 represents this embodiment. A series of successively- positioned frames 72 is again illustrated. The contention windows of sizes corresponding to multiple numbers of frames are indicated in the Figure by brackets 1 16. When the transmission attempt number exceeds the selected value k, the size of the contention window is thereafter selected to be a multiple number of time slots forming random access channels.
  • the brackets 122 represent contention windows of sizes corresponding to multiple numbers of time slots.
  • the size of the contention window By selecting the size of the contention window to be selected on a frame basis, ClV(frame), that is, to be of a size corresponding to a, or a multiple number of frames, power savings can be achieved.
  • the size of the contention window selected by the contention window selector to be of a size responsive to a combination of the transmission attempt number and the number of prior, successful transmissions of packet data.
  • the size of the contention window, CW is defined as follows:
  • / is the number of successful packet data transmissions in a previous frame.
  • the size of the contention windows is incremented based upon the number of successful transmissions in a prior frame.
  • the variable / is downloaded to the mobile terminal together with the other information broadcast upon the broadcast channel 18.
  • the mobile terminal is operable in this embodiment, subsequent to becoming active, to listen to the feedback broadcast upon the feedback channel 18 to become synchronized to the channel and thereafter to transmit the packet of data.
  • one of the available random access channels is randomly selected upon which to transmit the packet of data.
  • the size of the contention window is incrementally adjusted according to the above equation.
  • FIG. 6 illustrates a method, shown generally at 132, of an embodiment of the present invention.
  • the method 132 selects a contention window within which to transmit a packet of data at a sending station to a receiving station.
  • the packet of data is transmittable upon a random access channel defined in a time-division communication system.
  • frames each formed of a plurality of time slots, are defined.
  • the frames have a dynamically- allocable number of time slots forming random access channels.
  • a number of time slots allocated to form the random access channels of a selected frame is detected.
  • the size of the contention window is selected responsive, at least in part, to the detected number of time slots.
  • Operation of the various embodiments of the present invention at least selectively take into account the number of time slots dynamically allocated to form random access channels. Because advantage is taken of the variable number of time slots which form random access channels on a frame-by-frame basis, improved operational throughput is possible.

Abstract

Apparatus, and an associated method, by which to select the size of a contention window within which to transmit a packet of data upon a random access channel in a multi-user scheme. The number of time slots allocated to form random access channels in a frame is selectably variable in a dynamic manner. Advantage is made of the dynamic allocation of random access channels to select the size of the contention window. Operation is advantageously implemented in a mobile terminal operable in a wireless LAN (local area network), such as that set forth in the BRAN (broadband access network) promulgated by the ETSI.

Description

APPARATUS AND METHOD FOR SELECTING A SIZE OF A CONTENTION WINDOW FOR WIRELESS SYSTEM
The present invention relates generally to the communication of packet data on a random access channel defined in a frame-formatted, time-division, communication system in which time slots of which the frames are formed are dynamically allocated to form random access channels. More particularly, the present invention relates to apparatus, and an associated method, by which to incrementally alter the size of a contention window, used by a sending station operable in such a system, to send a packet of data within the boundaries defined by the contention window. Operation of an embodiment of the present invention advantageously selects the size of the contention window at least selectively to take into account the number of time slots allocated to form random access channels in a frame. Improved throughput rates and power consumption performance of the sending station is possible.
BACKGROUND OF THE INVENTION
A communication system is operable to communicate information between a sending station and a receiving station by way of a communication channel. A radio communication system is a communication system in which the communication channel by which information is communicated between the sending and receiving stations is formed upon a portion of the electromagnetic spectrum. Such a communication channel is sometimes referred to as a radio channel. Because a radio channel does not require a wireline connection for its formation, a radio communication system inherently permits an increase in communication mobility relative to communication systems which require wired connections to form a communication channel. Bandwidth limitations, which limit the communication capacity of many types of communication systems, are particularly acute in radio communication systems. Such bandwidth limitations in a radio communication system are typically due to limitations on the amount of the electromagnetic spectrum allocable to the radio communication system. Such bandwidth limitation limits the increase of communication capacity of a radio communication system. Increase of the communication capacity of the system, therefore, is sometimes only possible by increasing the efficiency by which the allocated spectrum is used. Other types of communication systems similarly can exhibit a communication capacity increase as a result of increase in the efficiency by which the communication channels formed between sending and receiving stations of such systems are utilized.
Digital communication techniques, for instance, provide a manner by which to increase the efficiency by which to effectuate communications upon communication channels of a communication system. Implementation of digital communication techniques in a radio communication system is particularly advantageous due to the particular needs to efficiently utilize the spectrum allocated to such a system.
Information which is to be communicated in a communication system utilizing digital communication techniques is typically digitized into discrete, digital bits. Groups of the digital bits are sometimes formatted into packets to form packets of data. The packets of data are communicated by the sending station, either individually or in groups, at discrete intervals to a receiving station. Once received at the receiving station, the packets of data are concatenated together to recreate the informational content contained therein. A packet of data shall herein refer both to a request packet as well as an information packet. In some of such communication systems, when a packet of data is received at a receiving station, the receiving station returns an acknowledgment to the sending station to indicate whether the packet of data has been successfully communicated to the receiving station. If the packet of data is indicated not to have been successfully communicated, the packet is retransmitted.
Because packets of data can be communicated at discrete intervals, the communication channel upon which the packet is transmitted need not be dedicated to a single sending-receiving station pair. Instead, a shared communication channel can be used to communicate packets of data communicated between a plurality of sending-receiving station pairs. Because of the shared nature of the shared channel, improved communication capacity is possible.
Sometimes the shared channel is formed of a random access channel in which sending stations are permitted random access thereto to communicate a packet of data thereon. While permitting the random access to the shared channel to transmit packets of data thereon provides a simple manner by which to effectuate communication of packets of data, lack of coordination between separate sending stations of separate-receiving station pairs might result in collisions of packets of data. That is to say, separate sending stations might attempt to transmit separate packets of data during overlapping time periods. Typically, when a collision condition occurs, the packets of data interfere with one another to an extent to prevent the recreation of their information content subsequent to reception at receiving stations. Packet data communications are effectuated, for instance, in conventional LANs (local area networks). Wireless networks operable in manners analogous to wired LANs have also been developed and are utilized to communicate packets of data over a radio link upon which a random access channel is defined. A High Performance Local Area Network type 2 (HIPERLAN/2) standard promulgated by the ETSI BRAN (Broadband Radio Access Network) project sets forth a standard of operation of an exemplary wireless LAN. Mobile terminals operable therein transmit packet data upon random access channels to an access point of the infrastructure of the wireless LAN. When a packet of data is successfully communicated to the access point, a feedback acknowledgment indicating the successful communication is returned to the mobile terminal. And, if a collision or other error condition occurs, a feedback acknowledgment indicating unsuccessful transmission of the packet is returned to the mobile terminal.
In the just-mentioned BRAN system, as well as in other packet data communication systems, if a packet of data is not successfully communicated to a receiving station, the packet is retransmitted, typically according to a retransmission scheme. For instance, back-off schemes, such as a binary exponential back-off scheme, have been implemented to minimize the occurrence of collisions by exploiting the feedback acknowledgments returned by the receiving station. Back-off schemes generally provide an improved manner of effectuating retransmission of packets of data from sending stations. An exemplary back-off scheme is described in the IEEE 802.1 1 standard.
Conventional exponential back-off schemes, such as the scheme set forth in the IEEE 802.1 1 standard, is predicated on various assumptions, including immediate feedback. Also, conventional, exponential back-off schemes have been intended for statically-defined systems. That is to say, conventional back-off schemes have generally been applied to systems in which the frame formats by which the packets are communicated are unchanging.
In a typical back-off scheme, a contention window is defined. The contention window has boundaries and the packet of data is transmitted upon a channel within the contention window boundaries. If the packet is not successfully communicated, the size of the contention window is increased and the packet is retransmitted.
The aforementioned BRAN system, as well as others, include a dynamic slot allocation (DSA) scheme in which random access channels allocated to a particular frame are dynamically allocated. Successive frames might have different allocations of random access channels.
Advantage is not taken of the variable nature of random access channels assigned in a dynamic slot allocation system, such as that proposed for the BRAN system in existing exponential back-off schemes.
A manner by which to define the size of a contention window utilized in a back-off scheme which takes into account the dynamic nature of a DSA system and which is better operable in a delayed feedback system would, therefore, be advantageous.
It is in light of this background information related to the communication of packet data that the significant improvements of the present invention have evolved.
SUMMARY OF THE INVENTION The present invention, accordingly, advantageously provides apparatus and an associated method, by which to incrementally alter the size of a contention window within which a sending station of a packet data communication system transmits a packet of data. The size of the contention window is incrementally adjusted in manners to reduce the possibility of the occurrence of a collision condition.
In one implementation, the size of the contention window at least selectably takes into account the number of time slots allocated to form a random access channel in a frame-formatted, time-division, communication system in which time-slots, of which the frames are formed, are dynamically allocated to form the random access channels. In one aspect of the present invention, apparatus is provided for a sending station of a two-way, multi-user communication system in which any of a plurality of sending stations transmits packets of data upon a shared channel to a receiving station. The receiving station is operable at least to return a feedback acknowledgment to the sending station to indicate successful communication of the packet data to the receiving station and also alternately to indicate unsuccessful communication of the packet. Unsuccessful communication is due, e.g. , to a collision condition in the event that two or more sending stations have transmitted a packet of data upon the shared channel during an overlapping time period, resulting in a collision of the packets of data. During operation of an embodiment of the present invention, the sending station transmits a packet of data within a contention window, the size of which is dependent upon at least a selected one of various factors. The size of the contention window is incrementally adjusted in manners to reduce the likelihood of occurrence of a collision condition. In another aspect of the present invention, the sending station transmits packets of data upon selected time slots defining random access channels of a MAC (medium access control) frame in which time slots are dynamically allocated on a frame-by-frame basis. In a TDD (time-division-duplex) system, an indication of the number of time slots allocated to form random access channels in that frame is broadcast to the sending station. At least selectably responsive to the number of time slots allocated to form random access channels in the frame, a determination is made as to the size of the contention window. In a further aspect of the present invention, apparatus and an associated method, is provided for a mobile terminal operable in a radio communication system, such as a BRAN (broadband radio access network) system, to communicate packet data. The radio communication system is a multi-user communication system in which a plurality of mobile terminals operate to communicate packet data. The packet data is transmitted upon a random access channel upon which any of the mobile terminals, including selected mobile terminals selected by a central station, are permitted random access to communicate packets of data thereon. Because of the shared nature of the random access channel, packets of data transmitted upon the random access channel are susceptible to collision. Such an occurrence is referred to as a collision condition. Because a collision condition prevents successful effectuation of communication of the packet of data, the packet of data must be retransmitted. A contention window is defined to include a selected number of random access channels. In the proposed BRAN system or another system which utilizes dynamic slot allocation, the number of random access channels formed within a single frame, can vary on a frame-by-frame basis. Indications of the number of random access channels of which a frame is defined is, in part, determinative of the size of the contention window. If retransmission of a packet of data is required due to a collision condition, the contention window is incrementally increased in size, and the packet of data is transmitted upon a random access channel within the contention window of increased size. By increasing the size of the contention window, the likelihood of occurrence of a collision condition is reduced.
In one implementation, selection is made of an initial size of a contention window within which to transmit a packet of data. A determination is made of the number of random access channels contained within a frame. If the number of random access channels contained within the frame is greater than a certain number, the contention window is initially selected to be of a size corresponding to the number of available random access channels within the frame. Otherwise, the contention window is selected to be of a size corresponding to the certain number. If the contention window is selected to be of an initial size of the certain number, the contention window spans more than one frame. The packet of data is transmitted upon a random access channel within the contention window.
In another implementation, the size of the contention window is selectably a number of time slots or a number of frames. By selecting the size of the contention window to be of a multi-frame size, improved power performance of the sending station is possible. When the contention window is of a size which is a function of a number of random access channels, the size of the contention window is selected to be exponentially related to the number of times in which the packet of data is attempted to be transmitted. When the number of transmission attempts is less than a selected value, the size of the contention window is incrementally increased with each additional transmission attempt by exponentially increasing the number of random access channel-time slots of which the contention window is formed. Once the number of transmission attempts is greater than the selected value, the contention window is sized to be of a multiple number of frames. With each additional transmission attempt thereafter, the size of the contention window as a function of frame-size, is exponentially increased. In an alternate implementation, when the number of transmission attempts is less than the selected value, the size of the contention window is a multiple number of frames. The contention window size is incrementally increased by a multiple number of frames. Once the number of transmission attempts exceeds the selected value, the contention window is sized as a function of a number of time slots forming random access channels. Subsequent contention window sizes are incrementally increased as a function of numbers of time slots forming random access channels.
In another alternate implementation, the mobile terminal first selects the size of a contention window on a slot-basis, i.e., ClV(slot). When the Cl/l (slot) is used, and a selected random access slot, b, within the CW(slot) is selected, if b is greater than a selected number j, the size of the contention window is selected on a frame basis, i.e. , CWftrame)n, upon which to transmit a packet. For instance, the selected number y can be selected to be double an average number of random access slots per frame. Although the size of the Cl^frame) is based upon an integer value of [b/j + 1], the selected CW(frame) must be more than three frames within CW(frame). Subsequent to this frame ClA/(frame), the mobile terminal selects one of the available random access slots within such frame to transmit a packet. In this implementation, then, the mobile terminal chooses to use a Cl/l^frame) whenever the selected random access slot within the ClA/(slot) is large so that a reduction in power consumption can be effectuated.
In another implementation, the size of the contention window is incrementally adjusted based upon the number of earlier, successful transmissions of packets of data. In a BRAN system, or the like, broadcasts are made to the mobile terminal of the number of time slots allocated to form random access channels in a frame and also the results of a previous transmission of packet of data. The size of the contention window is selected to be of a value dependent upon the number of transmission attempts, less a value related to the success of prior transmissions.
Thereby, through operation of various embodiments of the present invention, a manner is provided by which to select a size of a contention window. The size of the contention window is incrementally adjusted responsive, in part, to the number of time slots allocated to form random access channels in a frame formatted in a dynamic slot allocation scheme.
In these and other aspects, therefore, apparatus, and an associated method is provided for selecting a contention window within which to transmit a packet of data. The packet of data is sent by a sending station to a receiving station upon a random access channel defined in a time-division communication system. Frames, each formed of a plurality of time slots, are defined. The frames have a dynamically-allocable number of time slots forming random access channels. A detector is coupled to receive indications of the number of time slots allocated to form the random access channels of the frames. The detector detects the number of time slots allocated to form the random access channel of at least a selected frame. A contention window selector is coupled to receive indications of detection by the detector of the number of time slots allocated to form the random access channels of the selected frame. The contention window selector is coupled to receive indications of detection by the detector of the number of time slots allocated to form the random access channels of the selected frame. The contention window selector is selectably operable to select a size of the contention window responsive, at least in part, to the number of time slots detected by the detector.
A more complete appreciation of the present invention and the scope thereof can be obtained from the accompanying drawings which are briefly summarized below, the following detailed description of the presently-preferred embodiments of the invention, and the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 illustrates a functional block diagram of a communication system in which an embodiment of the present invention is operable. Figure 2 illustrates frame format of an MAC (medium access control) frame pursuant to which communications are formatted during operation of an exemplary implementation of the communication system shown in Figure 1.
Figure 3 illustrates a contention window formed during operation of an embodiment of the present invention and within which a packet of data is transmitted.
Figure 4 illustrates the formation of contention windows formed during operation of another embodiment of the present invention.
Figure 5 illustrates the formation of contention windows formed during operation of another embodiment of the present invention.
Figure 6 illustrates a method flow diagram listing the method of operation of an embodiment of the present invention.
DETAILED DESCRIPTION
Referring first to Figure 1 , a communication system, shown generally at 10, provides for the communication of packet data between a mobile terminal 12 and an access point (AP) 14. The communication system 10 is a multi-user communication system permitting of a plurality of mobile terminals 12 to communicate packet data with the access point 14. While only a single mobile terminal 12 is shown in the Figure, in an actual communication system, a plurality of such mobile terminals are operable to communicate packet data with the access point.
The communication system 10 shown in the Figure forms a radio communication system in which a radio link formed between the mobile terminal and the access point permits the formation thereon of communication channels to effectuate the packet data between the mobile terminal and the access point. The communication system 10 is exemplary; in other implementations, the communication system 10 can be constructed in other manners and analogously represented. That is to say, the mobile terminal 12 is generally representative of a sending station operable to send a packet of data upon a random access channel, and the access point 14 is representative of a receiving station operable to receive the packet of data and to acknowledge whether the communication of the packet of data has been successfully effectuated.
Packet data generated by the mobile terminal is communicated upon a random access channel (RACH) 16, here defined upon the radio link formed between the mobile terminal and the access point. The random access channel 16 is randomly accessible by the mobile terminal 12 shown in the Figure as well as other mobile terminals operable in the communication system. Feedback acknowledgments are returned by the access point 14 by way of a broadcast, or other feedback (e.g., an inband control channel), channel (BCH) 18. The feedback acknowledgment is, for example, binary indicating successful or unsuccessful communication of the packet of data, or the feedback information is ternary, indicating idle condition, successful communication, or unsuccessful communication. Uplink (ULCH) and downlink (DLCH) channels 20 are also defined upon the radio link to extend between the mobile terminal and the access point. Other uplink and downlink information is communicated upon the channels 20.
The communication system 10 shown in the Figure is exemplary of a wireless (LAN) local area network, such as the wireless (LAN) set forth in the ETSI-promulgated BRAN (broadband radio access network) system standard. A wireless LAN is installed, for instance, within a building structure with separate access points 14 installed at different floors of the building structure or at different portions of a single floor of the building structure. The access point 14 forms a multiple-access transceiver, capable here at least to receive packets of data generated by a plurality of mobile terminals, of which the mobile terminal 12 is exemplary, and to broadcast feedback acknowledgments back to such mobile terminals. The access point 14 is here shown to be coupled to a controller 22 which controls operation of the LAN and is, in turn, coupled to other communication systems, such as a macrocellular communication system, a PSTN (public-switched telephonic network), a TCP/IP network, or other communication system.
The mobile terminal 12 includes transmitter circuitry 28 and receiver circuitry 32. The transmitter circuitry 28 is coupled to receive data sourced at a data source 34, either provided to the transmitter circuitry in packet form, or formatted into packet data at the transmitter circuitry. The transmitter circuitry is operable, amongst other things, to transmit the data applied thereto by the data source 34 upon selected random access channels 16 for communication to the access point 14. The receiver circuitry 32 is operable at least to receive feedback acknowledgments by the access point 14 on the broadcast channel 18. The receiver circuitry is here shown further to be coupled to a data sink 36 to which other information received by the receiver circuitry 32 is applied.
The mobile terminal further includes a controller 38 which is operable, in part, to control operation of the transmitter and receiver circuitry 28 and 32 of the mobile terminal. In the exemplary implementation, the controller is formed of a processing device, together with associated circuitry, at which algorithms are executed to perform the functions of the controller. The controller is here shown to include functional elements, the functions of which are performed during operation of the controller.
The controller includes a detector 42 which is coupled to the receiver circuitry by way of the line 44. The detector is operable to detect indications received by the receiver circuitry 32 of feedback acknowledgments broadcast to the mobile terminal on the broadcast channel 18. Indications of detections by the detector are provided to a contention window selector 46, here shown by way of the line 48. The contention window selector is operable, at least to the indications of the detections made by the detector, to select a size of a contention window. The contention window is of a size to include a selected number of time slots forming random access channels, or entire frames, and indications of the selected window size are provided by the contention window selector to the transmitter circuitry 28, here by way of the lines 52.
As shall be noted more fully hereinbelow, when the communication scheme by which the communication system 10 is operable in which the number of time slots forming random access channels are dynamically allocated, the access point 14 broadcasts upon the broadcast channel both an indication of whether a prior transmission of a packet of data has been successfully communicated to the access point, and also the number of time slots allocated to form random access channels within a particular frame. The information is received by the receiver circuitry, and the detector is operable to detect the values of the feedback acknowledgment and the time slots allocated to form random access channels. Indications of these detections are provided to the contention window selector 46, and the contention window selector is operable, at least in part, responsive to such indications. And, the contention window size selected by the selector 46 is provided to the transmitter circuitry which causes a packet of data sourced by the data source 34 to be inserted into a random access channel within the contention window selected by the selector.
The controller 38 is further shown to include an average number calculator 56 coupled to receive the indications of detections made by the detector on the line 48. The average number calculator is operable to calculate an average number of time slots allocated to form random access channels over a plurality of frames. Values of the average calculated by the calculator 56 are provided to the contention window selector, here by way of the line 58. In one embodiment, selection of the size of the contention window by the selector 46 is further responsive to the average calculated by the calculator.
The controller 38 further includes a counter 62 coupled to the transmitter circuitry, here shown by way of the line 64. The counter 62 is operable to count the number of transmission attempts by which a packet of data is attempted to be transmitted by the mobile terminal. The count value of the counter 62 is provided to the detector 42, here by way of the line 66. And, the detector provides such value to the contention window selector. In one implementation, the size of the contention window selected by the selector is, in part, responsive to the count value determined by the counter.
Figure 2 illustrates a single MAC (medium access control) frame 72 defined in the BRAN system standard. The MAC frame 72 is a frame formatted pursuant to a DSA (dynamic slot allocation) scheme. The MAC frame 72 defines a TDD (time-division-duplex) communication scheme. The MAC frame is formed of a plurality of successive time slots 76, and groups of the time slots 76 are partitioned into different portions. A first portion 78, formed by the first group of time slots 76, form broadcast channels (BCHs) 18. Second and third portions 82 and 84, formed of a second and third group of time slots 76, form the uplink and downlink (ULCH and DLCH) channels 20. And, a fourth portion 86, formed of a fourth group of time slots 76, form random access channels (RACHs) 16.
The access point 14 (shown in Figure 1 ) broadcasts on selected broadcast channels 16 of the first portion of the frame 72 feedback acknowledgments to mobile terminals and also indications of the number of time slots allocated to form random access channels 16 which form the fourth portion 86 of the frame. Broadcasts of such information on selected broadcast channels by the access point 14 are detected by the receiver circuitry 32 (shown in Figure 1 ) of a mobile terminal. The detector 42, coupled to the receiver circuitry by way of the line 44, detects the values of the feedback acknowledgment and the number of random access channels contained in the frame and provides indications of such detection to the contention window selector 46. Responsive to such information, selection is made by the contention window of the size of the contention window. A packet of data is caused to be communicated by the transmitter circuitry upon a random access channel within the boundaries of the contention window so-selected. Figure 3 illustrates several sequentially positioned MAC frames
72, each having a number of random access channels 16. Contention windows are selected during operation of an embodiment of the present invention and packet data is caused to be transmitted upon various of the channels within the boundaries of the contention windows.
For an initial transmission attempt, a = 0, wherein a is the attempt number, determination is made as to the number of random access channels which are available within a frame. For instance when n random access channels are contained within an initial frame, a packet of data can be caused to be transmitted upon one of the available random access channels. If, for example, only one random access channel is available in the frame, the packet is caused to be transmitted upon the available channel. However, if traffic conditions in the communication system are significant, there is a likelihood of occurrence of a collision condition. Generally, when traffic conditions are high, the number of random access channels is relatively small. And, when the traffic conditions are low, the number of available random access channels is typically large.
In an exemplary operation of an embodiment of the present invention, the initial size of the contention window, CW, is defined as follows:
n n ≥ m
CW.. m n < m
wherein: n is the number of available random access channels per frame, variable on a frame-by-frame basis; m is a selected number, for instance, the average number of random access channels per frame; and a equals the attempt number, for the initial attempt, a = 0. In one embodiment, the selected number m is a fixed value, stored at the mobile terminal. In another implementation, the selected value m is a system parameter, downloaded to the mobile terminal. And, in another implementation, the selected number m is calculated by the average number calculator 56 and applied to the contention window selector 46 by way of the line 58.
In the illustration of Figure 3, a left-most (as shown) frame 72 includes three, i.e., n =3, random access channels 16. The subsequent, left-center (as shown) frame 72 includes a single, i.e., n = 1 , random access channel 16. A right-center (as shown) frame 72 includes seven, i.e. , n = 7, random access channels 16. And, a rightmost (as shown) frame 72 includes five, i.e., n = 5, random access channels 16. The Figure also illustrates broadcast channel 20 information, namely feedback acknowledgment and random access channel numbering information. In the Figure, such broadcasts are indicated by the arrows 92, 94, and 96.
During the initial transmission attempt at the left-most frame, and using the above-noted equation, n is set to be five as the average number of random access channels per frame is selected, by prior calculation, to be of that value. But, because the number of time slots allocated to form random access channels in the first frame 72 is three, i.e., n = 3, the contention window, CW, is set to be of a value of five according to the above equation. The contention window is defined to be of a size corresponding to the bracket 98 which encompasses five random access channels. For purposes of example, a packet of data is transmitted in the second random access channel of the left-most (as shown) frame.
If, conversely, the first transmission attempt occurs in the right- center (as shown) frame 72, the above equation selects the contention window, CW, to be of a value of seven as n = 7 and m = 5. Selection is made to transmit the packet of data upon one of the seven time slots allocated to form random access channels in the frame.
By selecting the initial size of the contention window according to this equation, a measure of load control is provided and the likelihood of successful, collision-free, communication of the packet of data is of an increased probability.
Figure 4 illustrates another successive series of frames 72, each frame having a dynamically-allocated number of time slots allocated to form random access channels. Operation of an embodiment of the present invention also contemplates selection of the size of the contention window to be a multiple number of frames. By selecting the size of the contention window to correspond to that of a multiple number of frames, power consumption reduction at the mobile terminal is possible as the mobile terminal is permitted to enter into a sleep mode during portions of a frame instead of counting the number of random access channels in each of the frames.
Selection of the size of the contention window in this embodiment of the present invention is governed by the following equation:
CW(sIot) = 2" a < k CW(fi-ame) = 2a a ≥ k wherein: a is the number of transmission attempts; and k is a selected value defined, for instance, as a current traffic load or expiration time-related value. Review of the above equations indicates that when the transmission attempt number is less than the selected value k, the size of the contention window is of a time slot number exponentially related to the transmission attempt number. When the transmission attempt number equals or exceeds the selected value k, the contention window size is selected to be of a multiple number of frames, the multiple being exponentially related to the transmission attempt number. Because the size of the contention window is selected either to be of a size which is a function of a number of time slots, or a function of a number of frames, power consumption at the mobile terminal can be selectively reduced.
In the Figure, the brackets 106 represent contention windows which are of sizes which are of multiple numbers of time slots, exponentially related to the transmission attempt number. When the transmission attempt number equals the selected value k, here indicated at the time designated by the arrow 108, the sizes of the contention windows become multiples of numbers of frames. Here, the brackets 1 12 represent contention windows of sizes which are of multiple numbers of frames according to the above equation. In an alternative embodiment, the size of the contention window,
CW, is governed by the following equations:
CW(slot) = 2" a≥ k CW(frame) = 2a a<k wherein the values are above-defined.
Review of these equations indicate that the size of the contention window selected to be of a multiple number of frames when the transmission attempt is less than the selected value k. And, when the transmission attempt number exceeds the selected value k, the size of the contention window becomes a multiple number of time slots forming random access channels. Figure 5 represents this embodiment. A series of successively- positioned frames 72 is again illustrated. The contention windows of sizes corresponding to multiple numbers of frames are indicated in the Figure by brackets 1 16. When the transmission attempt number exceeds the selected value k, the size of the contention window is thereafter selected to be a multiple number of time slots forming random access channels. Here, the brackets 122 represent contention windows of sizes corresponding to multiple numbers of time slots.
By selecting the size of the contention window to be selected on a frame basis, ClV(frame), that is, to be of a size corresponding to a, or a multiple number of frames, power savings can be achieved. The power savings are possible by causing the mobile terminal to enter into a sleep mode during frames in which no communications are needed. For instance, if a selected random access slot b is greater than a selected number;', the contention window size is selected on a frame basis, CW(frame). As an example, if CW(s\ot) = 128, the selected random access channel slot is expected to be within that number of time slots. If b = 100, the mobile terminal has to remain in a non-sleep mode to listen for feedback acknowledgments to count the number of random access channels per frame. But, if the average number of random access channels per frame is 5, i.e. , j = 5, the mobile terminal must listen to twenty frames, resulting in unnecessary power consumption. If, instead, CH/(frame) is utilized in which Cl/l/(frame) is based on b/j = 100/5, the mobile terminal can enter a sleep mode during twenty frames, and then after the twentieth frame, the mobile terminal chooses one of the random access channels in such frame to transmit the packet.
In another embodiment, the size of the contention window selected by the contention window selector to be of a size responsive to a combination of the transmission attempt number and the number of prior, successful transmissions of packet data. In this embodiment, the size of the contention window, CW, is defined as follows:
CWa =CWa_, 2a- -2l a >2 if CWa ≤ \, CWa =2 wherein: a is the transmission attempt number; and
/ is the number of successful packet data transmissions in a previous frame. In this implementation, the size of the contention windows is incremented based upon the number of successful transmissions in a prior frame. The variable / is downloaded to the mobile terminal together with the other information broadcast upon the broadcast channel 18.
The mobile terminal is operable in this embodiment, subsequent to becoming active, to listen to the feedback broadcast upon the feedback channel 18 to become synchronized to the channel and thereafter to transmit the packet of data. At the initial transmission attempt, one of the available random access channels is randomly selected upon which to transmit the packet of data. Or, the implementation, earlier described with respect to the initial packet data attempt, is implemented.
If the transmission attempt is unsuccessful, as indicated by the feedback acknowledgment, retransmission is effectuated. To effectuate the retransmission, the size of the contention window is incrementally adjusted according to the above equation. The maximum contention window size can also be defined, such as, for example, CW = 200. This number is defined, for instance, by the expected number of accesses at one access point 14. Because this embodiment makes use of prior sizes of contention windows, as well as the number of successful transmissions in a prior frame, the size of the contention window is adjusted pursuant to exemplary traffic conditions.
Figure 6 illustrates a method, shown generally at 132, of an embodiment of the present invention. The method 132 selects a contention window within which to transmit a packet of data at a sending station to a receiving station. The packet of data is transmittable upon a random access channel defined in a time-division communication system. In such system, frames, each formed of a plurality of time slots, are defined. The frames have a dynamically- allocable number of time slots forming random access channels. First, and as indicated by the block 134, a number of time slots allocated to form the random access channels of a selected frame is detected. Then, as indicated by the block 136, the size of the contention window is selected responsive, at least in part, to the detected number of time slots. Operation of the various embodiments of the present invention at least selectively take into account the number of time slots dynamically allocated to form random access channels. Because advantage is taken of the variable number of time slots which form random access channels on a frame-by-frame basis, improved operational throughput is possible.
The previous descriptions are of preferred examples for implementing the invention and the scope of the invention should not necessarily be limited by this description. The scope of the present invention is defined by the following claims:

Claims

The following are claimed:
1 . Apparatus for selecting a contention window within which to transmit a packet of data at a sending terminal to a receiving station, the packet of data transmittable upon a random access channel defined in a time-division communication system in which frames, each formed of a plurality of time slots, are defined, the frames having a dynamically-allocable number of time slots forming random access channels, said apparatus comprising: a detector coupled to receive indications of the number of time slots allocated to form the random access channels of the frames, said detector for detecting the number of time slots allocated to form the random access channels of at least a selected frame; a contention window selector coupled to receive indications of detection by said detector of the number of time slots allocated to form the random access channels of the selected frame, said contention window selector selectably operable to select a size of the contention window responsive, at least in part, to the number of time slots detected by said detector.
2. The apparatus of claim 1 wherein said contention window selector selects the size of the contention window to correspond to the number of time slots detected by said detector to be allocated to the selected frame to form random access channels.
3. The apparatus of claim 2 wherein said contention window selector selects the size of the contention window to correspond to the number of time slots detected to be allocated to the selected frame if the number of time slots is greater than a selected value, otherwise said contention window selector selects the size of the contention window to correspond to the selected value.
4. The apparatus of claim 3 wherein the selected value is related to an average number of time slots allocated to form random access channel in a plurality of frames.
5. The apparatus of claim 4 further comprising an average calculator also coupled to receive the indications of detection by said detector of the number of time slots allocated to form the random access channels of the selected frame, said average calculator for calculating the average value of time slots which forms the selected value.
6. The apparatus of claim 3 wherein said contention window selects the size of the contention window within which to attempt an initial transmission of the packet of data.
7. The apparatus of claim 1 wherein the time-division communication system comprises a time-division-duplex communication system, and wherein the indications of the number of time slots allocated to form the random access channel to which said detector is coupled to receive are broadcast at a front portion of a frame.
8. The apparatus of claim 1 wherein said detector is further coupled to receive an indication of a number of attempts by which the sending terminal has attempted to transmit the packet of data to the receiving station, wherein said contention window selector is further coupled to receive indications of detection by said detector of the number of attempts by which the sending terminal has attempted to transmit the packet of data, and wherein the size of the contention window selected by said contention window selector is further responsive to the number of attempts detected by said detector.
9. The apparatus of claim 8 wherein said contention window selector selects the size of the contention window to be of a number of time slots defined to be random access channels related to the number of attempts detected by said detector.
10. The apparatus of claim 9 wherein the size of the contention window is selected to be of a number of time slots exponentially related to the number of attempts detected by said detector.
1 1 . The apparatus of claim 8 wherein said contention window selector selects the size of the contention window to be of a number of frames related to the number of attempts detected by said detector.
12. The apparatus of claim 1 1 wherein the size of the contention window is selected to be of a number of frames exponentially related to the number of attempts detected by said detector.
13. The apparatus of claim 1 1 wherein said contention window selector alternately selects the size of the contention window to be of a number of time slots defined to be random access channels related to the number of attempts detected by said detector when the number of attempts detected by said detector is within a selected value, and, if the number of attempts detected by said detector is beyond the selected number, said contention window selector selects the size of the contention window to be of the number of frames related to the number of attempts detected by said detector.
14. The apparatus of claim 13 wherein the selected value comprises a traffic-load parameter.
15. The apparatus of claim 13 wherein the selected value comprises a time-related value.
16. The apparatus of claim 8 further comprising a counter coupled to receive an indication of each attempt by the sending terminal to transmit the packet of data, said counter for counting the attempts, a count value formed by said counter forming the indication of the number of attempts to which said detector is coupled to receive.
17. The apparatus of claim 1 wherein said detector is further coupled to receive an indication of a success indicia representative of a number of successful prior transmissions of packet data in a prior frame, wherein said contention window selector is further coupled to receive indications of detection by said detector of the success indicia, and wherein the size of the contention window selected by said contention window is further responsive to the number of successful prior transmissions.
18. The apparatus of claim 17 wherein the time-division communication system comprises a time-division-duplex (TDD) communication system, and wherein the indication of the success indicia to which said detector is coupled to receive are broadcast at a front portion of a frame.
19. The apparatus of claim 17 wherein said detector is further coupled to receive an indication of a number of attempts by which the sending terminal has attempted to transmit the packet of data to the receiving station, wherein said contention window selector is further coupled to receive indications of detection by said detector of the number of attempts by which the sending terminal has attempted to transmit the packet of data, and wherein the size of the contention window selected by said contention window selector is further responsive to the number of attempts detected by said detector.
20. A method for selecting a contention window within which to transmit a packet of data at a sending terminal to a receiving station, the packet of data transmittable upon a random access channel defined in a time-division communication system in which frames, each formed of a plurality of time slots, are defined, the frames having a dynamically-allocable number of time slots forming random access channels, said method comprising: detecting a number of time slots allocated to form the random access channels of at least a selected frame; and selecting a size of the contention window responsive, at least in part, to the number of time slots detected during said operation of detecting.
21 . The method of claim 20 wherein said operation of detecting further comprises detecting an indication of a number of attempts by which the sending terminal has attempted to transmit the packet of data and wherein said operation of selecting is further responsive to the number of attempts detected during said operation of detecting.
22. The method of claim 20 wherein said operation of detecting further comprises detecting an indication of a success indicia representative of a number of successful prior transmissions of packet data in a prior frame, and wherein said operation of selecting is further responsive to the indication of the success indicia detected during said operation of detecting.
23. In a mobile terminal having a receiver portion and a transmitter portion, the mobile terminal operable in a time-division radio communication system at least to communicate a packet of data to a remote station upon a random access channel in which frames, each formed of a plurality of time slots, are defined, the frames having a dynamically-allocable number of time slots forming random access channels, the number of time slots allocated to form random access channels of a selected frame broadcast to the mobile terminal, an improvement of apparatus for selecting a contention window within which to transmit the packet of data from the mobile terminal, said apparatus comprising: a detector coupled to the receiver portion of the mobile terminal, said detector for detecting an indication of the number of time slots allocated to form the random access channel of the selected frame broadcast to the mobile terminal and received at the receiver portion thereof; and a contention window selector coupled to receive indications of detection by said detector of the number of time slots allocated to form the random access channels of the selected frame, said contention window selector selectably operable to select a size of the contention window responsive, at least in part, to the number of time slots detected by said detector.
PCT/US2000/013123 1999-05-14 2000-05-12 Apparatus and method for selecting a size of a contention window for wireless system WO2000070814A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU47130/00A AU4713000A (en) 1999-05-14 2000-05-12 Apparatus and method for selecting a size of a contention window for wireless system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US09/312,579 1999-05-14
US09/312,579 US6285662B1 (en) 1999-05-14 1999-05-14 Apparatus, and associated method for selecting a size of a contention window for a packet of data system

Publications (1)

Publication Number Publication Date
WO2000070814A1 true WO2000070814A1 (en) 2000-11-23

Family

ID=23212110

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/013123 WO2000070814A1 (en) 1999-05-14 2000-05-12 Apparatus and method for selecting a size of a contention window for wireless system

Country Status (3)

Country Link
US (1) US6285662B1 (en)
AU (1) AU4713000A (en)
WO (1) WO2000070814A1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1284554A2 (en) * 2001-08-14 2003-02-19 Samsung Electronics Co., Ltd. Wireless data communication system and method using wireless transmission frame structure for increasing communication efficiency
EP1519599A2 (en) * 2003-09-26 2005-03-30 Samsung Electronics Co., Ltd. Method for controlling sleep interval in broadband wireless access communication system
GB2424799A (en) * 2005-04-01 2006-10-04 Motorola Inc Dynamic allocation of random access time slots in a mobile communication system
CN101272336A (en) * 2007-03-21 2008-09-24 华硕电脑股份有限公司 Method and apparatus for handling random access procedure in a wireless communications system
EP1973365A3 (en) * 2007-03-21 2008-12-31 Innovative Sonic Limited Method and apparatus for handling random access procedure in a wireless communications system
US7489674B2 (en) 2003-05-30 2009-02-10 Samsung Electronics Co., Ltd. Method for wireless local area network communication using multiple channels
WO2009026746A1 (en) * 2007-08-31 2009-03-05 Thomson Licensing Method and apparatus for communicating in multiple modes

Families Citing this family (74)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2374854C (en) * 1999-05-26 2008-02-05 Nokia Networks Oy Random access control method and system
US7023833B1 (en) 1999-09-10 2006-04-04 Pulse-Link, Inc. Baseband wireless network for isochronous communication
US6944148B1 (en) * 1999-09-10 2005-09-13 Pulse-Link, Inc. Apparatus and method for managing variable-sized data slots within a time division multiple access frame
US6681256B1 (en) * 1999-12-21 2004-01-20 Nokia Corporation Method for dynamically selecting allocation of random access channels in a communication system
US6920110B2 (en) * 2001-02-14 2005-07-19 Microsoft Corporation System and method for transferring data over a network
US7437428B1 (en) * 2000-02-16 2008-10-14 Microsoft Corporation System and method for transferring data over a network
US6754176B1 (en) * 2000-03-01 2004-06-22 Sharewave, Inc. Scheme for managing overlapping wireless computer networks
US6738368B1 (en) 2000-05-12 2004-05-18 Interdigital Technology Corporation Prioritization and flow control of a spread spectrum multiuser channel
US6952456B1 (en) * 2000-06-21 2005-10-04 Pulse-Link, Inc. Ultra wide band transmitter
US6404772B1 (en) * 2000-07-27 2002-06-11 Symbol Technologies, Inc. Voice and data wireless communications network and method
US7082472B1 (en) * 2000-08-31 2006-07-25 Lucent Technologies Inc. Method for transmitting data over a network medium
ATE276633T1 (en) * 2000-11-28 2004-10-15 Interdigital Tech Corp CONTENT ACCESS CONTROL SYSTEM AND METHOD
US6965942B1 (en) * 2001-01-12 2005-11-15 3Com Corporation Method and system for improving throughput over wireless local area networks with a dynamic contention window
US20020120740A1 (en) * 2001-02-28 2002-08-29 Jin-Meng Ho Shared communications channel access in an overlapping coverage environment
US7035246B2 (en) * 2001-03-13 2006-04-25 Pulse-Link, Inc. Maintaining a global time reference among a group of networked devices
US7127519B2 (en) * 2001-05-03 2006-10-24 Lucent Technologies Inc. Back off methods and systems
WO2003023992A1 (en) * 2001-09-07 2003-03-20 Pulse-Link, Inc. System and method for transmitting data in ultra wide band frequencies in a de-centralized system
US7248604B2 (en) * 2001-10-30 2007-07-24 Ipr Licensing, Inc. Throughput in multi-rate wireless networks using variable-length packets and other techniques
AU2002231843A1 (en) * 2002-02-12 2003-09-04 Nokia Corporation Method for controlling data transmission, and data transmission system
US20030233592A1 (en) * 2002-06-14 2003-12-18 Hung-Ming Lin Power saving method using frame rate control in computer graphics systems
KR100891788B1 (en) * 2002-07-08 2009-04-07 삼성전자주식회사 Method for making contention of access for real time application and medium access control layer module
CN100518361C (en) * 2003-02-12 2009-07-22 捷讯研究有限公司 Apparatus, and associated method for facilitating initiation of channel allocation to communicate data
EP1511221B1 (en) * 2003-03-27 2020-05-20 Optis Wireless Technology, LLC Intermittent communication method and intermittent communication device
KR20040092830A (en) * 2003-04-29 2004-11-04 삼성전자주식회사 Method for controlling a sleep interval in broadband wireless access communication systems
KR100698620B1 (en) * 2003-06-16 2007-03-21 삼성전자주식회사 Digital transmitter/receiver system having a robust error correction coding/decoding apparatus and a method error correction coding/decoding therof
US20050059405A1 (en) * 2003-09-17 2005-03-17 Trapeze Networks, Inc. Simulation driven wireless LAN planning
US20050059406A1 (en) * 2003-09-17 2005-03-17 Trapeze Networks, Inc. Wireless LAN measurement feedback
US7376143B2 (en) * 2003-09-30 2008-05-20 Intel Corporation Systems and methods for contention control in wireless networks
US7397814B2 (en) * 2003-12-09 2008-07-08 Intel Corporation Method and apparatus to estimate collision rate parameter
US7221927B2 (en) * 2004-02-13 2007-05-22 Trapeze Networks, Inc. Station mobility between access points
CA2760916C (en) * 2004-03-04 2013-12-10 Samsung Electronics Co., Ltd. A system and method for performing location update
US7957389B2 (en) * 2004-03-31 2011-06-07 Alcatel-Lucent Usa Inc. Method of stall identification and recovery
US7280836B2 (en) * 2004-04-30 2007-10-09 Symbol Technologies, Inc. System and method for coexistence in wireless networks
US7480266B2 (en) * 2004-11-30 2009-01-20 Intel Corporation Interference adaptation apparatus, systems, and methods
US20060203784A1 (en) * 2005-03-14 2006-09-14 International Business Machines Corporation Smart roaming to avoid time-outs during WLAN association
DE112006000618T5 (en) 2005-03-15 2008-02-07 Trapeze Networks, Inc., Pleasanton System and method for distributing keys in a wireless network
US8638762B2 (en) 2005-10-13 2014-01-28 Trapeze Networks, Inc. System and method for network integrity
US7724703B2 (en) 2005-10-13 2010-05-25 Belden, Inc. System and method for wireless network monitoring
WO2007044986A2 (en) 2005-10-13 2007-04-19 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
US7551619B2 (en) 2005-10-13 2009-06-23 Trapeze Networks, Inc. Identity-based networking
US7573859B2 (en) 2005-10-13 2009-08-11 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
US8250587B2 (en) 2005-10-27 2012-08-21 Trapeze Networks, Inc. Non-persistent and persistent information setting method and system for inter-process communication
US7558266B2 (en) 2006-05-03 2009-07-07 Trapeze Networks, Inc. System and method for restricting network access using forwarding databases
US8966018B2 (en) 2006-05-19 2015-02-24 Trapeze Networks, Inc. Automated network device configuration and network deployment
US9191799B2 (en) 2006-06-09 2015-11-17 Juniper Networks, Inc. Sharing data between wireless switches system and method
US7912982B2 (en) 2006-06-09 2011-03-22 Trapeze Networks, Inc. Wireless routing selection system and method
US8818322B2 (en) 2006-06-09 2014-08-26 Trapeze Networks, Inc. Untethered access point mesh system and method
US9258702B2 (en) 2006-06-09 2016-02-09 Trapeze Networks, Inc. AP-local dynamic switching
US7844298B2 (en) 2006-06-12 2010-11-30 Belden Inc. Tuned directional antennas
US7724704B2 (en) 2006-07-17 2010-05-25 Beiden Inc. Wireless VLAN system and method
US8340110B2 (en) 2006-09-15 2012-12-25 Trapeze Networks, Inc. Quality of service provisioning for wireless networks
US8072952B2 (en) 2006-10-16 2011-12-06 Juniper Networks, Inc. Load balancing
US7865713B2 (en) 2006-12-28 2011-01-04 Trapeze Networks, Inc. Application-aware wireless network system and method
US7873061B2 (en) 2006-12-28 2011-01-18 Trapeze Networks, Inc. System and method for aggregation and queuing in a wireless network
US8233470B2 (en) * 2007-06-28 2012-07-31 Intel Corporation Multi-radio wireless communication device method for synchronizing wireless network and bluetooth communications
US7725118B2 (en) * 2007-08-22 2010-05-25 Intel Corporation Multi-radio wireless communication device and method for coordinating communications between potentially interfering radios
US8902904B2 (en) 2007-09-07 2014-12-02 Trapeze Networks, Inc. Network assignment based on priority
US8509128B2 (en) 2007-09-18 2013-08-13 Trapeze Networks, Inc. High level instruction convergence function
US8238942B2 (en) 2007-11-21 2012-08-07 Trapeze Networks, Inc. Wireless station location detection
US8219142B2 (en) * 2008-02-01 2012-07-10 Broadcom Corporation Method, system, and apparatus for coexistence of plurality of communication technologies in communication device
US8150357B2 (en) 2008-03-28 2012-04-03 Trapeze Networks, Inc. Smoothing filter for irregular update intervals
US8474023B2 (en) 2008-05-30 2013-06-25 Juniper Networks, Inc. Proactive credential caching
CN101631063B (en) * 2008-07-15 2012-02-01 上海无线通信研究中心 Competition window adjustment mechanism method and system based on positions and congestion conditions
US8228937B2 (en) * 2008-07-21 2012-07-24 Xg Technology, Inc. Method for extending a heterogeneous MAC protocol to multi-channel systems
US8978105B2 (en) 2008-07-25 2015-03-10 Trapeze Networks, Inc. Affirming network relationships and resource access via related networks
US8238298B2 (en) 2008-08-29 2012-08-07 Trapeze Networks, Inc. Picking an optimal channel for an access point in a wireless network
US9294219B2 (en) * 2008-09-30 2016-03-22 Qualcomm Incorporated Techniques for supporting relay operation in wireless communication systems
JP5602231B2 (en) * 2009-08-20 2014-10-08 パーデュー・リサーチ・ファウンデーション A predictive duty cycle adaptation method for event-driven wireless sensor networks
CN101854429A (en) * 2010-03-10 2010-10-06 深圳市同洲电子股份有限公司 Control method of network connection and mobile communication terminal
US8542836B2 (en) 2010-12-01 2013-09-24 Juniper Networks, Inc. System, apparatus and methods for highly scalable continuous roaming within a wireless network
US20130044731A1 (en) * 2011-08-15 2013-02-21 Qualcomm Incorporated Proactive Feedback Transmissions During Handover Procedures
KR20140129969A (en) * 2013-04-30 2014-11-07 인텔렉추얼디스커버리 주식회사 wireless network, access point, and station
WO2015139254A1 (en) * 2014-03-20 2015-09-24 华为技术有限公司 Data transmission method and station
US11659592B2 (en) * 2018-01-19 2023-05-23 Apple Inc. Contention window adjustment mechanisms for FELAA systems

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0551223A1 (en) * 1992-01-08 1993-07-14 Compagnie Generale D'automatisme Cga-Hbs Data transmission method for communication stablishment and the transceiver therefor
EP0709982A1 (en) * 1994-10-26 1996-05-01 International Business Machines Corporation Medium access control scheme for wireless LAN using a variable length interleaved time division frame

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4630264A (en) * 1984-09-21 1986-12-16 Wah Benjamin W Efficient contention-resolution protocol for local multiaccess networks
US4675863A (en) * 1985-03-20 1987-06-23 International Mobile Machines Corp. Subscriber RF telephone system for providing multiple speech and/or data signals simultaneously over either a single or a plurality of RF channels
US5131010A (en) * 1989-10-12 1992-07-14 General Electric Company Voice guard digital voter for multiple site PST RF trunking system
US6144645A (en) * 1998-05-26 2000-11-07 Nera Wireless Broadband Access As Method and system for an air interface for providing voice, data, and multimedia services in a wireless local loop system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0551223A1 (en) * 1992-01-08 1993-07-14 Compagnie Generale D'automatisme Cga-Hbs Data transmission method for communication stablishment and the transceiver therefor
EP0709982A1 (en) * 1994-10-26 1996-05-01 International Business Machines Corporation Medium access control scheme for wireless LAN using a variable length interleaved time division frame

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
BIANCHI G ET AL: "Performance evaluation and enhancement of the CSMA/CA MAC protocol for 802.11 wireless LANs", SEVENTH IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS. PIMRC'96 (CAT. NO.96TH8240), PROCEEDINGS OF PIMRC '96 - 7TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE COMMUNICATIONS, TAIPEI, TAIWAN, 15-18 OCT. 1, 1996, New York, NY, USA, IEEE, USA, pages 392 - 396 vol.2, XP002144465, ISBN: 0-7803-3692-5 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1284554A2 (en) * 2001-08-14 2003-02-19 Samsung Electronics Co., Ltd. Wireless data communication system and method using wireless transmission frame structure for increasing communication efficiency
EP1284554A3 (en) * 2001-08-14 2003-09-10 Samsung Electronics Co., Ltd. Wireless data communication system and method using wireless transmission frame structure for increasing communication efficiency
US7489674B2 (en) 2003-05-30 2009-02-10 Samsung Electronics Co., Ltd. Method for wireless local area network communication using multiple channels
EP1519599A2 (en) * 2003-09-26 2005-03-30 Samsung Electronics Co., Ltd. Method for controlling sleep interval in broadband wireless access communication system
EP1519599A3 (en) * 2003-09-26 2005-09-28 Samsung Electronics Co., Ltd. Method for controlling sleep interval in broadband wireless access communication system
US7289804B2 (en) 2003-09-26 2007-10-30 Samsung Electronics Co., Ltd. Method for controlling sleep interval in broadband wireless access communication system
GB2424799A (en) * 2005-04-01 2006-10-04 Motorola Inc Dynamic allocation of random access time slots in a mobile communication system
CN101272336A (en) * 2007-03-21 2008-09-24 华硕电脑股份有限公司 Method and apparatus for handling random access procedure in a wireless communications system
EP1973365A3 (en) * 2007-03-21 2008-12-31 Innovative Sonic Limited Method and apparatus for handling random access procedure in a wireless communications system
US9668279B2 (en) 2007-03-21 2017-05-30 Innovative Sonic Limited Method and apparatus for handling random access procedure in a wireless communications system
WO2009026746A1 (en) * 2007-08-31 2009-03-05 Thomson Licensing Method and apparatus for communicating in multiple modes

Also Published As

Publication number Publication date
US6285662B1 (en) 2001-09-04
AU4713000A (en) 2000-12-05

Similar Documents

Publication Publication Date Title
US6285662B1 (en) Apparatus, and associated method for selecting a size of a contention window for a packet of data system
US11013031B2 (en) Uplink PPDU transmission
US11706711B2 (en) Method and device for transmitting PPDU
US11751246B2 (en) Multiple frame transmission
US7948911B2 (en) Implicit signaling for link adaptation
CN106576364B (en) Method for transmitting data in wireless communication system and apparatus therefor
US8743793B2 (en) Systems and methods for providing a separate contention window allowing allocations for pending uplink SDMA transmission opportunities
US7801063B2 (en) Method and apparatus for rate fallback in a wireless communication system
US20010009555A1 (en) Method and device for robust fallback in data communication systems
US8570868B2 (en) Congestion control in a communication network based on the CSMA/CA protocol
EP3111715B1 (en) Compensation procedure for excess transmission opportunity time
Li et al. Performance comparison of the radio link protocols of IEEE802. 11a and HIPERLAN/2
EP1746770A1 (en) Method for modifying a transmission characteristic of a communication channel, and network device therefor
Kim IEEE 802.11 MAC performance with variable transmission rates
WO2001022646A1 (en) Cumulative acknowledgement transmission in an automatic repeat request
US20230300744A1 (en) Channel access mechanism for low power wake-up receivers
EP1746785A1 (en) A network device and method for selecting a transmit rate for transmitting over a communication channel
Barroca et al. Impact of Using CSS PHY and RTS/CTS Combined with Frame Concatenation in the IEEE 802.15. 4 Non-Beacon Enabled Mode Performance
WO2023211662A1 (en) Enhanced restricted access window mechanism for low latency transmission

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BB BG BR BY CA CH CN CZ DE DK EE ES FI GB GE HU IL IS JP KE KG KP KR KZ LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK TJ TM TR TT UA UG US UZ VN

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP