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. In this paper, a new channel assignment algorithm using a modiied Hoppeld neural network is proposed. The channel assignment problem is formulated as an energy minimization problem th...

Wireless mesh networks gradually become the core of the next generation wireless networks technology and provide ubiquitous network connectivity to Internet. However, in the process of transmission, wireless interference severely limits network capacity. Therefore, many channel assignment algorithms are recently proposed for WMNs to improve the overall network capacity, but most of them make an...

We present a polynomial time improvement of the linear channel pin assignment LCPA algorithms presented by Cai and Wong in 1990. We solve the LCPA problem according to minimum channel density under a special priority schedule subject to vertical constraints and ux. The priority driven linear channel pin assignment algorithm (PDCPA) reduces the channel height by an average of 17 % without increa...

The demand for mobile communication has been steadily increasing in recent years. With the limited frequency spectrum, the problem of channel assignment becomes increasingly important, i.e., how do we assign the calls to the available channels so that the interference is minimized while the demand is met? This problem is known to belong to a class of very difficult combinatorial optimization pr...

We have proposed a new ultra-compact optical demultiplexer based on metal-insulator-metal plasmonic waveguides aperture-coupled to the ring resonators. Our proposed device has high performance, small footprint, and high potential for integration and development to more channels.

Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, m...

Kumar N . Sivarajan and Robert J . McEliece, California Institute of Technology,’ and John W. Ketchum, GTE Laboratories Incorporated. In this paper, we describe some heuristic channel assignment algorithms for cellular systems, that we have recently developed. These algorithms have yielded optimal, or near-optimal assignments, in many cases. The channel assignment problem can be viewed as a gen...

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 sets of colors to vertices of the triangular lattice so that the sets of colors assigned to adjace...

Given a graph G and a non-negative integer weight or demand xv for each node v, a colouring of the pair (G, x) is an assignment to each node v of a set of xv colours such that adjacent nodes receive disjoint sets of colours. We are interested in such colourings when the maximum demand xv is large. An application where such colouring problems arise is in the design of cellular radio communicatio...