1 / 23

Understanding Congestion in IEEE 802.11b Wireless Network

Understanding Congestion in IEEE 802.11b Wireless Network. Amit P.jardosh Krihna Romashandran Kevin C.Almeroth Elizabith M.Royer University of California Santa Barbara. Introduction The occurrence of high density nodes with a single collision domain in W.N result in congestion . problems:

chuong
Télécharger la présentation

Understanding Congestion in IEEE 802.11b Wireless Network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Understanding Congestion in IEEE 802.11b Wireless Network Amit P.jardosh Krihna Romashandran Kevin C.Almeroth Elizabith M.Royer University of California Santa Barbara

  2. Introduction • The occurrence of high density nodes with a single collision domain in W.N result in congestion . • problems: Dropping in throughput . Unacceptable packet delay

  3. We aim to answer: 1. what does congestion mean in W.N ? 2. how do we identify it ? 3. what are the challenges un the congestion analysis ?

  4. Some factors to explain the behavior of MAC layer : 1. Channel busy time. 2. RTS-CTS mechanism. 3. Frame transmission. 4. Acceptance delay

  5. Overview for Distribution Coordination Function DCF: • Designed to reduce contention. • Use CSMA/CA. • Use RTS-CTS

  6. CSMA/CA • Designed to reduce contention. the node sense link if ( busy ) wait (back off interval) else transmit

  7. How to reduce contention in DCF? • By using RTS-CTS RTS: contains information about size of data and channel time needed. other node record these information and wait for a back off interval (BO) by assign a counter. sensing busy stop the counter.

  8. Multi Rate Adaptation protocol • Adapt the rate of which frames are transmitted , HOW? by using Auto Rate Fallback (ARF) Dropping packets decreasing rate Successful packets increasing rate

  9. The Data Collection Framework Vicinity sniffing:a method used to collest data from the MAC layer. capturing data within two session: • Day session . • Plenary session. • Day session in an early time divided it into sniffers. • Plenary session in an late time dividing it into sniffers.

  10. Sniffer: amount of time about 2.5 hours. • Implementing by distributing the APs in different location and collecting the needed data for the MAC layer thus we can study the traffic of the flowing data between terminals and nodes. • The data contains the control messages and data packets transmitted through each session

  11. The traffic in the plenary session is lower than it in the day session. • And so by this way we can monitor the congestion domain between the N.W terminal so we can implement the multi rate adaptation.

  12. Vicinty sniffing challenges • Choice of sniffer locations. • Unrecorded frames. 1. frame dropped due ro bit errors. 2. hardware limitation (such as buffers) 3. hidden terminal problem.

  13. Solution for these challenges • Estimation for the unrecorded data: 1. Data frames: Every data frame need an ACK and SIFS time. 2. RTS frames: RTS need CTS after SIFS delay. 3. CTS frames: The node which send RTS and receive CTS will send a data frame.

  14. But if the data, CTS and RTS are missing? The algorithm support a percentage equation for this problem as follows: Unrecorded% = unrec-frames unrec-frames + captured frames

  15. Defining congestion • Congestion: is the state which the channel is closed to being completely utilized by the transmission of bytes. • Can be measured by the mean of channel busy-time.

  16. Channel Utilization • Channel utilization= transmission time for all data and control frames + delay time (SIFS + DIFS)

  17. When the channel utilization increases? 1. The channel utilization increases for larger data frame (according to the time spent) 2. Decreasing the rate of transmission.

  18. Channel busy time

  19. Data frame : CBT= DDIFS +DDATA(s, r) • RTS frame : CBT = Drts • CTS frame : CBT= DSIFS + DSIFS • ACK frame : CBT = DSIFS + DACK • Beacon frame : CBT = DDIFS + DBEACON

  20. Throughput and Goodput • Throughput : total number of recorded bits per second. • Goodput :total number of recorded control and successfully acknowledged data frame per second.

  21. Classifying Congestion • We classify N.W state into: • Uncongested state (30% utilized). • Modrately congested state(30-84% utilized). • Highly congested state (above 84% utilized).

  22. Acceptance Delay: is the time for the data to be acknowledged (the time between the transmission of data and the time when the ACK was recorded)

  23. conclusion • The N.W controlled by monitoring the traffic of the congestion domain by using protocol like vicinity sniffing and its parameters. • After monitoring we can control it by using Auto Rate Fallback (ARF) protocol.

More Related