k-Hop Backtracking Based Rerouting Algorithm for Handoff Processing

This paper proposes a rerouting scheme for handoff processing based on k-hop backtracking mechanism. The proposed scheme dynamically chooses the number of backtracking hops, k, according to the velocity of wireless devices and the current bandwidth of the network. During the backtracking of Location Update, the proposed scheme finds out the optimal common node in the link of original Subscriber Station and destination Subscriber Station, through which the new route from the Correspond node to mobile node can achieve the optimal route cost in k-hop backtracking range. Meanwhile, all intermediate nodes, on receiving Location Update, will forward packets to the destination Subscriber Station with its optimal route, which greatly reduces the cost of packets forwarding.