Utilization and fairness in spectrum assignment for opportunistic spectrum access
Utilization and fairness in spectrum assignment for opportunistic spectrum access
复制标题
DOI：
10.1007/s11036-006-7322-y
复制
发表时间：
2006-08-01
影响因子：
3.8
通讯作者：
Zhao, Ben Y.
中科院分区：
文献类型：
--
作者：
Peng, Chunyi;Zheng, Haitao;Zhao, Ben Y.
频谱接入的开放频谱方法可以通过允许设备机会性地感知和利用可用频谱来实现接近最佳的利用。然而，简单的分布式频谱分配可能导致设备之间的显著干扰。在本文中，我们定义了一个通用的框架，定义了频谱接入问题的几个定义的整体系统效用。通过将分配问题简化为图着色问题的变体，我们证明了全局优化问题是NP难的，并通过顶点标记提供了一种通用的近似方法。我们研究了一个集中式的策略，其中一个中央服务器计算分配分配的基础上，全球知识，和一个分布式的方法，其中设备合作，以协商本地信道分配到全球优化。我们的实验结果表明，我们的分配算法可以显着减少干扰，提高吞吐量（多达12倍）。进一步的模拟表明，我们的分布式算法生成的分配分配质量类似于我们的集中式算法，使用全局知识，而在这个过程中产生的计算复杂性大大降低。
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive distributed spectrum assignment can lead to significant interference between devices. In this paper, we define a general framework that defines the spectrum access problem for several definitions of overall system utility. By reducing the allocation problem to a variant of the graph coloring problem, we show that the global optimization problem is NP-hard, and provide a general approximation methodology through vertex labeling. We examine both a centralized strategy, where a central server calculates an allocation assignment based on global knowledge, and a distributed approach, where devices collaborate to negotiate local channel assignments towards global optimization. Our experimental results show that our allocation algorithms can dramatically reduce interference and improve throughput (as much as 12-fold). Further simulations show that our distributed algorithms generate allocation assignments similar in quality to our centralized algorithms using global knowledge, while incurring substantially less computational complexity in the process.