When multiple agents are in a shared environment, there usually exist con straints among
the possible actions of these agents. A distributed constraint satisfaction problem (distributed …

With the limited frequency spectrum and an increasing demand for cellular communication
services, the problem of channel assignment becomes increasingly important. However …

In this chapter G=(V, E) denotes an arbitrary undirected graph without loops, where V={v 1, v
2,…, vn} is its vertex set and E={e 1, e 2,…, em}⊂(E× E) is its edge set. Two edges are …

Efficient allocation of channels for wireless communication in different network scenarios
has become an extremely important topic of recent research. The main challenge lies in the …

A cellular network is generally modeled as a subgraph of the triangular lattice. In the static
frequency assignment problem, each vertex of the graph is a base station in the network …

The channel-assignment problem (CAP) for cellular radio networks is an NP-complete
problem. Previous techniques for solving this problem have used graph-coloring algorithms …

The paper deals with the channel assignment problem in a hexagonal cellular network with
two-band buffering, where channel interference does not extend beyond two cells. Here, for …

This paper presents a new genetic algorithm (GA) with good convergence properties and a
remarkable low computational load. Such features are achieved by on-line tuning up the …

We investigate the channel assignment problem, that is, the problem of assigning channels
(codes) to the cells of a cellular radio network so as to avoid interference and minimize the …

Wireless communication supports various real-world applications, such as aeronautical
navigation, satellite and TV broadcasting, wireless LANs, and mobile communications. The …