Location Problems of Base Stations in a Mobile Communication System and Computational Geometry

摘要

The demand for mobile communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime，anywhere and with anyone. There exist various problems to which computational geometry and graph ＆ 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 solve location problems of base stations in a mobile communication system like PHS (Personal Handy-phone System) using results of computational geometry.