DLL MAC Protocols

download DLL MAC Protocols

of 10

Transcript of DLL MAC Protocols

  • 8/20/2019 DLL MAC Protocols

    1/22

  • 8/20/2019 DLL MAC Protocols

    2/22

    2

    Types of MAC

    • Control: – Distributed. – Centralized.

    • How they coordinate medium access: – Round-robin. – Scheduled-access.

    – Contention-based.

    OPM

  • 8/20/2019 DLL MAC Protocols

    3/22

    3

    MAC Protocols• Contention-based

    – ALOHA and Slotted ALOHA. – CSMA. –

    CSMA/CD.• Round-robin : token-based protocols.

    – Token bus. – Token ring.

    • Scheduled Access Based: – Centralized or distributed scheduling based MAC – Ex. GSM, WIMAX, LTE, WiFi networks.

    OPM

  • 8/20/2019 DLL MAC Protocols

    4/22

  • 8/20/2019 DLL MAC Protocols

    5/22

    5

    Pure ALOHA•

    In pure ALOHA, frames are transmitted at completelyarbitrary times.

    OPM

  • 8/20/2019 DLL MAC Protocols

    6/22

    6

    Collisions

    • Invalid frames may be caused by channel noise or

    • Because other station(s) transmitted at the same time:collision .

    • Collision happens even when the last bit of a frameoverlaps with the first bit of the next frame.

    OPM

  • 8/20/2019 DLL MAC Protocols

    7/22

    7

    Pure ALOHA: Performance• Vulnerable period for the shaded frame .

    OPM

  • 8/20/2019 DLL MAC Protocols

    8/22

    8

    ALOHA’s Performance (Cont’d)

    • S = G e -2G , where S is the throughput (rate of successfultransmissions) and G is the mean offered load per frameduration.

    • S = S max = 1/2e = 0.184 for G=0.5.

    OPM

  • 8/20/2019 DLL MAC Protocols

    9/22

    9

    Slotted Aloha

    • Time divided in uniform slots• Need central clock (or other sync mechanism)• Frames can only be transmitted at beginning of slot: “discrete”

    ALOHA.

    • Frames either miss or overlap totally• Vulnerable period is half of pure ALOHA.• S = G e -G.• S = S max = 1/e = 0.368 for G = 1.• Doubles performance of pure ALOHA.

    OPM

  • 8/20/2019 DLL MAC Protocols

    10/22

    10

    ALOHA Protocols: Performance

    • Throughput versus offered traffic for ALOHAsystems.

    OPM

  • 8/20/2019 DLL MAC Protocols

    11/22

    11

    ALOHA Protocols: Summary

    • Simple.• poor utilization (network efficiency)• Applicable only in the network having very low user

    density

    OPM

  • 8/20/2019 DLL MAC Protocols

    12/22

    CARRIER SENSE MULTIPLE ACCESS(CSMA)

    •CSMA protocol was developed to overcome the problem found in ALOHAi.e. to minimize the chances of collision, so as to improve the performance.

    •CSMA protocol is based on the principle of ‘carrier sense’.

    •The chances of collision can be reduce to great extent if a station senses thechannel before trying to use it.

    • Although CSMA can reduce the possibility of collision, but it cannot eliminateit completely.

    •The chances of collision still exist because of propagation delay.

    12OPM

  • 8/20/2019 DLL MAC Protocols

    13/22

    CSMA Protocol• 1-Persistent CSMA

    – Continuous sensing – Transmits packet with probability 1 in immediate idle time slot – Collision rate is high

    • Non-Persistent CSMA – Senses carrier at random time – Network efficiency is comparatively high – Collision rate is also comparatively low

    • P-Persistent CSMA – Time divided into slots – if idle time sensed Transmits packet with probability p – Network efficiency is comparatively high – Collision rate is low

    13OPM

  • 8/20/2019 DLL MAC Protocols

    14/22

    CSMA /CD protocol

    • Carrier Sense Multiple Access/ Collision Detection• Used in Ethernet LAN• Transmitting device transmits packets and continuously detects

    collision• If collision detected, differs transmission for random time

    • For Random time delay Binary exponential back off algorithm

    is used.

    14OPM

  • 8/20/2019 DLL MAC Protocols

    15/22

  • 8/20/2019 DLL MAC Protocols

    16/22

    Collision Free Protocols

    • Reservation protocol – Like token base access

    • Bit Mapped Protocol using contention period – transmit time is divided in to contention and Frame time – In contention period one bit is reserved (0 nothing to transmit, 1 to

    transmit) – Contention period followed by number of frames = No. of “1” in

    contention period•

    Binary count down Protocol using contention period – Instead reserving one bit for all users in contention period user devices

    transmits their binary addresses

    16OPM

  • 8/20/2019 DLL MAC Protocols

    17/22

    Binary Count down contention protocol

    17

    In contention period user nodes transmits their binary address (only those who wantsto transmit)

    OPM

  • 8/20/2019 DLL MAC Protocols

    18/22

    Limited-Contention Protocol

    • Contention Protocol are more suitable for low load – As load increases contention delay also increases – As load increases packet collision probability also increases

    • Collision free protocols are more suitable for heavy load – As load increases channel efficiency also improves at the cost of

    additional overhead

    • Limited-Contention Protocol combines the best properties ofcontention and collision free protocols

    – At low load uses contention Protocol due to less delay – At high load uses collision free protocol due to good channel efficiency

    18OPM

  • 8/20/2019 DLL MAC Protocols

    19/22

    Limited-Contention Protocol Cont.

    • Adaptive Tree walk Protocol – Low load

    • Every body contends – Collision

    • Reduces number of stations

    19OPM

  • 8/20/2019 DLL MAC Protocols

    20/22

    Adaptive Tree walk algorithm

    First contention all stations are permitted to contendIf collision then in next slot only stations under node 2 contendsIf success then in next slot stations under node 3 contendsIf collision then in next slot stations under node 4 contendsIf success then in next slot stations under node 5 contends

    20OPM

  • 8/20/2019 DLL MAC Protocols

    21/22

  • 8/20/2019 DLL MAC Protocols

    22/22

    Binary exponential back-off algorithm

    • Used for randomization• The contention slot is decided as 2 power n• Where n= 0,1,2,….N •

    For first time collision n=1, station transmits in slot 0 or 1 .• For second time collision n=2, station transmits in any one slot

    from 0 to 3 .• For third time collision n=3, station transmits in any one slot from

    0 to 7.• And so on.

    22OPM