On channel assignment problem in cellular networks

Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136) Pub Date : 1997-11-02 DOI:10.1109/ACSSC.1997.680521

T. Roxborough, S. Medidi, A. Sen

引用次数: 6

Abstract

The channel assignment problem in a mobile cellular network is considered in this paper. The cellular network is most often modelled as a graph and the channel assignment problem is formulated as the coloring problem of that graph. The channel assignment problem in its most general form is NP-complete. Prior studies assume that the graph modelling the cellular network is an arbitrary graph. However, we show that the graph modelling the cellular network has a very regular structure and exploiting this regular structure, the channel assignment problem can be solved optimally in many cases. We also present an integer linear programming formulation of the channel assignment problem.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

蜂窝网络中的信道分配问题

研究了移动蜂窝网络中的信道分配问题。蜂窝网络通常被建模为一个图，信道分配问题被表述为该图的着色问题。信道分配问题的最一般形式是np完全的。以往的研究假设蜂窝网络的图是任意图。然而，我们证明了蜂窝网络的图形建模具有非常规则的结构，并且利用这种规则结构，在许多情况下可以最优地解决信道分配问题。我们还提出了信道分配问题的一个整数线性规划公式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)

自引率

0.00%

发文量

期刊最新文献

A comparative study of multiple accessing schemes Self-affine modeling of speech signal in speech compression A progressive transmission image coder using linear phase paraunitary filter banks A canonical representation for distributions of adaptive matched subspace detectors Finite length equalization for FFT-based multicarrier systems-an error-whitening viewpoint