15 search results - page 1 / 3 » Optimal Channel Assignments for Lattices with Conditions at ... |
IPPS
2005
IEEE
13 years 10 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
JCO
2007
13 years 4 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper, we propose a network coding using a lattice for the two-way relay channel with two nodes communicating bidirectionally through a relay, which we call modulo-andfo...
SIAMDM
2008
13 years 4 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
SECON
2008
IEEE
13 years 11 months ago
2008
IEEE
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...