A New Algorithm for Efficient Optimisation of Base Station Placement in Indoor Wireless Communication Systems

A new algorithm is proposed to efficiently find an optimal base station configuration for indoor CDMA networks from a set of potential base station sites. It considers both forward link and reverse link signal-to-interference ratio (SIR) constraints. The proposed algorithm is a combination of a heurisitc algorithm and selective brute force search. The heurisitc algorithm estimates the minimum number of base stations required to serve a set of mobiles. Brute force search analyzes forward link and reverse link SIR for the configurations, starting with the estimated minimum required number of base stations, to find the acceptable configurations and one optimal configuration. The proposed algorithm can be applied repeatedly to different sets of mobiles in an indoor system to find an overall optimal configuration. The efficiency of the proposed algorithm is compared with that of the branch and bound (B&B) algorithm and the genetic algorithm to find an optimal configuration.