Istituto di Scienza e Tecnologie dell'Informazione     
Bertossi A. A., Pinotti M. C., Tan R. B. Efficient use of radio spectrum in wireless networks with channel separation between close stations. In: International ACM Workshop on Discrete Algorithms and Methods for Mobile Computings (Boston,11 August 2000). Proceedings, 2000.
This paper investigates the problem of assigning channels to the stations of a wireless network so that interfering transmitters are assigned channels with a given separation and the number of channels used is minimized. Two versions of the channel assignment problem are considered which are equivalent to two specific coloring problems - called L(2, 1) and L(2, 1, 1) - of the graph representing the network topology. In these problems, channels assigned to adjacent vertices must be at least 2 apart, while the same channel can be reused only at vertices whose distance is at least 3 or 4, respectively. Efficient channel assignment algorithms using the minimum number of channels are provided for specific, but realistic, network topologies, including buses, rings, hexagonal grids, bidimensional grids, cellular grids, and complete binary trees.
Subject Wireless communication
C.2.1 Network Architecture and Design-Wireless communication

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional