A handoff algorithm using pattern recognition
Dik Kin Wong, Donald C. Cox · 2002
Traditional handoff algorithms generally cannot keep both the average number of unnecessary handoffs and the handoff decision delay low. In making handoff decisions, they do not exploit the relative constancy of path loss and shadow fading effects at any given location around a base station. This information can in fact be used to improve the efficiency of handoff decision algorithms, as we do in our new handoff algorithms using pattern recognition. Handoff decision algorithms with both a negligible number of unnecessary handoffs and a negligible decision delay can therefore be realized. We compare the performance of our new algorithm with the traditional algorithms in the canonical handoff scenario, which has been extensively studied in the literature.