多信道无线网状网路下近似最佳化之分散式具服务品质.ppt

NTU IM OPLAB A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Mesh Networks多信道無線網狀網路下近似最佳化之分散式具服務品質限制路由演算法 Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh Abstract For each mesh client, it is desirable to choose the route with low interference and minimum delay to access the Internet; however, this is suboptimal for the whole system. Channel assignment heuristic algorithm Distributed QoS constrained routing algorithm A routing metric which is composed of average cross-network packet delay and end-to-end delay and derived from a Lagrangean Relaxation based problem formulation. OSPF based protocol for dynamic routing K shortest paths and K fastest paths Problem Description The problem we addressed is to find out the arc weight form of each link while taking “system perspective” and “user perspective” into account The environment we considered here is a multichannel WMN which is one case of this generic formulation for illustration purpose In the multichannel WMN, the link capacity degrades due to the other links using the same channel in the interference range. Therefore, the link capacity is divided by the number of interference links in the following formulation (i.e., ) Problem Description Problem Description Notation of Given Parameters Notation of Decision Variables Problem Formulation Channel Assignment Heuristic Channel Assignment Heuristic Channel Assignment Heuristic Channel Assignment Heuristic Channel Assignment Heuristic Channel Assignment Heuristic Channel Assignment Heuristic Solution Approach for Multichannel WMN Formulation Subproblem 1 (related to decision variable ) Subproblem 2 (related to decision variable and ) Routing Metric The Arc Weight of Each Link Estimation of Routing Metric Parameters Perturbation Analysis ECHO packets A monotonically increasing and convex function to approximate Estimation of Routing Metric Parameters Dynamic