DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sehun | ko |
dc.contributor.author | Yeo, J | ko |
dc.date.accessioned | 2007-11-07T01:49:03Z | - |
dc.date.available | 2007-11-07T01:49:03Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1998-03 | - |
dc.identifier.citation | COMPUTERS OPERATIONS RESEARCH, v.25, no.3, pp.219 - 228 | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/10203/1844 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | Optimal scheduling in CDMA packet radio networks | - |
dc.type | Article | - |
dc.identifier.wosid | 000071688100006 | - |
dc.identifier.scopusid | 2-s2.0-0032020686 | - |
dc.type.rims | ART | - |
dc.citation.volume | 25 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 219 | - |
dc.citation.endingpage | 228 | - |
dc.citation.publicationname | COMPUTERS OPERATIONS RESEARCH | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Sehun | - |
dc.contributor.nonIdAuthor | Yeo, J | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.