Medium Access Methods. Lecture 9

Similar documents
Local Area Networks NETW 901

DOPPLER SHIFT. Thus, the frequency of the received signal is

6.1 Multiple Access Communications

ECE 333: Introduction to Communication Networks Fall Lecture 15: Medium Access Control III

Multiple Access CHAPTER 12. Solutions to Review Questions and Exercises. Review Questions

Lecture on Sensor Networks

Lecture 8: Media Access Control. CSE 123: Computer Networks Stefan Savage

Outline. EEC-484/584 Computer Networks. Homework #1. Homework #1. Lecture 8. Wenbing Zhao Homework #1 Review

Mobile Communications

COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section B

Multiple Access Methods

Lecture 8: Media Access Control

Chapter 2 Overview. Duplexing, Multiple Access - 1 -

Medium Access Control

Department of Computer Science and Engineering. CSE 3213: Computer Networks I (Fall 2009) Instructor: N. Vlajic Date: Dec 11, 2009.

Medium Access Control. Wireless Networks: Guevara Noubir. Slides adapted from Mobile Communications by J. Schiller

ECT-215 Homework #1 Solution Set Chapter 14 Problems 1-29

06/02/2006. Sharing the Medium. Peter Rounce Room Notes Courtesy of Graham Knight P.A.

Fine-grained Channel Access in Wireless LAN. Cristian Petrescu Arvind Jadoo UCL Computer Science 20 th March 2012

1. Introduction 1.2 Medium Access Control. Prof. JP Hubaux

TSIN01 Information Networks Lecture 9

Multiple Access (3) Required reading: Garcia 6.3, 6.4.1, CSE 3213, Fall 2010 Instructor: N. Vlajic

Mobile Computing. Chapter 3: Medium Access Control

PULSE: A MAC Protocol for RFID Networks

Computer Networks. Week 03 Founda(on Communica(on Concepts. College of Information Science and Engineering Ritsumeikan University

Cellular systems 02/10/06

FPGA-BASED DESIGN AND IMPLEMENTATION OF THREE-PRIORITY PERSISTENT CSMA PROTOCOL

ICT 5305 Mobile Communications. Lecture - 4 April Dr. Hossen Asiful Mustafa

Ultra-Low Duty Cycle MAC with Scheduled Channel Polling

Medium Access Control Protocol for WBANS

ALERT2 TDMA Manager. User s Reference. VERSION 4.0 November =AT Maintenance Report Understanding ALERT2 TDMA Terminology

COM-405 Mobile Networks. Module A (Part A2) Introduction

INTRODUCTION TO WIRELESS SENSOR NETWORKS. CHAPTER 3: RADIO COMMUNICATIONS Anna Förster

DiCa: Distributed Tag Access with Collision-Avoidance among Mobile RFID Readers

Achieving Network Consistency. Octav Chipara

Politecnico di Milano Advanced Network Technologies Laboratory. Beyond Standard MAC Sublayer

Wireless Communication

Exercise Data Networks

Chapter 3 : Media Access. Mobile Communications. Collision avoidance, MACA

Multiple access techniques

Department of Computer Science and Engineering. CSE 3213: Communication Networks (Fall 2015) Instructor: N. Vlajic Date: Dec 13, 2015

Analysis of Collided Signal Waveform on the Long Transmission Line of UART-CSMA/CD Control Network

CS 438 Communication Networks Spring 2014 Homework 2 Due Date: February 19

Wireless Communications Lecture 4: Multiple Access Technologies

Network Management System for Telecommunication and Internet Application

Figure 8.1 CSMA/CD worst-case collision detection.

Channel partitioning protocols

Wireless Transmission & Media Access

Contrail TDMA Manager User s Reference

Medium Access Control via Nearest-Neighbor Interactions for Regular Wireless Networks


OSI Reference Model. Application Layer. Presentation Layer. Session Layer. Chapter 4: Application Protocols. Transport Layer.

A feasibility study of CDMA technology for ATC. Summary

Increasing Broadcast Reliability for Vehicular Ad Hoc Networks. Nathan Balon and Jinhua Guo University of Michigan - Dearborn

Simple, Optimal, Fast, and Robust Wireless Random Medium Access Control

Visible Light Communication (VLC) Low-Complexity Visible Light Networking with LED-to-LED Communication. Application: Toy-to-Toy Communication

EUROPEAN ETS TELECOMMUNICATION July 1997 STANDARD

Analyzing Split Channel Medium Access Control Schemes

Scheduling of Event-Triggered Controllers on a Shared Network Anton Cervin and Toivo Henningsson

MULTIPLE CHOICE QUESTIONS

Deployment Design of Wireless Sensor Network for Simple Multi-Point Surveillance of a Moving Target

Research Article Dynamic Cognitive Self-Organized TDMA for Medium Access Control in Real-Time Vehicle to Vehicle Communications

Lecture 23: Media Access Control. CSE 123: Computer Networks Alex C. Snoeren

Half-Duplex Spread Spectrum Networks

TIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS

Wireless Intro : Computer Networking. Wireless Challenges. Overview

Efficient Method of Secondary Users Selection Using Dynamic Priority Scheduling

AN EFFICIENT MULTIACCESS PROTOCOL FOR WIRELESS NETWORKS. Benjamin W. Wah and Xiao Su

LTE-Unlicensed. Sreekanth Dama, Dr. Kiran Kuchi, Dr. Abhinav Kumar IIT Hyderabad

ECS455: Chapter 4 Multiple Access

Multiple Access System

Mobile Computing Unit 1 WIRELESS COMMUNICATION FUNDAMENTALS

Advanced Computer Networks. Wireless Networks Fundamentals

Lecture 7: Centralized MAC protocols. Mythili Vutukuru CS 653 Spring 2014 Jan 27, Monday

Calculation of the Spatial Reservation Area for the RTS/CTS Multiple Access Scheme

Medium Access Schemes

Analysis of Random Access Protocol and Channel Allocation Schemes for Service Differentiation in Cellular Networks

Self-Stabilizing Deterministic TDMA for Sensor Networks

CS434/534: Topics in Networked (Networking) Systems

On the Effects of Node Density and Duty Cycle on Energy Efficiency in Underwater Networks

Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs)

IN wireless communication networks, Medium Access Control

Multiple Access Schemes

Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks

D3.2 MAC layer mechanisms and adaptations for Hybrid Terrestrial-Satellite Backhauling

Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs)

Fiber Distributed Data Interface

StarPlus Hybrid Approach to Avoid and Reduce the Impact of Interference in Congested Unlicensed Radio Bands

Spread Spectrum Communications and Jamming Prof. Debarati Sen G S Sanyal School of Telecommunications Indian Institute of Technology, Kharagpur

A MAC Interaction Aware Routing Metric in Wireless Networks

Experimental Studies and Modeling of. An Information Embedded Power System

Lecture 5 Transmission. Physical and Datalink Layers: 3 Lectures

IEEE P Wireless LANs IEEE802.11h Dynamic Frequency Selection (DFS) in an Independent BSS (IBSS) Abstract

Canova Tech The Art of Silicon Sculpting

WUR-MAC: Energy efficient Wakeup Receiver based MAC Protocol

Cognitive Wireless Network : Computer Networking. Overview. Cognitive Wireless Networks

CS445: Modeling Complex Systems

Jinbao Li, Desheng Zhang, Longjiang Guo, Shouling Ji, Yingshu Li. Heilongjiang University Georgia State University

What LTE parameters need to be Dimensioned and Optimized

Mobile Communications: Technology and QoS

Transcription:

Medium Access Methods Lecture 9

Medium Access Control Medium Access Control (MAC) is the method that defines a procedure a station should follow when it needs to send a frame or frames. The use of regulated method ensure that there is no conflict among the stations. The problem of controlling the access to the medium is similar to the rules of speaking in an assembly. Rules are established to ensure that two people do not speak at the same time 2

Medium Access Methods MAC can be divided into two broad categories: Random access and controlled access. See the figure below

Random Access With Random Access or contention methods no station is superior to another station and non of them are assign the control of others. No schedule time for a station to transmit -transmission is random among the stations. No rule that specifies what station should send next stations complete with each other to access the medium hence contention methods Each station that has data to send uses the procedure defined in the protocol in relation to the state of the medium (idle/busy) to make a decision on whether or not to send 4

Random Access The procedure that station use to access the medium with Random Access method must answer the following Questions: When should the station access the medium? What should the station do when the medium is busy? How should the station determine the success or failure of the transmission? What should the station do if there is an access conflict? 5

Evolution of Random Access Methods

The first method, known as ALOHA, used a very simple procedure called Multiple Access (MA). This Method was improved with addition of procedure that forces the station to sense the medium before transmitting. This was called Carrier Sense Multiple Access (CSMA). This method was later evolved into two parallel methods: CSMA/CD and CSMA/CA CSMA/CD tries to show what the station should do if a collision is detected CSMA/CA tries to avoid the collision

Random Access Methods Multiple Access (MA) Carrier Sense with Multiple Access (CSMA) Carrier Sense with Multiple Access with Collision Detection (CSMA/CD) Carrier Sense with Multiple Access with Collision Avoidance (CSMA/CA)

Carrier Sense Multiple Access (CSMA) The chance of collision can be reduced if a station sense the medium before trying to use it. CSMA requires that each station first listen to the medium (or check the state of the medium) before sending CSMA is based on the principle sense before transmit or Listen before talk CSMA can reduce the possibility of collision, but can not eliminate it 9

Collision in CSMA

Vulnerable Time: Vulnerable Time: Vulnerable time for CSMA is the propagation time,. This is the time needed for a signal to propagate Tprop from one end of the medium to the other. When a station sends a frame, and any other station tries to send a frame during Vulnerable time, a collision will result. 11

Persistence Strategies Persistence Strategy: define what a station should do if, when sensing the medium, it finds it busy. Two strategies:

Non-persistent Method Non persistence Method: In the non-persistence method, a station with a frame to send, it senses the medium: If the medium is idle, it sends immediately If the medium is not idle it waits a random time and then sense the medium again

1-Persistent Approach In persistence strategy, a station senses the medium. If the medium is idle, it sends the frame. 1-persistence: In this method, after the station finds the medium idle, it sends its frame immediately (with a probability of 1). 1-persistence method increases the chances of collision as two or more station may find the medium idle and send their frames immediately.

P-Persistent Approach In P-Persistence method, after the station finds the medium idle, it may or may not send It sends with probability p and refrain from sending with probability 1-p The station generates the random number between 1 and 100. If the random number is less than 20, the station will send; otherwise the station refrain from sending. The station waits one time slot before sensing the medium again. P-Persistence: reduces the chances of collision and improves the efficiency

Example of P-Persistent For example, if p is 0.2, it means that each station, after sensing an idle line, sends with a probability of 0.2 (20 percent of the time) and refrain from sending with a probability of 0.8 (80 percent of the time)

Carrier Sense Multiple Access with Collision Detection (CSMA/CD) CSMA method does not define what should be done if a collision occurs. That is why it was never implemented. CSMA/CD, a modified version of CSMA, adds a procedure to handle the collision Back off time is between 0 and 2Nx(maximum propagation time) 17

Collision If the collision occurs, the frame should be sent again. To reduce the probability of collision the second time, the station should wait- is should back-off. It should wait a little the first time, more is the collision occur again, much more if it happens a third time, and so on

Back-off exponential Method In the exponential back-off method, the station waits an amount of time between 0 and 2 N x (Maximum propagation time) N: number of attempted transmission It waits between 0 and 2 x (Maximum propagation time) for the first time. Between 0 and 2 2 x (Maximum propagation time) for the second time

CSMA/CD Procedure

Jam Signal The jam signal is intended to inform other stations of the situation s collision. It alerts them that collision has occurred. The maximum value of the back-off parameter is 15

Controlled Access In controlled access method, the stations consult each other to find which station has the right to send. The station can not send unless it has been authorized by other stations. 22

Token Passing Network In the Token passing method, a station is authorized to send data when it receives a special frame called a token.

Token Passing When no data is being sent, a token circulate around the ring. If the station needs to send data, it waits for the token. The station capture the token, sends one or more frames (as long as it has some frames to send or the time allocated hasn t expired). It releases the token to be used by the successor station 24

Token Passing Procedure