CAJ | 학술논문

如果网络中的节点不能及时公平地共享信道资源，会造成数据传输延时的增加和节点能量的浪费。为解决这种信道分配不均问题，提出一种基于TDMA的调度算法TSFA。该算法分为网络分簇、节点染色、独立集调度3个步骤，主要思想是在分布式顶点染色算法DVCA的基础上得到最大独立集，其根据每个独立集内的数据流量大小分配时隙。仿真结果表明，TSFA避免了相邻节点间的通信干扰，减少了网络的通信延时，提高了网络的吞吐量，实现了信道分配的公平性。
여과망락중적절점불능급시공평지공향신도자원，회조성수거전수연시적증가화절점능량적낭비。위해결저충신도분배불균문제，제출일충기우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.