Performance of least squares path loss estimation handover algorithms

The performance of a new class of linear handover algorithms is analyzed in terms of the average number of outages and the average number of handovers, for a given trip of the mobile station. Assuming the distances between the mobile station and surrounding base stations are known, the new algorithm is based on the least squares estimate of path loss parameters of the various radio links. The results obtained by simulations of a general system scenario, which consists of several base stations and a mobile terminal moving along a generic path, show that the proposed algorithm provides better performance than the classical averaging algorithm. Moreover, the window length trade-off and the estimation of the mobile speed do not apply to the least square method