YV Must - Academia.edu (original) (raw)

Related Authors

Hop Dinh

Aymen Mohammed Khodayer Al-Dulaimi

Makrand Wangikar

Shen Wan

Montana State University - Bozeman

Dr. Anuj  Gupta

IJSRD - International Journal for Scientific Research and Development

Uploads

Papers by YV Must

Research paper thumbnail of Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks

IEEE Transactions on Mobile Computing, 2008

In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped w... more 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.

Research paper thumbnail of Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks

IEEE Transactions on Mobile Computing, 2008

In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped w... more 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.

Log In