9 April 2007 A fault-tolerant fully adaptive routing algorithm for collaborative computing in wireless mesh networks
Author Affiliations +
Abstract
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Cao Liang, Xin-Ming Huang, Jing Ma, "A fault-tolerant fully adaptive routing algorithm for collaborative computing in wireless mesh networks", Proc. SPIE 6576, Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks V, 657612 (9 April 2007); doi: 10.1117/12.721619; https://doi.org/10.1117/12.721619
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT


Back to Top