载波侦听多路访问即csma_载波侦听多路访问（CSMA）计算机网络

最新推荐文章于 2021-12-17 09:47:22 发布

cumubi7453

最新推荐文章于 2021-12-17 09:47:22 发布

阅读量1.4k

点赞数

文章标签：人工智能多线程深度学习 python java

原文链接：https://www.includehelp.com/computer-networks/carrier-sense-multiple-access-csma.aspx

版权

载波侦听多路访问即csma

In the earlier discussion, we saw that Aloha leads to collision and have efficiency only about 20-30%. That's why performance is not up to satisfaction. The concept was to reduce the chance of collision and increase the performance sensing the medium before trying to use it.

在前面的讨论中，我们看到Aloha导致碰撞，并且效率只有大约20-30％。这就是为什么表现不能令人满意的原因。其概念是减少碰撞的机会并提高在尝试使用介质之前检测介质的性能。

CSMA (CSMA)

Carrier sense multiple access (CSMA) requires that each station first listen to the medium and then send if sending doesn't lead to any collision. That means CSMA is based on "sense before transmit" principle. CSMA can reduce the possibility of collision, but it cannot eliminate it. The possibility of collision still exists because of propagation delay; when a station sends a frame, other stations are yet to sense that. Thus, a station may sense the medium and find it idle, only because the first bit sent by another station has not yet been received.

载波侦听多路访问(CSMA)要求每个站首先侦听媒体，然后在发送不会导致任何冲突的情况下发送。这意味着CSMA基于“传输前感知”原理。 CSMA可以减少冲突的可能性，但不能消除它。由于传播延迟，碰撞的可能性仍然存在。当一个站点发送帧时，其他站点尚未感知到。因此，站可能仅由于尚未接收到由另一站发送的第一比特而感测到介质并发现其空闲。

Let's see an example,

我们来看一个例子

    A       B       C       D
                    T2
    T1

At time T1 station A senses the medium and finds it idle, so it sends a frame. At time T2 (T2> T1) station C senses the medium and finds it idle because the first bit from station A has not reached station C yet. Station C also sends a frame. The two signals collide and both frames are destroyed.

在时间T1，站A感测到介质并发现其空闲，因此它发送帧。在时间T2(T2> T1)，站点C感测到介质并发现其处于空闲状态，因为来自站点A的第一位尚未到达站点C。站C也发送一个帧。两个信号发生冲突，两个帧均被破坏。

脆弱的时间 (Vulnerable Time)

The vulnerable time for CSMA is the propagation time T_p. The propagation time is needed for a signal to propagate from one end of the medium to other ends. When two stations try to send respective frames simultaneously a collision will result. But if the first bit of the frame reaches the end of the medium, every station must have already heard the bit and will refrain from sending them.

CSMA的脆弱时间是传播时间T _p 。信号从介质的一端传播到另一端需要传播时间。当两个站尝试同时发送各自的帧时，将导致冲突。但是，如果帧的第一位到达媒体的末尾，则每个站都必须已经听到了该位，并且将避免发送它们。

CSMA的持久性方法 (Persistence Methods for CSMA)

There are basically three persistence methods:

基本上有三种持久性方法：

1-Persistent
1永久
Non-Persistent
非持久
p-Persistent
p持久

1) 1-Persistent

1)1永久

The 1-persistent method is simple and straightforward. When a station finds the channel idle, it sends its frame immediately (with probability 1).

1-persistent方法简单明了。当站点发现信道空闲时，它将立即发送其帧(概率为1)。

This method has the highest chance of collision because two or more stations may find the channel idle at the same time and send their frames immediately.

此方法发生冲突的可能性最高，因为两个或多个站点可能会同时发现信道空闲并立即发送其帧。

2) Non-persistent method

2)非持久方法

In the non-persistent method, a station that has a frame ready to be sent senses the line first. If the channel is idle, it sends immediately. If the channel is not idle, it waits a random amount of time(quite like Aloha) and then senses the line again.

在非持久性方法中 ，具有准备发送的帧的站将首先感知线路。如果通道空闲，则立即发送。如果通道不空闲，它将等待随机的时间(非常像Aloha )，然后再次检测到该线路。

The non-persistent method reduces the chance of collision because it is unlikely that two or more stations will wait for the same amount of time since it’s random and retry to send simultaneously.

非持久方法减少了冲突的可能性，因为两个或更多的站不太可能会等待相同的时间，因为它是随机的，然后尝试同时发送。

3) p-persistent method

3)p持久方法

The p-persistent method is used if the channel is slotted in time slots with a slot duration equal to or greater than the maximum propagation time. the p-persistent method reduces the chance of collision and improves efficiency. In this method, after the station finds the channel idle it follows these following steps:

如果信道在时隙持续时间等于或大于最大传播时间的时隙中进行时隙分配，则使用p-persistent方法 。 p持久方法减少了碰撞的机会并提高了效率。在此方法中，站点发现信道空闲后，请执行以下步骤：

With probability p, the station sends its frame.
站以概率p发送其帧。
With probability q = 1 -p, the station waits for the beginning of the next time slot and checks the line again.
当概率q = 1 -p时 ，站等待下一个时隙的开始并再次检查线路。
1. If the line is idle, it goes to step 1.
2. Aloha.Aloha这样的退避过程。

References:

参考文献：