Nearly optimum scheduling in mobile CDMA packet radio networks

Author

Faragó, András ; Chlamtac, Imrich ; Ahn, Hye Yeon

Author_Institution

Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA

fYear

1992

fDate

11-14 Oct 1992

Firstpage

769

Abstract

The authors propose the modulo hunter algorithm, which provides a solution for a mobile CDMA (code division multiple access) network using TDMA (time division multiple access) slot allocation in the case of arbitrary multiple reception capacity. The solution is nearly optimal in the sense that the length of the resulting TDMA frame is guaranteed to be within a small multiple of the best possible. The method is very easy to implement, requires a short execution time, and can be used in a distributed way. It is independent of the particular network topology, which guarantees robustness in the face of topology changes and makes the result especially suitable for mobile CDMA packet radio networks

Keywords

code division multiple access; mobile radio systems; packet radio networks; scheduling; time division multiple access; CDMA; TDMA; code division multiple access; mobile packet radio networks; modulo hunter algorithm; multiple reception capacity; network topology; optimum scheduling; slot allocation; time division multiple access; Computer networks; Intelligent networks; Multiaccess communication; Narrowband; Network topology; Packet radio networks; Processor scheduling; Radio networks; Spread spectrum communication; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 1992. MILCOM '92, Conference Record. Communications - Fusing Command, Control and Intelligence., IEEE

Conference_Location

San Diego, CA

Print_ISBN

0-7803-0585-X

Type

conf

DOI

10.1109/MILCOM.1992.244002

Filename

244002