TY - GEN
T1 - Minimum interference channel assignment in multi-radio wireless mesh networks
AU - Subramanian, Anand Prabhu
AU - Gupta, Himanshu
AU - Das, Samir R.
PY - 2007
Y1 - 2007
N2 - In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communication. We address the problem of assigning channels to communication links in the network with the objective of minimizing overall network interference. Since the number of radios on any node can be less than the number of available channels, the channel assignment must obey the constraint that the number of different channels assigned to the links incident on any node is atmost the number of radio interfaces on that node. The above optimization problem is known to be NP-hard. We design centralized and distributed algorithms for the above channel assignment problem. To evaluate the quality of the solutions obtained by our algorithms, we develop a semidefinite program formulation of our optimization problem to obtain a lower bound on overall network interference. Empirical evaluations on randomly generated network graphs show that our algorithms perform close to the above established lower bound, with the difference diminishing rapidly with increase in number of radios. Also, detailed ns-2 simulation studies demonstrate the performance potential of our channel assignment algorithms in 802.11 -based multi-radio mesh networks.
AB - In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communication. We address the problem of assigning channels to communication links in the network with the objective of minimizing overall network interference. Since the number of radios on any node can be less than the number of available channels, the channel assignment must obey the constraint that the number of different channels assigned to the links incident on any node is atmost the number of radio interfaces on that node. The above optimization problem is known to be NP-hard. We design centralized and distributed algorithms for the above channel assignment problem. To evaluate the quality of the solutions obtained by our algorithms, we develop a semidefinite program formulation of our optimization problem to obtain a lower bound on overall network interference. Empirical evaluations on randomly generated network graphs show that our algorithms perform close to the above established lower bound, with the difference diminishing rapidly with increase in number of radios. Also, detailed ns-2 simulation studies demonstrate the performance potential of our channel assignment algorithms in 802.11 -based multi-radio mesh networks.
UR - https://www.scopus.com/pages/publications/48049106224
U2 - 10.1109/SAHCN.2007.4292860
DO - 10.1109/SAHCN.2007.4292860
M3 - Conference contribution
AN - SCOPUS:48049106224
SN - 1424412684
SN - 9781424412686
T3 - 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON
SP - 481
EP - 490
BT - 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON
T2 - 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON
Y2 - 18 June 2007 through 21 June 2007
ER -