Virtual cellular networks for non-uniformly distributed base stations

Cellular communications have experienced an explosive growth recently. In order to accommodate more subscribers, cells need to be split into smaller ones to make more efficient use of the limited frequency spectrum allocation. As a result the cell size in one area may be different from the cell size in another area. For example, in a well-populated city, the cell size may be smaller than the cell size in a rural area. Although a lot of research on cellular networks has been reported in the literature, they all assume a cellular network with a uniform cell size. To study a cellular network with non-uniform cell sizes, one approach is to design a virtual cellular network with a uniform cell size such that each virtual cell contains at most one base station. This paper has proposed a novel concept referred to as projection locus that can be used to construct a virtual cellular network for non-uniformly distributed base stations. The constructed virtual cellular network can be in the form of mesh or honeycomb. Both forms of virtual cellular networks are optimal in the sense that their corresponding uniform cell sizes reach the largest possible.

[1]  Yi-Bing Lin Reducing location update cost in a PCS network , 1997, TNET.

[2]  M. Rahnema,et al.  Overview of the GSM system and protocol architecture , 1993, IEEE Communications Magazine.

[3]  Kenneth Steiglitz,et al.  Optimization of wireless resources for personal communications mobility tracking , 1995, TNET.

[4]  Sami Tabbane,et al.  An Alternative Strategy for Location Tracking , 1995, IEEE J. Sel. Areas Commun..

[5]  Uyless Black Mobile and wireless networks , 1996 .

[6]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[7]  Keqin Li,et al.  Optimal dynamic mobility management for PCS networks , 2000, TNET.

[8]  Jun Li,et al.  Handoff and Location Management in Mobile ATM Networks , 1997 .

[9]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[10]  Ian F. Akyildiz,et al.  Movement-based location update and selective paging for PCS networks , 1996, TNET.

[11]  Jingyuan Zhang A cell ID assignment scheme and its applications , 2000, Proceedings 2000. International Workshop on Parallel Processing.

[12]  Ian F. Akyildiz,et al.  Mobile user location update and paging under delay constraints , 1995, Wirel. Networks.

[13]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1995, Wirel. Networks.

[14]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[15]  Xian Zhou,et al.  Locating Strategies for Personal Communication Networks: A Novel Tracking Strategy , 1997, IEEE J. Sel. Areas Commun..

[16]  Keqin Li,et al.  Optimal dynamic location update for PCS networks , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).