Two-state pattern-recognition handoffs for corner-turning situations

Handoff algorithms are used in wireless cellular systems to decide when and to which base station to handoff. Traditional handoff algorithms generally cannot keep both the average number of unnecessary handoffs and the handoff decision delay low. They do not exploit the relative constancy of path loss and shadow fading effects at any given location around a base station. However, handoff algorithms with both a negligible number of unnecessary handoffs and a negligible decision delay can be realized by exploiting this information. One example is the set of handoff algorithms using pattern-recognition introduced in previous work. In this paper, we describe how pattern-recognition handoff algorithms can be applied to the problem of turning a corner. This can be used as part of an integrated pattern-recognition handoff algorithm or together with a traditional handoff algorithm, in which case the pattern-recognition handles only the special cases like turning a corner