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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.