无线体域网中动态分配队列长度的调度算法  

Scheduling algorithm based on adaptive queue length in WBAN

作　　者：章婷婷 彭敏 周清峰[2] 安宁[2] ZHANG Tingting;PENG Min;ZHOU Qingfeng;AN Ning(Institute of Industry and Equipment Technology,Hefei University of Technology,Hefei 230009,China;School of Computer and Information,Hefei University of Technology,Hefei 230601,China)

机构地区：[1]合肥工业大学工业与装备技术研究院,安徽合肥230009 [2]合肥工业大学计算机与信息学院,安徽合肥230601

出　　处：《合肥工业大学学报（自然科学版）》2019年第7期906-911,共6页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(61471156;61601164);广东省科技规划资助项目(2016B010108002);佛山市科技创新资助项目(2015IT100095)

摘　　要：在无线体域网的调度算法研究中,当网络中通信链路质量较差时,传感器节点之间的数据通信存在丢包率高和资源利用率低的问题。为此,文章提出一种根据实时速率动态分配队列长度的优先级调度算法,以排队系统模型为基础进行理论分析,并将其与固定队列长度算法进行比较。仿真结果表明,当紧急数据数量突增时,该动态队列长度算法显著提高了系统的吞吐量,降低了数据的丢失概率,保障了系统数据通信的可靠性。The scheduling algorithm in the wireless body area network(WBAN) is studied. There exist some problems of high packet loss rate and low resource utilization in the process of data communication between sensor nodes when the communication link quality is poor. For alleviating these problems,a priority scheduling algorithm based on adaptive queue length distribution is proposed,and the mathematical analysis is conducted according to the queue theory model. In addition,this algorithm is compared with the fixed queue length algorithm,in which capacities for different types of data are allocated in advance. The simulation result shows that the algorithm of dynamic queue length can achieve significant performance improvement in terms of throughput and data loss when the emergent data burst,which brings the system a higher reliability.

关 键 词：无线体域网 排队系统 优先级调度 数据丢失 

分 类 号：TP393.1[自动化与计算机技术—计算机应用技术]