Results 211 to 220 of about 54,333 (259)

Random access channel assignment on a collision erasure channel

2020 Information Theory and Applications Workshop (ITA), 2020
Channel assignment for wireless radios employing random access is found in several contexts, including low-power wide area network (LPWAN) protocols such as LoRaWAN. This paper considers the assignment of a set of N radios to M available channels with the objective of maximizing the sum throughput.
Abhinanda Dutta, Steven Weber 0001
openaire   +1 more source

Channel assignment on strongly-simplicial graphs

Proceedings International Parallel and Distributed Processing Symposium, 2004
Given a vector ( 1; 2; : : : ; t) of non increasing pos- itive integers, and an undirected graph G = (V;E), an L( 1; 2; : : : ; t)-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that jf(u) -- f(v)j i, if d(u; v) = i; 1 i t; where d(u; v) is the distance (i.e. the minimum num- ber of edges) between the vertices
Alan A. Bertossi, Maria Cristina Pinotti, RIZZI, ROMEO   +2 more
openaire   +4 more sources

On the 2-Dimensional Channel Assignment Problem

IEEE Transactions on Computers, 1984
We consider the 2-dimensional channel assignment problem: given a set S of iso-oriented rectangles (whose sides are parallel to the coordinate axes), find a minimum number of planes (channels) to which only nonoverlapping rectangles are assigned. This problem is equivalent to the coloring problem of the rectangle intersection graph G = (V, E), in which
D. T. Lee, Joseph Y.-T. Leung
openaire   +2 more sources

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

An Optimal Solution for the Channel-Assignment Problem

IEEE Transactions on Computers, 1979
Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a Θ(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling.
Udaiprakash I. Gupta, D. T. Lee, Joseph Y.-T. Leung   +2 more
openaire   +2 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