Name
Abstract | ||
|---|---|---|
This paper presents an algorithm for producing near-optimal conflict-free schedules for networks operating under code division
multiple access (CDMA). A procedure for finding a lower bound on the length of such schedules is also presented. The presence
of both primary and secondary conflicts (due to imperfectly orthogonal CDMA codes) are accounted for by these algorithms.
The complexity of both algorithms is analyzed and computational experience with both procedures is presented. Using the lower
bound, it is shown that the heuristic is effective. The complexity analysis demonstrates that it is efficient enough to use
in networks of realistic size, even when the schedules must be produced in real time. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/BF01553897 | ALGORITHMICA |
Keywords | Field | DocType |
real-time scheduling.,secondary conflicts,code division multiple access cdma,computer experiment,real time,lower bound,code division multiple access | Heuristic,Computer science,Scheduling (computing),Upper and lower bounds,Cdma networks,Multi-frequency time division multiple access,Schedule,Code division multiple access,Distributed computing | Journal |
Volume | Issue | ISSN |
4.0 | 3 | 0178-4617 |
Citations | PageRank | References |
10 | 3.96 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. J. Post | 1 | 10 | 3.96 |
| Aaron Kershenbaum | 2 | 818 | 96.80 |
| Sarachik, P. | 3 | 30 | 13.79 |