A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Routing in multi-hop wireless mesh networks with bandwidth guarantees
2009
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '09
Preserved Fulltext
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.
doi:10.1145/1530748.1530810
dblp:conf/mobihoc/HouLCYB09
fatcat:ujuufr7s3bfivjbv4oaptkp4za