Graph-Partition Based Fast Channel Assignment in Cellular Networks
| Autor: | Houssem Eddine Hadji, Fen Zhou, Abderrezak Rachedi, Malika Babes |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Constraint (information theory)
Clique Computer science 0202 electrical engineering electronic engineering information engineering Benchmark (computing) Graph partition Cellular network 020206 networking & telecommunications 02 engineering and technology Interference (wave propagation) Topology Communication channel |
| Zdroj: | GLOBECOM |
| DOI: | 10.1109/globecom38437.2019.9013207 |
| Popis: | Channel assignment remains an important issue in cellular networks due to the limited frequency resource. In this paper, we study the Minimum Span Channel Assignment Problem (MS-CAP) in hexagonal cellular networks with k-band buffering restriction, where channel interference does not extend beyond k cells. The objective of MS- CAP is to minimize the max- imum frequency index used for accepting all the demands while respecting the frequency separation constraint. We start from deriving the optimal channel assignment strategies for distance- 2 clique cellular networks with homogeneous call demands, where cells are within a distance of two cells from each other. By partitioning the network into distance-2 cliques, we then further propose a time efficient algorithm GPCAA to solve the MS- CAP in large cellular networks with heterogeneous demands. Our method has been evaluated on the well-known benchmark instance Philadelphia cellular network. Numerical results show that the GPCAA algorithm outperforms its counterparts in the literature in terms of solution optimality and computing time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|