2007
DOI: 10.1109/twc.2007.060312
|View full text |Cite
|
Sign up to set email alerts
|

Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks

Abstract: Abstract-A multi-channel wireless mesh network (MC-WMN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
72
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 111 publications
(72 citation statements)
references
References 33 publications
(54 reference statements)
0
72
0
Order By: Relevance
“…Static CAs can be easily extended to be semidynamic [16][17][18][19][20][21][22][23][24][25][26] if the node refreshes the channels assigned to the radios on a regular time period. Semidynamic CAs adapt fast to the changes in the traffic pattern and the interference on the wireless medium from both internal and external sources.…”
Section: Figure 1 Multi-radio Wireless Mesh Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…Static CAs can be easily extended to be semidynamic [16][17][18][19][20][21][22][23][24][25][26] if the node refreshes the channels assigned to the radios on a regular time period. Semidynamic CAs adapt fast to the changes in the traffic pattern and the interference on the wireless medium from both internal and external sources.…”
Section: Figure 1 Multi-radio Wireless Mesh Networkmentioning
confidence: 99%
“…The routing has to be considered as a joint problem with the channel assignment [16,[18][19][20], since any change in the channel radio mapping affects the quality of the links between nodes and may trigger the routing protocol to reroute the traffic. On the other hand, the changes in the traffic pattern have an impact on the next decision of the channel assignment protocol.…”
Section: Routing Modificationsmentioning
confidence: 99%
“…Fairness in CA is the ability of the CA algorithms in organizing the overall traffic load between the nodes of the network [10].…”
Section: Fairnessmentioning
confidence: 99%
“…One approach is to formulate channel assignment problem as an optimization problem [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18]. Das et al [5] proposed an optimizationbased algorithm that maximizes the number of logical links that can be active simultaneously, subject to interference constraints.…”
Section: Introductionmentioning
confidence: 99%
“…Chen et al [6] devised a channel assignment strategy which assigns the channels in order to balance the traffic load between different channels. The algorithms in [5][6][7][8] are static and assign the channels permanently. There also exist some dynamic algorithms which update the assigned channels either in a short-term basis (e.g., packet-by-packet [9][10][11]) or a long-term basis (e.g., every several minutes or hours [12,13,15,16,14]).…”
Section: Introductionmentioning
confidence: 99%