MOTOROLA: MObility TOlerable ROute seLection Algorithm in wireless networks

In wireless networks, routing algorithms need to be tolerable to network dynamics. Existing route selection mechanisms suffer from a lack of considerations of stability and its induced routing overhead. Stabilities on route selection, traffic engineering and transmission schedule are fundamental issues in achieving a mobility-tolerable wireless network. In this study, the authors propose a mobility-tolerable paradigm (named `MOTOROLA`) in building a stable route level coordination algorithm for dynamic routing and scheduling. In MOTOROLA, mobility-awareness modules explore the mobility parameters and the link duration time, purely by adaptive beacon messages. Transitory links are mitigated based on threshold value of link duration. The route level resource allocation algorithm is also tolerable to network topology changes and the rescheduling costs are minimised in time scale. Analytical and simulation results show that because of mobility-awareness ability and route stability, MOTOROLA could improve network efficiency by transitory links` mitigation and coordinative route restoration.