Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms

Capone, Antonio; Carello, Giuliana; Filippini, Ilario; Gualandi, Stefano; Malucelli, Federico

doi:10.1016/j.adhoc.2009.11.003

Cited by 111 publications

(99 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each link e ∈ E, N e u , N e 1 , N e 0 are mutually disjoint subsets of M and N e u ∪ N e 1 ∪ N e 0 = M. Moreover, |N e 1 | ≤ 1, and if N e 1 = {m e } then N e 0 = M \ {m e } and N e u = ∅. RMP(N ) is formulated as (5).…”

Section: Exact Optimization: Branch-and-pricementioning

confidence: 99%

“…A relevant mixed-integer programming model is given in [19]. Models and algorithms for joint optimization of rate adaptation with power control, channel assignment and routing are presented in [5,20,21].…”

Section: Related Workmentioning

confidence: 99%

“…The presented model is non-compact and can be solved exactly only through branch-and-price (B&P) -a standard integer programming approach applied in many optimization problems of wireless networks [11]. In our problem we need to generate the compatible set (a set of simultaneously active links) in B&P [5]. Unfortunately, B&P does not work efficiently for large networks in the considered problem setting due to the static way of using MCS.…”

Section: Introductionmentioning

confidence: 99%

“…We will use the notion of compatible set (see [5,6]) to represent a set of simultaneously active links that does not violate constraints (1) and (2) subsequently. In a compatible set C, each link is associated with a MCS m e (C), e ∈ C. Given a list of compatible set C i , i ∈ I (I = {1, 2, .…”

mentioning

confidence: 99%

See 3 more Smart Citations

Optimizing link rate assignment and transmission scheduling in WMN through compatible set generation

Pióro

Yuan

et al. 2015

Telecommun Syst

View full text Add to dashboard Cite

This requirement leads to a complicated exact branchand-price method, which is quite time-consuming for networks of practical size. Thus, we propose an original heuristic based on simulated annealing that utilizes specific characteristics of the problem. The method provides a balance between sub-optimality of the obtained solutions and the running time. The presented method is the main purpose and novelty of the paper. An extensive numerical study illustrates effectiveness of the proposed approach.

show abstract

Section: Exact Optimization: Branch-and-pricementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Optimizing link rate assignment and transmission scheduling in WMN through compatible set generation

Pióro

Yuan

et al. 2015

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…Also, optimization techniques have been extensively studied in the literature to, generally speaking, maximize the network capacity. Mixed-integer programming models related to WMN network optimization are treated in quite a large number of papers such as [9,10,11,14,21,23,41,50].…”

Section: Survey Of the Fieldmentioning

confidence: 99%

On max–min fair flow optimization in wireless mesh networks

et al. 2014

View full text Add to dashboard Cite

The paper is devoted to modeling wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots. Such MIP models are formulated for several cases of the modulation and coding schemes (MCS) assignment. We present a general way of solving the max-min fairness (MMF) traffic objective for WMN using the formulated capacity models. Thus the paper combines WMN radio link modeling with a non-standard way of dealing with uncertain traffic, a combination that has not, to our knowledge, been treated so far by exact optimization models. We discuss several ways, including a method based on the so called compatible or independent sets, of solving the arising MIP problems. We also present an extensive numerical study that illustrates the running time efficiency of different solution approaches, and the influence of the MCS selection options and the number of time slots on traffic performance of a WMN. Exact joint optimization modeling of the WMN capacity and the MMF traffic objectives forms the main contribution of the paper.

show abstract