Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2571/2002 |
| Book | Distributed Computing |
| DOI | 10.1007/3-540-36385-8 |
| Copyright | 2002 |
| ISBN | 978-3-540-00355-7 |
| DOI | 10.1007/3-540-36385-8_14 |
| Pages | 130-141 |
| Subject Collection | Computer Science |
| SpringerLink Date | Tuesday, January 01, 2002 |
| |
|
14. Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids
Aniket Dubhashi6  , Shashanka M V S 6 , Amrita Pati6 , Shashank R. 6 and Anil M. Shende7
| (6) |
Birla Institute of Technology & Science, 333031 Pilani, India |
| (7) |
Roanoke College, 24153 Salem, VA, USA |
Abstract
In this paper, we study the problem of channel assignment for wireless networks modelled as d-dimensional grids. In particular, for d-dimensional square grids, we present optimal assignments that achieve a channel separation of 2 for adjacent stations where
the reuse distance is 3 or 4. We also introduce the notion of a colouring schema for d- dimensional square grids, and present an algorithm that assigns colours to the vertices of the grid satisfying the schema
constraints.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|