当前位置: X-MOL 学术IEEE ACM Trans. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the Age of Information in a CSMA Environment
IEEE/ACM Transactions on Networking ( IF 3.7 ) Pub Date : 2020-02-24 , DOI: 10.1109/tnet.2020.2971350
Ali Maatouk , Mohamad Assaad , Anthony Ephremides

In this paper, we investigate a network where $N$ links contend for the channel using the well-known carrier sense multiple access scheme. By leveraging the notion of stochastic hybrid systems, we find: 1) a closed-form expression of the average age when links generate packets at will 2) an upperbound of the average age when packets arrive stochastically to each link. This upperbound is shown to be generally tight, and to be equal to the average age in certain scenarios. Armed with these expressions, we formulate the problem of minimizing the average age by calibrating the back-off time of each link. Interestingly, we show that the minimum average age is achieved for the same back-off time in both the sampling and stochastic arrivals scenarios. Then, by analyzing its structure, we convert the formulated optimization problem to an equivalent convex problem that we find its optimal solution. Insights on the interaction between links and numerical implementations of the optimized Carrier Sense Multiple Access (CSMA) scheme in an IEEE 802.11 environment are presented. Next, to further improve the performance of the optimized CSMA scheme, we propose a modification to it by giving each link the freedom to transition to SLEEP mode. The proposed approach provides a way to reduce the burden on the channel when possible. This leads, as will be shown in the paper, to an improvement in the performance of the network. Simulations results are then laid out to highlight the performance gain offered by our approach in comparison to the optimized standard CSMA scheme.

中文翻译:

CSMA环境中的信息时代

在本文中,我们调查了一个网络 $ N $ 链路使用众所周知的载波侦听多路访问方案竞争该信道。通过利用随机混合系统的概念,我们发现:1)当链接随意生成数据包时,平均寿命的闭式表达式2)当数据包随机到达每个链接时,平均寿命的上限。该上限通常显示为严格,在某些情况下等于平均年龄。有了这些表达式,我们通过校准每个链接的退避时间来制定最小化平均年龄的问题。有趣的是,我们表明,在抽样和随机到达场景中,在相同的退避时间下均达到了最低平均年龄。然后,通过分析其结构,将公式化的优化问题转换为找到其最优解的等效凸问题。本文介绍了在IEEE 802.11环境中优化的载波侦听多路访问(CSMA)方案的链路与数值实现之间的交互作用。接下来,为了进一步提高优化的CSMA方案的性能,我们提出了一种修改方案,即赋予每个链接自由过渡到SLEEP模式的能力。所提出的方法提供了一种在可能的情况下减轻信道负担的方法。如本文中将显示的那样,这将导致网络性能的提高。然后列出仿真结果,以突出我们的方法与优化的标准CSMA方案相比所提供的性能提升。为了进一步提高优化的CSMA方案的性能,我们提出了一种修改方案,即允许每个链接自由过渡到SLEEP模式。所提出的方法提供了一种在可能的情况下减轻信道负担的方法。如本文中将显示的那样,这将导致网络性能的提高。然后列出仿真结果,以突出我们的方法与优化的标准CSMA方案相比所提供的性能提升。为了进一步提高优化的CSMA方案的性能,我们提出了一种修改方案,即允许每个链接自由过渡到SLEEP模式。所提出的方法提供了一种在可能的情况下减轻信道负担的方法。如本文中将显示的那样,这将导致网络性能的提高。然后列出仿真结果,以突出我们的方法与优化的标准CSMA方案相比所提供的性能提升。
更新日期:2020-04-22
down
wechat
bug