2006 IEEE International Conference on Communications 2006
DOI: 10.1109/icc.2006.255061
|View full text |Cite
|
Sign up to set email alerts
|

Joint Optimal Channel Assignment and Congestion Control for Multi-channel Wireless Mesh Networks

Abstract: Abstract-The aggregate capacity of wireless mesh networks can be increased by the use of multiple channels. Stationary wireless routers are equipped with multiple network interface cards (NICs). Each NIC is assigned with a distinct frequency channel. In this paper, we formulate the Joint Optimal Channel Assignment and Congestion Control (JOCAC) as a decentralized utility maximization problem with constraints that arise from the interference of the neighboring transmissions. Unlike other previous work, the JOCA… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
40
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 57 publications
(40 citation statements)
references
References 17 publications
(30 reference statements)
0
40
0
Order By: Relevance
“…We would also have M lk ¼ 0 for any l 2 L and each k 2 L n flg. In fact, the capacity model in (8) is a special case of the capacity model in (22). Similar to (9), we can replace c l ðxÞ in problem (CACA) with (22) and obtain the complete formulation of our congestionaware channel assignment model.…”
Section: Exclusive Schedulingmentioning
confidence: 99%
See 2 more Smart Citations
“…We would also have M lk ¼ 0 for any l 2 L and each k 2 L n flg. In fact, the capacity model in (8) is a special case of the capacity model in (22). Similar to (9), we can replace c l ðxÞ in problem (CACA) with (22) and obtain the complete formulation of our congestionaware channel assignment model.…”
Section: Exclusive Schedulingmentioning
confidence: 99%
“…Various congestion measures can be considered. For example, following the steps in [22], we can show that the network utility maximization (NUM) problem [25][26][27][28] in the presence of elastic traffic sources can be reduced to solving problem (CACA) if k l denotes the congestion price on link l. In this case, the congestion prices depend on the transport-layer protocol is being used. For example, the congestion prices are queueing delay and packet loss probability for TCP Vegas [29] and TCP Reno [30], respectively.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…A joint routing and NIC assignment scheme is proposed in [21]. In [22], we formulate the joint channel assignment and congestion control as a utility maximization problem. The model is extended to incorporate network interface assignment and media access control in [23].…”
Section: Related Workmentioning
confidence: 99%
“…Load balancing is shown to be a proper objective for joint topology control and routing algorithms in optical networks [28]. Congestion aware capacity planning is also proposed for cross-layer congestion control designs in wireless ad-hoc [29] and mesh networks [22]. Maximizing δ min can also be justified in terms of providing fairness among the existing logical links.…”
Section: E Feasible Region and The Objective Functionmentioning
confidence: 99%