Distributed channel allocation for PCN with bursty traffic

Abstract

Considers the design of efficient channel allocation algorithms in personal communication networks where the cells have varying traffic loads. A common communication channel is to be dynamically shared between the cells. The authors propose a distributed inter-cell channel allocation policy that is easy to implement through the use of simple signalling between neighboring cells. For cells arranged in a line they show that the proposed policy achieves maximum throughput. The same is true when the cells are arranged in a circle and the channel can be reused in every other cell. For larger reuse distances and planar hexagonal arrays, the policy may not always achieve maximal throughput. For these cases the authors provide regions of achievable cell throughputs under the proposed policy and show that they are tight in certain cases © Copyright 2009 IEEE - All Rights Reserved.