We consider the design of efficient channel allocation algorithms in personal communication networks (PCN) where the cells have varying traffic loads. A common communication channel is to be dynamically shared between the cells. We propose a distributed intercell channel allocation policy that is easy to implement through the use of simple signaling between neighboring cells. For cells arranged in a line, we show that the proposed policy achieves maximum throughput. The same is true when the cells are arranged in a circle and the frequency reuse distance is 2, while for larger reuse distances and planar hexagonal arrays, the policy may not always achieve maximal throughput. For general circular arrays, we enhance the policy to achieve maximal throughput asymptotically as the number of cells increases. For planar hexagonal arrays, we show that the policy can guarantee throughputs which are fairly close to maximal.
展开▼
