Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids

This paper presents optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids. Given the reuse distance σ (an integer ≥ 5 ), using minimum number of colors, our algorithm assigns colors(channels) to the vertices (radio stations) in such a way that the...

Full description

Saved in:
Bibliographic Details
Published inDistributed Computing - IWDC 2004 pp. 424 - 434
Main Authors Panda, B. S., Kumar, Mahesh, Das, Sajal K.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 01.01.2004
SeriesLecture Notes in Computer Science
Subjects
Adjacent Vertex
Channel Assignment
Optimal Scheme
Radio Station
Wireless Network
Online AccessGet full text
ISBN9783540240761
3540240764
ISSN0302-9743
1611-3349
DOI10.1007/978-3-540-30536-1_47

Cover

More Information
Summary:This paper presents optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids. Given the reuse distance σ (an integer ≥ 5 ), using minimum number of colors, our algorithm assigns colors(channels) to the vertices (radio stations) in such a way that the color difference between the adjacent vertices is at least 2, and two vertices x and y receive the same color only when the distance between x and y is at least σ.
ISBN:9783540240761
3540240764
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30536-1_47