Showing papers by "Mahesh Kumar published in 2004"
01 Dec 2004
TL;DR: This paper presents optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids, using minimum number of colors, given the reuse distance σ.
Abstract: 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 σ.
3 citations
27 Dec 2004
TL;DR: In this article, the authors presented an optimal scheme for channel assignment in wireless networks modeled as 2-dimensional square grids, given the reuse distance σ (an integer ≥ 5 ), using minimum number of colors, which assigns colors(channels) to the vertices (radio stations) in such a way that the color difference between the adjacent vertices is at least 2.
Abstract: 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 σ.
1 citations