Results 1  10
of
3,274
Channel Assignment Schemes for Cellular Mobile Telecommunication Systems
 IEEE Personal Communications
, 1996
"... This paper provides a detailed discussion of wireless resource and channel allocation schemes. We provide a survey of a large number of published papers in the area of fixed, dynamic and hybrid allocation schemes and compare their tradeoffs in terms of complexity and performance. We also investigat ..."
Abstract

Cited by 392 (1 self)
 Add to MetaCart
This paper provides a detailed discussion of wireless resource and channel allocation schemes. We provide a survey of a large number of published papers in the area of fixed, dynamic and hybrid allocation schemes and compare their tradeoffs in terms of complexity and performance. We also
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
, 2005
"... Multihop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their singlehop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using o ..."
Abstract

Cited by 443 (0 self)
 Add to MetaCart
orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of closeby transmissions; effective routing schemes can alleviate potential congestion on any gateways
Channel Assignment and . . .
, 2000
"... In cellular telephone networks, sets of radio channels (colors) must be assigned to transmitters (vertices) while avoiding interference. Often, the transmitters are laid out like vertices of a triangular lattice in the plane. We investigated the corresponding weighted coloring problem of assigning s ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In cellular telephone networks, sets of radio channels (colors) must be assigned to transmitters (vertices) while avoiding interference. Often, the transmitters are laid out like vertices of a triangular lattice in the plane. We investigated the corresponding weighted coloring problem of assigning
An Optimal Channel Assignment Scheme
, 2003
"... In this paper, we introduce an optimal channel assignment algorithm for two traffic classes: voice and data, which maintains predefined upper bounds on the dropping probabilities of both handoff transaction and handoff voice calls in cellular mobile networks. The proposed channel assignment scheme m ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper, we introduce an optimal channel assignment algorithm for two traffic classes: voice and data, which maintains predefined upper bounds on the dropping probabilities of both handoff transaction and handoff voice calls in cellular mobile networks. The proposed channel assignment scheme
Channel assignment and graph multicoloring
, 2002
"... Cellular data and communication networks are usually modeled as graphs with each node representing a base station in a cell in the network, and edges representing geographical adjacency of cells. The problem of channel assignment in such networks can be seen as a graph multicoloring problem. We surv ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Cellular data and communication networks are usually modeled as graphs with each node representing a base station in a cell in the network, and edges representing geographical adjacency of cells. The problem of channel assignment in such networks can be seen as a graph multicoloring problem. We
Random channel assignment in the plane
 Random Structures & Algorithms
, 2003
"... ABSTRACT: In the model for random radio channel assignment considered here, points corresponding to transmitters are thrown down independently at random in the plane, and we must assign a radio channel to each point but avoid interference. In the most basic version of the model, we assume that there ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
ABSTRACT: In the model for random radio channel assignment considered here, points corresponding to transmitters are thrown down independently at random in the plane, and we must assign a radio channel to each point but avoid interference. In the most basic version of the model, we assume
Frequency Channel Assignment on Planar
 Proc. ESA’02, LNCS
, 2002
"... For integers p q, a L(p; q)labeling of a network G is an integer labeling of the nodes of G such that adjacent nodes receive integers which differ by at least p, and nodes at distance two receive labels which differ by at least q. The minimum number of labels required in such labeling is q (G). Thi ..."
Abstract
 Add to MetaCart
). This arises in the context of frequency channel assignment in mobile and wireless networks and often G is planar. We show that if G is planar then 3 (2q \Gamma 1)\Delta + 12p + 144q \Gamma 78.
Channel assignment in cellular radio networks
 IEEE TRANS. VEH. TECHNOL
, 1993
"... We investigate algorithms based on simulated annealing to solve the channel assignment problem for cellular radio networks. The blocking probability of a network is chosen as the optimization criterion. In order to check the quality of the solutions obtained by simulated annealing, we examine some s ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
We investigate algorithms based on simulated annealing to solve the channel assignment problem for cellular radio networks. The blocking probability of a network is chosen as the optimization criterion. In order to check the quality of the solutions obtained by simulated annealing, we examine some
A Unified Framework and Algorithm for Channel Assignment
 in Wireless Networks”, Wireless Networks, Volume 5, Issue 2
, 1999
"... Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our framew ..."
Abstract

Cited by 150 (0 self)
 Add to MetaCart
Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our
Results 1  10
of
3,274