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

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

A Survey on Modified RTS/CTS Mechanism

/$10.00 (c) 1998 IEEE

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

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

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

IEEE Medium Access Control. Medium Access Control

/99/$10.00 (c) 1999 IEEE

Wireless Medium Access Control Protocols

Hidden Problems with the Hidden Node Problem

Directional Antenna based Time Division Scheduling in Wireless Ad hoc Networks

CSE 461: Wireless Networks

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

Medium Access Control (MAC) Protocols for Ad hoc Wireless Networks -IV

Review of Medium Access Control protocol for MANET

Collisions & Virtual collisions in IEEE networks

Dynamic Power Control MAC Protocol in Mobile Adhoc Networks

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

UAMAC: Unidirectional-Link Aware MAC Protocol for Heterogeneous Ad Hoc Networks

ICE 1332/0715 Mobile Computing (Summer, 2008)

Simulation Based Analysis of the Impact of Hidden Terminal to the TCP Performance in Mobile Ad Hoc Networks

Concurrent-MAC: Increasing Concurrent Transmissions in Dense Wireless LANs

SENSOR-MAC CASE STUDY

Media Access Control in Ad Hoc Networks

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

Wireless MACs: MACAW/802.11

Effectiveness of DSDV Protocol Under Hidden Node Environment

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

MAC Protocols: A Review

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

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

Coordinated Dynamic Physical Carrier Sensing based on Local Optimization in Wireless Ad hoc Networks

EVALUATING ADJACENT CHANNEL INTERFERENCE IN IEEE NETWORKS

Mohamed Khedr.

On exploiting spatial reuse in wireless ad hoc networks

Performance Analysis for Channel Utilization in Wireless LAN

Wireless Sensor Networks 8th Lecture

A Jamming-Based MAC Protocol for Wireless Multihop Ad Hoc Networks

Performance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks

Computer Communication III

Addressing Asymmetric Link in Wireless Mesh Networks

A Jamming-Based MAC Protocol to Improve the. Performance of Wireless Multihop Ad Hoc. Networks

Implementation of an Adaptive MAC Protocol in WSN using Network Simulator-2

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang

A Channel Accessing Scheme with Joint Detection Receivers in Ad Hoc Networks

Lecture 16: QoS and "

PNC BASED DISTRIBUTED MAC PROTOCOL IN WIRELESS NETWORKS

Cellular Learning Automata-based Channel Assignment Algorithms in Mobile Ad Hoc Network

MAC protocols. Lecturer: Dmitri A. Moltchanov

Wireless Local Area Networks (WLANs)) and Wireless Sensor Networks (WSNs) Computer Networks: Wireless Networks 1

New CDMA-Based MAC Protocol for Ad Hoc Networks

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

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

ECS: an Enhanced Carrier Sensing Mechanism for Wireless Ad-hoc Networks 1

An Chan and Soung Chang Liew Department of Information Engineering, The Chinese University of Hong Kong {achan5,

Fu-Yi Hung ALL RIGHTS RESERVED

AN ANALYSIS OF THE MODIFIED BACKOFF MECHANISM FOR IEEE NETWORKS

Design and Implementation of IEEE Based Dual Media Access Control for MANETs Amit Kumar Department of Computer Science Engineering

Improving IEEE RTS/CTS Handshake in Wireless. Ad Hoc Networks Considering Large Interference Range

Performance evaluation of Cooperative MAC and ZRP in Cooperative Communication Networking Environment

Wireless Local Area Networks. Networks: Wireless LANs 1

Strengthening Unlicensed Band Wireless Backhaul

Local Area Networks NETW 901

15-441: Computer Networking. Wireless Networking

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

Ethernet. Lecture 6. Outline. Ethernet - Physical Properties. Ethernet - Physical Properties. Ethernet

Distributed power control over multiple channels for ad hoc wireless networks

Reservation Packet Medium Access Control for Wireless Sensor Networks

TCP and UDP Fairness in Vehicular Ad hoc Networks

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks

Delayed ACK Approach for TCP Performance Improvement for Ad Hoc Networks Using Chain Topology

Dynamic Deferred Acknowledgment Mechanism for Improving the Performance of TCP in Multi-Hop Wireless Networks

An Efficient Scheduling Scheme for High Speed IEEE WLANs

The MAC layer in wireless networks

Performance Evaluation of Failed Link Detection in Mobile Ad Hoc Networks

Tarek Sheltami. CCSE COE 3/8/2008 1

A Multi-channel MAC Protocol for Ad Hoc Wireless Networks

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

original standard a transmission at 5 GHz bit rate 54 Mbit/s b support for 5.5 and 11 Mbit/s e QoS

An Enhanced Transmission Power Controlled MAC Protocol for Ad Hoc Networks

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

Appointed BrOadcast (ABO): Reducing Routing Overhead in. IEEE Mobile Ad Hoc Networks

Protecting Mobile Ad Hoc Networks from Spurious CTS Attacks 'Carrier Sensing based Deferral Mechanism'

Data Communications. Data Link Layer Protocols Wireless LANs

Enhanced Topology Control Interference Aware Channel Assignment Algorithm. Nazia Ahmad, B. Tech.

Wireless LANs. ITS 413 Internet Technologies and Applications

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

CMPE 257: Wireless and Mobile Networking

Research Article Simulation of Efficiency in Mobile Ad Hoc Networks using OMNeT++

Collision Avoidance through Multiple RTS/CTS Dialogue in RFID System

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

Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer. Computer Networks: Wireless LANs

Collision Free and Energy Efficient MAC protocol for Wireless Networks

MAC LAYER. Murat Demirbas SUNY Buffalo

A Dynamic Channel Allocation Mechanism for IEEE Networks

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

Chapter 12 Multiple Access 12.1

Revealing the problems with medium access control protocol in multi hop wireless ad hoc networks

Figure.2. Hidden & Exposed node problem

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)

Transcription:

247 Ad Hoc WLAN Throughput Improvement by Reduction of RTS Range Emilia Weyulua, Taro Iwabuchib, Misu Takeshic, Masaki Hanadad, Moo Wan Kime acde b Graduate School of Informatics, Tokyo University of Information Sciences Department of Information Systems, Faculty of Informatics, Tokyo University of Information Sciences Chiba, Japan aeweyulu@gmail.com, bj13050ti@edu.tuis.ac.jp, cs11118tm@gmail.com, dmhanada@rsch.tuis.ac.jp, emwkim@rsch.tuis.ac.jp Abstract In this paper, we evaluate a novel method for reducing exposed nodes in IEEE 802.11 ad hoc WLANs using asymmetric transmission ranges for RTS and CTS frames. The RTS/CTS handshake communication control mechanism used in IEEE 802.11 networks solves the hidden node problem but causes the exposed node problem. Our proposed method uses asymmetric transmission ranges for RTS and CTS control frames to solve the exposed node problem. Simulations using the Network Simulator 2 (NS-2) show that asymmetric transmission of RTS and CTS frames improves overall network throughput compared to the standard RTS/CTS method. Keywords IEEE 802.11, ad hoc, RTS, CTS, transmission range, asymmetric, NS-2, AODV I. INTRODUCTION With the Internet of Things (IoT) /Cyber Physical Systems (CPS) soon coming into existence and the imminent deployment of 5G mobile technologies, the use of wireless networks is set to increase rapidly [1] [2]. Different types of devices will be connecting to each other wirelessly in ad hoc network setups. Ad hoc networks consist of wireless nodes/devices that build automatic connections to other nodes/devices with no centralized infrastructure. The IEEE 802.11 wireless local area network (WLAN) technology is the most used wireless network standard but its communication control is not a completed mechanism [3]. Techniques for dealing with interference in IEEE 802.11 ad hoc networks still need improvement and should be optimized to support increasing required throughput while utilizing limited radio resource efficiently [4]. IEEE 802.11 multi-hop ad hoc networks especially suffer from interference between nodes which substantially limits the reliability and the throughput of these networks [4]. The media access control (MAC) layer in IEEE 802.11 networks controls access to the shared wireless medium using two techniques: Physical Carrier Sensing and RTS/CTS (Request to Send / Clear to Send) handshake (Virtual Carrier Sensing) [5]. However, both Physical Carrier Sensing and the RTS/CTS method introduce additional problems to the wireless medium in that they suffer from the hidden node problem and the exposed node problem respectively. A. Hidden Node Problem In wireless networks, the hidden node problem occurs when a node is visible from one intermediate wireless node, but not from other nodes communicating with that intermediate node. In Fig.1 below, B is the intermediate node. Node A can communicate with intermediate node B and node C can also communicate with intermediate node B. However, nodes A and C cannot sense each other since they are outside each other s communication ranges and this leads to difficulties in the media access control layer. If node A and node C both start transmitting to intermediate node B at the same time, this causes packet collisions and loss at intermediate node B. Figure 1: The Hidden node problem

248 B. Exposed Node Problem Exposed nodes are wireless nodes that are prevented from communicating with other nodes in their transmission ranges because they are close to a sending node and overhear the RTS frame [5]. Fig. 2 below explains the exposed node problem: Figure 2: The Exposed node problem Exposed nodes in the network decrease network performance because they have to hold their transmissions for the NAV (Network Allocation Vector) period defined in the RTS frame [3]. This leads to overall network throughput degradation. Since ad hoc nodes do not rely on fixed, centralized infrastructure, they are increasingly used in several networking applications such as in military, rescue operations, meetings and conventions [4]. On the other hand, the RTS/CTS handshake has been shown to be especially detrimental to network throughput performance in large IEEE 802.11 based wireless ad-hoc networks [6]. Thus methods of improving the effectiveness of the RTS/CTS handshake are necessary. The rest of this paper is organized as follows: Section II describes related literature; Section III describes the Asymmetric RTS/CTS idea; Section IV the use of Network Simulator-2 (NS-2) simulations and Section V discusses the simulation results. Section VI concludes the paper. abovementioned into consideration during our simulations. Other methods have been proposed in literature to solve the exposed node problem such as that described in [6]. The method called Selective Disregard of NAVs (SDN) selectively ignores certain physical carrier sense and NAVs. This method needs additional functionalities to be implemented in all nodes and lacks compatibility with the IEEE standard. MAC protocols based on Multiple Access with Collision Avoidance (MACA) proposed in [7] that exploit control gaps between the RTS/CTS exchange and the subsequent DATA/ACK have also been proposed. Another method that effectively solves the hidden and the exposed node problems is the Dual Busy Tone Multiple Access (DBTMA) method described in [8]. DBTMA uses two out-of-band busy tones to protect the RTS packets and the DATA packets from interfering stations. This protocol however assumes separate channels or data streams for tones and data, our method only assumes a single channel. III. ASYMMETRIC RTS/CTS A. Overview The basic idea of Asymmetric RTS/CTS is to have different transmission ranges for RTS and CTS frames by simulating the transmission range of RTS frames to be less than that of CTS frames. Reducing the transmission range of RTS frames means we eliminate some of the nodes that overhear the RTS frame from the sending node thereby reducing the total number of exposed nodes in the network. When the RTS range is completely included in the CTS range, there are no longer exposed nodes. Fig. 3 shows the concept of our proposed method. II. RELATED WORKS Our first research of the proposed method was reported in [3]. However, the simulations in [3] were limited to evaluating the basic performance of the asymmetric RTS/CTS idea on a simple MAC layer setup and do not take into consideration other network conditions such as random distribution of nodes and mobility. Our research aims to extend the performance of this idea by taking the

249 functions of receiving and sending RTS and CTS packets are defined. The newrtsthresh_ variable was defined in function recvrts under class Mac802_11 (mac-802_11.cc). The recvrts function checks for a received RTS packet's power level and compares it to the newrtsthresh_ variable we set in the tcl simulation file to determine whether the RTS packet being received should be discarded or not. Figure 3: Asymmetric RTS/CTS B. Grid Topology Simulation To start off the simulation, we simulate grid topologies to reflect real world environments where RTS frames do not need to have such a wide deployments of wireless nodes are often governed transmission range as they only need to reach the by artificial objects such as walls, furniture and receiving node in order to provoke a CTS response building structures, and as such follow a geometric [3]. Thus if the transmission range of RTS is set to arrangement [3]. We assumed an environment the minimum distance, only reaching the receiving where each node can communicate with its adjacent node, this is enough to provoke CTS from the nodes using a set transmission range. The distance receiver node. between nodes was set to an interval of. CTS frames on the other hand should reach all Simulations for grid topologies ranging from 3x3 (9) possible nodes that may cause collisions at the nodes to 15x15 (225) nodes were evaluated. To receiving node. Hence CTS frames are assigned a simulate the Standard RTS/CTS method, we set larger transmission range so that Data frame both transmission ranges for RTS frames and CTS reception at the receiving node is protected. Based frames to. For the Asymmetric RTS/CTS on this strategy, the transmission ranges for the method, we set transmission range for RTS packets RTS and CTS frames is thus asymmetric. to and CTS packets to. Random communication time and selection of receiver nodes IV. NS-2 SIMULATION was used. B. Effect of Adjusting Transmission Range A. Overview To test the performance of the proposed asymmetric RTS/CTS idea, we simulate different wireless topology scenarios using NS-2. NS-2 is an open-source; event-driven simulator designed specifically for research in computer communication networks [9]. Having been under constant enhancement for years, NS-2 contains modules for numerous network components such as routing, transport layer protocols and applications; and it has become the most widely used open source network simulator. In NS-2, the transmission range of a packet is determined by the power such a packet is transmitted with from the sending node [9]. To reduce the transmission range for RTS frames, we defined a RTS power threshold variable, newrtsthresh_, to add to the MAC layer component of NS-2. This is where the MAC control C. Random Topology Simulation To simulate the randomly distributed node topology, we assume that each node can communicate with at least one neighbouring node within a certain transmission range. Once again, the distance between nodes was set to an interval of. RTS and CTS frames were set to for the Standard method and for the Asymmetric method, to and to respectively. After the RTS/CTS exchange is complete, the Data packet is routed to the destination node using the AODV routing protocol [10]. Table 1 below presents the simulation parameters and conditions:

250 TABLE 1. SIMULATION PARAMETERS AND CONDITIONS Frame Type RTS CTS Data ACK IEEE 802.11b Grid Topology Transmission range (Distance) Standard Asymmetric Other parameters RTS threshold Data packet size Propagation model Routing protocol 1000 bytes 3000 bytes TwoRayGround AODV Simulation conditions Simulation time Simulation frequency Comm. time between nodes Figure 4: Grid topology throughput results (225) Fig. 5 below show random distribution results for 20 nodes: 60 seconds x500 Random V. RESULTS AND DISCUSSIONS In this section, we analyse the simulation results from the grid topologies and the random distribution topology by looking at network throughput and then performing a statistical analysis. Overall, the simulations showed that the proposed Asymmetric RTS/CTS method improves network throughput over the Standard RTS/CTS method. Figure 5: Random distribution throughput results Due to the increased presence of exposed and hidden nodes in the random distribution topology, A. Throughput Analysis the difference in throughput between the Standard Here we show the throughput comparison RTS/CTS method and the Asymmetric RTS/CTS between the Standard RTS/CTS and the proposed method is not as pronounced as in the grid topology Asymmetric RTS/CTS methods. Fig. 4 below setup; however Asymmetric RTS/CTS still shows the throughput results for a 15x15 grid performs better. topology (225 nodes). We can clearly see that the Asymmetric RTS/CTS method has better network B. Statistical Analysis throughput than the Standard RTS/CTS method. For the statistical analysis, we use the Standard We attribute this to the elimination of exposed Error [11] and the paired T-Test [12] to confirm nodes in the network. that the difference in mean throughput between the Standard RTS/CTS and the Asymmetric RTS/CTS is due to the elimination of exposed nodes and not due to random chance. Fig. 6 below shows the standard error for the mean for all groups of grid topology nodes at a 5% significance level. Since the error bars do not overlap, we can assume that there is less than a 5% chance that the throughput data from the simulations misrepresents the true difference between the two method s results.

251 frames in topologies distributed nodes. of mobile, randomly ACKNOWLEDGMENT The authors would like to thank Dr Akihisa Matoba for his assistance with this research. REFERENCES [1] [2] Figure 6: Standard error of the mean The calculated P-Value from the Paired T-Test was less than 0.05 (i.e. P-Value < 0.05) for all topologies. This implies statistical significance and we can say with 95% confident that the difference in the throughput results between the Standard RTS/CTS and Asymmetric RTS/CTS is due to the elimination of exposed nodes [3] [4] [5] [6] [7] VI. CONCLUSIONS In this paper, we evaluate a method of using asymmetric transmission ranges for RTS and CTS frames for the purposes of reducing exposed nodes in ad hoc WLANs. Simulation results show that the proposed Asymmetric RTS/CTS method has better overall network throughput than the Standard RTS/CTS method. Future work will look at changing the transmission range of RTS and CTS [8] [9] [10] [11] [12] E. Starkloff, 5G: The Internet for Everyone and Everything. [Online]. Available: http://www.ni.com/pdf/company/en/trend_watch_5g.pdf M. Törngren, Cyber-Physical Systems: Characteristics, Trends, Opportunities and Challenges, ser. Lecture Notes CPS summer school. Stockholm, Sweden: 2015. A. Matoba, M. Hanada, H. Kanemitsu, and M. W. Kim, Asymmetric RTS/CTS for Exposed Node Reduction in IEEE 802.11 Ad Hoc Networks, JCSE, Vol. 8, No. 2, p107-118. Sept.2013. A. Jayasuriya, S. Perreau, A. Dadej, S. Gordon, Hidden vs. exposed terminal problem in ad hoc networks, in: Proc. of the Australian Telecommunication Networks and Applications Conference, Sydney, Australia, 2004. K. Xu, M.Gerla, and S. Bae, Effectiveness of RTS/CTS handshake in IEEE 802.11 based ad hoc networks, Ad Hoc Networks Journal, Elsevier, vol. 1, no. 1, pp. 107 123, Jul. 2003. L. Jiang, S. C. Liew, Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks, IEEE Transactions on Mobile Computing, Vol. 7, No. 1, pp. 34-49, Jan. 2008. P. Karn, MACA A new channel access method for packet radio, in ARRL/CRRL Amateur Radio 9th Computer Networking Conference, 1990, pp. 134-140. Z. J. Haas and J. Deng, Dual busy tone multiple access (DBTMA)-a multiple access control scheme for ad hoc networks, Communications, IEEE Transactions on, vol. 50, no. 6, pp. 975-985, 2002. T. Issariyakul and E. Hossain, Introduction to network simulator ns2, Springer, Nov. 2008. B. Awerbuch and A. Mishra, Ad hoc On Demand Distance Vector (AODV) routing protocol, Lecture Notes: CS: 647 Advanced Topics in Wireless Networks, Department of Computer science, Johns Hopkins. J. L. Hintze, NCSS Statistical System, Kaysville, Utah 2007 Rosie Shier, Statistics: Paired t-tests. [Online]. Available: http://www.statstutor.ac.uk/resources/uploaded/paired-t-test.pdf. Emilia Weyulu and Misu Takeshi are students with the Graduate school of Informatics at the Tokyo University of Information Sciences in Chiba, Japan. Taro Iwabuchi is an undergraduate student with the Department of Information Systems in the faculty of Informatics school at the Tokyo University of Information Sciences in Chiba, Japan. Masaki Hanada and Moo Wan Kim are professors with the Graduate school of Informatics at the Tokyo University of Information Sciences in Chiba, Japan.