Multiple Access Protocols, Study notes of Data Communication Systems and Computer Networks

Multiple access protocols are essential in enabling multiple users to access a shared communication channel efficiently. They play a crucial role in various communication systems, including wireless networks, satellite communication, and local area networks. These notes cover topics such as TDMA, CSMA, CDMA, FDMA, and ALOHA along with solved examples and apt diagrams.

Typology: Study notes

2022/2023

Available from 08/02/2023

tannishtha-jain
tannishtha-jain 🇮🇳

3 documents

1 / 29

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Multiple Access Protocols
Computer Networks
Types:-
1) Concept Multiple Access Resolution
2)Random Access Control
ALOHA(Pure and Slotted ALOHA)
Carrier Sense Multiple Access
Carrier Sense Multiple Access with Collision
Detection
Carrier Sense Multiple Access with Collision
Avoidance
Computer Networks
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d

Partial preview of the text

Download Multiple Access Protocols and more Study notes Data Communication Systems and Computer Networks in PDF only on Docsity!

Multiple Access Protocols

Computer Networks

Types:-

  1. Concept Multiple Access Resolution 2)Random Access Control

• ALOHA(Pure and Slotted ALOHA)

• Carrier Sense Multiple Access

• Carrier Sense Multiple Access with Collision

Detection

• Carrier Sense Multiple Access with Collision

Avoidance Computer Networks

3 The data link layer is the second layer in the OSI (Open Systems Interconnection) model and the layer responsible for the reliable transfer of data between two devices connected on the same network. It is concerned with addressing, framing, and error detection and correction. One of the important aspects of the data link layer is handling multiple access to the shared communication medium, especially in shared network topologies. Multiple access refers to the ability of multiple devices to communicate over the same network medium simultaneously. In shared network topologies, such as Ethernet and Wi-Fi, multiple devices contend for access to the shared communication channel. The data link layer must manage this contention and ensure that data packets are transmitted efficiently and without collisions.

ALOHA

Aloha is a multiple access protocol used in data communication networks to manage access to a shared communication channel. It was one of the first multiple access methods developed for early computer networks and played a significant role in the development of modern networking protocols. The Aloha protocol was originally developed at the University of Hawaii in the early 1970s. There are two variants of the Aloha protocol:

1. Pure Aloha:

  • Pure Aloha is a simple and decentralized protocol that allows devices to transmit data whenever they have information to send.
  • When a device wants to transmit a data packet, it checks if the communication channel is idle.
  • If the channel is idle, the device transmits the packet. If there is a collision (i.e., two or more devices transmitting simultaneously), data packets will collide, leading to a loss of data.
  • After a collision, devices that experienced the collision will wait for a random amount of time before attempting to retransmit the packet.

2. Slotted Aloha:

  • Slotted Aloha improves the efficiency of the protocol by dividing time into discrete time slots.
  • Each time slot corresponds to the time it takes for one data packet to be transmitted.
  • Devices are only allowed to transmit at the beginning of a time slot, ensuring synchronized transmission attempts.
  • If a device has data to transmit, it waits for the next time slot to begin. If the channel is idle, it transmits its packet during that slot.
  • If a collision occurs, the devices involved wait for the next time slot and attempt to retransmit. Comparing the two variants, Slotted Aloha reduces the probability of collisions and improves overall efficiency compared to Pure Aloha. However, both variants still suffer from performance limitations in highly congested networks because they do not have mechanisms to prevent or detect collisions effectively. Aloha served as an essential foundation for the development of more advanced multiple access protocols used in modern networking systems, such as Carrier Sense Multiple Access (CSMA) and its variations (e.g., CSMA/CD and CSMA/CA). These later protocols incorporated additional techniques to further reduce the likelihood of collisions and improve the overall performance of shared communication channels. Despite its simplicity, Aloha played a crucial role in the early days of networking and inspired further research and development in the field of computer networking.

Carrier Sense Multiple Access with

Collision Avoidance (CSMA/CA):

  • CSMA/CA is used in wireless networks, particularly Wi-Fi networks.
  • In a wireless environment, collision detection is more challenging, so collision avoidance mechanisms are used instead.
  • Before transmitting data, a device using CSMA/CA will first listen to the network to check if the medium is idle (Carrier Sense).
  • Additionally, the device performs a virtual carrier sense, which involves checking if the medium will be busy by other devices over the entire duration of the intended transmission.
  • If the medium is sensed as idle, the device sends a request to send (RTS) frame to the access point (AP) for permission to transmit.
  • The AP replies with a clear to send (CTS) frame, reserving the medium for the device's transmission. After this exchange, the device can safely transmit its data.
  • Other devices within range of the RTS/CTS exchange will defer their transmissions, reducing the likelihood of collisions. Both CSMA and CSMA/CA are used to manage multiple access in shared network environments, but CSMA/CA is more common in wireless networks due to the challenges of collision detection in wireless communication.

8

Frames in a pure ALOHA network

10 The stations on a wireless ALOHA network are a maximum of 600 km apart. If we assume that signals propagate at 3 × 108 m/s, we find Tp = (600 × 103 ) / (3 × 108 ) = 2 ms. Now we can find the value of TB for different values of K. a. For K = 1, the range is {0, 1}. The station needs to| generate a random number with a value of 0 or 1. This means that TB is either 0 ms (0 × 2) or 2 ms (1 × 2), based on the outcome of the random variable. b. For K = 2, the range is {0, 1, 2, 3}. This means that TB can be 0, 2, 4, or 6 ms, based on the outcome of the random variable. c. For K = 3, the range is {0, 1, 2, 3, 4, 5, 6, 7}. This means that TB can be 0, 2, 4,... , 14 ms, based on the outcome of the random variable. d. We need to mention that if K > 10, it is normally set to

Example 1

11 Figure 5 Vulnerable time for pure ALOHA protocol

Vulnerable time - pure ALOHA protocol

13 A pure ALOHA network transmits 200 - bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces a. 1000 frames per second b. 500 frames per second c. 250 frames per second.

Example 3

Solution The frame transmission time is 200 / 200 kbps or 1 ms. a. If the system creates 1000 frames per second, this is 1 frame per millisecond. The load is 1. In this case S = G× e −2 G or S = 0.135 (13.5 percent). This means that the throughput is 1000 × 0.135 = 135 frames. Only 135 frames out of 1000 will probably survive. b. If the system creates 500 frames per second, this is (1/2) frame per millisecond. The load is (1/2). In this case S = G × e −2G^ or S = 0.184 (18.4 percent). This means that the throughput is 500 × 0.184 = 92 and that means only 92 frames out of 500 will probably survive. Note that this is the maximum throughput case, percentagewise. c. If the system creates 250 frames per second, this is (1/4) frame per millisecond. The load is (1/4). In this case S = G × e −2G^ or S = 0.152 (15.2 percent). This means that the throughput is 250 × 0.152 = 38. Only 38 frames out of 250 will probably survive.

14 Figure 6 Frames in a slotted ALOHA network

Frames in a slotted ALOHA network

The throughput for slotted ALOHA is

S = G × e

−G

The maximum throughput

Smax = 0.368 when G = 1.

16 A slotted ALOHA network transmits 200 - bit frames on a shared channel of 200 kbps. What is the throughput if the system (all stations together) produces a. 1000 frames per second b. 500 frames per second c. 250 frames per second.

Example 4

Solution The frame transmission time is 200/200 kbps or 1 ms. a. If the system creates 1000 frames per second, this is 1 frame per millisecond. The load is 1. In this case S = G× e−G^ or S = 0.368 (36.8 percent). This means that the throughput is 1000 × 0.0368 = 368 frames. Only 386 frames out of 1000 will probably survive. b. If the system creates 500 frames per second, this is (1/2) frame per millisecond. The load is (1/2). In this case S = G × e−G^ or S = 0.303 (30.3 percent). This means that the throughput is 500 × 0.0303 = 151. Only 151 frames out of 500 will probably survive. c. If the system creates 250 frames per second, this is (1/4) frame per millisecond. The load is (1/4). In this case S = G × e −G or S = 0.195 (19.5 percent). This means that the throughput is 250 × 0.195 = 49. Only 49 frames out of 250 will probably survive.

17 Figure 8 Space/time model of the collision in CSMA

Space/time model of the collision in

CSMA

19 Figure 10 Behavior of three persistence methods

Behavior of three persistence methods

20 Figure 11 Flow diagram for three persistence methods

Flow diagram for three persistence

methods