An improved random walk model for PCS networks

We propose an improvement to a random walk model for personal communications services networks with hexagonal configuration. The number of states required is reduced from n(n + 1)/2 to (n/sup 2/ + 2n + 4)/4 if n is even, and to (n/sup 2/ + 2n + 5) /4 if n is odd, where n is the layers of a cluster.