2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM) 2010
DOI: 10.1109/wowmom.2010.5534902
|View full text |Cite
|
Sign up to set email alerts
|

Utility-based channel assignment and topology control in wireless mesh networks

Abstract: Abstract-We define a utility-based framework for joint channel assignment and topology control in multi-rate multi-radio wireless mesh networks, and present a greedy algorithm for solving the corresponding optimization problem. Key features of the proposed approach are the support for different target objectives, which are expressed as utility functions of the MAC layer throughput, and the efficient utilization of wired network gateways, while guaranteeing that for every mesh node there exists a path to a gate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…Concurrent transmission in heterogeneous networks is optimized by throughput and fairness [Yang et al, 2010;Dionysiou et al, 2010]. Each of these approaches addresses the NP-hard optimization problem with different optimization criteria and specific optimization functions.…”
Section: One Of the Mathematical Optimization Methods Commonly Employmentioning
confidence: 99%
See 1 more Smart Citation
“…Concurrent transmission in heterogeneous networks is optimized by throughput and fairness [Yang et al, 2010;Dionysiou et al, 2010]. Each of these approaches addresses the NP-hard optimization problem with different optimization criteria and specific optimization functions.…”
Section: One Of the Mathematical Optimization Methods Commonly Employmentioning
confidence: 99%
“…MeTHODICAL includes a flexible address-interface mapping as it does not assume a one-to-one mapping, commonly found on earlier work in this area [Nacef and Montavont, 2008;Dionysiou et al, 2010;Lahde et al, 2010]. The one-to-one mapping considers that a physical interface has only a single address.…”
Section: Multihoming Aware Optimization Mechanismmentioning
confidence: 99%
“…On the other hand, assigning a common channel to all nodes reduces the available interfaces and the chance for more intelligent channel assignment, which is significant since practical mesh networks contain nodes with a few (typically 3-4) interfaces. The work in this paper also differs from our previous work [17] where channel assignment considered the per link throughput, rather than the e2e throughput of flows.…”
Section: Introductionmentioning
confidence: 95%
“…To maximize network utilization and minimizing traffic disruption, a polynomially bound online heuristic algorithm, DeSARA, is proposed in [43], which finds the CA for the current traffic demand by considering the existing CA of the network to minimize the reconfiguration overhead. In [44], the authors define a utility-based framework for joint CA and TC in MR-MC WMNs, and present a greedy algorithm for solving the corresponding optimization problem. Key features of the proposed approach are the support for different target objectives and the efficient utilization of wired network gateways.…”
Section: Channel Assignmentmentioning
confidence: 99%