Computer Science

Computer Science ›› 2021, Vol. 48 ›› Issue (9): 264-270.doi: 10.11896/jsjkx.210100143

• Computer Network • Previous Articles     Next Articles

Wireless Downlink Scheduling with Deadline Constraint for Realistic Channel Observation Environment

ZHANG Fan1, GONG Ao-yu1, DENG Lei2, LIU Fang3, LIN Yan1, ZHANG Yi-jin1   

  1. 1 School of Electronic and Optical Engineering,Nanjing University of Science and Technology,Nanjing 210094,China
    2 College of Electronics and Information Engineering,Shenzhen University,Shenzhen,Guangdong 518060,China
    3 Department of Information Engineering,The Chinese University of Hong Kong,Hong Kong 999077,China
  • Received:2021-01-19 Revised:2021-03-12 Online:2021-09-15 Published:2021-09-10
  • About author:ZHANG Fan,born in 1995,postgra-duate,is a member of China Computer Federation.Her main research interests include design and optimization for protocols in wireless networks.
    ZHANG Yi-jin,born in 1982,Ph.D,professor.His main research interests include sequence design,wireless networks,and artificial intelligence.
  • Supported by:
    National Natural Science Foundation of China(62071236,61902256,62001225),Fundamental Research Funds for the Central Universities of China(30920021127,30919011227) and Natural Science Foundation of Jiangsu Province(BK20190454).

PDF (PC)

730

Abstract: Deadline-constrained wireless downlink transmissions,which have been widely used for a variety of real-time communication services that are related to the national economy and the people's livelihood,require each packet to be delivered in an ultra-reliable fashion within a strict delivery deadline.However,the base station (BS) cannot fully observe the channel state between itself and each device,and can be aware of the channel state for a device only when the BS receives a feedback from this device.This realistic channel observation environment makes the design of deadline-constrained downlink scheduling more challengeable.This paper aims to deal with this issue by allowing the BS to determine the transmission priority based on the packet information and partially-observable channel states.This paper uses an infinite-horizon partially observable Markov decision process (POMDP) to model the downlink transmission by only considering the head-of-line packets,but finding an optimal or near-optimal strategy for this model is computationally infeasible.As such,this paper proposes a suboptimal strategy with low complexity using the Q-function Markov decision process (QMDP) for the finite-horizon problems,and further proposes a simpler heuristic strategy.Simulation results demonstrate the performance advantage of the proposed strategies over baselines in various network scenarios,and indicate that the partial observability on the channel states indeed has a significant impact on the throughput performance.

Key words: Deadline constraint, Downlink transmission strategies, Partially observable Markov decision process, Throughput

CLC Number: 

  • TN911
[1]SHEN S H.Efficient SVC multicast streaming for video confe-rencing with SDN control[J].IEEE Transaction Network and Service Management,2019,16(2):403-416.
[2]LIU Q,ZENG H,CHEN M.Network utility maximization under maximum delay constraints and throughput requirements[J].IEEE/ACM Transactions on Networking,2020,28(5):2132-2145.
[3]LUVISOTTO M,PANG Z,DZUNG D.High-performance wireless networks for industrial control applications:new targets and feasibility[J].Proceedings of the IEEE,2019,107(6):1074-1093.
[4]China Electronics Standardization Institute.White Paper on Industrial IoT Connectivity[OL].http://www.cesi.cn/iot/201809/4356.html.
[5]ZOU J,PAN D,ZHOU Q,et al.An Improved Compressed Sen-sing Channel Estimation Method for Low Voltage Power Line Carrier Communication[J].Journal of Chongqing University of Technology(Natural Science),2019,33(11):155-161.
[6]WU Q L,FANG Z,ZHANG Z J,et al.A Review on Resource Optimization Strategies for Multi-flow Cooperative Ad Hoc Networks[J].Journal of Chongqing Technology and Business University (Natural Science Edition),2017,34(3):39-48.
[7]HOU I H,BORKAR V,KUMAR P R.A theory of QoS for wireless[C]//IEEE INFOCOM.2009:486-494.
[8]HOU I H,KUMAR P R.Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels[C]//10th ACM International Symposium on Mobile Ad Hoc Networking and Computing.2009.
[9]HOU I H,KUMAR P R.Utility maximization for delay constrained QoS in wireless[C]//IEEE INFOCOM.2010:1-9.
[10]HOU I H,KUMAR P R.Scheduling heterogeneous real-timetraffic over fading wireless channels[J].IEEE/ACM Transactions on Networking,2014,22(5):1631-1644.
[11]KANG X,WANG W,JARAMILLO J J,et al.On the perfor-mance of largest-deficit-first for scheduling real-time traffic in wireless networks[J].IEEE/ACM Transactions on Networking,2016,24(1):72-84.
[12]KANG X,HOU I H,YING L.On the capacity requirement of largest-deficit-first for scheduling real-time traffic in wireless networks[C]//16th ACM International Symposium on Mobile Ad Hoc Networking and Computing.2015:217-226.
[13]HOU I H,RAHUL S.Scheduling of access points for multiple live video streams[C]//14th ACM International Symposium on Mobile Ad Hoc Networking and Computing.2013:267-270.
[14]DUA A,BAMBOS N.Downlink wireless packet scheduling with deadlines[J].IEEE Transactions on Mobile Computing,2008,6(12):1410-1425.
[15]DENG L,WANG C C,CHEN M,et al.Timely wireless flows with general traffic patterns:Capacity region and scheduling algorithms[J].IEEE/ACM Transactions on Networking,2017,25(6):3473-3486.
[16]ZHANG F,GONG A Y,DENG L,et al.Scheduling algorithms for wireless downlink with deadline and retransmission constraints[C]//IEEE 20th International Conference on Communication Technology.2020:736-740.
[17]GAUCHERAND E F,ARAPOSTATHIS A,MARCUS S I.On the adaptive control of a partially observable Markov decision process[C]//27th IEEE Conference on Decision and Control.1988:1204-1210.
[18]KAELBLING L P,LITTMAN M L,CASSANDRA A R,et al.Planning and acting in partially observable stochastic domains[J].Artificial Intelligence,1998,101(1):99-134.
[19]PINEAU J,GORDON G J,THRUN S.Point-based value iteration:An anytime algorithm for POMDPs[C]//18th Internatio-nal Joint Conference on Artificial Intelligence.2003.
[20]LITTMAN M L,CASSANDRA A R,KAELBLING L P.Lear-ning policies for partially observable environments:Scaling up[C]//15th International Conference on Machine Learning.1995:362-370.
[1] SONG Ying, ZHONG Xian, SUN Bao-lin, GUI Chao. Sliding Window-based Network Coding Cooperative Algorithm in MANET [J]. Computer Science, 2020, 47(11): 322-326.
[2] JI Bao-feng, WANG Yi-dan, XING Bing-bing, LI Yu-qi, GAO Hong-feng, HAN Cong-cheng. Enhancement Method of Throughput in Ultra-dense Network Based on Hierarchical Multi-hop Physical Layer Network Coding [J]. Computer Science, 2019, 46(7): 56-60.
[3] ZHOU Wei-xing, SHI Hai-he. Survey on Sequence Assembly Algorithms in High-throughput Sequencing [J]. Computer Science, 2019, 46(5): 36-43.
[4] YAO Xin-wei, ZHANG Meng-na, WANG Wan-liang, YANG Shuang-hua. Optimal Energy Allocation Algorithm with Energy Harvesting and Hybrid Energy Storage for Microscale Wireless Networks [J]. Computer Science, 2018, 45(8): 75-79.
[5] ZHANG Yun-chun, LI Long-bao, YAO Shao-wen, HU Jian-tao, ZHANG Chen-bin. Sandpile Model Based Load Balancing Algorithm in Wireless Mesh Networks [J]. Computer Science, 2018, 45(8): 84-87.
[6] CHI Kai-kai ,WEI Xin-chen, LIN Yi-min. High-throughput and Load-balanced Node Access Scheme for RF-energy Harvesting Wireless Sensor Networks [J]. Computer Science, 2018, 45(8): 119-124.
[7] CHI Kai-kai, XU Xin-chen, WEI Xin-chen. Minimal Base Stations Deployment Scheme Satisfying Node Throughput Requirement in Radio Frequency Energy Harvesting Wireless Sensor Networks [J]. Computer Science, 2018, 45(6A): 332-336.
[8] CHI Kai-kai, LIN Yi-min, LI Yan-jun, CHENG Zhen. Duty Cycle Scheme Maximizing Throughput in Energy Harvesting Sensor Networks [J]. Computer Science, 2018, 45(6): 100-104.
[9] GUAN Zheng, YANG Zhi-jun, QIAN Wen-hua. Improved MAC Protocol in Radio-over-fiber Networks and Its Performance Analysis [J]. Computer Science, 2018, 45(10): 89-93.
[10] LIU Jian-ming and LIN Dao-wei. Research on Network Performance Based on Nomadic Group Mobility Model [J]. Computer Science, 2017, 44(2): 140-146.
[11] YANG Liang-huai, WAN Kai-ming and FAN Yu-lei. Throughput Enhancement for Heterogeneous Solid-state Drives [J]. Computer Science, 2017, 44(2): 228-234.
[12] SUN Zhen-yu, SHI Jing-yan, JIANG Xiao-wei, ZOU Jia-heng and DU Ran. Evaluation of Resource Management Methods for Large High Energy Physics Computer Cluster [J]. Computer Science, 2017, 44(10): 85-90.
[13] WANG Zhen-chao, CAI Zhi-jie and XUE Wen-ling. Opportunistic Routing Algorithm Based on Partial Network Coding for Wireless Networks [J]. Computer Science, 2016, 43(9): 152-155.
[14] JIA Yu-dong, CHEN Xin and XIANG Xu-dong. DAS:Generalized Stochastic Petri Nets Approach to Component Carrier Dynamic Adaptive Scheduling [J]. Computer Science, 2016, 43(11): 111-116.
[15] LIU Hai-yan, TAN Liang and LIU Chun-ling. Improved Multi-channel Access Protocol Study Based on Ad Hoc [J]. Computer Science, 2016, 43(11): 155-159.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.