WSN中满足公平性的时分复用调度算法  

TDMA scheduling fairness algorithm for wireless sensor network

作　　者：高强[1] 李英涛[1,2] 孙大洋[2,3] 张婧[1,2] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012 [2]吉林大学符号计算与知识工程教育部重点实验室,吉林长春130012 [3]吉林大学通信工程学院,吉林长春130012

出　　处：《计算机工程与设计》2015年第5期1126-1130,1175,共6页Computer Engineering and Design

基　　金：国家自然科学基金项目(61073164;61373123)

摘　　要：如果网络中的节点不能及时公平地共享信道资源,会造成数据传输延时的增加和节点能量的浪费。为解决这种信道分配不均问题,提出一种基于TDMA的调度算法TSFA。该算法分为网络分簇、节点染色、独立集调度3个步骤,主要思想是在分布式顶点染色算法DVCA的基础上得到最大独立集,其根据每个独立集内的数据流量大小分配时隙。仿真结果表明,TSFA避免了相邻节点间的通信干扰,减少了网络的通信延时,提高了网络的吞吐量,实现了信道分配的公平性。If the nodes in WSN can not share channel resources equally,it will result in delay time and energy dissipation.To solve the problem of unfair channel allocation,a TDMA-based scheduling algorithm named TSFA was proposed.The algorithm consisted of three steps：network clustering,coloring phase and timeslots assignment.Its main idea was that the maximum inde-pendent set was got using a distributed vertex coloring algorithm （DVCA）,and then each independent set was mapped to a unique timeslot according to the set’s priority.The priority was obtained by considering the distribution of network traffic. Simu-lation results show that the proposed TSFA can greatly decrease intra-cluster delay and increase intra-cluster throughput to meet the fairness requirement of channel allocation.

关 键 词：无线传感器网络 公平性 图染色 时分复用调度算法 

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