A set theory approach to the channel assignment problem

A set-theory framework on the channel assignment problem is presented in this paper. This framework provides a uniform interpretation for the two classes of channel assignment approaches: (1) the centralized assignment based on a predetermined "channel separation matrix", being employed in cellular frequency planning, and (2) the distributed assignment based on actual interference measurements, typically used in cordless telephony. Based on the insights gained, we further propose several algorithms that can be applied to both approaches. A set of simulations is presented to compare our algorithms with some existing centralized assignment algorithms. It is found that our method performs well with a simple procedure that can be easily applied in a distributed fashion for dynamic channel assignment which is an important subject in radio resource management for the emerging personal communications.

[1]  M. Potter,et al.  Sets: An Introduction , 1990 .

[2]  Leonard J. Cimini,et al.  Distributed algorithms for dynamic channel allocation in microcellular systems , 1992, [1992 Proceedings] Vehicular Technology Society 42nd VTS Conference - Frontiers of Technology.

[3]  Kumar N. Sivarajan,et al.  Dynamic channel assignment in cellular radio , 1990, 40th IEEE Conference on Vehicular Technology.

[4]  R.J. McEliece,et al.  Channel assignment in cellular radio , 1989, IEEE 39th Vehicular Technology Conference.

[5]  Justin C. Chuang Autonomous adaptive frequency assignment for TDMA portable radio systems , 1991 .

[6]  A. Gamst,et al.  Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.

[7]  J. Zoeliner,et al.  A Breakthrough in Spectrum Conserving Frequency Assignment Technology , 1977, IEEE Transactions on Electromagnetic Compatibility.