This paper presents a fully adaptive store-and-forward routing algorithm in wireless mesh networks (WMNs). In this
algorithm, each packet is assigned a specific turn scheme based on its source and destination locations. A full routing
adaptivity is achieved for every packet propagated in the network. The deadlock and livelock problems are addressed
and solved in this paper. A hierarchy routing structure is proposed to achieve deadlock freedom without introducing of
virtual channels or buffer pools. The simulation results show that the proposed routing scheme provides a better fault
tolerant performance in comparison with the conventional partially adaptive and dimensional ordered routing algorithms.
The system throughput is analyzed theoretically and then validated by the simulations.