# Patent

## Title
Systems and methods for contention control in wireless networks

## Abstract

Systems and methods provide for controlling contention in a wireless network device. The systems and methods transmit a packet on a wireless network. If the transmission is not successful, then a contention window parameter is adjusted according to a fast backoff operation. If the packet transmission was successful and the current value of the contention window parameter is less than a threshold value then the contention window parameter is decreased according to a contention avoidance operation. If the packet transmission is successful and the current value of the contention window parameter is greater than the threshold value then the contention window parameter is decreased according to a slow start operation.

## Background
RELATED APPLICATION(S)
This application is a continuation of U.S. application Ser. No. 10/675,879, filed Sep. 30, 2003 now U.S. Pat. No. 7,376,143, which is incorporated herein by reference for all purposes.


FIELD
The present invention relates generally to wireless network systems, and more particularly to providing contention control in such networks.
COPYRIGHT NOTICE/PERMISSION
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings hereto: Copyright© 2003, Intel Corporation. All Rights Reserved.
BACKGROUND
The use of wireless networking continues to grow at a rapid pace. Wireless networks are attractive for a number of reasons. They are convenient, they allow flexibility and roaming, and can support dynamic environments. Furthermore, they are relatively easy to install when compared with their wired counterparts. In some cases, for example in older buildings, they may be cheaper to deploy. An entire network can be put together in a matter of hours rather than days with no need for wiring or rewiring. In many scenarios, wireless networks can have a lower cost of ownership than their wired counterparts despite the cheaper cost of wired LAN cards.
As wireless networking becomes more popular, the number of network devices participating in wireless networks may increase. This in turn can lead to increased contention for the wireless network resources, in particular the wireless network bandwidth. Contention in a wireless network can be more problematic than in wired networks because it is relatively more expensive to recover from a collision (e.g. two or more nodes attempting to transmit simultaneously) in wireless networks.
In the IEEE 802.11 standard, IEEE std. 802.11-1999, published 1999 and later versions (hereinafter “IEEE 802.11 standard) for the wireless LAN (WLAN), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. The fundamental access method of the IEEE 802.11 MAC is a distributed coordination function (DCF) known as carrier sense multiple access with collision avoidance, or CSMA/CA, a random access CSMA-based collision avoidance scheme. In general and according to the IEEE 802.11 standard, the DCF works as follows:
For a station to transmit, the station first determines whether the wireless medium is idle for greater than or equal to a DIFS (Distributed Interframe Spacing) period, or an EIFS (Extended Interframe Spacing) period. If yes, it will transmit immediately. If the first transmission fails or the medium is not idle, the backoff procedure will be invoked for the station. The station determines a random backoff interval counter by randomly selecting a value from the interval [0, CW]. The backoff interval counter is initialized to the randomly selected value and managed as follows: The counter is decremented for each medium idle time slot that the medium is idle. If the medium is not determined to be busy and the backoff interval counter of the station is decremented to zero, the transmission may proceed.
As can be seen from the above, the contention window determines the idle backoff time slots and packet collisions in each contention cycle. So the selection of the contention window CW can significantly impact the performance of the 802.11 MAC. In the standard 802.11 MAC, the contention window selection generally follows the following two rules:

    
    
        1) The contention window CW is doubled every time following an unsuccessful attempt to transmit until the maximum contention widow size of CWmax for the medium is reached. A retry will be performed by the station for the frame.
        2) The contention window CW will be reset to the minimum contention window size CWmin for the medium following a successful transmission or when a retry counter reaches its limit.
    
    


It has been observed that the throughput performance of the standard IEEE802.11 MAC protocol does not handle highly loaded wireless local networks well. In particular when the number of active stations increases, the system throughput degrades significantly due to the high collision rate detected. As a result, there is a need in the art for the various embodiments of the present invention.



BRIEF DESCRIPTION OF THE DRAWINGS
FIGS. 1A and 1B are block diagrams illustrating a system level overview of hardware and software environments incorporating embodiments of the invention;
FIG. 2 is a flowchart illustrating a method for controlling contention in a wireless network;
FIG. 3 is a diagram illustrating application of a method according to an embodiment of the invention to an exemplary sequence of wireless packet transmissions; and
FIGS. 4A-4C are charts illustrating exemplary performance results achieved by an embodiment of the invention.



DETAILED DESCRIPTION
In the following detailed description of exemplary embodiments of the invention, reference is made to the accompanying drawings that form a part hereof, and in which is shown by way of illustration specific exemplary embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the embodiments of the invention, and it is to be understood that other embodiments may be utilized and that logical, mechanical, electrical and other changes may be made without departing from the scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense.
In the Figures, the same reference number is used throughout to refer to an identical component which appears in multiple Figures. Signals and connections may be referred to by the same reference number or label, and the actual meaning will be clear from its use in the context of the description. Further, the same base reference number (e.g. 120) is used in the specification and figures when generically referring to the actions or characteristics of a group of identical components. A numeric index introduced by a decimal point (e.g. 120.1) is used when a specific component among the group of identical components performs an action or has a characteristic.
The detailed description is divided into multiple sections. In the first section the hardware and software operating environment of different embodiments of the invention is described. In the second section methods according to various embodiments of the invention are described.
Operating Environment
FIG. 1A is a block diagram of the major components of a hardware environment 130 incorporating various embodiments of the invention. In general, the systems and methods of various embodiments of the invention may be incorporated on any hardware or software system that supports wireless networks. Generally such hardware includes personal computers, server computers, mainframe computers, laptop computers, portable handheld computers, personal digital assistants (PDAs), network enabled cellular telephones, wireless base stations, network interface cards and hybrids of the aforementioned devices. In some embodiments of the invention, hardware environment 130 comprises a processor 132, memory 134 and wireless network interface 124 to wireless network 126. Processor 132, memory 134 and wireless network interface 124 may communicate through a system bus or specialized data transfer bus.
Processor 132 may be any type of computational circuit such as, but not limited to, a microprocessor, a complex instruction set computing (CISC) microprocessor, a reduced instruction set computing (RISC) microprocessor, a very long instruction word (VLIW) microprocessor, a graphics processor, a digital signal processor (DSP), or any other type of processor, processing circuit, execution unit, or computational machine. In some embodiments of the invention, processor 102 may be a processor in the Pentium® or Celeron® family of processors available from Intel Corporation, Santa Clara, Calif. In alternative embodiments, processor 132 may be a specialized network processor. Although only one processor 132 is shown, multiple processors may be included in hardware environment 130.
Memory 132 may comprise any type of volatile or non-volatile memory capable of storing instructions and data utilized by processor 130. Memory 130 may comprise RAM (Random Access Memory), ROM (Read Only Memory), hard-drives, floppy-drive, CD-ROM, DVD-ROM and flash memory, or any combination thereof.
Wireless network device 124 may be a network interface card, a hardware chip or chipset, or any other hardware designed to send and receive wireless transmissions of data that conform to a wireless protocol. In some embodiments of the invention, the wireless protocol may be any of the IEEE 802.11 family of protocols.
In some embodiments, processor 132, memory 134 and wireless network device 124 may be integrated into a single unit such as a wireless network interface card or the motherboard of a mobile computer such as a laptop computer, notebook computer, PDA etc. In alternative embodiments, processor 132 and memory 134 may be part of integral computer system and wireless network device 124 may be a separate device (having its own processor and memory) removably coupled to the integral computer system via a bus such as a PCI bus or other communications interface such as a USB, PCMCIA or IEEE 1394 (Firewire) interface.
FIG. 1B is a block diagram of the major components of a software operating environment 100 incorporating various embodiments of the invention. In some embodiments of the invention, operating environment 100 comprises a network stack for a wireless network device. The software components running in the operating environment are may be read from a machine-readable media and run under the control of an operating system, and interfaced with the operating system. Examples of such machine-readable media include hard disks, floppy disks, CD-ROMs, DVD-ROMs and flash ROMs. Further, machine-readable media includes wired and wireless signals transmitted over a network. Examples of operating systems include Windows® 95, Windows 98®, Windows Me®, Windows CE®, Windows® NT, Windows 2000®, and Windows XP® by Microsoft Corporation. However, no embodiment of the present invention is limited to any particular operating system, and in alternative embodiments the software components may operate within the Palm OS® from Palm Inc., variants of the UNIX and Linux operating systems and cellular telephone operating systems.
Additionally, the systems and methods of embodiments of the present invention may be implemented in firmware.
As illustrated in FIG. 1B, the network stack includes an application layer 106, transport layer 108, Internet Protocol layer 110, MAC (Media Access Control) layer 112, device driver and device driver layer 122. Application layer 106 provides an interface to network services for a software application 102. Software application 102 may be any software application that uses a network to transmit and receive data to and from hosts on a network. Such applications include electronic mail applications, file transfer applications, and web browser applications. The embodiments of the invention are not limited to any particular software application. Typically application layer 106 provides an interface that is designed to be network independent. That is, application layer 106 is designed so that the interface it provides does not change from network type to another.
Transport layer 108 typically provides an interface to application layer 106, an includes software that manages a virtual error-free, point to point connection so that host A can send messages to host B and they will arrive un-corrupted and in the correct order. The transport layer establishes and dissolves connections between hosts. In one embodiment of the invention, the transport layer is the TCP (Transmission Control Protocol) layer.
Network layer 110 is used by the transport layer 108, and determines routing of packets of message data from sender to receiver via the data link layer. In some embodiments, the network layer protocol is IP (Internet Protocol).
MAC (Media Access and Control) layer 112 provides an interface between the network layer and network functions that depend on the physical media. In some embodiments of the invention, MAC layer 112 comprises an interface for a wireless network 126, and includes a DCF (Distributed Coordination Function) 114 for a wireless network. In some embodiments, the DCF 114 comprises a CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) DCF. DCF 114 may incorporate one or more of fast backoff 116, slow start 118 and/or contention avoidance 120 functions. Details on these functions are provided below with reference to FIG. 2.
Device driver 122 provides an interface to the MAC layer 112 and the particular physical hardware used to connect a station to the wireless network 126. Some or all of the MAC layer functionality may be implemented in the device driver 122. As is known in the art, device driver 122 makes use of the particular commands and physical interfaces provided by a particular wireless network device 124 used to send and receive data on the wireless network 126. In addition to being hardware dependent, device drivers are typically also operating system dependent.
The network stack illustrated in FIG. 1B is typical of a TCP/IP implementation used in some embodiments of the invention. Those of skill in the art will appreciate that other protocols may be substituted for TCP/IP, and are within the scope of the present invention.
Additionally, those of skill in the art will appreciate that the functionality provided by the layers described above may be distributed across hardware and software in various manners. For example, the DCF functions may be provided within a MAC layer that is provided by an operating system, or they may be provided as part of a network interface card (NIC) that is connected to a host computer or network device. The embodiments of the invention are not limited to any particular distribution of network functionality.
FIG. 2 is a flowchart illustrating methods for controlling contention in a wireless network according to embodiments of the invention. The methods may be performed within an operating environment such as that described above with reference to FIGS. 1A and 1B. The methods to be performed by the operating environment constitute computer programs made up of computer-executable instructions. Describing the methods by reference to a flowchart enables one skilled in the art to develop such programs including such instructions to carry out the methods on suitable computers (the processor of the computer executing the instructions from computer-readable media). The methods illustrated in FIG. 2 are inclusive of the acts performed by an operating environment executing an exemplary embodiment of the invention.
Methods
FIG. 2 is a flowchart illustrating a method for determining a contention window interval to provide contention control in a wireless network. The method begins when a system executing the method initializes contention control parameters (Block 202). In some embodiments of the invention, the contention control parameters include a contention window value “CW”, a threshold value “Threshold”, and a success flag “Success”. In some embodiments, these parameters may be initially set as follows:

    
    
        CW=CWmax;
        Threshold=CWmin;
        Success=false;

where CWmax is a predetermined maximum value for CW, CWmin is a predetermined minimum value for CW, and Success indicates whether the last transmission was successful or not. Values for CWmax and CWmin may be dependent on the underlying wireless protocol being used. In some embodiments of the invention, the Success parameter may be initialized to a true value, resulting in a slightly more conservative method for adjusting the CW parameter.

    
    


Next, the system receives a request to transmit data (block 204). The data will typically originate from a software application and may include headers added on by the network layers below the software application. In some embodiments, if the medium is idle for more than the DIFS period or if the backoff interval counter for the station is zero, the system then attempts to transmit the data on the wireless network. Otherwise, the system will invoke a backoff procedure by selecting a backoff time interval counter from the interval [0, CW], decreasing the backoff counter when the medium is not busy, and attempting to transmit the packet when the backoff counter is zero. Assuming the former case: the system attempts to transmit the data on the wireless network.
The system then checks to see if the transmission was successful (block 206). If the transmission was not successful, the system proceeds to determine if the transmission attempt immediately preceding the current transmission attempt was successful by examining the Success parameter (block 208). If the preceding transmission was successful (i.e. Success=1), the threshold value is adjusted upward (block 210) and then reset Success to 0. In some embodiments, the threshold value is doubled until reaching a maximum of CWmax. In alternative embodiments of the invention, fast backoff comprises setting the CW parameter directly to CWmax. The method then proceeds to perform fast backoff on the contention window parameter (block 212).
If the preceding transmission was not successful (i.e. Success=0), the system proceeds directly to performing fast backoff on the CW parameter (block 212) without adjusting the Threshold parameter. In some embodiments of the invention, fast backoff comprises doubling the CW parameter until reaching the value CWmax. In alternative embodiments of the invention, fast backoff comprises setting the CW parameter directly to CWmax.
Pseudocode for the blocks 206-212 according to some embodiments is as follows:










Fast Backoff

















If ( An unsuccessful transmission happens )









If (Success == 1)









Threshold = min(2*CW + 1, CWmax);



Success = 0;









Endif



CW = min(2*CW + 1, CWmax);









Endif










Pseudocode for the blocks 206-212 according to alternative embodiments is as follows:










Fast Backoff (Alternative Embodiments)

















If ( An unsuccessful transmission happens )









If (Success == 1)









Threshold = min(2*CW + 1, CWmax);



Success = 0;









Endif



CW = CWmax;









Endif










If the check at block 206 determines that the transmission was successful, then the system proceeds to determine if the current CW parameter is greater than the Threshold parameter (block 214). If CW is greater than Threshold, the system performs a slow start function (block 216). In some embodiments, the slow start function comprises substantially halving the CW parameter, to a minimum of CWmin.
Pseudocode for the slow start function of block 216 according to embodiments is as follows:










Slow Start

















If ( A successful transmission happens and CW > Threshold )









Success = 1;



CW = max ((CW−1)/2, CWmin);









Endif










Alternatively, if the check at block 214 determines that the value of the current CW parameter is less than or equal to the Threshold parameter, then the system performs a contention avoidance function (block 218). In some embodiments, the contention avoidance function comprises subtracting a decrement step size value “α” from the current CW parameter to until CW is equal to CWmin. In general, the contention avoidance provides a substantially linear reduction in the CW parameter.
Pseudocode for the contention avoidance function used in some embodiments of the invention is as follows:










Contention Avoidance

















If ( A successful transmission happens and CW ≦ Threshold )









Success = 1;



CW = max(CWmin, CW − α);









Endif










In some embodiments, α may be determined according to the current value of CW as shown in table 1. In these embodiments, α is determined according to a piecewise constant function to approximate α(CW) as described below.







TABLE 1







Suggested α value set









CW













7-63
64-127
128-255
256-511
512-1023


















α
3
6
13
25
50










In alternative embodiments of the invention, the value of α may be determined as illustrated in Table 2 below. In these embodiments, α is determined using a higher order approximation of α(CW) as described below.







TABLE 2







Another suggested α value set













CW
7-31
32-63
64-127
128-255
256-511
512-1023





α




  
    CW
    2
  
  
    10
    2
  








  
    CW
    2
  
  
    16
    2
  








  
    CW
    2
  
  
    25
    2
  








  
    CW
    2
  
  
    50
    2
  








  
    CW
    2
  
  
    75
    2
  








  
    CW
    2
  
  
    100
    2
  













The α values in tables 1 and 2 may be derived by approximating α(CW) based on the fact that the resource BSS in the IEEE 802.11 standard is the bandwidth by each station. For each station, let BWi be the bandwidth utilized by the i-th station, and CWi be its contention window size. Then on average,



  
    
      
        
          
            BW
            i
          
          ⁡
          
            (
            t
            )
          
        
        ≈
        
          c
          
            
              
                CW
                i
              
              ⁡
              
                (
                t
                )
              
            
            ×
            aSlotTime
          
        
      
      ⁢
      
        

      
      ⁢
      for
      ⁢
      
        
      
      ⁢
      some
      ⁢
      
        
      
      ⁢
      constant
      ⁢
      
        
      
      ⁢
      coefficient
      ⁢
      
        
      
      ⁢
      
        c
        .
        
          
        
        ⁢
        Thus
      
      ⁢
      
        
      
      ⁢
      
        
          BW
          i
        
        ⁡
        
          (
          
            t
            +
            1
          
          )
        
      
    
    =
    
      b
      *
      
        
          BW
          i
        
        ⁡
        
          (
          t
          )
        
      
    
  




  
    
      
        
          
            for
            ⁢
            
              
            
            ⁢
            multiplicative
            ⁢
            
              
            
            ⁢
            factor
            ⁢
            
              
            
            ⁢
            b
          
          >
          0
        
        ⇒
        
          
            CW
            i
          
          ⁡
          
            (
            
              t
              +
              1
            
            )
          
        
      
      =
      
        
          
            CW
            i
          
          ⁡
          
            (
            t
            )
          
        
        /
        b
      
    
    ,
    and
  




  
    
      
        BW
        i
      
      ⁡
      
        (
        
          t
          +
          1
        
        )
      
    
    =
    
      
        
          a
          +
          
            
              
                BW
                i
              
              ⁡
              
                (
                t
                )
              
            
            ⁢
            
              
            
            ⁢
            for
            ⁢
            
              
            
            ⁢
            an
            ⁢
            
              
            
            ⁢
            additive
            ⁢
            
              
            
            ⁢
            factor
            ⁢
            
              
            
            ⁢
            a
          
        
        >
        0
      
      ⇒
      
        

      
      ⁢
      
        
          
            
              
                
                  CW
                  i
                
                ⁡
                
                  (
                  
                    t
                    +
                    1
                  
                  )
                
              
              =
              
              ⁢
              
                1
                
                  
                    
                      a
                      ×
                      aSlotTime
                    
                    c
                  
                  +
                  
                    1
                    
                      
                        CW
                        i
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    CW
                    i
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                
                  
                    
                      
                        a
                        ×
                        aSlotTime
                      
                      c
                    
                    ×
                    
                      
                        CW
                        i
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                  
                  +
                  1
                
              
            
          
        
      
    
  




  
    Since
    ⁢
    
      
    
  




  
    
      aSlotTime
      ⪡
      
        1
        ⁢
        
          
        
        ⁢
        and
        ⁢
        
          
        
        ⁢
        
          
            a
            ×
            aSlotTime
          
          c
        
        ×
        
          
            CW
            i
          
          ⁡
          
            (
            t
            )
          
        
      
    
    =
    
      
        
          a
          
            
              BW
              i
            
            ⁡
            
              (
              t
              )
            
          
        
        ⪡
        1
      
      ⇒
      
        

      
      ⁢
      
        
          
            
              
                
                  CW
                  i
                
                ⁡
                
                  (
                  
                    t
                    +
                    1
                  
                  )
                
              
              =
              
              ⁢
              
                
                  
                    CW
                    i
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                -
                
                  a
                  ×
                  
                    
                      CW
                      i
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  ×
                  
                    
                      {
                      
                        aSlotTime
                        ×
                        
                          
                            CW
                            i
                          
                          ⁡
                          
                            (
                            t
                            )
                          
                        
                      
                      }
                    
                    /
                  
                
              
            
          
        
        
          
            
              
              ⁢
              
                c
                +
                
                  
                    
                      CW
                      i
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  ×
                  
                    O
                    ⁡
                    
                      (
                      
                        
                          (
                          
                            
                              
                                CW
                                i
                              
                              ⁡
                              
                                (
                                t
                                )
                              
                            
                            ×
                            aSlotTime
                          
                          )
                        
                        2
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    CW
                    i
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                -
                
                  
                    
                      a
                      ×
                      aSlotTime
                    
                    c
                  
                  ×
                  
                    
                      
                        CW
                        i
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    2
                  
                
                +
                
                  
                    
                      CW
                      i
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  ×
                
              
            
          
        
        
          
            
              
              ⁢
              
                O
                ⁡
                
                  (
                  
                    
                      (
                      
                        
                          
                            CW
                            i
                          
                          ⁡
                          
                            (
                            t
                            )
                          
                        
                        ×
                        aSlotTime
                      
                      )
                    
                    2
                  
                  )
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    CW
                    i
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                -
                
                  α
                  ⁡
                  
                    (
                    
                      
                        CW
                        i
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    )
                  
                
                +
                
                  
                    
                      CW
                      i
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  ×
                
              
            
          
        
        
          
            
              
              ⁢
              
                O
                ⁡
                
                  (
                  
                    
                      (
                      
                        
                          
                            CW
                            i
                          
                          ⁡
                          
                            (
                            t
                            )
                          
                        
                        ×
                        aSlotTime
                      
                      )
                    
                    2
                  
                  )
                
              
            
          
        
        
          
            
              ≈
              
              ⁢
              
                
                  
                    CW
                    i
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                -
                
                  α
                  ⁡
                  
                    (
                    
                      
                        CW
                        i
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    )
                  
                
              
            
          
        
      
    
  




  
    where
    ⁢
    
      
    
    ⁢
    the
    ⁢
    
      
    
    ⁢
    additive
    ⁢
    
      
    
    ⁢
    decrement
    ⁢
    
      
    
    ⁢
    value
  




  
    
      α
      ⁡
      
        (
        
          
            CW
            i
          
          ⁡
          
            (
            t
            )
          
        
        )
      
    
    =
    
      
        
          a
          ×
          aSlotTime
        
        c
      
      ×
      
        
          
            CW
            i
          
          ⁡
          
            (
            t
            )
          
        
        2
      
    
  



FIG. 3 is a diagram illustrating an example of the application of a method according to an embodiment of the invention to an exemplary sequence of wireless packet transmissions. The example in FIG. 3 shows the resulting CW parameter values during a sequence of packet transmissions where three packets are transmitted successfully followed by an unsuccessful transmission and a successful retry. As can be seen by the exemplary sequence, with each successful transmission, the methods reduce the contention window size CW either aggressively, e.g. exponential reduction by a slow start function until a threshold value is reached, or gradually, e.g. linear reduction by a contention avoidance function after the threshold value is reached. After an unsuccessful transmission, the contention window size CW may be increased aggressively, e.g. fast backoff by exponential increase or by taking the maximum contention window size. In some embodiments, the threshold is a value not less than the last contention window size in which a successful transmission has happened or the threshold value is the maximum contention windows size CWmax for the medium.
FIGS. 4A-4C are charts illustrating exemplary performance results achieved by embodiments of the invention. The performance results were based on simulation studies using an Opnet simulator from OPNET Technologies, Inc. for the novel contention control methods described above in comparison to and mixed with the standard IEEE 802.11 MAC DCF. The simulations were performed for three wireless LAN scenarios: 10 stations, 50 stations, and 100 stations. For each scenario, three simulation cases were run:

    
    
        All stations run the standard 802.11 MAC DCF, illustrated as curve 406.
        All stations run the novel contention control method with the protocol parameters from table, illustrated as curve 402.
        Half of the stations run the novel contention method with the protocol parameters from Table 1 and the other half run the standard 802.11 MAC DCF, referred as the mixed 802.11 DCF and Algorithm 1, illustrated as curve 404.
    
    


No RTS/CTS were used in the simulation cases. Table 3 shows the wireless LAN system configuration and the simulation configurations.








TABLE 3





Parameter
Value







SIFS
28 m sec


DIFS
128 m sec


A slot time
50 m sec


Bit rate
1 mbps


PLCP overhead
128 m sec


CWmin
15


CWmax
1023


Packet size
Uniform distribution between 1400 bytes and



2000 bytes


Packet inter arriving
10 stations: uniform distribution between 0.01


time
and 0.02.50 stations: uniform distribution



between 0.1 and 0.2.100 stations: uniform



distribution between 0.1 and 0.2.


Simulation duration
300 seconds









In the simulation cases, the traffic is generated so that all stations will always experience busy media when they try to initiate transmissions for new frames and hence will always need to go through backoff procedures to transmit frames.
The performance of a simulated 10 station network is illustrated in FIG. 4A, a simulated 50 station network in FIG. 4B, and a simulated 100 station network in FIG. 4C. It should be noted that the performance levels illustrated in FIGS. 4A-4C are exemplary, and that no embodiment of the invention is limited to the performance values shown.
Systems and methods for providing contention control in a wireless network are provided. The embodiments of the invention provide advantages over previous systems. For example, the systems and methods of the embodiments of the invention may reduce collisions significantly and achieve high system throughput while still maintain the fairness to all stations. Furthermore, the systems and methods can be supported with no changes to TCP/IP and with minimal changes to the IEEE 802.11 MAC standards. The methods can also be applied directly to other contention based medium access protocols, such as IEEE 802.11e EDCF (Enhanced Distributed Coordination Function).
Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiments shown. This application is intended to cover any adaptations or variations of the present invention.
The terminology used in this application is meant to include all of these environments. It is to be understood that the above description is intended to be illustrative, and not restrictive. Many other embodiments will be apparent to those of skill in the art upon reviewing the above description. Therefore, it is manifestly intended that the present invention be limited only by the following claims and equivalents thereof.

## Claims

1. A method for execution by one or more processors, the method comprising:
transmitting a packet on a wireless network;
in response to determining that transmitting the packet was successful, setting by the one or more processors a contention window parameter to a first value if the contention window parameter is less than a threshold value and setting the contention window parameter to a second value if the contention window parameter is greater than the threshold value; and
in response to determining that transmitting the packet was not successful, performing the tasks of:
increasing the contention window parameter, and
if transmitting a preceding packet was not successful then increasing the threshold value.

2. The method of claim 1, wherein setting the contention window parameter to the first value comprises decreasing the contention window parameter in a substantially linear manner.

3. The method of claim 1, wherein setting the contention window parameter to the first value comprises subtracting a predetermined stepsize value from the contention window parameter.

4. The method of claim 1, wherein setting the contention window parameter to the second value comprises decreasing the contention window parameter in a substantially exponential manner.

5. The method of claim 1, wherein setting the contention window parameter to the second value comprises substantially halving the contention window parameter.

6. A network device comprising:
a processor; and
a wireless network interface coupled to the processor;
wherein the processor causes the wireless network interface to transmit a packet on a wireless network, and
further wherein the processor determines if the packet was successfully transmitted and sets the contention window parameter to a first value if the contention window parameter is less than the threshold value and sets the contention window parameter to a second value if the contention window parameter is greater than the threshold value,.
further wherein the processor determines if the packet was not successfully transmitted and performs the tasks of:
increasing the contention window parameter, and
if transmitting a preceding packet was not successful then increasing the threshold value.

7. The network device of claim 6, wherein the first value is determined by decreasing the contention window parameter in a substantially linear manner.

8. The network device of claim 6, wherein the first value is determined by subtracting a predetermined stepsize value from the contention window parameter.

9. The network device of claim 6, wherein the second value is determined by decreasing the contention window parameter in a substantially exponential manner.

10. The network device of claim 6, wherein the second value is determined by substantially halving the contention window parameter value.

11. The network device of claim 6, wherein the processor, memory and wireless network interface are incorporated in a network interface card.

12. A non-transitory computer-readable storage medium having computer executable instructions for causing one or more processors to perform a method for controlling contention in a wireless network device, the method comprising:
transmitting a packet on a wireless network;
if transmitting the packet is successful then setting the contention window parameter to a first value if the contention window parameter is less than the threshold value and setting the contention window parameter to a second value if the contention window parameter is greater than the threshold value; and
in response to determining that transmitting the packet was not successful, performing the tasks of:
increasing the contention window parameter, and
if transmitting a preceding packet was not successful then increasing the threshold value.

13. The computer-readable storage medium of claim 12, wherein increasing the contention window parameter comprises increasing the contention window parameter in an exponential manner.

14. The computer-readable storage medium of claim 12, wherein increasing the contention window parameter comprises setting the contention window parameter to a predetermined maximum value.

15. The computer-readable medium of claim 12, wherein increasing the contention window parameter comprises substantially doubling the contention window parameter.

16. The computer-readable medium of claim 12, wherein setting the contention window parameter to the first value comprises decreasing the contention window parameter in a substantially linear manner.

17. The computer-readable medium of claim 12, wherein setting the contention window parameter to the first value comprises subtracting a predetermined stepsize value from the contention window parameter.

18. The computer-readable medium of claim 12, wherein setting the contention window parameter to the second value comprises decreasing the contention window parameter in a substantially exponential manner.

19. The computer-readable medium of claim 12, wherein setting the contention window parameter to the second value comprises substantially halving the contention window parameter.

20. A system comprising:
one or more processors;
a media access and control module executable by the one or more processors to control transmission of a packet on a wireless network; and
a distributed coordination function module executable by the one or more processors for the media access and control module operable to determine that the packet was successfully transmitted and to set a contention window parameter to a first value if the contention window parameter is less than a threshold value and to set the contention window parameter to a second value if the contention window parameter is greater than the threshold value;
wherein the distributed coordination function module is further operable to determine that transmitting the packet was not successful and perform the tasks of:
increasing the contention window parameter, and
if transmitting a preceding packet was not successful then increasing the threshold value.

21. The system of claim 20, wherein the contention window parameter is increased in an exponential manner.

22. The system of claim 20, wherein the first value is determined by decreasing the contention window parameter in a substantially linear manner.

23. The system of claim 20, wherein the first value is determined by decreasing the contention window parameter in a substantially exponential manner.