Results 211 to 220 of about 56,182 (260)

Channel Assignment in Honeycomb Networks

2003
The honeycomb grid is a network topology based on the hexagonal plane tessellation, which is convenient to model the regular placement on the plane of the base stations of wireless networks. For an efficient use of the radio spectrum in such networks, channels have to be assigned to the base stations so as to avoid interferences.
Alan A. Bertossi, Maria Cristina Pinotti, RIZZI, ROMEO, Anil M. Shende   +3 more
openaire   +3 more sources

Channel assignment on Cayley graphs

Journal of Graph Theory, 2010
Summary: We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if \(G\) is the Cayley graph of an \(n\)-generated group \(\Gamma \) with a certain kind of presentation, then \(\lambda (G;k, 1)\leq 2(k+n - 1)\).
openaire   +1 more source

Dynamic channel assignment with cumulative co-channel interference

ACM SIGMOBILE Mobile Computing and Communications Review, 2004
This paper studies the problem of centralized dynamic channel assignment (DCA) in wireless cellular systems under space and time-varying channel demand. The objective is to minimize the number of channels required to satisfy demand while also satisfying co-channel interference constraints.
Karen Daniels, Kavitha Chandra, Sa Liu, Sumit Widhani   +3 more
openaire   +1 more source

Channel segregation based dynamic channel assignment for WLAN

2012 IEEE International Conference on Communication Systems (ICCS), 2012
In a frequency reusing wireless local area network (WLAN), the co-channel interference (CCI) environment will change when new access points (APs) join the network. Therefore, the user throughput reduces if the available channels are not properly re-allocated.
Yuki Matsumura, Shinya Kumagai, Tatsunori Obara, Tetsuya Yamamoto, Fumiyuki Adachi   +4 more
openaire   +1 more source

Bounds on the expected optimal channel assignment in Rayleigh channels

2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2012
The channel assignment problem is highly important to OFDMA cognitive radio systems. Tight bounds on the optimal channel assignment are crucial for the performance evaluation of various channel assignment schemes. In this paper we derive the mean of the maximal sum rate channel assignment for i.i.d Rayleigh fading channels.
Oshri Naparstek, Amir Leshem
openaire   +1 more source

Channel Assignment with Ant Colony Optimization

2020
In wireless communication arise various forms of optimization problems including channel assignment problem. There are many possible ways to assign channels to wireless links and our goal is to find the assignment that minimizes channel interference. For that purpose we have developed an ant colony optimization algorithm based on general guidelines of ...
Marko Peras, Nikola Ivkovic
openaire   +2 more sources

Channel assignment for hierarchical cellular networks

2003 International Conference on Parallel Processing, 2003. Proceedings., 2003
In mobile telecommunications operation, radio channels are scarce resources and should be carefully assigned. One possibility is to deploy the hierarchical cellular network (HCN). We study a HCN channel assignment scheme called repacking on demand (RoD). RoD was originally proposed for wireless local loop networks.
Hsien-Ming Tsai, Ai-Chun Pang, Yung-Chun Lin, Yi-Bing Lin   +3 more
openaire   +1 more source

Priority Channel Assignment in Tandem DSI

IEEE Transactions on Communications, 1980
DSI (digital speech interpolation) is a technique for increasing the utilization of telephone transmission facilities by allocating transmission channels during intervals of active speech (talkspurts) only. The use of DSI for tandem connections, where DSI links are connected in cascade via circuit switching, poses a problem, however, since the voice ...
Mischa Schwartz, Kenichi Mase, Donald R. Smith   +2 more
openaire   +1 more source

Frequency Channel Assignment on Planar Networks

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 ?qp(G).
Michael Molloy 0001, Mohammad R. Salavatipour   +1 more
openaire   +1 more source

Graph labeling and radio channel assignment

Journal of Graph Theory, 1998
Given a graph and a set of constraints the authors find labelings of minimum span. Vertices of highly structured graphs can represent radio transmitters, hence the focus is on the infinite triangular, square and line lattices. Previously accepted practice can lead to suboptimal channel assignments.
Jan van den Heuvel, R. A. Leese, M. A. Shepherd   +2 more
openaire   +2 more sources