New applications of computational geometry and graph theory to cellular mobile communications

Author

Tamura, Hiroshi ; Sengoku, Masakazu ; Shinoda, Shoji

Author_Institution

Niigata Inst. of Technol., Kashiwazaki, Japan

fYear

1996

fDate

18-21 Nov 1996

Firstpage

199

Lastpage

202

Abstract

Various problems exist to which computational geometry and graph and network theory are applicable in mobile communication services. For example, it is well known that the coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we show some examples of new applications of computational geometry and graph theory to cellular mobile communications

Keywords

cellular radio; code division multiple access; computational geometry; frequency allocation; graph theory; land mobile radio; radio spectrum management; cellular CDMA systems; cellular mobile communications; channel assignment algorithms; coloring algorithms; computational geometry; graph partitioning problem; graph theory; largest empty circle problem; location registration area; optimal base station location; Base stations; Cellular networks; Communications technology; Computational geometry; Graph theory; Mobile communication; Mobile computing; Multiaccess communication; Network theory (graphs); Personal communication networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1996., IEEE Asia Pacific Conference on

Conference_Location

Seoul

Print_ISBN

0-7803-3702-6

Type

conf

DOI

10.1109/APCAS.1996.569253

Filename

569253