{"id":310,"date":"2003-10-01T16:38:04","date_gmt":"2003-10-01T16:38:04","guid":{"rendered":"http:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=310"},"modified":"2010-08-24T10:26:28","modified_gmt":"2010-08-24T10:26:28","slug":"a-throughput-efficient-and-channel-adaptive-scheduling-scheme-in-voicedata-ds-cdma-networks-with-transmission-power-constraints","status":"publish","type":"post","link":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=310","title":{"rendered":"A Throughput-Efficient and Channel-Adaptive Scheduling Scheme in Voice\/Data DS-CDMA Networks with Transmission Power Constraints"},"content":{"rendered":"<p><a href=\"http:\/\/network.ee.tsinghua.edu.cn\/papers\/shutao_pdi_wcmc2003.pdf\" target=\"_blank\"><img loading=\"lazy\" decoding=\"async\" class=\"alignright size-full wp-image-117\" title=\"pdf\" src=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2010\/08\/pdf.gif\" alt=\"\" width=\"95\" height=\"50\" \/><\/a><br \/>\n<span class=\"paper_subtitle\">LANGUAGE<\/span><br \/>\nEnglish<br \/>\n<span class=\"paper_subtitle\">SOURCE<\/span><br \/>\n to appear in Wiley Wireless Communications and Mobile Computing, Special Issue on Radio Resource Management for Wireless Internet, Oct. 2003<br \/>\n<span class=\"paper_subtitle\">Published Date<\/span>:2003-10-01<br \/>\n<span class=\"paper_subtitle\">ABSTRACT<\/span><br \/>\nIn a practical voice\/data CDMA network, the constraint of transmission powers makes it necessary to transmit multiple data users in parallel in order to fully utilize system resource (power). How to choose those data users that should be transmitted simultaneously and allocate appropriate powers among them remains as an open issue. In this paper we prove that it is<br \/>\noptimal in the sense of maximum data throughput to select data users and allocate powers according to the descending order of their indexes of received power capability (IRPC). Here, IRPC is defined as the product of the transmission power upper bound and the channel gain. Based on this principle, a channel-adaptive scheduling scheme, Partially Descending IRPC (PDI) scheduling, is proposed to achieve efficient throughput performance for data traffic while maintaining certain fairness among different users. The efficiency and fairness of the PDI scheduling are verified by comparing with the conventional fair-sharing scheme and round-robin scheme through computer simulations. Numerical results also reveal the robustness of the new<br \/>\nscheme to the channel estimation errors.<br \/>\n<span class=\"paper_subtitle\">KEYWORDS<\/span><br \/>\nCDMA, scheduling, throughput optimization, fading channel<\/p>\n","protected":false},"excerpt":{"rendered":"<p><a href=\"http:\/\/network.ee.tsinghua.edu.cn\/papers\/shutao_pdi_wcmc2003.pdf\" target=\"_blank\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft size-full wp-image-117\" title=\"pdf\" src=\"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/wp-content\/uploads\/2010\/08\/pdf.gif\" alt=\"\" width=\"95\" height=\"50\" \/><\/a>Tao Shu, Zhisheng Niu, <span class=\"papertitle\">A Throughput-Efficient and Channel-Adaptive Scheduling Scheme in Voice\/Data DS-CDMA Networks with Transmission Power Constraints<\/span>, <span class=\"papersource\"> to appear in Wiley Wireless Communications and Mobile Computing, Special Issue on Radio Resource Management for Wireless Internet, Oct. 2003<\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[7],"tags":[99,32,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/310"}],"collection":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=310"}],"version-history":[{"count":3,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/310\/revisions"}],"predecessor-version":[{"id":892,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/310\/revisions\/892"}],"wp:attachment":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=310"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=310"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=310"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}