An efficient methodology for optimal channel assignment of large and complex mobile radio networks

Ali, S.Z.; Turner, L.F.

doi:10.1109/vtc.2001.956626

Cited by 4 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The optimal solution of the problem is obtained only for particular cases [14]. In [15] a branch and bound algorithm is used, but this approach does not guarantee against the complete enumeration. For a large-scale system an approach for the optimal solution is impractical.…”

Section: Introductionmentioning

confidence: 99%

Analytical Approach for Channel Assignments in Cellular Networks

Shakhov

Choo

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the present paper channel assignments in cellular architectures are considered. This is quite important in cell and channel planning since reusing channels in cells allows to manage resources and to serve users effectively in the system. The optimal solution is offered here for the case of co-channel interference. Previous solutions on co-channel interference are based on regular hexagonal models for service areas. A novel technique is employed in this work that does not depend upon any geometric form of cells. It is obtained that the optimal number of channels equals the density of a special graph. Earlier analytical results on span minimization show lower bounds meanwhile we provide the upper bound in this paper.

show abstract

Section: Introductionmentioning

confidence: 99%