Proceedings 16th International Parallel and Distributed Processing Symposium 2002
DOI: 10.1109/ipdps.2002.1016599
|View full text |Cite
|
Sign up to set email alerts
|

Channel assignment with separation for special classes of wireless networks: grids and rings

Abstract: Giver& an integer 0' > 1, a vector (61,62, .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2002
2002
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…We also presented optimal Ä´AE ½ ½ ¾ µ colouring schemes, with a high value for AE ½ , for square grids for all and for cellular grids for the case where reuse distance is odd i.e., ¾ · ½ , ¾ ½ ¾ . The previous best known results have been restricted to AE ½ » ¾ ¿ [3,4], in case of cellular grids and AE ½ ½ ¾ [2] in case of square grids. We conjecture that our value of AE ½ is a tight upper bound on AE ½ for optimal colouring schemes for these grids.…”
Section: Discussionmentioning
confidence: 99%
“…We also presented optimal Ä´AE ½ ½ ¾ µ colouring schemes, with a high value for AE ½ , for square grids for all and for cellular grids for the case where reuse distance is odd i.e., ¾ · ½ , ¾ ½ ¾ . The previous best known results have been restricted to AE ½ » ¾ ¿ [3,4], in case of cellular grids and AE ½ ½ ¾ [2] in case of square grids. We conjecture that our value of AE ½ is a tight upper bound on AE ½ for optimal colouring schemes for these grids.…”
Section: Discussionmentioning
confidence: 99%