Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    Random Access Protocols Slotted Aloha

    Uploaded by

    Shahin Fatima
    Random access protocols like Slotted Aloha and CSMA allow nodes to transmit packets without coordination. Slotted Aloha divides time into slots and nodes transmit at the start of empty slots, retransmitting after collisions. CSMA involves listening first before transmitting, to avoid collisions when the channel is busy. "Taking turns" protocols like polling, token passing, and reservation-based protocols provide coordinated access to avoid collisions but have overhead from coordination.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Random Access Protocols Slotted Aloha

    Uploaded by

    Shahin Fatima
    24 views3 pages
    Random access protocols like Slotted Aloha and CSMA allow nodes to transmit packets without coordination. Slotted Aloha divides time into slots and nodes transmit at the start of empty slots, retransmitting after collisions. CSMA involves listening first before transmitting, to avoid collisions when the channel is busy. "Taking turns" protocols like polling, token passing, and reservation-based protocols provide coordinated access to avoid collisions but have overhead from coordination.

    Original Title

    4-8a-4up

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Random access protocols like Slotted Aloha and CSMA allow nodes to transmit packets without coordination. Slotted Aloha divides time into slots and nodes transmit at the start of empty slots, retransmitting after collisions. CSMA involves listening first before transmitting, to avoid collisions when the channel is busy. "Taking turns" protocols like polling, token passing, and reservation-based protocols provide coordinated access to avoid collisions but have overhead from coordination.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    24 views3 pages

    Random Access Protocols Slotted Aloha

    Uploaded by

    Shahin Fatima
    Random access protocols like Slotted Aloha and CSMA allow nodes to transmit packets without coordination. Slotted Aloha divides time into slots and nodes transmit at the start of empty slots, retransmitting after collisions. CSMA involves listening first before transmitting, to avoid collisions when the channel is busy. "Taking turns" protocols like polling, token passing, and reservation-based protocols provide coordinated access to avoid collisions but have overhead from coordination.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Random Access protocols

    Slotted Aloha
    time is divided into equal size slots (= pkt trans. time) node with new arriving pkt: transmit at beginning of next slot if collision: retransmit pkt in future slots with probability p, until successful.

    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) slotted ALOHA ALOHA CSMA and CSMA/CD
    5: DataLink Layer 5a-21

    Examples of random access MAC protocols:


    Success (S), Collision (C), Empty (E) slots


    5: DataLink Layer 5a-22

    Slotted Aloha efficiency


    Q: what is max fraction slots successful?
    A: Suppose N stations have packets to send each transmits in slot with probability p prob. successful transmission S is:
    by single node: S= p (1-p)(N-1)

    Pure (unslotted) ALOHA


    unslotted Aloha: simpler, no synchronization pkt needs transmission:

    send without awaiting for beginning of slot pkt sent at t0 collide with other pkts sent in [t0-1, t0+1]

    collision probability increases:

    by any of N nodes S = Prob (only one transmits)

    = N p (1-p)(N-1)

    At best: channel

    choosing optimum p as n -> infty ...

    = 1/e = .37 as N -> infty

    use for useful transmissions 37% of time!


    5: DataLink Layer 5a-23 5: DataLink Layer 5a-24

    Pure Aloha (cont.)


    P(success by given node) = P(node transmits) . P(no other node transmits in [p0-1,p0] . P(no other node transmits in [p0-1,p0] = p . (1-p) . (1-p) P(success by any of N nodes) = N p . (1-p) . (1-p) choosing optimum p as n -> infty ... 0.4 = 1/(2e) = .18
    0.3 0.2 0.1

    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 human analogy: dont interrupt others!

    S = throughput = goodput (success rate)

    Slotted Aloha

    protocol constrains
    effective channel throughput!

    Pure Aloha
    0.5

    G = offered load = Np

    1.0

    1.5

    2.0 5: DataLink Layer 5a-25 5: DataLink Layer 5a-26

    CSMA collisions
    collisions can occur:
    propagation delay means two nodes may not year hear each others transmission

    spatial layout of nodes along ethernet

    CSMA/CD (Collision Detection)


    CSMA/CD: carrier sensing, deferral as in CSMA
    collisions detected within short time colliding transmissions aborted, reducing channel wastage persistent or non-persistent retransmission

    collision:

    entire packet transmission time wasted

    note:

    role of distance and propagation delay in determining collision prob.


    5: DataLink Layer 5a-27

    collision detection: easy in wired LANs: measure signal strengths, compare transmitted, received signals difficult in wireless LANs: receiver shut off while transmitting human analogy: the polite conversationalist
    5: DataLink Layer 5a-28

    CSMA/CD collision detection

    Taking Turns MAC protocols


    channel partitioning MAC protocols: share channel efficiently at high load inefficient at low load: delay in channel access, 1/N bandwidth allocated even if only 1 active node! Random access MAC protocols efficient at low load: single node can fully utilize channel high load: collision overhead taking turns protocols look for best of both worlds!

    5: DataLink Layer 5a-29

    5: DataLink Layer 5a-30

    Taking Turns MAC protocols


    Polling: master node invites slave nodes to transmit in turn Request to Send, Clear to Send msgs concerns:

    Reservation-based protocols
    Distributed Polling:
    time divided into slots begins with N short reservation slots

    Token passing: control token passed from one node to next sequentially. token message concerns:

    polling overhead latency single point of failure (master)

    token overhead latency single point of failure (token)

    reservation slot time equal to channel end-end propagation delay station with message to send posts reservation reservation seen by all stations after reservation slots, message transmissions ordered by

    known priority

    5: DataLink Layer 5a-31

    5: DataLink Layer 5a-32

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy