In recent years there is a growing effort to provide learning algorithms for spectrum collaboration. In this paper we present a medium access control protocol which allows spectrum collaboration with minimal regret and high spectral efficiency in highly loaded networks. We present a fully-distributed algorithm for spectrum collaboration in congested ad-hoc networks. The algorithm jointly solves both the channel allocation and access scheduling problems. We prove that the algorithm has an optimal logarithmic regret. Based on the algorithm we provide a medium access control protocol which allows distributed implementation of the algorithm in ad-hoc networks. The protocol utilizes single-channel opportunistic carrier sensing to carry out a low-complexity distributed auction in time and frequency. We also discuss practical implementation issues such as bounded frame size and speed of convergence. Computer simulations comparing the algorithm to state-of-the-art distributed medium access control protocols show the significant advantage of the proposed scheme.
翻译:近年来,人们日益努力为频谱合作提供学习算法。在本文件中,我们提出了一个中等访问控制协议,允许在高度装载的网络中进行最小遗憾和高光谱效率的频谱合作;我们为拥挤的特设网络中的频谱合作提供了完全分布的算法。该算法共同解决了频道分配和访问时间安排问题。我们证明,该算法具有最佳的对数遗憾。根据这一算法,我们提供了一种中等访问控制协议,允许在临时网络中以分布方式实施算法。协议利用单一渠道的机会性载体传感进行一个按时间和频率分布的低复杂性拍卖。我们还讨论了诸如约束框架大小和趋同速度等实际实施问题。计算机模拟将算法与最新且分布的媒体访问控制协议进行比较,显示了拟议计划的重大优势。