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

Title:
Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks
Source:
Telecommunications Software Engineering: Emerging Methods, Models and ToolsMathematical and computer modelling. 53(3-4):458-470
Publisher Information:
Kidlington: Elsevier, 2011.
Publication Year:
2011
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Optimisation et calcul variationnel numériques, Numerical methods in optimization and calculus of variations, Méthodes de calcul scientifique (y compris calcul symbolique, calcul algébrique), Methods of scientific computing (including symbolic computation, algebraic computation), Algorithme, Algorithm, Algoritmo, Analyse assistée, Computer aided analysis, Análisis asistido, Analyse numérique, Numerical analysis, Análisis numérico, Architecture ordinateur, Computer architecture, Arquitectura ordenador, Calcul variationnel, Variational calculus, Cálculo de variaciones, Maillage, Grid pattern, Celdarada, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Modèle mathématique, Mathematical model, Modelo matemático, Méthode décomposition, Decomposition method, Método descomposición, Méthode optimisation, Optimization method, Método optimización, Ordonnancement, Scheduling, Reglamento, Programmation mathématique, Mathematical programming, Programación matemática, Routage, Routing, Enrutamiento, 49XX, 65K10, 65Kxx, Convex optimization, Multi-path routing, QoS, Wireless mesh network
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai, China
UEI, ENSTA-Paris Tech, Paris, France
Institute of Computer Science and Information Engineering, National Ilan University, Ilan, Tawain, Province of China
ISSN:
0895-7177
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.23752440
Database:
PASCAL Archive

Weitere Informationen

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.