In this paper, we investigate the problem of link-level resource provisioning in multi-radio multi-channel (MRMC) wireless networks. A robust channel assignment algorithm is proposed that explicitly takes into consideration link-level demands. Our solution approach utilizes the dual decomposition[11] and Gibbs sampler techniques, which effectively incorporate the channel allocation (combinatori...

AbstrAct In this paper, a novel prediction technique is proposed, which uses road topology information for prediction. The proposed scheme uses real time positioning information and road topology information, which matches with the real environment. The scheme uses flexible channel assignment to maintain a better tradeoff between forced termination and call blocking probabilities. For reservati...

One of the fundamental issues in the operation of a mobile communication system is the assignment of channels to cells and to calls. Since the number of channels allocated to a mobile communication system is limited, efficient utilization of these communication channels by using efficient channel assignment strategies is not only desirable but also imperative. This paper presents a novel approa...

The CSMA/CA based random channel access mechanisms in Wireless Mesh Networks(WMNs), IEEE 802.11 DCF and EDCA, are inefficient to eliminate effectively hidden terminal and exposed terminal problems in multi-hop scenarios. In this paper, we propose efficient channel assignment and routing protocols for multi-radio multi-channel (MRMC) wireless mesh networks. These set of protocols are based on La...

Campus and enterprise wireless networks are increasingly characterized by ubiquitous coverage and high traffic demands. An efficient channel assignment of access points (APs) in these networks has the potential to greatly improve wireless LAN performance. Therefore, previous studies have investigated methods for determining effective channel assignments. Existing approaches, however, do not ada...

This study focuses on two issues: parametric modeling of the channel and index assignment of codevectors, to design a vector quantizer that achieves high robustness against channel errors. We first formulate the design of a robust zero-redundancy vector quantizer as a combinatorial optimization problem leading to a genetic search for a minimum-distortion index assignment. Performance is further...

We consider a cell-free Massive multiple-input multiple-output (MIMO) system and investigate the system performance for the case when the quantized version of the estimated channel and the quantized received signal are available at the central processing unit (CPU), and the case when only the quantized version of the combined signal with maximum ratio combining (MRC) detector is available at th...

A new channel assignment algorithm using a modiied Hoppeld neural network is proposed. The channel assignment problem is formulated as an energy minimization problem that is implemented by a modiied discrete Hoppeld network. Also a new technique to escape local minima is introduced. The interconnection weights between the neu-rons are designed in such a way that each neuron receives inhibitory ...

The channel-assignment problem is important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal channel-assignment problem has become increasingly important. The goal of this problem is to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. This algorithm co...

The eeciency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are veriied by extensive simulations.