Optimal scheduling in CDMA packet radio networks

We consider the time slot assignment problem in a CDMA packet radio network. Unlike the classical TDMA packet radio networks, a CDMA packet radio network can provide each node with a multiple reception capacity using orthogonal codes. This multiple reception capacity of each node presents a new challenge for channel access protocols. Also we consider non-uniform traffic demand over nodes which has become important due to the increase of subscribers and the introduction of personal communication system (PCS). We present an algorithm for a general system where the number of nodes and the reception capacity can be any positive integers and the traffic demand can be non-uniform. Computational tests show that our algorithm generates excellent solutions in most cases. (C) 1998 Elsevier Science Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
1998-03
Language
ENG
Citation

COMPUTERS OPERATIONS RESEARCH, v.25, no.3, pp.219 - 228

ISSN
0305-0548
URI
http://hdl.handle.net/10203/1844
Appears in Collection
NE-Journal Papers(저널논문)
  • Hit : 498
  • Download : 93
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 4 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0