Site Selection for Wireless Base Station Based on Map Partitioning

The problem to locate wireless base stations relates to how to make the best use of effectiveness, which is very important in the field of wireless communication engineering. This paper refers to the theories of graph partitioning, considering the number of covered vertex, the number of covered ranges and the gradient of density. We present a practical algorithm framework to solve the problem based on map partitioning. When considering the necessary conditions and optional conditions, our algorithm framework adopts the strategy of self adaptive divide and conquers. It works as three steps: divide and conquer map, check restraint conditions, and select locations. We conduct some experiments on Shanghai´s traffic map and show the good allocations results for wireless base station in Shanghai city.