Throughput Improvement by Adjusting RTS Transmission Range for W-LAN Ad Hoc Network

Similar documents
Ad Hoc WLAN Throughput Improvement by Reduction of RTS Range Emilia Weyulua, Taro Iwabuchib, Misu Takeshic, Masaki Hanadad, Moo Wan Kime

A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem

standard. Acknowledgement: Slides borrowed from Richard Y. Yale

Lecture 16: QoS and "

Mohamed Khedr.

A Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks

Wireless MACs: MACAW/802.11

Cooperative Communication Protocol based on Relay Node Grouping in Wireless Networks

Transmission Control Protocol over Wireless LAN

Computer Networks. Wireless LANs

CSE 461: Wireless Networks

IEEE Medium Access Control. Medium Access Control

Data Communications. Data Link Layer Protocols Wireless LANs

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

Computer Communication III

CMPE 257: Wireless and Mobile Networking

A Survey on Modified RTS/CTS Mechanism

CSMA/IC: A New Class of Collision free MAC Protocols for Ad Hoc Wireless Networks

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

P B 1-P B ARRIVE ATTEMPT RETRY 2 1-(1-P RF ) 2 1-(1-P RF ) 3 1-(1-P RF ) 4. Figure 1: The state transition diagram for FBR.

Collisions & Virtual collisions in IEEE networks

Mohammad Hossein Manshaei 1393

Wireless LANs. ITS 413 Internet Technologies and Applications

Unit 7 Media Access Control (MAC)

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

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

Local Area Networks NETW 901

A new MAC protocol for reducing effect of needless transmission deferment induced by missed RTS/CTS handshake

Computer Networks (Fall 2011) Homework 2

Mobile & Wireless Networking. Lecture 7: Wireless LAN

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols

A Backoff Algorithm for Improving Saturation Throughput in IEEE DCF

An Efficient Scheduling Scheme for High Speed IEEE WLANs

Wireless Local Area Network (IEEE )

Lecture 25: CSE 123: Computer Networks Alex C. Snoeren. HW4 due NOW

Reliable Multicast Scheme Based on Busy Signal in Wireless LANs

A Performance Analysis of IEEE Networks in the Presence of Hidden Stations

MAC. Fall Data Communications II 1

Implementing a Cooperative MAC Protocol for Wireless LANs

MAC in /20/06

ICE 1332/0715 Mobile Computing (Summer, 2008)

Lecture 24: CSE 123: Computer Networks Stefan Savage. HW4 due NOW

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

Performance Analysis for Channel Utilization in Wireless LAN

Dynamic Power Control MAC Protocol in Mobile Adhoc Networks

Hands-On Exercises: IEEE Standard

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

SENSOR-MAC CASE STUDY

Wireless Protocols. Training materials for wireless trainers

Simulation Analysis of IEEE Non-beacon Mode at Varying Data Rates

2 Related Work. 1 Introduction. 3 Background

Chapter 6 Wireless and Mobile Networks

Overview : Computer Networking. Spectrum Use Comments. Spectrum Allocation in US Link layer challenges and WiFi WiFi

Multiple Access Links and Protocols

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

Chapter 6 Medium Access Control Protocols and Local Area Networks

Performance anomaly of b

Figure.2. Hidden & Exposed node problem

Empirical Study of Mobility effect on IEEE MAC protocol for Mobile Ad- Hoc Networks

Mobile Communications Chapter 7: Wireless LANs

Lecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy

04/11/2011. Wireless LANs. CSE 3213 Fall November Overview

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

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

Delivering Voice over IEEE WLAN Networks

Performance Evaluation of Modified IEEE MAC for Multi-Channel Multi-Hop Ad Hoc Network *

Strengthening Unlicensed Band Wireless Backhaul

6.9 Summary. 11/20/2013 Wireless and Mobile Networks (SSL) 6-1. Characteristics of selected wireless link standards a, g point-to-point

Analysis of Throughput and Energy Efficiency in the IEEE Wireless Local Area Networks using Constant backoff Window Algorithm

CSCD 433 Network Programming Fall Lecture 7 Ethernet and Wireless

Outline. CS5984 Mobile Computing. IEEE 802 Architecture 1/7. IEEE 802 Architecture 2/7. IEEE 802 Architecture 3/7. Dr. Ayman Abdel-Hamid, CS5984

IEEE Technical Tutorial. Introduction. IEEE Architecture

Effect of Fragmentation in WLAN Systems with Interference Problems

Wireless Local Area Networks (WLANs) Part I

IEEE MAC Sublayer (Based on IEEE )

Wireless Local Area Networks. Networks: Wireless LANs 1

Data and Computer Communications. Chapter 13 Wireless LANs

CS698T Wireless Networks: Principles and Practice

MAC Protocols for VANETs

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS

The MAC layer in wireless networks

A New Full Duplex MAC Protocol to Solve the Asymmetric Transmission Time

Fu-Yi Hung ALL RIGHTS RESERVED

CMPE 257: Wireless and Mobile Networking

WLAN Performance Aspects

Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks

Title. Author(s)Nguyen, Thi Xuan My; Saivichit, Chaiyachet; Miyanaga. Issue Date Doc URL. Type. Note. File Information

Multi-rate Opportunistic Spectrum Access in Multi-hop Ad Hoc Networks

A Modified Medium Access Control Algorithm for Systems with Iterative Decoding

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

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols

Wireless LAN -Architecture

Mobile Communications Chapter 7: Wireless LANs

Embedded Internet and the Internet of Things WS 12/13

Department of Electrical and Computer Systems Engineering

ISSN: International Journal of Advanced Research in Computer Engineering & Technology Volume 1, Issue 5, July 2012

A Finite State Model for IEEE Wireless LAN MAC DCF

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

ICE 1332/0715 Mobile Computing (Summer, 2008)

Enhancing the DCF mechanism in noisy environment

Transcription:

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems pp. 941 946 DOI: 10.15439/2014F437 ACSIS, Vol. 2 Throughput Improvement by Adjusting RTS Transmission Range for W-LAN Ad Hoc Network Akihisa Matoba Graduate School of Informatics, Tokyo University of Information Sciences, 4-1 Onaridai, Wakaba-ku, Chiba, 265-8501 Japan Masaki Hanada Department of Informatics, Tokyo University of Information Sciences, 4-1 Onaridai, Wakaba-ku, Chiba, 265-8501 Japan Moo Wan Kim Department of Informatics, Tokyo University of Information Sciences, 4-1 Onaridai, Wakaba-ku, Chiba, 265-8501 Japan Abstract The W-LAN Ad Hoc network tends to cause problems called Hidden Node and Exposed Node. RTS/CTS mechanism has been introduced to mitigate Hidden Node and most of existing researches assume that RTS and CTS are sent at the same transmission range. This paper describes a new method to improve the network throughput by adjusting the RTS transmission range. The simulation result showed that the proposed method achieved higher throughput in some degree. T I. INTRODUCTION HE W-LAN Ad Hoc network tends to cause problems called Hidden Node and Exposed Node [1]. Fig.1 shows an example of Hidden Node and Exposed Node. In Fig.1, transmission range and receive range are assumed to be equal. Assuming a sender node and a receiver node, a Hidden Node is located near to the receiver node and can hear the transmission from the receiver node while it cannot hear the transmission from the sender node as it is far enough from the sender node. The Hidden Node and the sender node can send a frame respectively at the same moment and can cause a collision at the receiver node. An Exposed Node is located near the sender node and its transmission reaches to the sender node but cannot reach to the receiver node as it is far enough from the receiver node. The Exposed Node doesn t cause a collision at the receiver node when it sends a frame at the same moment when the sender node sends a frame. But due to carrier sense mechanism of IEEE802.11, the Exposed Node detects a transmission of the sender node and has it suspend the transmission. This may cause unnecessary transmission suspensions and degrade network performance [2]. RTS/CTS mechanism as shown in Fig. 2 has been introduced to mitigate Hidden Node since the first version of IEEE802.11 [3]. First a sender node does carrier sense. If channel is idle, it further waits DIFS (DCF Inter Frame Space) period and random back off period. Then it sends RTS (Request To Send) and any nodes which hear the RTS reserves air time during Fig.1 Example of Hidden Node and Exposed Node NAV (Network Allocation Vector) period. The receiver node receives RTS and sends back CTS (Clear To Send) after SIFS (Short Inter frame Space) period. CTS also have NAV and suspend transmission of nodes which hear the CTS until the receiver node sends ACK. Then the sender node sends a data frame after it receives CTS and the receiver node sends ACK after it receives the data frame. In this mechanism, Hidden Nodes around the receiver node can suspend transmissions by the CTS and the receiver node can avoid collisions to receive the data frame. But this mechanism creates Exposed Nodes around the sender node as they hear the RTS and suspend their transmission. In this paper a new RTS/CTS method to reduce the number of Exposed Nodes has been proposed. This method assigns different transmission range to RTS and CTS respectively to reduce the number of Exposed Nodes. Simulation results shows that the proposed method improves the entire network throughput compared to the standard RTS/CTS mechanism, and also has effect to equalize variation of throughput among each node. 978-83-60810-58-3/$25.00 c 2014, IEEE 941

942 PROCEEDINGS OF THE FEDCSIS. WARSAW, 2014 Fig. 2 Standard RTS/CTS Mechanism A. Related Work II. PROPOSED METHOD Various researches have been conducted to mitigate Exposed Node and Hidden Node [4]. The most of existing researches assume that RTS, CTS and Data frame are sent at the same data transmission rate and have the same radio coverage. This was true with the first version of IEEE802.11, but now Data frame is sent at multi rates (54Mbps with 11a/g at maximum) while control frames such as RTS/CTS remain the lowest basic rate (1Mbps with 11g, 6Mbps with 11a). There are some researches to consider multi transmission rate, but no researches assume different transmission rate to RTS and CTS. B. Basic Idea In our research we intentionally allocate different transmission rate to RTS and CTS in order to proactively control the radio coverage and mitigate effect of Exposed Node. We have redefined the objective of RTS only to provoke CTS. RTS needs to reach to receiver node but it doesn t need to reach to any other nodes. So the RTS should be sent at the maximum data rate as data frame. This strategy introduces risk to lose CTS and ACK at the sender node by collisions from surrounding nodes (Exposed Nodes). But we assume this risk is minimal as CTS and ACK have short length in comparison to data frame. Fig.3 shows the basic idea of our proposal. Here we define Sender Node as S, Receive Node as R, Hidden Node as H and Exposed nodes as Ei, Nj. Radius of RTS range and CTS range by standard method are defined as Rrts and Rcts. Radius of proposed higher transmission rate of RTS (i.e. RTS ) is defined R rts. As shown in Fig.3, higher transmission rate of RTS makes the RTS coverage range smaller than CTS and reduces Exposed Node. In order to avoid collision of data frame at the receiver node, CTS should be sent at lowest data rate to be heard by Hidden Node as many as possible. In case if RTS range is completely included in CTS range, there is no Exposed Node. The shaded area of Fig.3 contains the eliminated exposed nodes (i.e. Nj) by proposal. The following steps show the procedure of the proposal; Step1: S sends RTS to R with possible highest transmission rate. This is to minimize the RTS coverage range and to reduce the number of Ei. Step2: R receives RTS and sends back CTS with basic transmission rate. This is to ensure all potential hidden nodes to receive CTS and to suspend their transmission. Step3: S receives CTS and sends data frame to R with maximum transmission rate. If the RTS range is completely included in the CTS range, there is no exposed node. Step4: R receives data frame and sends back ACK with highest transmission rate. By the way above discussion, to reduce radio coverage is not applicable to CCA (Clear Channel Assessment). Any frames have PLCP preamble and header with 1Mbps, and the payload portion is in higher date rate (e.g. 54Mbps). The effect of CCA may need to be investigated further. A. Simulation Condition III. SIMULATION We have assumed Wireless LAN standard of 5GHz band, IEEE802.11a. The system parameter for the simulation is shown in Table 1.

MOOWAN KIM, MOO WAN KIM, MASAKI HANADA: THROUGHPUT IMPROVEMENT BY ADJUSTING RTS 943 Fig. 3 Basic Idea of Proposal In IEEE802.11a, 8 transmission rates are defined as 6Mbps, 9Mbps, 12Mbps, 18Mbps, 24Mbps, 36Mbps, 48Mbps and 54Mbps. For simplicity, in this simulation, RTS is sent at 18Mbps and CTS is sent at the minimum basic rate as 6Mbps. Data and ACK are sent at the same as RTS (i.e. 18Mbps). As the simulated network topology all nodes are located in a grid with 70m interval. Seven cases are assumed for grid size from 3x3 with 9 nodes to 15x15 with 255 nodes. Nodes can be randomly distributed, but in practical deployment distribution of nodes is often governed by artificial objects such as walls, furniture, partitions and structures of building and it follows geometric arrangement. So we assumed the grid distribution as the initial research stage. The 5x5 grid of nodes is shown in Fig.4. The node 13 is the sender node and receiver node is selected among node 8, 12, 14 and 18 at random. In Fig.4, node 14 is selected as the receiver node. TABLE 1. SYSTEM PARAMETERS FOR SIMULATION Frame Type Transmission Rate Range RTS 18Mbps 88m 1 hop (70m) CTS 6Mbps 140m 2 hops (140m) Data 18Mbps 88m 1 hop (70m) ACK 18Mbps 88m 1 hop (70m) Load 3Mbps per node with exponential distribution Data Size 1,000 bytes Distance Nodes are located at 70m interval in a grid. Other DIFS=34μs, SIFS=16μs and Slot time=9μs. Other parameters follow 802.11a standard.

944 PROCEEDINGS OF THE FEDCSIS. WARSAW, 2014 Fig. 4 25 Nodes (5 x 5) Example An RTS with standard method reaches up to a node at two hop distance and totally 12 nodes excluding sender node are in transmission range. An RTS with proposed method reaches only to nodes at one hop distance and totally 4 nodes are in transmission range. As the CTS transmission range is two hops, RTS range of the proposed method is completely included in CTS range. In Fig.4, black nodes are in the CTS transmission range and white nodes have no influences with the transmission from note 13 to node 14. Gray nodes would be Exposed Nodes if standard method is applied. As you see in Fig.4, in case of standard method with 5x5 grid, gray nodes (i.e. Exposed Nodes) are very often located at the boundary of the network. It is anticipated that boundary condition would affect throughput improvement ratio especially to small size grid. Therefore we have simulated up to 15x15 grid of 255 nodes. B. Simulation Result As shown in Fig.5, throughput per node goes lower as the size of grid goes bigger for both standard and proposed method. The simulation result showed that the proposed method achieved higher throughput per node in all grid sizes. Fig.5 Average Throughput per Node

MOOWAN KIM, MOO WAN KIM, MASAKI HANADA: THROUGHPUT IMPROVEMENT BY ADJUSTING RTS 945 Fig.6 Average Number of RTS Transmission Fig.6 shows average number of RTS transmission per data frame for each grid size. The number greater than 1.0 imply the occurrence of RTS retransmission. With standard method, 11% to 13% of RTS were retransmitted due to collisions. With the proposed method, only 5% to 6% of RTS were retransmitted. Fig. 7 shows the average throughput dispersion. The proposed method has smaller dispersion than standard method, and this tendency is more ostensible with smaller grid size. IV. CONCLUSION In this paper we have proposed the new method to adjust the transmitting rate of RTS to the same as data frame in order to control its transmission range proactively. Fig.7 Dispersion of Throughput

946 PROCEEDINGS OF THE FEDCSIS. WARSAW, 2014 We have showed by simulation that the proposed method can improve throughput. We need to investigate further to validate effect of proposed method and to find method of selecting appropriate parameters as well as theoretical explanation. REFERENCES [1] K. Xu, M. Gerla, and S. Bae, "How effective is the IEEE802.11 RTS/CTS Handshake in Ad Hoc Network?" Proc. IEEE Globe Com 02, pp.72-76,nov. 2002. [2] S. Ray, J. B. Carruthers. and D. Starobinski, RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs, WCNC 2003 IEEE, vol. 3, pp.1516-1521, March 2003 [3] IEEE-SA Standards board, Part11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Std 802.11-2012 [4] K. Nishide, H. Kubo, and R. Shinkuma, Detecting Hidden and Exposed Terminal Problems in Densely Deployed Wireless Networks, IEEE Transactions on Wireless Communications, vol. 11, no. 11, pp.3841-3849, November 2011