Backtracking Based Handoff Rerouting Algorithm for WiMAX Mesh Mode
Reconstruct a new route for network services during the handoff process is a fundamental issue of wireless communication. This paper proposes a new rerouting algorithm to achieve a fast handoff based on k-hop backtracking mechanism. The algorithm can dynamically decide the backtracking hops according to the velocity of wireless devices and the current network bandwidth through iterative strategy. During the backtracking process, our algorithm is able to find out an optimized route for the handoff network services and require all intermediate nodes which has received the Location Update information forward all received packets to Mobile Terminal with their optimal route to the destination subscriber station. This will greatly reduce the cost of packet forwarding during the handoff process.
KeywordsTime Slot Receive Signal Strength Mobile Terminal Optimal Route Correspond Node
Unable to display preview. Download preview PDF.
- 1.IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access SystemsGoogle Scholar
- 2.Alexe, E., Mark, B.L.: Modeling and Analysis of Fast Handoff Algorithms for Microcellular Networks. In: IEEE/ACM MASCOTS 2002 (2002)Google Scholar
- 9.Min-hua, Y., Yu, L., Hui-min, Z.: The Mobile IP Handoff Between Hybrid Networks, IEEE PIMRC (2002)Google Scholar
- 11.Perkins, C.E.: IP mobility support, Request for Comments (RFC) 2002-2006Google Scholar