DISTRIBUTED CHANNEL ALLOCATION FOR PCN WITH VARIABLE-RATE TRAFFIC

We consider the design of efficient channel allocation algorithms in p ersonal communication networks (PCN) where the cells have varying traf fic loads, A common communication channel is to be dynamically shared between the cells, We propose a distributed intercell channel allocati on policy that is easy to implement through the use of simple signalin g between neighboring cells. For cells arranged in a line, we show tha t the proposed policy achieves maximum throughput, The same is true wh en the cells are arranged in a circle and the frequency reuse distance is 2, white for larger reuse distances and planar hexagonal arrays, t he policy may not always achieve maximal throughput, For general circu lar arrays, we enhance the policy to achieve maximal throughput asympt otically as the number of cells increases, For planar hexagonal arrays , we show that the policy can guarantee throughputs which are fairly c lose to maximal.