退避算法的定义

退避算法：

    退避算法是在在单个信道的基于竞争的介质的一种访问控制（MAC）协议。每当一个以上的节点在同一时刻试图访问介质的时候，它会导致分组碰撞。如果相撞的节点试图再次访问信道，在节点做及时同步的时候数据包将发生碰撞。因此，节点需要时间位差。为了产生这种位差，退避算法（例如二进制指数退避（BEB）） 。例如，在BEB算法中，每当一个节点的传输涉及在与另一个节点的传输发生碰撞，两个节点都将选择一个随机的等待时间，在下次再次尝试前需要等待选择的随机时间。如果他们在这样的尝试都没有成功，他们自己的竞争窗口增加一倍，在发射前再次选择等待一个随机时间。这个过程将被重复一定次数的尝试。如果经过数次尝试之后都失败了，那么其传输的数据包将被从传输队列中移除。

原文详见：

In a single channel contention based medium access control (MAC) protocols, whenever more than one station or node tries to access the medium at the same instant of time, it leads to packet collisions. If the collided stations tries to access the channel again, the packets will collide as the nodes are synchrozied in time. So the nodes need to be displaced in time. To displace them temporally, a backoff algorithm is used (example binary exponential backoff (BEB)). For example, in BEB algorithm, whenever a node's transmission is involved in a collision with another node's transmission, both nodes will choose a random waiting time and wait for this amoiunt of time before attempting again. If they are not successful in this attempt, they double their contention window and choose a randoim waiting time before transmitting again. This process will be repeated for certain number of attempts. If the nodes are not successful in their transmission after this limit, the packets will be dropped from their queue.