Name
Title | ||
|---|---|---|
Optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids |
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 σ. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30536-1_47 | IWDC |
Keywords | Field | DocType |
optimal scheme,adjacent vertex,wireless network,channel assignment problem,2-dimensional square grid,color difference,minimum number,radio station,reuse distance,2 dimensional | Integer,Radio broadcasting,Wireless network,Discrete mathematics,Vertex (geometry),Reuse,Communication channel,Neighbourhood (graph theory),Color difference,Mathematics | Conference |
Volume | ISSN | ISBN |
3326 | 0302-9743 | 3-540-24076-4 |
Citations | PageRank | References |
2 | 0.38 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. S. Panda | 1 | 99 | 21.18 |
| Mahesh Kumar | 2 | 2 | 0.38 |
| Sajal K. Das | 3 | 8086 | 745.54 |