Title :
An optimal solution to the “Philadelphia” channel assignment problem
Author :
Janssen, J.C.M. ; Kilakos, K.
Author_Institution :
Dept. of Math. Stat. & Comput. Sci., Dalhousie Univ., Halifax, NS, Canada
fDate :
5/1/1999 12:00:00 AM
Abstract :
The Philadelphia problem is often used as a test problem in channel assignment research. Given a cellular network, the demand in each cell, and a number of interference constraints, the question is to determine the minimum span (number of consecutive channels) of any valid channel assignment. We present a solution to this problem by giving a theoretically obtained lower bound and a matching optimal assignment
Keywords :
cellular radio; channel allocation; optimisation; radio networks; radiofrequency interference; Philadelphia channel assignment problem; cellular network; consecutive channels; interference constraints; lower bound; matching optimal assignment; minimum span; optimal solution; Bandwidth; Cellular networks; Frequency conversion; Frequency division multiaccess; Interference constraints; Land mobile radio cellular systems; Mathematics; Radio transmitters; Telephony; Testing;
Journal_Title :
Vehicular Technology, IEEE Transactions on
