Multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) achieve higher throughput using multiple simultaneous transmissions and receptions. However, due to limited number of non-overlapping channels, such networks suffer from co-channel interference, which degrades their performance. To mitigate co-channel interference, effective channel assignment algorithms (CAAs) are desired. In this ...

In this paper we have considered a wireless mobile network with data/voice traffic. The paper, considered two type of channel assignment (1) with guard channel (2) without guard channel. In cellular mobile system, radio channels are very limited and mobility of mobile terminal occurs a phenomenon called handoff. Handoff is defined as process of transferring an ongoing call or data session from ...

A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a problem of covering the demand in a cellular network by pre-assigned blocks of cells, called tiles. This tile cover approach is applied to networks with a cosite constraint and two different constraints between cells. New bounds are derived u...

In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of call requests per cell is continually changing, making channel assignment naturally an online problem. We describe two new online channel assignment algorithms for networks based on a regular hexagonal layout of cells, where interference level...

It has been long recognized that the interference among concurrent wireless transmissions plays a crucial role in limiting the performance of wireless networks. Recently, studies indicate that equipping nodes with multiple radios and operating these radios on multiple frequency channels can greatly enhance the capacity of wireless networks. On the other hand, to fully realize the benefits of mu...

This study points to an automatic channel assignment for unadministrated, chaotic WLANs to take advantage on the given capacity of the IEEE 802.11 frequency spectrum and to enhance the quality of the entire WLAN sphere. This paper determines four public channel assignment algorithms for IEEE 802.11 networks. We show the problem of channel assignment in unadministrated WLANs and describe each al...

A number of graph coloring problems have their roots in a communication problem known as the channel assignment problem. The channel assignment problem is the problem of assigning channels nonnegative integers to the stations in an optimal way such that interference is avoidedas reported by Hale 2005 . Radio k-coloring of a graph is a special type of channel assignment problem. Kchikech et al. ...

In the channel assignment problem, frequencies are assigned to the requested calls in a cellular mobile network subject to electromagnetic compatibility constraints such that a required bandwidth is minimized. In this paper, a new method based on genetic algorithm is proposed to solve these problems. The performance of the proposed method is evaluated by solving 3 channel assignment problems. R...