A Hybrid Algorithm for Antenna Placement in Cellular Networks

In a wireless cellular network, by shrinking cell sizes and increasing number of base station antennas, optimalplacement of antennas can yield significant savings. This paper proposes a hybrid simplex algorithm to minimize the maximum path loss experienced by wireless portable handsets. Five different floor plans are considered to compare performance of the proposed algorithm against the Quasi-Newton algorithm, as well as, the exhaustive search. Simulation results show that although the hybrid simplex algorithm is suboptimal, it has a good potential for finding better antenna placements, specially for larger floor plans.

Keywords:

Antenna placement , Cellular network , hybrid , K-Means , simplex , clustering