Abstract
This paper presents a distributed polynomial algorithm for ̄nding the maximum bandwidth path in Wireless Mesh Net- works (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 ̄rst distributed path calculation algorithm in WMNs.
| Original language | English |
|---|---|
| Pages | 353-354 |
| Number of pages | 2 |
| DOIs | |
| Publication status | Published - 2009 |
| Event | 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'09 - New Orleans, LA, United States Duration: 18 May 2009 → 21 May 2009 |
Conference
| Conference | 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'09 |
|---|---|
| Country/Territory | United States |
| City | New Orleans, LA |
| Period | 18/05/09 → 21/05/09 |
Keywords
- Distributed algo- rithms
- QoS routing
- Wireless mesh networks
Fingerprint
Dive into the research topics of 'Routing in multi-hop wireless mesh networks with bandwidth guarantees'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver