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.
| Original language | English (US) |
|---|---|
| Title of host publication | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
| Editors | M.P. Farques, R.D. Hippenstiel |
| Publisher | IEEE Comp Soc |
| Pages | 630-634 |
| Number of pages | 5 |
| Volume | 1 |
| State | Published - 1998 |
| Event | Proceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) - Pacific Grove, CA, USA Duration: Nov 2 1997 → Nov 5 1997 |
Other
| Other | Proceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) |
|---|---|
| City | Pacific Grove, CA, USA |
| Period | 11/2/97 → 11/5/97 |
ASJC Scopus subject areas
- Hardware and Architecture
- Signal Processing
- Electrical and Electronic Engineering