802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

69 th IETF, Chicago, IL Performance Evaluation of L3 Transport Protocols for IEEE Richard Rouil, Nada Golmie and David Griffith National Institute.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
The ALOHA Protocol “Free for all”: whenever station has a frame to send, it does so. –Station listens for maximum RTT for an ACK. –If no ACK after a specified.
Ethernet – CSMA/CD Review
– Wireless PHY and MAC Stallings Types of Infrared FHSS (frequency hopping spread spectrum) DSSS (direct sequence.
Bridging. Bridge Functions To extend size of LANs either geographically or in terms number of users. − Protocols that include collisions can be performed.
Interactions Between the Physical Layer and Upper Layers in Wireless Networks: The devil is in the details Fouad A. Tobagi Stanford University “Broadnets.
Communication Networks Lecture 5 NETW 501-L5: NETW 501-L5: Medium Access Control Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204,
20 03 TASTE OF RESEARCH SUMMER SCHOLARSHIPS Author: Wei Zhang Supervisor: Tim Moors Efficient Voice Over Wireless Network Abstract The objective of this.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
Simulation of VoIP traffic in n networks Aya Mire Niv Tokman Oren Gur-Arie.
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
Wireless Networking So we talked about wired networks. What about wireless?
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
Chapter 14 LAN Systems Ethernet (CSMA/CD) ALOHA Slotted ALOHA CSMA
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
EE 4272Spring, 2003 Chapter 14 LAN Systems Ethernet (CSMA/CD)  ALOHA  Slotted ALOHA  CSMA  CSMA/CD Token Ring /FDDI Fiber Channel  Fiber Channel Protocol.
IEEE Wireless LAN: Capacity Analysis and Protocol Enhancement F. Cali, M. Conti, E. Gregori IEEE Wireless LAN: Capacity Analysis and Protocol.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
protocol continued. DCF The basic idea is non-persistent. Can do an optimization: For a new packet (Q len = 0), the sender needs only wait for.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
9/11/2015 5:55 AM1 Ethernet and CSMA/CD CSE 6590 Fall 2010.
Opersating Mode DCF: distributed coordination function
2014 YU-ANTL Lab Seminar Performance Analysis of the IEEE Distributed Coordination Function Giuseppe Bianchi April 12, 2014 Yashashree.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
Computer and Data Communications Semester Mohd Nazri Mahmud Session 4a-12 March 2012.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
802.11: Performance Reference: “Does the IEEE MAC protocol work well in multihop wireless ad hoc networks”; Xu, S.; Saadawi, T. IEEE Communications.
Routing Protocol Evaluation David Holmer
Voice Capacity analysis over Introducing VoIP and WLans IEEE based Wireless Local Area Networks (WLANs) are becoming popular While WLANs.
More about channels In b/g, there are 11 channels, starting at 2.412GHz at a spacing of 5MHz. Each channel owns a bandwidth of 22MHz.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs K.Murugan, B.Dushyanth, E.Gunasekaran S.Arivuthokai, RS.Bhuvaneswaran, S.Shanmugavel.
2000 년 11 월 20 일 전북대학교 분산처리실험실 TCP Flow Control (nagle’s algorithm) 오 남 호 분산 처리 실험실
Cyclic Redundancy Check (CRC).  An error detection mechanism in which a special number is appended to a block of data in order to detect any changes.
Types of Service. Types of service (1) A network architecture may have multiple protocols at the same layer in order to provide different types of service.
Vertical Optimization Of Data Transmission For Mobile Wireless Terminals MICHAEL METHFESSEL, KAI F. DOMBROWSKI, PETER LANGENDORFER, HORST FRANKENFELDT,
Copyright 2008 Kenneth M. Chipps Ph.D. Controlling Flow Last Update
Multiple Access.
A Multiplex-Multicast Scheme that Improves System Capacity of Voice- over-IP on Wireless LAN by 100% * B 葉仰廷 B 陳柏煒 B 林易增 B
Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 9.
LOCAL AREA NETWORKS. CSMA/CA In a wired network, the received signal has almost the same energy as the sent signal because either the length of the cable.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Doc.: IEEE /1263r2 Submission Dec 2009 Z. Chen, C. Zhu et al [Preliminary Simulation Results on Power Saving] Date: Authors: Slide.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
ECEN 621, Prof. Xi Zhang ECEN “ Mobile Wireless Networking” Course Materials: Papers, Reference Texts: Bertsekas/Gallager, Stuber, Stallings, etc.
1 Ethernet CSE 3213 Fall February Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed.
COE-541 LAN / MAN Simulation & Performance Evaluation of CSMA/CA
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
Performance Evaluation of L3 Transport Protocols for IEEE (2 nd round) Richard Rouil, Nada Golmie, and David Griffith National Institute of Standards.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Performance Evaluation of L3 Transport Protocols for IEEE Richard Rouil, Nada Golmie and David Griffith National Institute of Standards and Technology.
Chapter 9: Transport Layer
Instructor Materials Chapter 9: Transport Layer
[Preliminary Simulation Results on Power Saving]
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
[Preliminary Simulation Results on Power Saving]
Empirical Formula for EDCA Bandwidth Factor
DL MU MIMO Error Handling and Simulation Results
Presentation transcript:

802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie

Background In the past several years, computer communication has turned toward the wireless medium n is proposition for a new and improved protocol, that aims to deal with higher demands – video streams, VoIP conversations, file sharing and more. One of the main enhancements introduced to the MAC layer is packet aggregation

Packet aggregation The idea – squeeze packets into one transmission. Reduces the overhead of control packets and timeouts related to the protocol May be destined to single or multiple receivers

Project goals Examine the influence of aggregated communication on periodic information – with focus on VoIP Examine the influence of aggregation size (number of packets per aggregation) on network’s behavior

Standard protocol transaction 1. Data arrives at Tx FIFO of STA A from VoIP data generator. IAC is sent. 2. AP receives IAC, wait SIFS and respond with RAC. 3. RAC received. STA A sends non-aggregated VoIP data 4. After DIFS, the operation is repeated by STA B 5. Aggregation size is reached. AP send IAC followed by the aggregated data 6. Data is received by STA C

Simulation structure and flow

Simulation assumptions There is no random noise in the simulation and error rate is zero. All stations are n (no legacy devices) Each station can be involved in one conversation at a time All conversations are between a local station and remote network (Through the AP) Only AP uses aggregated packages The destinations of conversations are distributed equally. The length of conversations is distributed exponentially. No Ack packages in MAC layer - the simulated network layer

Simulation parameters All simulations runs had these parameters: Number of stations: 250 Average conversation length: 1 sec Number of conversations: 1000 to 20,000 in steps of 500. For each number of conversations, the following aggregation max size were defined: (bytes) in steps of 100.

Simulation constants Time slot = 20 u sec SIFS = 10 u sec DIFS = SIFS + 2*TimeSlot = 50 u sec TTL for aggregation: 8000 u sec

What are we checking ? X axis is the number of conversations simulated. The estimated network load is a measure of how much DATA is injected into the network. AvgNumOfBytesConversation*NumberOfConversation/SimulationTime Best effort is the free percentage of the network for other TCP communication. We want to check the effect of aggregation size on the packets delay and best effort, in various network loads. Packets delay measured is average delay and max delay, as well as max delay of successful short VoIP and long VoIP packets.

Average delay of VoIP packets

Average delay is under 10 ms (except for aggregation size of 100), which indicates that not many packets are lost Delay rises rapidly with small aggregation size like 100 bytes. This is because the AP sends at a high rate, and he has precedence over other stations, which causes the delay.

Max delay of VoIP packets

We can see that Max delay can be quite high. This means that packets are lost – they don’t arrive on time. Max delay tends to decrease with larger aggregation sizes, since LESS AP transmission occur. Instead, whenever the AP transmits, the transmission time increases. This increase, however, is negligible in respect to more AP transmissions

Max delay of successful long VoIP packets

Max delay of successful short VoIP packets

Max delay of successful VoIP packets As can be seen, in simulations with a smaller number of conversations, the max delay of successful packets is relatively far from the upper boundary. For relatively low network capacity, the max delay is derived from the TTL timing of the AP (8 ms). At higher network capacity, the max delay is almost equal to the upper boundary, which indicates that the max delay is derived from the regular stations.

Best effort

It is difficult to determine the effect of aggregation size on best effort. The difference is most noticeable on aggregation size of 100 bytes, which is in effect no aggregation. Higher aggregation sizes show higher values of best effort.

Aggregation size

Analysis 100 bytes aggregation is like no aggregation at all, which causes the AP to take over the medium and delay regular stations. Best average results are for 300 bytes aggregation size, but max delay is still high. Larger aggregations are better as network load is increased, but average gets worse as more packets wait in the aggregation.

Implementation issues Network capacity is represented in number of conversations. Actual network capacity is much lower and cannot exceed a certain value. Analytic calculation shows that only 125 conversations can occur concurrently in time frame of 10 ms. calculation calculation Using short time slot is very similar, therefore we focused on long time slot. Example for the similarities can be seen here. here

Implementation issues – cont’ Due to the capacity limit, there is little sense in running the simulation with a very large number of stations and conversations. This generates higher capacity, yet meaningless results – the unreasonable high number of stations creates a tough competition over the medium and results in horribly high delays, for example. Example: Example: 10,000 stations, 40,000-60,000 conversations. Example:

Thank you Niv, Oren & Aya

Analytic calculation of maximal number of conversation in 10ms frame time: Average transmission time: DIFS+IAC+SIFS+RAC+SIFS+DATA = = 80 u sec Maximum number of transmissions: 10,000/80 = 125

Network capacity As can be seen, the actual network capacity in our simulation does not exceed 1.1 Mbps. This is due to the 125 conversation limit. However, there is a correlation between the number of conversations and the “actual” capacity over the different aggregation size, therefore number of conversations is adequate rating system.

Short VS long time slot There is high correlation between long time slots and short time slots, hence the analysis of long time slots simulations can be applied to short time slots simulations as well.

High number of stations and conversations There is no clear orientation, and average delay is unreasonably high. That many stations create a tough competition and starvation of stations. This is unrealistic and provide no insights.