Distributed scheduling of CDMA networks with minimal information

Author

Kershenbaum, A. ; Post, M.J.

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Polytech. Univ., New York, NY, USA

Volume

39

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

17

Lastpage

20

Abstract

An algorithm which produces conflict-free communication schedules in mobility multihop radio networks is presented. These schedules are produced in a completely distributed manner. The algorithm is based on a globally known permutation on the nodes of the network. As a result the only knowledge needed on the part of individual nodes is the number of nodes in the network. This permutation guarantees that conflict-free schedules can be produced in a distributed manner. Two extensions to the basic permutation are discussed. The first enables neighboring nodes to enhance their communication schedules in a fast, robust, distributed manner. The second extension allows the algorithm to operate in the presence of secondary conflicts

Keywords

code division multiple access; mobile radio systems; queueing theory; CDMA networks; algorithm; conflict-free communication schedules; distributed scheduling; minimal information; mobility multihop radio networks; Mobile communication; Multiaccess communication; Optimal scheduling; Processor scheduling; Production; Radio network; Radio transmitters; Scheduling algorithm; Spread spectrum communication; Upper bound;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.68271

Filename

68271