Referenced Items are not available for this document.
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to interference. We study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests, and propose a shortest path routing based on k-shortest path with admission control. The results show our algorithm achieves good performance, and it effectively provides bandwidth guaranteed path for connection request.
Published in:
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Date of Conference: 21-25 Sept. 2007
- Page(s):
- 1705 - 1708
- Print ISBN:
- 978-1-4244-1311-9
- INSPEC Accession Number:
- 10046526
- Conference Location :
- Shanghai
- Digital Object Identifier :
- 10.1109/WICOM.2007.429
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
