Loading [MathJax]/extensions/TeX/ieeemacros.js
Graph-Partition Based Fast Channel Assignment in Cellular Networks | IEEE Conference Publication | IEEE Xplore

Graph-Partition Based Fast Channel Assignment in Cellular Networks


Abstract:

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 Prob...Show More

Abstract:

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.
Date of Conference: 09-13 December 2019
Date Added to IEEE Xplore: 27 February 2020
ISBN Information:

ISSN Information:

Conference Location: Waikoloa, HI, USA

References

References is not available for this document.