Share Email Print
cover

Proceedings Paper

A fault-tolerant fully adaptive routing algorithm for collaborative computing in wireless mesh networks
Author(s): Cao Liang; Xin-Ming Huang; Jing Ma
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 9 April 2007
PDF: 10 pages
Proc. SPIE 6576, Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks V, 657612 (9 April 2007); doi: 10.1117/12.721619
Show Author Affiliations
Cao Liang, Worcester Polytechnic Institute (United States)
Xin-Ming Huang, Worcester Polytechnic Institute (United States)
Jing Ma, The MathWorks Inc. (United States)


Published in SPIE Proceedings Vol. 6576:
Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks V
Harold H. Szu; Jack Agee, Editor(s)

© SPIE. Terms of Use
Back to Top