Graph theoretic or computational geometric research of cellular mobile communications

Author

Tamura, Hiroshi ; Sengoku, Masakazu ; Nakano, Keisuke ; Shinoda, Shoji

Author_Institution

Dept. of Inf. & Electron. Eng., Niigata Univ., Japan

Volume

6

fYear

1999

fDate

36342

Firstpage

153

Abstract

The demand fur communication services is rapidly increasing, because the mobile communication service is synonymous of an ideal communication style realizing communication in any time, any where and with anyone. There exist various problems to which computational geometry and graph and network theory is applicable in mobile communication services. For example, it is well known that coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we show new results in graph theoretic or computational geometric research of cellular mobile communications

Keywords

cellular radio; channel allocation; computational geometry; graph colouring; telecommunication network routing; cellular mobile communications; channel assignment algorithms; coloring algorithms; computational geometric research; computational geometry; graph theoretic research; ideal communication style; network theory; Base stations; Cellular networks; Communications technology; Computational geometry; Computer applications; Computer networks; Mobile communication; Multiaccess communication; Network theory (graphs); Terminology;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-5471-0

Type

conf

DOI

10.1109/ISCAS.1999.780118

Filename

780118