Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks

✍ Scribed by Yajun Li; Liang Zhou; Yuhang Yang; Han-Chieh Chao

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 583 KB
• Volume: 53
• Category: Article
• ISSN: 0895-7177
• DOI: 10.1016/j.mcm.2010.03.030

✦ Synopsis

In Wireless Mesh Networks (WMN), the optimal routing of data depends on the link capacities which are determined by link scheduling. The optimal performance of the network, therefore, can only be achieved by joint routing and scheduling optimization. Although the joint single-path routing and scheduling optimization problem has been extensively studied, its multi-path counterpart within wireless mesh networks has not yet been fully investigated. In this paper, we present an optimization architecture for joint multi-path QoS routing and the underlying wireless link scheduling in wireless mesh networks. By employing the contention matrix to represent the wireless link interference, we formulate a utility maximization problem for the joint multi-path routing and MAC scheduling and resolve it using the primal-dual method. Since the multi-path routing usually results in the non-strict concavity of the primal objective function, we first introduce the Proximal Optimization Algorithm to get around such difficulty. We then propose an algorithm to solve the routing subproblem and the scheduling subproblem via the dual decomposition. Simulations demonstrate the efficiency and correctness of our algorithm.