### Abstract

In an earlier paper by Akyildiz et al., it is shown how to classify cell types in a cellular network based on the random walk model; the number of states is reduced from a naive classification of (3n ^{2}+3n-5) to n(n+1)/2 in a hexagonal configuration, where n is the number of layers of cells. By using a reflection relation, this paper shows that the number of states can be further reduced to (n + 1)(n + 3)/4 if n is odd, and n(n + 4)/4 if n is even. These numbers are about half of that of Akyildiz et al. Simulation experiments indicate that our approach significantly reduces the computational costs in the related probability derivation.

Original language | English |
---|---|

Pages (from-to) | 337-339 |

Number of pages | 3 |

Journal | IEEE Communications Letters |

Volume | 5 |

Issue number | 8 |

DOIs | |

State | Published - 1 Aug 2001 |

### Keywords

- Cellular network
- Location management
- Personal communication services (PCS)
- Random walk
- Wireless communication

## Fingerprint Dive into the research topics of 'An improved cell type classification for random walk modeling in cellular networks'. Together they form a unique fingerprint.

## Cite this

Tseng, Y-C., & Hung, W. N. (2001). An improved cell type classification for random walk modeling in cellular networks.

*IEEE Communications Letters*,*5*(8), 337-339. https://doi.org/10.1109/4234.940984