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

Slides:



Advertisements
Similar presentations
CSE 413: Computer Networks
Advertisements

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
1 Dual Busy Tone Multiple Access (DBTMA) : A Multiple Access Control Scheme for Ad Hoc Networks Z. Haas and J. Deng IEEE Trans. on Communications June,
1 «Performance Analysis for a New Medium Access Control Protocol in Wireless LANs» By YOUNGGOO KWON and YUGUANG FANG Presentation by Ampatzis Efthimios.
Dynamic Bandwidth Scheduling for QoS Enhancement over IEEE WLAN Sangwook Kang, Sungkwan Kim, Mingan Wang, Sunshin An Korea University European Wireless.
Module C- Part 1 WLAN Performance Aspects
Presentation By: Daniel Mitchell, Brian Shaw, Steven Shidlovsky Paper By: Martin Heusse, Franck Rousseau, Gilles Berger-Sabbatel, Andrzej Duda 1 CS4516.
14.1 Chapter 14 Wireless LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Simulation of VoIP traffic in n networks Aya Mire Niv Tokman Oren Gur-Arie.
Network Technology CSE Network Technology CSE3020 Week 9.
Analyzing Multi-channel MAC Protocols for Underwater Sensor Networks Presenter: Zhong Zhou.
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
MAC Protocols Media Access Control (who gets the use the channel) zContention-based yALOHA and Slotted ALOHA. yCSMA. yCSMA/CD. TDM and FDM are inefficient.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
Wireless Networking So we talked about wired networks. What about wireless?
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 7th Lecture Christian Schindelhauer.
1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.
Submission doc.: IEEE /1452r0 November 2014 Leif Wilhelmsson, EricssonSlide 1 Frequency selective scheduling in OFDMA Date: Authors:
A Transmission Control Scheme for Media Access in Sensor Networks Alec Woo, David Culler (University of California, Berkeley) Special thanks to Wei Ye.
5-1 Data Link Layer r Wireless Networks m Wi-Fi (Wireless LAN) Example Problems m RTS/CTS.
Wireless scheduling analysis (With ns3) By Pradeep Prathik Saisundatr.
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 Real-Time Traffic over the IEEE Medium Access Control Layer Tian He J. Sobrinho and A. krishnakumar.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
Ethernet. Problem In an Ethernet, suppose there are three stations very close to each other, A, B and C. Suppose at time 0, all of them have a frame to.
Computer and Data Communications Semester Mohd Nazri Mahmud Session 4a-12 March 2012.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Voice over WiFi R 張素熒 R 朱原陞 R 王振宇
Voice Capacity analysis over Introducing VoIP and WLans IEEE based Wireless Local Area Networks (WLANs) are becoming popular While WLANs.
IEEE Wireless LAN Standard. Medium Access Control-CSMA/CA IEEE defines two MAC sublayers Distributed coordination function (DCF) Point coordination.
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.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Doc.: IEEE /065r0 Submission January 2001 Brockmann, Hoeben, Wentink (Intersil) g MAC Analysis Menzo Wentink Ron Brockmann.
A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks ICC 2006 Ahmed K. Sadek, Zhu Han, and K. J. Ray Liu Department.
A Multiplex-Multicast Scheme that Improves System Capacity of Voice- over-IP on Wireless LAN by 100% * B 葉仰廷 B 陳柏煒 B 林易增 B
Doc.: IEEE /0637r0 Submission May 2014 James Wang et. al., MediaTekSlide 1 Spatial Reuse and Coexistence with Legacy Devices Date:
1 Real-Time Traffic over the IEEE Medium Access Control Layer Tian He.
Performance Analysis of IEEE Distributed Coordination Function (DCF) Author : Giuseppe Bianchi Presented by: 李政修 December 23, 2003.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
Rami Melhem Sameh Gobriel & Daniel Mosse Modeling an Energy-Efficient MAC Layer Protocol.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
1 Ethernet CSE 3213 Fall February Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed.
Design and Implementation of a Reservation-based MAC Protocol for Voice/Data over IEEE Ad-Hoc Wireless Networks Shiann-Tsong Sheu, Tzu-Fang Sheu.
Resolutions to Static RTS CTS Comments
Broadcast-and-select networks. Each node is usually attached to two fibers: one to transmit, one to receive W WDM channels are available Tx and Rx operate.
PAC: Perceptive Admission Control for Mobile Wireless Networks Ian D. Chakeres Elizabeth M. Belding-Royer.
Chapter 4 The Medum Access Sublayer. MA Sublayer Additional Reference –Local and Metropolitan Area Networks, William Stallings, Prentice Hall, 2000, 6th.
AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.
Simulation of MAC layer EEL 6507 Fall 2003 Scott Owen & Eric Donnelly.
Topics in Distributed Wireless Medium Access Control
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
On the Physical Carrier Sense in Wireless Ad-hoc Networks
A Scheduling Scheme for Level-2 Enhanced PCF MAC Service
Simulation Results for QoS, pDCF, VDCF, Backoff/Retry
Channel Allocation Problem/Multiple Access Protocols Group 3
Channel Allocation Problem/Multiple Access Protocols Group 3
Wireless LAN Simulation IEEE MAC Protocol
Outline 1. INTRODUCTION 2. PRELIMINARIES 3.THE PROPOSED PROTOCOL
Is the MAC sufficient for wireless high speed mesh LANs?
Wireless MAC Multimedia Extensions Albert Banchs, Witold Pokorski
Presentation transcript:

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

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

Network capacity calculation The idea: to create a standard reference point to network capacity, regardless of aggregation size used. The network capacity is the percentage of bandwidth actually used. Due to different timing scheme, the percentage differs between regular station and AP. Thus we calculate them independently and perform a weighted sum. This is a static calculation. A dynamic calculation taking actual collisions and transmissions into account provide different capacity per aggregation, which makes comparison impossible. The equations are in the next slide:

The AP has priority on the channel, thus STA can transmit only when AP is accumulating the aggregation. The weight is based on the AP portion of time: Efficiency of STA/AP is the amount of actual data transmission out of the total transmission period (including handshake and wait times). Note that transmission of control messages is negligible: Thus the total network efficiency is the weight sum: Network capacity equations

Simulation analysis We can see that at lower network capacity, we get better results for the higher aggregation sizes, while at higher network capacities we get better performance for middle range of aggregation size In the current simulation configuration, the aggregated AP has priority over the regular stations. When network capacity is low, it takes time to accumulate an aggregation, which gives equal opportunity to the stations to transmit their messages. When the network capacity is high, aggregations are accumulated in no time, and the AP starves the other stations, thus their messages expire and the success rate is falling.

Simulation analysis (cont.) Aggregation of 100 is like almost no aggregation at all. Success rate is poor at lower network capacities, while at higher rates the success rate is similar to higher aggregation sizes. It can be seen that the trends are kept as margin is raised.

Network capacity (MB/s)

Success rate analysis It can be seen that for low-mid range network capacity, the largest aggregation is the best. At higher network capacities, the larger aggregations causes regular stations starvation, thus success rates are slightly lower than at smaller aggregation sizes.

Conclusions At all simulated network capacities, the larger aggregations provide better results than smaller aggregation sizes. The only exception is at the highest network capacities, at which a slight degradation can be observed. Higher aggregation size is better for almost all network capacities, even at a network were not all devices aggregate. The degradation at higher network capacities is probably simulation dependent. In networks with better balance between AP and stations priorities (such as QoS), one can assume that there will be no degradation.

Thank you Niv, Oren & Aya