{"id":266,"date":"2003-04-22T16:13:53","date_gmt":"2003-04-22T16:13:53","guid":{"rendered":"http:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=266"},"modified":"2010-08-24T10:26:37","modified_gmt":"2010-08-24T10:26:37","slug":"a-channel-adaptive-and-throughput-efficient-scheduling-scheme-in-power-constrained-voicedata-cdma-networks-based-on-ranking-of-received-power-capabilities","status":"publish","type":"post","link":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/?p=266","title":{"rendered":"A Channel-Adaptive and Throughput-Efficient Scheduling Scheme in Power-Constrained Voice\/Data CDMA Networks Based on Ranking of Received Power Capabilities"},"content":{"rendered":"<p><a href=\"http:\/\/network.ee.tsinghua.edu.cn\/papers\/shutao_pdi_vtc2003sp.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 \/>\nProc. IEEE VTC 2003 Spring, April 22-24, 2003, Jeju, Korea<br \/>\n<span class=\"paper_subtitle\">Published Date<\/span>:2003-04-22<br \/>\n<span class=\"paper_subtitle\">ABSTRACT<\/span><br \/>\nIn this paper, we study the throughput optimization of data traffic for a power-constrained voice\/data CDMA system by the scheduling of data users. It is found that under a given received power budget and the constraints of transmission powers, the throughput of data traffic is maximized by selecting simultaneous data users and allocating powers according to the descending order of their received power capabilities, which is defined as the product between the transmission power limit and the channel gain. Based on this principle, a novel dynamic and channel-adaptive scheduling scheme is proposed to enhance the throughput performance of data traffic why maintaining certain fairness among different users. The validity of the proposed scheme and its robustness to channel estimation error is verified by comparing with the conventional fair-sharing scheme and round-robin scheme via computer simulation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p><a href=\"http:\/\/network.ee.tsinghua.edu.cn\/papers\/shutao_pdi_vtc2003sp.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 Channel-Adaptive and Throughput-Efficient Scheduling Scheme in Power-Constrained Voice\/Data CDMA Networks Based on Ranking of Received Power Capabilities<\/span>, <span class=\"papersource\">Proc. IEEE VTC 2003 Spring, April 22-24, 2003, Jeju, Korea<\/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\/266"}],"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=266"}],"version-history":[{"count":2,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/266\/revisions"}],"predecessor-version":[{"id":911,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=\/wp\/v2\/posts\/266\/revisions\/911"}],"wp:attachment":[{"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=266"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=266"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/network.ee.tsinghua.edu.cn\/niulab\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=266"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}