By Topic

An optimal solution to the “Philadelphia” channel assignment problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Janssen, J.C.M. ; Dept. of Math. Stat. & Comput. Sci., Dalhousie Univ., Halifax, NS, Canada ; Kilakos, K.

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

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:48 ,  Issue: 3 )