By Topic

Subspace approach to channel assignment in mobile communication networks

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 $31
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)
Lochtie, G.D. ; British Telecom Res. Labs., Ipswich, UK ; Mehler, M.J.

The problem of planning a mobile cellular radio network involves the allocation of channels to base stations so as to ensure that the network can carry sufficient traffic while avoiding interference conflicts. An optimum algorithm for this purpose would meet these constraints while allocating a minimum number of radio channels. The mathematical formulation of this problem reveals that it is a nondeterministic complete polynomial for which the time to solve scales exponentially with its size. The authors extend a technique previously used to address the travelling salesman problem. A method of solution is developed which analytically determines a valid subspace in which solutions must lie before an energy minimisation argument is applied. This approach is shown to simplify the solution technique and guarantees the traffic demand constraints are enforced

Published in:

Communications, IEE Proceedings-  (Volume:142 ,  Issue: 3 )