会议专题

Bandwidth Guaranteed Scheduling and Shortest Path Routing in Wireless Mesh Networks

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.

bandwidth routing wireless mesh networks

Zeng Ziming Zhang Liyi

School of Information Management, Wuhan University Wuhan 430072, P.R.China

国际会议

第三届IEEE无线通讯、网络技术暨移动计算国际会议

上海

英文

2007-09-21(万方平台首次上网日期,不代表论文的发表时间)