Gateway selection and routing in wireless mesh networks

TY - JOUR

T1 - Gateway selection and routing in wireless mesh networks

AU - Papadaki, Katerina

AU - Friderikos, Vasilis

PY - 2010/2/15

Y1 - 2010/2/15

N2 - This paper deals with issues regarding network planning and optimization in multi-hop wireless mesh networks (WMNs). The central focus is on mathematical programming formulations for both the uncapacitated and capacitated joint gateway selection and routing (U/C-GSR) problem in WMNs, which are in general NP-complete, when expressed as decision problems. We detail a reformulation using the shortest path cost matrix (SPM) and prove that it gives the optimal solution when applied to the uncapacitated case. We extend the SPM formulation to the capacitated case and show computationally, by using a lower bound on the optimal solution, that it performs within a small optimality gap. Evidence from numerical investigations shows that, the proposed formulation can dramatically improve the computation time for WMNs with realistic network sizes Furthermore, a set of extensions to the basic formulation is detailed to allow modeling issues such as multi-rate transmission, restricting the number of hops in each routing sub-tree and declaring unreliable nodes as leaf nodes in the routing tree. (C) 2009 Elsevier B V All rights reserved.

AB - This paper deals with issues regarding network planning and optimization in multi-hop wireless mesh networks (WMNs). The central focus is on mathematical programming formulations for both the uncapacitated and capacitated joint gateway selection and routing (U/C-GSR) problem in WMNs, which are in general NP-complete, when expressed as decision problems. We detail a reformulation using the shortest path cost matrix (SPM) and prove that it gives the optimal solution when applied to the uncapacitated case. We extend the SPM formulation to the capacitated case and show computationally, by using a lower bound on the optimal solution, that it performs within a small optimality gap. Evidence from numerical investigations shows that, the proposed formulation can dramatically improve the computation time for WMNs with realistic network sizes Furthermore, a set of extensions to the basic formulation is detailed to allow modeling issues such as multi-rate transmission, restricting the number of hops in each routing sub-tree and declaring unreliable nodes as leaf nodes in the routing tree. (C) 2009 Elsevier B V All rights reserved.

U2 - 10.1016/j.comnet.2009.04.017

DO - 10.1016/j.comnet.2009.04.017

M3 - Article

VL - 54

SP - 319

EP - 329

JO - COMPUTER NETWORKS

JF - COMPUTER NETWORKS

IS - 2

ER -