An optimal solution to the "Philadelphia" channel assignment problem

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 pre...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on vehicular technology Vol. 48; no. 3; pp. 1012 - 1014
Main Authors Janssen, J.C.M., Kilakos, K.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.05.1999
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Bandwidth
Cellular
Cellular communication
Cellular networks
Channels
Equipments and installations
Exact sciences and technology
Frequency conversion
Frequency division multiaccess
Interference
Interference constraints
Land mobile radio cellular systems
Lower bounds
Marketing
Matching
Mathematics
Mobile radiocommunication systems
Optimization
Radio transmitters
Radiocommunications
Telecommunications
Telecommunications and information theory
Telephony
Testing
Mobile radiocommunication
Frequency division multiple access
Lower bound
Cell network
Wireless telecommunication
Heuristic method
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0018-9545
1939-9359
DOI:10.1109/25.765037