Published May 1990
| Published
Book Section - Chapter
Open
Dynamic channel assignment in cellular radio
Chicago
An error occurred while generating the citation.
Abstract
Dynamic channel assignment algorithms for cellular systems are developed. The algorithms are compared with an easily simulated bound. Using this bound, it is demonstrated that in the case of homogeneous spatial traffic distribution, some of these algorithms are virtually unbeatable by any channel assignment algorithm. These algorithms are shown to be feasible for implementation in current cellular systems. For the examples considered, in the interesting range of blocking probabilities (2-4%), the dynamic channel assignment algorithms yielded an increase of 60-80% in the carried traffic over the best-known fixed channel assignment.
Additional Information
© 1990 IEEE. Date of Current Version: 06 August 2002. The work of K. N. Sivarajan and R. J. McEliece was supported by a grant from GTE Laboratories Inc. The work of R. J. McEliece was also partially supported by a grant from Pacific Bell.Attached Files
Published - SIVvtc90.pdf
Files
SIVvtc90.pdf
Files
(416.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:1ab3c1b067fcfdd42eb9fd1fa66fcbec
|
416.8 kB | Preview Download |
Additional details
- Eprint ID
- 31390
- Resolver ID
- CaltechAUTHORS:20120509-135031162
- GTE Laboratories
- Pacific Bell
- Created
-
2012-05-09Created from EPrint's datestamp field
- Updated
-
2022-10-26Created from EPrint's last_modified field