Effect of Random Assigning of Initial Contention Window Value on Performance of Persistent Relay CSMA with and without Binary Exponential Backoff Algorithm
Effect of Random Assigning of Initial Contention Window Value on Performance of Persistent Relay CSMA with and without Binary Exponential Backoff Algorithm
复制标题
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
K. Sakakibara;Naoya Yoda;Kento Takabayashi
中科院分区：
文献类型：
--
作者：
K. Sakakibara;Naoya Yoda;Kento Takabayashi
基于IEEE 802.11分布式协调功能（DCF），提出了一种用于多个中继节点协作传输的持久中继载波侦听多址接入（PRCSMA）。我们提出了随机分配的初始竞争窗口（CW）值的每个中继节点在PRCSMA合作阶段的开始，并评估其性能与不二进制指数Baskoff（BEB）算法。每个中继节点独立地并且随机地在预定义的整数集合中选择其初始CW值，而在原始PRCSMA中，中继节点将其CW值固定为公共给定整数。计算机仿真结果表明，该协议能有效地提高原PRCSMA的性能。该协议可以减少中继节点之间的帧冲突的可能性，并成功地减少合作的持续时间。此外，结果表明，BEB算法对于PRCSMA是低效的，因为它在帧传输首次成功之前引入了冗余空闲时隙和更多的冲突时隙
Based on IEEE 802.11 Distributed Coordination Function (DCF), Persistent Relay Carrier Sense Multiple Access (PRCSMA) was proposed for cooperative transmission with two or more relay nodes. We propose random assigning of the initial Contention Window (CW) value of each relay node at the beginning of cooperation phase in PRCSMA and evaluate its performance with and without binary exponential baskoff (BEB) algorithm. Each relay node independently and randomly selects its initial CW value among a predefined set of integers, while in the original PRCSMA, a relay node fixes its CW value to a common given integer. Numerical results obtained from computer simulation reveal that the proposed protocol can improve the performance of the original PRCSMA. The proposed protocol makes it possible to reduce the possibility of frame collisions among relay nodes and successfully reduce the duration of cooperation. Also, the results demonstrate that the BEB algorithm is inefficient for PRCSMA, since it introduces redundant idle slots and more collision slots before the first success of frame transmission