An optimal solution to the "Philadelphia" channel assignment problem

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1999Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Vehicular Technology, volume 48, pages 1,012-1,014 (issn: 0018-9545,

Copyright policy )

Authors: J.C.M. Janssen; K. Kilakos;

doi: 10.1109/25.765037

An optimal solution to the "Philadelphia" channel assignment problem

- Summary
- Metrics

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.

Related Organizations

Dalhousie University
Canada
University of Montreal
Canada

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	11
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average