Service curve assurances versus uplink throughput in CDMA networks

The scheme proposed in this paper balances the partly conflicting objectives of meeting the diverse quality of service (QoS) needs of mobile hosts (MHs) and achieving high uplink throughput in a Direct Sequence Code Division Multiple Access (DS-CDMA) based cellular network. The QoS needs of the MHs are modeled using the notion of a service curve, which is a function characterizing the minimum number of bits a MH must transmit in any given time interval in order to meet its QoS requirement. Each MH is also assumed to have a specified bound on the acceptable bit error rate.The technique proposed in this paper maximizes the uplink throughput subject to the service curve constraints by jointly adapting the transmitted power and the number of spreading codes used by each MH in relaying its data bits. During this joint adaptation, the technique also imposes specified bounds on the transmitted power and the number of spreading codes that a MH can handle. The proposed technique is evaluated using a discrete-event simulation. The evaluation shows that the proposed scheme can effectively balance the two above-mentioned objectives.

[1]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[2]  Seong-Jun Oh,et al.  Dynamic spreading gain control in multiservice CDMA networks , 1999, IEEE J. Sel. Areas Commun..

[3]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Seong-Jun Oh,et al.  Distributed power control and spreading gain allocation in CDMA data networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Parameswaran Ramanathan,et al.  Adaptive use of error-correcting codes for real-time communication in wireless networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[7]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[8]  George C. Polyzos,et al.  Scheduling for quality of service guarantees via service curves , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[11]  Syed A. Jafar,et al.  Adaptive multicode CDMA for uplink throughput maximization , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[12]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[13]  Parameswaran Ramanathan,et al.  Adapting packet fair queueing algorithms to wireless networks , 1998, MobiCom '98.

[14]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time and priority services , 1997, SIGCOMM '97.

[15]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[16]  Larry J. Greenstein,et al.  An empirically based path loss model for wireless channels in suburban environments , 1999, IEEE J. Sel. Areas Commun..

[17]  Roy D. Yates,et al.  A Framework for Uplink Power Control in Cellular Radio Systems , 1995, IEEE J. Sel. Areas Commun..

[18]  Nevin Lianwen Zhang,et al.  On the Role of Context-Specific Independence in Probabilistic Inference , 1999, IJCAI.

[19]  George C. Polyzos,et al.  SCED: A Generalized Scheduling Policy for Guarantee* Quality-of-Service , 1999 .

[20]  Parameswaran Ramanathan,et al.  Adaptive allocation of CDMA resources for network-level QoS assurances , 2000, MobiCom '00.

[21]  Kwang-Cheng Chen,et al.  Service curve proportional sharing algorithm for service-guaranteed multiaccess in integrated-service wireless networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[22]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.