Routing in multi-hop wireless mesh networks with bandwidth guarantees

Authors:
Ronghui Hou;King-Shan Lui;Hon-Sun Chiu;Kwan L. Yeung;Fred Baker
Affiliations:
The University of Hong Kong, Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong, Hong Kong;The University of Hong Kong, Hong Kong, Hong Kong;Cisco System, San Jose, USA
Venue:
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Year:
2009

Citing 2
Cited 2

Interference-aware topology control and QoS routing in multi-channel wireless mesh networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Contention-Aware Admission Control for Ad Hoc Networks

IEEE Transactions on Mobile Computing

Complexity and design of QoS routing algorithms in wireless mesh networks

Computer Communications
Survey A survey of routing protocols for smart grid communications

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a distributed polynomial algorithm for finding the maximum bandwidth path in Wireless Mesh Networks (WMNs). Our proposed algorithm can be applied for designing the proactive hop-by-hop routing protocol with bandwidth guarantee. To the best of our knowledge, our work is the first distributed path calculation algorithm in WMNs.