Explain CSMA with collision detection?

- CSMA with collision detection is abbreviated as CSMA/CD. 

- CSMA in itself makes use of the LBT technology i.e., listen or sense before talk. 

- But when incorporated with the ability of collision detection, it gets much better. 

- If the channel is sensed to be idle the data packets or frames are transmitted immediately but if not, the transmitter is bound to wait for some time before it can re-transmit. 

- Sensing the channels prior to transmission is absolutely necessary if the collisions are to be avoided. 

- Sensing the channel is the most effective way of avoiding the collisions. 

- There are two types of CSMA protocols namely persistent and the non-persistent CSMA.

- In CSMA/CD protocol all the hosts have freedom for transmitting and receiving the data frames on one and the same channel. 

- Also, the size of the packets is variable.

CSMA/CD comprises of two processes:

Carrier Sense: In this process the transmitter or the host checks if the channel or the line is not occupied before starting the transmission.

Collision Detection: CSMA/CD tries to detect the collisions in the shortest possible time. If it happens to detect a collision, it stops the transmission then and there and waits for a random amount of time which is equal to the binary exponential back-off. It then again senses the channel.

- For ensuring there occurs no collision during the transmission of a packet, a host must have the capability of detecting the collision before the transmission process is complete. 

- What happens is that the host A sensing the line to be idle starts transmitting a frame. 

- Just before the first unit of this frame reaches host B, it also senses the line to be idle and starts its transmission. 

- Now the host B receives data while its transmission is still in progress and so it detects that a collision is about to occur. 

- A collision occurs close to the host B. the host A also receives data in midst of its transmission and therefore detects the collision. 

- For making the hosts detect collision before transmission, a minimum length has to be decided for the packets that are transmitted via CSMA/CD networks. 

There are 3 states for a CSMA/ CD channel namely:

1. Contention
2. Transmission
3. Idle

- Ethernet is the most popular example of the CSMA/CD networks. 

- A minimum slot time is required for collision detection between the stations.

- This slot time must equal twice the maximum value of the propagation delay. - The host acquires the channel on the basis of the 1 – persistence. 

- Also, a jam signal is transmitted if a case of collision detection occurs. 

- CSMA/CD make use of the binary exponential back-off algorithm. 

- It is obvious that the idle time of the channel will be small if the load is heavy. 

- It normalizes all the packets with respect to the time of the packet transmission.

- CSMA/CD represents a very effective method for media access control. 

- There are different methods available for detecting the collisions. 

- Which method is to be followed depends largely on the transmission medium that exists between the two stations. 

- For example, if the two stations are connected via electrical buses, the collision can be detected by making comparison between the transmitted and the received data. 

- Some other way involves recognition of a signal of higher amplitude than the normal one. 

- The jam signal used in the CSMA/CD networks is constituted of 32 bit binary pattern.

Differentiate between persistent and non-persistent CSMA?

- CSMA or Carrier Sense Multiple Access makes use of LBT or listen before technique before making any transmission. 

- It senses the channel for its status and if found free or idle, the data frames are transmitted otherwise the transmission is deferred till the channel becomes idle again. 

- In simple words, we can say that CSMA is an analogy to human behavior of not interrupting others when busy. 

- There are number of protocols out which the persistent and the non – persistent are the major ones. 

- CSMA is based on the idea that if the state of the channel can be listened or sensed prior to transmitting a packet, better throughput can be achieved.

- Also, using this methodology a number of collisions can be avoided. 

- However, it is necessary to make the following assumptions in CSMA technology:

1. The length of the packets is constant.
2. The errors can only be caused by collisions except which there are no errors.
3. Capture effect is absent.
4. The transmissions made by all the other hosts can be sensed by each of the hosts.
5. The transmission time is always greater than the propagation delay.

About Persistent CSMA

- This protocol first senses the transmission channel and acts accordingly. 

- If the channel is found to be occupied by some other transmission, it keeps listening or sensing the channel and as soon as the channel becomes free or idle, starts its transmission. 

- On the other hand, if the channel is found empty, then it does not wait and starts transmitting immediately. 

- There are possibilities of collisions. 

- If one occurs, the transmitter must wait for random time duration and start again with the transmission. 

- It has a type called 1 – persistent protocol which makes transmission of probability 1 whenever the channel is idle. 

- In persistent CSMA there are possibilities of occurrence of collisions even if the propagation delay is 0. 

- However, collisions can only be avoided if the stations do not act so greedy. 

- We can say that this CSMA protocol is aggressive and selfish. 

- There is another type of this protocol called the P – persistent CSMA. 

- This is the most optimal strategy. 

- Here the channels are assumed to be slotted where one slot equals the period of contention i.e., 1 RTT delay. 

- The protocol has been named so because it transmits the packet with probability p if the channel is idle otherwise it waits for one slot and then transmits.

About Non–Persistent CSMA

- It is deferential and less aggressive when compared to its persistent counterpart. 

- It senses the channel and if it is busy it just waits and then again after sometime senses the channel unlike persistent CSMA which keeps on sensing the channel continuously. 

- As and when the channel is found free, the data packet is transmitted immediately. 

- If there occurs a collision it waits and starts again.

- In this protocol, even if the two stations become greedy in midst of transmission of some other station they do not collide probably whereas, in persistent CSMA they collide.

- Also, if only one of the stations become greedy in midst of some other transmission in progress, it has no choice but to wait. 

- In persistent CSMA this greedy stations takes over the channel up on completion of the current transmission.

- Using non – persistent CSMA can reduce the number of collisions whereas persistent CSMA only increases the risk. 

- But the non – persistent CSMA is less efficient when compared to the persistent CSMA.

- Efficiency lies in the ability of the protocols of detecting the collisions before starting the transmission. 

What are five key assumptions in dynamic channel allocation?

Putting the available bandwidth in operation of the cellular telephone system to efficient use is an important problem to be considered for providing good service to the largest number of customers possible. The problem has gained a critical status owing to the rapid growth of the cellular telephones users. 

- A communication channel is nothing but a band of frequencies which a number of users can use simultaneously if they are residing far apart from each other. 

- There is a minimum distance at which no interference occurs between the users and it is known as the channel reuse constraint. 

- A cellular telephone system divides the service area in to a number of regions commonly known as the cells. 

- Each of the cells has its own base station for handling the calls concerned with that cell. 

- The bandwidth of the communication channel is partitioned in to many channels permanently. 

- The cells are then allocated these channels in such a way that the channel reuse constraint is not violated by the calls. 

- There are a number of ways for allocating the channels. 

- Few of them are better than the others when it comes to reliably making channels available to all the cells. 

Few examples of channel allocation methods are:

1. Fixed assignment method
2. Dynamic allocation method
3. Reinforcement learning method

About Dynamic Method Allocation

- One type of dynamic method allocation is the BDCL or the borrowing with directional channel locking. 

- Out of all the above mentioned channel allocation methods, the dynamic allocation is considered the best one according to some studies conducted. 

- It is somewhat of the heuristic kind. 

- In dynamic allocation, the channels are allocated in the same way as in the fixed assignment method but it permits borrowing channels from the other cells whenever required. 

- It then arranges those channels in a specific order in each of the cells and this ordering is used in determining the channels for borrowing and reassigning the calls dynamically within the cells.

- There are static allocation techniques also but those don’t seem to work as well as the dynamic allocation techniques. 

In dynamic channel allocation 5 assumptions are always made which we have discussed below:

Station model: 

- There are N independent stations in the model and one frame is generated by each of the stations one at a time. 

- It is blocked until the successful transmission of the previous frame. 

- This means a station cannot queue multiple frames for transmission. 

- For example, a transmission gap of 100 bits is required during the transmission of the consecutive frames.

Single channel assumption:  

- The same medium is shared by all the stations. 

- Through it all the stations can receive and transmit.

Collision assumption: 

- A collision occurs whenever at the same time two frames are transmitted. 

- The two frames that collide have to be re-transmitted.

Transmission model: 

- There are 2 types namely, the continuous time model and the slotted time model. 

- In the former type transmission can be started at any given time. 

- In the latter model, transmission starts with a time slot.

Carrier sense: 

- It can also be classified in to 2 categories namely carrier sense and no carrier sense. 

- Stations can know if a channel is occupied prior to using it. This is called carrier sense.

- In no carrier sense, the stations cannot know whether the channel is occupied or not before transmission.

- Also, it gets difficult for the dynamic allocation method for setting up the favorable usage patterns as the calls start saturating the system.