Subscribe by Email


Showing posts with label CSMA. Show all posts
Showing posts with label CSMA. Show all posts

Tuesday, July 9, 2013

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.



Monday, July 8, 2013

Explain Carrier Sense Multiple Access Protocols - CSMA

- CSMA or Carrier Sense Multiple Access is defined as a probabilistic MAC (media access control) protocol. 
- In this protocol the absence of the traffic is verified by the node prior to start transmitting through a transmission medium that is shared by a number of channels. 
- For example, a band of EM spectrum, electric bus and so on. 
- Feedback from the receiver is used by the transmitter for determining whether the channel is already occupied by some transmission process or not. - This is termed as the carrier sense. 
- The transmitter before starting a transmission starts detecting whether a carrier wave is present their transmitted by some another station. 
- If a carrier wave is present, the transmission has no other option other than waiting for the transmission in progress to end before starting its own transmission. 
- To put it simply we can say that the carrier sense is what the CSMA protocol is based up on. 
- By ‘multiple access’, it simply means that a number of stations can transmit and receive data through the same medium. 
- But in this case all the other stations receive the data transmitted by one node using that same medium. 

There are many types of CSMA protocols as mentioned below:

1. CSMA with collision detection: 
- In short, this protocol is known as the CSMA/CD. 
- This protocol is used for improving the performance. 
- This it does through the termination of the transmission once a collision occurs along making reductions in the probability of occurrence of the other collisions upon re-transmissions.

2. CSMA with collision avoidance: 
- CSMA/ CA is the abbreviated form of this type of CSMA protocol. 
- This protocol avoids collision for improving the performance of the same.
- It tends not to be greedy on the transmitting channel.
- If it happens to sense the channel as busy prior to transmission then it is said to defer to a random interval.
- This is a measure for reduction in the probability of the packet collisions occurring on the channel.

3. Virtual time CSMA: 
- In short, known as the VTCSMA.
- This type of CSMA protocol has been designed for avoiding the collisions that are generated by the nodes. 
- These are the nodes that translate the signals at the same time. 
- This CSMA protocol is employed in the hard real time systems. 
- Two clocks are used by each node namely a real clock (rc) and a virtual clock (vc) for telling ‘real time’. 
- If the channel happens to be busy, the virtual clock freezes and if not it is reset. 
- vc is not initialized if the channel is busy and it runs faster when compared to the real clock.

CSMA happens to operate in various modes as discussed below:

1-Persistent: 
- The sender stations keeps on sensing the transmission channel until it becomes idle if previously it was busy. 
- When it finally becomes, then it starts transmitting the data packet i.e., the frame. 
- If a collision is detected, the transmitter has to wait for a random period of time before attempting to re-transmit the signal. 
- It finds use in systems such as Ethernet i.e., the systems using CSMA/ CD.

P-Persistent: 
- This mode lies somewhere between the non–persistent and the 1–persistent CSMA access modes.
- Once the data is ready to be transmitted, it checks for the status of the medium and starts transmitting the data packets with a certain probability.

Non-persistent: 
Less aggressive when compared to the previous one.

O-Persistent:
It works based according to the assigned transmission order. 


Sunday, July 7, 2013

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. 


Saturday, August 1, 2009

Overview Of The Medium Access Sublayer

Some networks have a single channel that is used for all communication. In these networks, the key design issue is the allocation of this channel among the competing stations wishing to use it. Numerous channel allocation algorithms have been devised like :

- FDM : Dedicate a frequency band to each station.
- TDM : Dedicate a time slot to each station.
- Pure ALOHA : Unsynchronized transmission at any instant.
- Slotted ALOHA : Random transmission in well defined time slots.
- 1-persistent CSMA : Standard carrier sense multiple access.
- Nonpersistent CSMA : Random delay when channel is sensed busy.
- P-persistent CSMA : CSMA, but with probability of p of persisting.
- CSMA/CD : CSMA. but abort on detecting a collision.
- Bit Map : Round robin scheduling using a bit map.
- Binary countdown : Highest numbered ready station goes next.
- Tree walk : Reduced contention by selective enabling.
- Wavelength division : A dynamic FDM scheme for fiber.
- MACA, MACAW : Wireless LAN protocols.
- GSM : FDM plus TDM for cellular radio.
- CDPD : Packet radio within an AMPS channel.
- CDMA : Everybody speak at once but in different language.
- Ethernet : CSMA/CD with binary exponential backoff.
- Token bus : Logical ring on a physical bus.
- Token Ring : Capture the token to send a frame.
- DQDB : Distributed queuing on a two-bus MAN.
- FDDI : Fiber-optic token ring.
- HIPPI : Crossbar using 50-100 twisted pairs.
- Fibre channel : Crossbar using fiber optics.
- SPADE : FDM with dynamic channel allocation.
- ACTS : TDM with centralized slot allocation.
- Binder : TDM with ALOHA when slot owner is not interested.
- Crowther : ALOHA with slot owner getting to keep it.
- Roberts : Channel time reserved in advance by ALOHA.

FDM and TDM are efficient when the number of stations is small and the traffic is continous.
ALOHA protocol, with and without slotting and control, has been proposed when the number of stations is large and variable.
BINARY COUNTDOWN completely eliminates contention.
TREE WALK reduces contention by dynamically dividing the stations into two disjoint groups, one of which is permitted to transmit and one of which is not.
WIRELESS LANs have their own problems and solutions. The biggest problem is caused by hidden stations, so CSMA does not work. MACA attempts to stimulate transmissions around the destination, to make CSMA work better.
GSM, CDPD and CDMA are widely used for mobile computers and telephones.
The IEEE 802 LANs are : CSMA/CD, TOKEN BUS, and TOKEN RING. Each of these has its unique advantages and disadvantages, and each has found its own user community.
FDDI, FAST ETHERNET, HIPPI, and FIBER CHANNEL offer bandwidth in the 100 Mbps range and up.


Facebook activity