1 / 17

Multiple Access protocol

Multiple Access protocol. Multiple Access Links and Protocols. Three types of “links”: point-to-point (single wire, e.g. PPP, SLIP) broadcast (shared wire or medium; e.g, Ethernet, Wavelan, satellite, etc.) switched (e.g., switched Ethernet, ATM, etc). Multiple Access Protocols.

speres
Download Presentation

Multiple Access protocol

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Multiple Accessprotocol 5: DataLink Layer

  2. Multiple Access Links and Protocols Three types of “links”: • point-to-point (single wire, e.g. PPP, SLIP) • broadcast (shared wire or medium; e.g, Ethernet, Wavelan, satellite, etc.) • switched (e.g., switched Ethernet, ATM, etc) 5: DataLink Layer

  3. Multiple Access Protocols • single shared communication channel • two or more simultaneous transmissions by nodes: interference • only one node can send successfully at a time • multiple access protocol: • distributed algorithm that determines how stations share channel, i.e., determine when station can transmit 5: DataLink Layer

  4. Why collisions occur • One or more node start transmission while some other transmission is going on • Tow or more node start transmission at the same time 5: DataLink Layer

  5. MAC Protocols: a taxonomy Three broad classes: • Static Channel Partitioning • divide channel into smaller “pieces” (time slots, frequency) • allocate piece to node for exclusive use • Random Access • allow collisions • “recover” from collisions • “Taking turns” (Dynamic channel partitioning) • tightly coordinate shared access to avoid collisions Goal: efficient, fair, simple, decentralized 5: DataLink Layer

  6. Channel Partitioning MAC protocols: TDMA TDMA: time division multiple access • access to channel in "rounds" • each station gets fixed length slot (length = pkt trans time) in each round • unused slots go idle • example: 6-station LAN, 1,3,4 have pkt, slots 2,5,6 idle • TDM (Time Division Multiplexing): channel divided into N time slots, one per user; inefficient with low duty cycle users and at light load. • FDM (Frequency Division Multiplexing): frequency subdivided. 5: DataLink Layer

  7. Channel Partitioning MAC protocols: FDMA FDMA: frequency division multiple access • channel spectrum divided into frequency bands • each station assigned fixed frequency band • unused transmission time in frequency bands go idle • example: 6-station LAN, 1,3,4 have pkt, frequency bands 2,5,6 idle • TDM (Time Division Multiplexing): channel divided into N time slots, one per user; inefficient with low duty cycle users and at light load. • FDM (Frequency Division Multiplexing): frequency subdivided. time frequency bands 5: DataLink Layer

  8. Channel Partitioning (CDMA) CDMA (Code Division Multiple Access) • unique “code” assigned to each user; ie, code set partitioning • used mostly in wireless broadcast channels (cellular, satellite,etc) • all users share same frequency, but each user has own “chipping” sequence (ie, code) to encode data • encoded signal = (original data) X (chipping sequence) • decoding: inner-product of encoded signal and chipping sequence • allows multiple users to “coexist” and transmit simultaneously with minimal interference (if codes are “orthogonal”) 5: DataLink Layer

  9. CDMA Encode/Decode 5: DataLink Layer

  10. CDMA: two-sender interference sender 1 sender 2 uses sender 1 code to receive sender 1 data 5: DataLink Layer

  11. Random Access protocols • When node has packet to send • transmit at full channel data rate R. • no a priori coordination among nodes • two or more trasnmitting nodes -> “collision”, • random access MAC protocol specifies: • how to detect collisions • how to recover from collisions (e.g., via delayed retransmissions) • Examples of random access MAC protocols: • slotted ALOHA • ALOHA • CSMA and CSMA/CD 5: DataLink Layer

  12. CSMA • What is CSMA carrier Sense multiple Access • carrier Sense : transmitter listen for carrier before sending packet . • multiple Access : multiple nodes can send and receive on the medium • There for collision can occur 5: DataLink Layer

  13. Tow type of CSMA • CSMA/CA • CSMA/CD 5: DataLink Layer

  14. CSMA: Carrier Sense Multiple Access) CSMA: listen before transmit: • If channel sensed idle: transmit entire pkt • If channel sensed busy, defer transmission • Persistent CSMA: retry immediately with probability p when channel becomes idle (may cause instability) • Non-persistent CSMA: retry after random interval 5: DataLink Layer

  15. CSMA/CD (CSMA with Collision Detection) • In CSMA, if 2 terminals begin sending packet at the same time, each will transmit its complete packet (although collision is taking place). • Wasting medium for an entire packet time. • CSMA/CD Step 1: If the medium is idle, transmit Step 2: If the medium is busy, continue to listen until the channel is idle then transmit Step 3: If a collision is detected during transmission, cease transmitting Step 4: Wait a random amount of time and repeats the same algorithm

  16. CSMA/CA (CSMA with collision Avoidance) • All terminals listen to the same medium as CSMA/CD. • Terminal ready to transmit senses the medium. • If medium is busy it waits until the end of current transmission. • It again waits for an additional predetermined time period DIFS (Distributed inter frame Space). • Then picks up a random number of slots (the initial value of backoff counter) within a contention window to wait before transmitting its frame. • If there are transmissions by other terminals during this time period (backoff time), the terminal freezes its counter. • It resumes count down after other terminals finish transmission + DIFS. The terminal can start its transmission when the counter reaches to zero.

  17. “Taking Turns” MAC protocols Token passing: • control token passed from one node to next sequentially. • token message • concerns: • token overhead • latency • single point of failure (token) Polling: • master node “invites” slave nodes to transmit in turn • Request to Send, Clear to Send msgs • concerns: • polling overhead • latency • single point of failure (master) 5: DataLink Layer

More Related