Slotted Nonpersistent CSMA Timeline divided into time slots, called mini slot, with length equal to maximum propagation delay  Before attempting transmission,

Slides:



Advertisements
Similar presentations
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 16 – High Speed LANs.
Advertisements

Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
The ALOHA Protocol “Free for all”: whenever station has a frame to send, it does so. –Station listens for maximum RTT for an ACK. –If no ACK after a specified.
EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
Ethernet – CSMA/CD Review
Fundamentals of Computer Networks ECE 478/578
Lecture 9: Multiple Access Protocols
The Data Link Layer introduction point-to-point data link protocols
Communication Networks Lecture 5 NETW 501-L5: NETW 501-L5: Medium Access Control Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204,
1 K. Salah Module 4.2: Media Access Control The Media Access Control (MAC) sublayer –Random Access (CSMA), IEEE –Token Passing, IEEE Ch 13-
1 Pertemuan 13 Teknik Akses Jaringan - Random Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Wireless & Mobile Networking: Multiple Radio Access Azizol Bin Abdullah (A2.04) Rujukan: Text Book Chapter 6.
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.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 17 Introduction to Computer Networks.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Teknik Akses Jaringan Carrier Sense Pertemuan 12 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
Studying Local Area Networks Via Media Access Control (MAC) SubLayer
ECE358: Computer Networks Spring 2012
Link-layer EE122 Discussion 10/14/2011. MAC Addresses Link-layer deals with MAC addresses – 48-bit addresses, flat name space – E.g., 88-9F-FA-F
Networks: Local Area Networks1 LANs Studying Local Area Networks Via Media Access Control (MAC) SubLayer.
Computer Networks: Local Area Networks 1 LANs Studying Local Area Networks via the Media Access Control (MAC) SubLayer.
Semester EEE449 Computer Networks The Data Link Layer Part 2: Media Access Control En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex,
Lecture 16 Random Access protocols r A node transmits at random at full channel data rate R. r If two or more nodes “collide”, they retransmit at random.
Shashank Srivastava Motilal Nehru National Institute Of Technology, Allahabad Medium Access Control.
Chap 4 Multiaccess Communication (Part 1)
1 ECE453 – Introduction to Computer Networks Lecture 7 – Multiple Access Control (I)
Delay Analysis of IEEE in Single-Hop Networks Marcel M. Carvalho, J.J.Garcia-Luna-Aceves.
9/11/2015 5:55 AM1 Ethernet and CSMA/CD CSE 6590 Fall 2010.
A Multichain Backoff Mechanism for IEEE WLANs Alkesh Patel & Hemant Patel ECE 695 – Leading Discussion By : Shiang- Rung Ye and Yu-Chee Tseng.
Multiple Access Protocols Chapter 6 of Hiroshi Harada Book
Wireless Application Protocol
McGraw-Hill © The McGraw-Hill Companies, Inc., 2004 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Chapter 4: Medium Access Control (MAC) Sublayer
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
LOCAL AREA NETWORKS. CSMA Carrier Sense Multiple Access To minimize the chance of collision and, therefore, increase the performance, the CSMA method.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.
R ANDOM A CCESS N ETWORKS CSMA F AMILIES 1. References Chapter 9 of the book. Throughput Analysis for Persistent CSMA Systems, HIDEAKI TAKAGI AND LEONARD.
Medium Access Control Sub Layer
7-1 Introduction to Queueing Theory l Components of a queueing system n probability density function (pdf) of interarrival times n pdf of service times.
Multiple Access.
Chapter 6 Multiple Radio Access
1 Kyung Hee University Chapter 12 Multiple Access.
Ethernet. Ethernet (802.3) 1-persistent CSMA, CD, binary exponential backoff Carrier sense: station listens to channel first. 1-persistent: If idle, station.
Access Delay Distribution Estimation in Networks Avideh Zakhor Joint work with: E. Haghani and M. Krishnan.
Medium Access Control in Wireless networks
實驗三 媒體存取協定模擬 教師: 助教: 1998/10/19 High Speed Network Lab. Department of Computer Information Science, NCTU.
Carrier Sense Multiple Access Improve ALOHA by using carrier sense –Stations listen to the carrier before transmitting –If channel is busy, the station.
1 Ethernet CSE 3213 Fall February Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed.
CSMA/CD Simulation Carrier Sense Multiple Access (CSMA), although more efficient than ALOHA or slotted ALOHA, still has one glaring inefficiency: When.
Tel Hai Academic College Department of Computer Science Prof. Reuven Aviv Markov Models for Access Control in Computer Networks Resource: Fayez Gebali,
Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 10.
COMPUTER NETWORKS Data-link Layer (The Medium Access Control Sublayer) MAC Sublayer.
Multiple Access By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.
ECEN “Mobile Wireless Networking”
Introduction to Queueing Theory
Lab 7 – CSMA/CD (Data Link Layer Layer)
Medium Access Control Protocols
Idle sense.
High Speed LANs – Ethernet and Token Ring
Services of DLL Framing Link access Reliable delivery
Chapter 12 Multiple Access
CSMA with Reservation by Interruptions (CSMA/RI)
CSE 313 Data Communication
CARRIER SENSE MULTIPLE ACCESS (CSMA)
Chapter 6 Multiple Radio Access.
Multiple Access Control (MAC) Protocols
Satellite Packet Communications A UNIT -V Satellite Packet Communications.
Presentation transcript:

Slotted Nonpersistent CSMA Timeline divided into time slots, called mini slot, with length equal to maximum propagation delay  Before attempting transmission, the user waits for the beginning of the next slot, and senses whether the channel is idle. If idle, he sends the packet for T time slots. If the channel is busy, the packet is rescheduled to some randomly chosen time in the future.

Throughput analysis Idle period = 1 => arrival in first idle slot Idle period = 2 => no arrival in first and arrival in second …

Idle period Following the above reasoning we get: Giving us:

Busy Period Both successful and unsuccessful transmissions last T+  A busy period will contain k transmission periods if there is at least one arrival in the last mini-slot of each of the first k-1 transmission periods, and no arrival in the last mini-slot of the kth transmission period: And:

Useful time During the busy period, the number of transmission periods is: When a transmission period is useful it carries information for T seconds The useful part of the busy-idle cycle is then: Where P suc denotes the success probability

Success probability We divide by the probability of “some arrivals” because we know there was at least one arrival, since a transmission period has been initiated

Throughput

BTP collision resolution Given a MA channel with Trenary Feedback running BTP for collision resolution. A node perform the following algorithm upon waking up: –If collision, wait for resolution and then transmit –Otherwise (if quiet or success), broadcast in the next time slot. At time t, n nodes collided. At time T>t a new node woke up wishing to send a packet. Which of the following is true? 1.The node will transmit successfully only after all n nodes have successfully transmitted 2.The node will transmit during the collision resolution, and the result will be as if the node had collided with the n nodes in the first place 3.Either 1. or 2. depending on the place in the of the slot in the virtual tree 4.Either 1. or 2. according to the type of slot the node sensed 5.All the above answers are wrong

Analysis

BTP in a noisy channel Consider a MA channel where BTP is applied and noise is present. The impact of noise is that there is a probability p 1 that a slot which contains a single transmission is interpreted as a collision. How will the CRIs (Collision Resolution Intervals) change?

How will the optimal probability p change: נפתור