Heterogeneous Base Station Placement for Wireless Networks

Abstract

The base station (BS) deployment planning is become more complex for the next-generation wireless networks, which is an architecture with multi-tier topology. The multiple coexist networks are deployed to serve different kinds of mobile users that their traffic requirements and moving speeds are different. Thus, in this paper, we discuss how to deploy the heterogenous BSs that support different service ranges, costs, speeds, capacities, and delay requirements with budgetary limit. The problem is formulated as an integer non-linear programming problem. Accordingly, we proposed some placement algorithms (i.e., Lagrangean Relaxation and simulated annealing approaches) to give a deployment strategy based on constructed BSs to minimize the total deployment cost under the satisfaction of user requirements. The experiment results show the heuristics based on the cost per unit of service point is the best than other two methods.