DIFS Modifications to Support QoS in IEEE g DCF Ad-hoc Networks

Similar documents
Department of Electrical and Computer Systems Engineering

EVALUATION OF EDCF MECHANISM FOR QoS IN IEEE WIRELESS NETWORKS

Remarks On Per-flow Differentiation In IEEE

CSE 461: Wireless Networks

Fairness in the IEEE network. Shun Y. Cheung

Performance anomaly of b

Multiple Access Links and Protocols

Introduction to Wireless Networking CS 490WN/ECE 401WN Winter Lecture 4: Wireless LANs and IEEE Part II

Lecture 16: QoS and "

An Efficient Scheduling Scheme for High Speed IEEE WLANs

Unit 7 Media Access Control (MAC)

Wireless Networked Systems

Performance analysis of Internet applications over an adaptive IEEE MAC architecture

A Novel Framework for Radio Resource Management in IEEE Wireless LANs

CMPE 257: Wireless and Mobile Networking

QoS Support for Time-Constrained Multimedia Communications in IEEE WLANs: A Performance Evaluation

CSC344 Wireless and Mobile Computing. Department of Computer Science COMSATS Institute of Information Technology

Mohamed Khedr.

Medium Access Control. IEEE , Token Rings. CSMA/CD in WLANs? Ethernet MAC Algorithm. MACA Solution for Hidden Terminal Problem

The MAC layer in wireless networks

Adaptive Fair Channel Allocation for QoS Enhancement in IEEE Wireless LANs

IEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall

CS 348: Computer Networks. - WiFi (contd.); 16 th Aug Instructor: Sridhar Iyer IIT Bombay

Expanding the use of CTS-to-Self mechanism to improving broadcasting on IEEE networks

MAC Sublayer(1) Principal service of the Medium Access Control Sublayer: Allocating a single broadcast channel (mostly a LAN) among competing users

The MAC layer in wireless networks

Wireless LANs. ITS 413 Internet Technologies and Applications

Certified Wireless Network Administrator (CWNA) PW Chapter Medium Access. Chapter 8 Overview

WiFi Networks: IEEE b Wireless LANs. Carey Williamson Department of Computer Science University of Calgary Winter 2018

A SURVEY OF QOS TECHNIQUES IN Drabu, Yasir Department of Computer Science, Kent State University

MAC. Fall Data Communications II 1

Local Area Networks NETW 901

EDCA LIMITATION WITH HIGH TRAFFIC REAL TIME APPLICATIONS

Data and Computer Communications. Chapter 13 Wireless LANs

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless

Performance Analysis for Channel Utilization in Wireless LAN

Topics for Today. More on Ethernet. Wireless LANs Readings. Topology and Wiring Switched Ethernet Fast Ethernet Gigabit Ethernet. 4.3 to 4.

Computer Communication III

WITH advances in wireless communications and the

Enhancing the DCF mechanism in noisy environment

CHAPTER 4 CALL ADMISSION CONTROL BASED ON BANDWIDTH ALLOCATION (CACBA)

LECTURE PLAN. Script. Introduction about MAC Types o ALOHA o CSMA o CSMA/CD o CSMA/CA

Lecture 23 Overview. Last Lecture. This Lecture. Next Lecture ADSL, ATM. Wireless Technologies (1) Source: chapters 6.2, 15

Prioritization scheme for QoS in IEEE e WLAN

Project Report: QoS Enhancement for Real-Time Traffic in IEEE WLAN

Table of Contents 1 WLAN QoS Configuration 1-1

Mohammad Hossein Manshaei 1393

IEEE e QoS for Wireless LAN:

QoS Enhancement in IEEE Wireless Local Area Networks

Priority Scheduling in Wireless Ad Hoc Networks

Wireless Network Security Spring 2012

Call Admission Control for IEEE Contention Access Mechanism

CMPE 257: Wireless and Mobile Networking

Wireless Local Area Networks (WLANs) Part I

Ethernet. Introduction. CSE 3213 Fall 2011

Wireless Local Area Network (IEEE )

Lesson 2-3: The IEEE x MAC Layer

A Comparative Analysis on Backoff Algorithms to Optimize Mobile Network

Wireless# Guide to Wireless Communications. Objectives

Key-Words: Ad hoc network, multimedia, QoS, routing protocol.

ECEN 5032 Data Networks Medium Access Control Sublayer

Interference avoidance in wireless multi-hop networks 1

Announcements / Wireless Networks and Applications Lecture 9: Wireless LANs Wireless. Regular Ethernet CSMA/CD.

Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver

Announcements: Assignment 4 due now Lab 4 due next Tuesday Assignment 5 posted, due next Thursday

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.

Chapter 6 Wireless and Mobile Networks. Csci 4211 David H.C. Du

Wireless Networking & Mobile Computing

Wireless Network Security Spring 2013

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS

CSE 6811 Ashikur Rahman

A Finite State Model for IEEE Wireless LAN MAC DCF

Logical Link Control (LLC) Medium Access Control (MAC)

A Backoff Algorithm for Improving Saturation Throughput in IEEE DCF

Guide to Wireless Communications, Third Edition. Objectives

IEEE MAC Sublayer (Based on IEEE )

Strategies and Guidelines for Improving Wireless Local Area Network Performance

Rahman 1. Application

Infrastructure CSMA/CA Network With Multiple Service Classes

Outline / Wireless Networks and Applications Lecture 9: Wireless LANs Aloha and 802 Wireless. Regular Ethernet CSMA/CD

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks

ICE 1332/0715 Mobile Computing (Summer, 2008)

University of Würzburg Institute of Computer Science Research Report Series. Performance Comparison of Handover Mechanisms in Wireless LAN Networks

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

Wireless Networks (MAC) Kate Ching-Ju Lin ( 林靖茹 ) Academia Sinica

Wireless Network Security Spring 2014

ITM542 Spring 2004 Feasibility Study of a Wireless LAN network With-VoIP at IIT Rice campus Ninad Narkhede Masaaki Yana Saturday, 1 May 2004

Chapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem.

Wireless Networks (MAC)

Providing Throughput Guarantees in IEEE e Wireless LANs

Figure.2. Hidden & Exposed node problem

Data Link Layer -2- Network Access

AGOOD medium access control (MAC) protocol for wireless

Enhancements and Performance Evaluation of Wireless Local Area Networks

standard. Acknowledgement: Slides borrowed from Richard Y. Yale

Data Communications. Data Link Layer Protocols Wireless LANs

CHAPTER 7 MAC LAYER PROTOCOLS. Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College

ICE 1332/0715 Mobile Computing (Summer, 2008)

Wireless LAN -Architecture

Transcription:

Modifications to Support QoS in IEEE 802.11g DCF Ad-hoc Networks Mohd Najwan Md Khambari a, Shahrin Sahib b, Mohd Fairuz Iskandar Othman c Fakulti Teknologi Maklumat dan Komunikasi Universiti Teknikal Malaysia Melaka, 75450 Ayer Keroh, Melaka Tel : 06-2332510, Fax : 06-2332508 E-mail : a najwan_ra@utem.edu.my, b shahrinsahib@utem.edu.my, c mohdfairuz@utem.edu.my ABSTRACT This paper describes and investigates the QoS provisioning technique used in IEEE 802.11g ad-hoc structure. This research then propose better scheme to support QoS by modifying the DCF Interframe Space () to use new values to bias towards the high priority traffic flow and distinguish it from the low priority traffic. Simulations are done using NS-2 and the findings presented. Results showed that better throughput can be achieved to provide better traffic flows on high priority traffic. Keywords IEEE 802.11, wireless, QoS,, SIFS, ad-hoc, NS-2 1.0 INTRODUCTION Wireless LAN (WLAN) is a technology connecting multiple devices as in LANs, with data transmission done over the air. It is a LAN, to which mobile stations (MS) can connect and communicate by means of high-frequency radio waves rather than wires. Technically, WLAN standard is described by IEEE 802.11. As the network world becomes more popular, the network load has become a critical issue. The wired LAN, which was originally designed to carry data traffic (such as file transfer, e- mail and Internet browsing) is now being used to carry real and muldia traffic such as video and voice. Highly congested network are demanding for better enhancement to support Quality of Service (QoS) that requires fast yet reliable transmission. One of the main reasons of the popularity of wireless network is that users can access the network without being physically attached where they can reach the Internet wherever they are, whether they are in the office or at home whenever and wherever they want. With the wireless network technology becomes more matured, a lot of improvements had been made to enhance it. This includes reduced errors in health care facility (where the any anywhere aspect of wireless communications allows increased access to accurate information when needed most), saving, improved profitability in terms of cost saving for cabling and labour and flexibility (Molta, 2004). With the encouraging growth of wireless network usage which saw increased productivity as much as 22% from a research of end users and IT network administrators of more than 300 U.S.-based organizations (Cisco, 2001), it is seen that pervasive high-speed wireless data services are both compelling and inevitable The strong and growing demand for WLANs in both consumer markets such as residential networks (Vanucci and Truong, 2003) and industrial markets such as retail, education, health care and wireless hot-spots in hotels, airports, and restaurants (Molta, 2004) has been documented repeatedly in business, industry and education (Pattara-Atikom, 2005). In this research, the proposed technique involves modifying the. This is done by fine tuning the SIFS because and SIFS are related with each other, which will be discussed later in the next sections. Using different values of SIFS will lead to different values of. The experiments are done exhaustively where the possibility of each scenario is put into test. The total numbers of scenarios involved in modifying the are 238. However, only the key scenarios are highlighted in this paper. The remainder of this paper is organized as follows. Firstly, this paper will discuss on the IEEE 802.11 channel coordination function before focusing on the Distributed Coordination Function (DCF). Then, other proposed techniques from previous research on are presented before outlining the author s proposed techniques. Finally, a brief description of simulation scenarios using NS-2 and findings are given. 2.0 IEEE 802.11 CHANNEL COORDINATION FUNCTION In wireless networks communications, radio frequency are used as the medium of data transfer. Since its half-duplex behavior, radio frequency can be used only by one device at a ; therefore there will be a method for the devices to take turns to use the radio frequency channel to avoid collision, which is called the coordination function.

There are two types of coordination functions which are the Point Coordination Function (PCF) and Distributed Coordination Function (DCF). Since this paper focuses on DCF, the following section will discuss more on the DCF access method. 2.1 Distributed Coordination Function (DCF) In DCF, the technique to use the RF channel is distributed to each of the MS. The MS themselves determine whether they have the opportunity to transmit data. It is a contention-based method where MS have to compete with each other to use the RF. In the contention basis, any MS can attempt to transmit data at any it wanted to, if the channel is sensed to be idle. However, problem occurs when two or more MS start to transmit data at the same, where a collision will happen. In order to avoid collision, DCF implements a mechanism called Carrier Sense Multiple Access with Colllision Avoidance (CSMA/CA) which is primarily adopted by wired LAN s Carrier Sense Multiple Access with Collision Detection (CSMA/CD) to avoid collision. Figure 1 below illustrates on how DCF mechanism avoids collision. MS A MS B T wait T wait BI BI Data Wait until channel is idle Figure 1: The operation of DCF mechanism Instead of having the two MS, MS A and MS B responsible for the collision to wait a random amount of (as in CSMA/CD), CSMA/CA has all the clients to wait for a random amount of, T wait, which consists of DCF Interframe Space () and backoff interval (BI) before attempting to do transmission, as shown in (1). BI is a uniform random value, sampled exponentially from [0, CW] where CW is the Contention Window with a maximum value of 1023 slots. T wait = + BI (1) Note that the value of is the same for each station. BI value is taken randomly to avoid collision. Meanwhile, is derived from an equation as in (2) below: = 2 (SlotTime) + SIFS (2) It is essential to know where the is derived from, as this involves on providing QoS which will be discussed later in this paper. In this paper, the modification of value involves using different values for SIFS whereby using different values of SIFS will result to the change of the value. Therefore we will discuss more on in the next sections. 3.0 RELATED WORKS IN AND SIFS MODIFICATIONS Deng and Chang (1999) rejects reservation scheme which was used in Intserv (RFC 1633, 1994) of wired LAN, as it leads to a major drawback. When the source is reserved but unused, it is simply wasted. The author proposed a method to support two priorities. Higher priority stations will wait for duration of PIFS, while lower priority stations will wait for duration of before attempting data transmission. Several assumptions are made where there is no hidden MS an issue, no stations operates on power-saving mode and no interference from nearby BSSs. Simscript simulation of video, voice and data traffic with priorities of 3, 2 and 0 with the ratio of 1:1:2 is performed. Results (IFS based, combined with CW separation) showed that there are performance improvements for high priority traffic in heavy load conditions where video traffic uses most of the bandwidth (55%) and lower priorities use the remaining bandwidth. In low load condition, lower priority traffic has the required bandwidth. Although it is illustrated that video and voice traffic has lower access delay and lower packet loss probability than in DCF, data traffic suffers access delay and higher packet loss than in DCF. Aad et al. (2001) uses almost the same scheme as Deng. Higher priority, j+1 and low priority j have different IFS values, j+1 and j, where j+1 is lower than j. The maximum random range random range RRj+1 of priority j+1 is defined as the maximum Backoff Interval (BI) of that priority. If the strict condition RRj+1 < j j+1 is satisfied, then all packets of priority j+1 have been transmitted before any packet of priority j is transmitted. In less stringent condition, RRj+1 > j j+1, a packet which could not access the medium the first may have its priority decreased in the subsequent attempts. Simulations were carried out and the results show that the method does not change the system efficiency, with data sums remains the same (Pham, Sekercioglu and Egan, 2004). The method works well for both Transmission Control Protocol (TCP) and User Datagram Protocol (UDP) flows with more significant effect on UDP flows compared to TCP flows. It also works in noisy environment and keeps the same stability of the system.

Meanwhile Benveniste (2002) recommends Urgency Arbitration Time (UAT) to differentiate services, which is the a station has to wait before a transmission attempt following a period when the medium is busy. Benveniste also introduces AIFS and Backoff Counter Update Time (BCUT) but both are actually and SlotTime. Higher priority traffic is assigned shorter AIFS and BCUT values compared to the low priorities. The AIFS value for high priority is the same as PCF Interframe Space (PIFS) and a minimum backoff of 1 in order to prevent conflict with medium access by centralized protocol PCF. A simulation was carried out where AIFS (high_prio) = PIFS, AIFS (low_prio) =, CW (high_prio) = [1, 32] and CW (low_prio) = [0, 31]. Results showed that the delay and jitter of high-priority traffic are decreased and under moderate load condition, the performance of low priority traffic is also improved compared to DCF 4.0 PROPOSED SCHEME As discussed before, is the duration for a mobile MS that wants to transmit data has to wait after sensing the channel is idle. The technique proposed to support QoS in this experiment is that the high priorities MS are assigned shorter. This means high priority MS have a shorter waiting, which allows the higher priority MS to transmit ahead of the lower priority MS. While high priority MS will always have a shorter waiting, it means high priority MS are most likely to have the opportunity to always being first to transmit data after the channel is sensed idle compared to the low priority MS. This scheme can further be depicted in below. HP Sender LP Sender Legend: HP = High Priority LP = Low Priority HP LP Figure 2: High priority MS and Low Priority MS transmission on proposed scheme In order to test the outcomes of the proposed scheme, a simulation using NS-2 was carried out which will be described in the next section. 5.0 SIMULATION SETUP AND SCENARIO Since the simulation is done using NS-2 version 2.31 (2007), simulation setup is done using Tool Command Language (TCL). The selected environment is configured to radio channel on which the channel type is set to wireless channel. Data Back off In order to simulate a realistic environment as in a real wireless network, radio propagation models are used to predict the received signal power of each packet. Since IEEE 802.11 considers both the direct path and a ground reflection, the propagation model used in this simulation is the Two-Ray Ground Reflection Model. Some assumptions were made during this experiment where the simulation is done as a per-based mobile communication. This means that each MS only transmit one type of data, whether a high priority data, or a low priority data. 16 MS are used where eight MS acts as the data source and the other eight of the MS as the destination where in the end there will be eight pairs of traffic flow, namely fid 1 to fid 8. For the sake of simplicity and clarity, only one flow will be configured as high priority, which is the fid 1. On fid 1, the MS is configured to use different values of SIFS in order to change its value. In order to see the difference in terms of improvement or degradation of the proposed scheme, the simulations findings are compared with the default IEEE 802.11g findings. Therefore, the default IEEE 802.11g network was also simulated as the controlled experiment. Table 1 below shows the different values of SIFS tested on the simulations. Table 1: The different values of used in the simulations Experiment (µs) Default 802.11g 28 1 26 2 24 3 22 Each of the experiment is then put into test by simulating the scenarios to conform to the default (as the benchmark) and proposed parameters. 6.0 RESULTS AND FINDINGS Recapping back the objective of the proposed scheme in previous sections, it is expected that the new scheme will provide better results in terms of network throughput. In this section, the effects of different values of towards network throughput will be discussed. Since NS-2 only provides a raw log file (called tracefile) that dumps the entire network scenario line, several scripts has been developed to facilitate the process of extracting the important data from the tracefile. This includes AWK scripts to manipulate and extract the tracefile and Shell script (particularly Bash script) to automate the TCL and AWK

scripts to execute independently and automatically with a single command through the terminal console. After extracting the data, analysis of the result is computed using SPSS. The mean value of the throughput is examined to determine the performance of the throughput. This is because the mean value of the throughput will reflect the overall throughput performance of the selected network flow. Table 2 below shows the results of the simulations of using different values of. Table 2: Mean throughput results of simulations Results of fid 1 Experiment No. of successful Transmission (µs) Mean Throughput (kbps) IEEE 802.11 583 28 2493.0149654 1 580 26 2816.7237122 2 4 24 17.3602780 3 4 22 16.1535090 From the table above, an increase of mean throughput can be seen on Experiment 1 where the value is 26 µs compared to Experiment IEEE 802.11 where the value is 28 µs. It is an increase from 2493.0149654 kbps to 2816.7237122 kbps, an improvement of 12.985%. The result is as expected, because using shorter SIFS allows the high priority MS to transmit earlier and more frequent compared to low priority MS. Surprisingly, using shorter than 26 µs will result to the mean throughput to drop dramatically. Results also revealed that using shorter than 26 µs stunted the number of successful transmissions. This phenomenon can be described in the next paragraph In this paper, the different values of are derived by using different values of SIFS. However in the IEEE 802.11, SIFS are not only used in. SIFS is also being used during the transmissions of TCP packets where ACK packets are involved. This can be shown as in Figure 3 below. From the figure above, the source MS has transmitted data to the destination MS. In TCP transmission, each packet sent by the sender will be replied by the receiver to notify the sender that the packet has already arrived. The notification is called the ACK packet. In IEEE 802.11, the receiver has to wait an SIFS period of before transmitting the ACK to avoid collision. With regard to the experiment done in this research, changing the value of the SIFS has not only affected the but also the waiting of the receiver to send the ACK to the sender which explains the very low number of successful transmissions. The SIFS behavior of being the waiting for ACK packets leads to low successful transmission. Initially, the sender sends the packet to the receiver. After the sender sends the packet, it then waits for SIFS and listen for any ACK. However since the SIFS is too short, the sender only listens for the ACK for a very short where the ACK could not arrive before the SIFS s out. The sender then suspects packet collision or packet drop. When the channel is idle, the sender retransmits the packet and the cycle continues where the ACK cannot arrive before SIFS s out. The looping process can be depicted as in Figure 4 below. Sender MS Transmits Data Sender MS Waits for ACK No ACK detected in SIFS period of Sender suspects packet collision/ packet drop Sender waits for idle channel to reattempt transmission Figure 4: Scenario on low number of successful transmission in shorter value of SIFS Therefore with regard to this research, the best value to support QoS done in the NS-2 simulation is 26 µs on which the SIFS value is 8 µs. 7.0 CONCLUSION Figure 3: The usage of SIFS in TCP packet transmission The primary contribution of this paper focuses on detailed investigation on many of the and SIFS modifications to support QoS by past researchers. New scheme of different

shorter SIFS values are then tested to unearth the best value to support QoS for better throughput. The simulation model proposed in this paper is done by modifying the through SIFS to differentiate services between high priority and low priority traffic. From the findings and result of the experiments, it is proved that the new provision technique proposed for the IEEE 802.11g ad-hoc network in this paper has the ability to enhance the throughput of the high priority network flow thus improving the IEEE 802.11 to support Quality of Service Vannuccini, G. and Truong, H.L. (2003). The IEEE 802.11e MAC for Quality of Service in Wireless LANs. IBM Research, Zurich Research Laboratory, Switzerland. REFERENCES Aad I. and Castelluccia C. (2001). Differentiation Mechanisms for IEEE 802.11. Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 01), USA, 1, 209-208. Benveniste, M. (2002). Tiered Contention Multiple Access (TCMA), A QoS-Based Distributed MAC Protocol. The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Portugal, 2, 598 604. Cisco Systems Inc (2001). Cisco Announces New Independent Study Demonstrating Productivity Gains Achieved Through Wireless LAN Use. Retrieved January 14, 2007, from http://newsroom.cisco.com/dlls/corp_111201b.html Deng J. and Chang R. S. (1999). A Priority Scheme for IEEE 802.11 DCF Access Method. IECE Transactions on Communications. Vol. E82-B (1), 96-102 Molta, D. (2004). Wi-Fi Tales. Network Computing,44-62. NS-2 ver. 2.31 (2007). Retrieved January 23, 2008, from http:// www.isi.edu/nsnam/ns/. Pattara-Atikom, W. (2005). Quality of Service Support in IEEE 802.11 Wireless Lan. Ph.D Thesis, University of Pittsburgh. Pham D., Sekercioglu A. and Egan G. (2004). A Survey of IEEE 802.11 MAC Mechanisms for Quality of Service (QoS) in Wireless Local Area Networks (WLANs). Technical Report MECSE-5-2004, Monash University. RFC1633 (1994). Integrated Services in the Internet Architecture: an Overview. Retrieved August 5, 2007, from http://www.ietf.org/rfc/rfc1633.txt