arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.0531cs.NIcs.ITmath.IT
收藏

带存储器的媒体访问控制协议

Medium Access Control Protocols With Memory

Jaeok Park, Mihaela van der Schaar

摘要:

许多现有的媒体访问控制(MAC)协议利用过去的信息(例如,传输尝试的结果)来调整用户的传输参数。本文提供了一个通用的框架来表达和评估分布式MAC协议,利用有限长度的内存为给定形式的反馈信息。我们定义协议的背景下,一个时隙的随机接入网络的饱和到来的内存。我们引入了两个性能指标,吞吐量和平均延迟,并制定的问题,找到一个最佳的协议。我们首先表明,TDMA的结果,这是最好的结果,在所考虑的情况下,可以得到一个过渡期后,通过一个协议与(N-1)-插槽内存,其中N是用户的总数。接下来,我们使用马尔可夫链和数值方法分析了具有1时隙存储器的协议的性能。具有1槽存储器的协议可以实现任意接近1的吞吐量(即,100%的信道利用率)。最后,我们将我们的框架应用于无线局域网。

英文摘要:

Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information. We define protocols with memory in the context of a slotted random access network with saturated arrivals. We introduce two performance metrics, throughput and average delay, and formulate the problem of finding an optimal protocol. We first show that a TDMA outcome, which is the best outcome in the considered scenario, can be obtained after a transient period by a protocol with (N-1)-slot memory, where N is the total number of users. Next, we analyze the performance of protocols with 1-slot memory using a Markov chain and numerical methods. Protocols with 1-slot memory can achieve throughput arbitrarily close to 1 (i.e., 100% channel utilization) at the expense of large average delay, by correlating successful users in two consecutive slots. Finally, we apply our framework to wireless local area networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑