Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032)
DOI: 10.1109/cmpsac.1999.812707
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of a graph model for channel assignment in a cellular network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…Loading patterns over multiple cell regions will be quite realistic for estimation of the infinite lattice cellular network, provided the multiple cell regions constitute planar subgraphs of the toroidal graph. To simulate this cellular system without boundary effects, we take the repeat tile and embed it on a torus [CaIr99]. The toroidal model is a natural and pertinent way of simulating and analyzing the behavior of the infinite cellular network using a finite model.…”
Section: Applications To Cellular Networkmentioning
confidence: 99%
“…Loading patterns over multiple cell regions will be quite realistic for estimation of the infinite lattice cellular network, provided the multiple cell regions constitute planar subgraphs of the toroidal graph. To simulate this cellular system without boundary effects, we take the repeat tile and embed it on a torus [CaIr99]. The toroidal model is a natural and pertinent way of simulating and analyzing the behavior of the infinite cellular network using a finite model.…”
Section: Applications To Cellular Networkmentioning
confidence: 99%