物联网中LEACH算法的研究与改进  

Research and Improvement on LEACH Algorithm for Internet of Things

作　　者：张冬悦[1] 徐四委[1] 高辉[1] 

机构地区：[1]辽宁大学信息学院,沈阳110036

出　　处：《四川理工学院学报（自然科学版）》2012年第2期35-38,共4页Journal of Sichuan University of Science & Engineering(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60703068);辽宁省高等学校科研资助项目(2008257)

摘　　要：针对物联网节点异构的特点,从时效性要求不同的角度出发,提出一种改进的LEACH路由分簇算法。在传送数据之前,要求节点发送代表数据缓急的脉冲,根据脉冲长度及频率得到节点时效性要求参数,结合参数的大小和传输的数据量,动态分配每轮数据传输的时隙,使得高时效性要求节点分配较长时隙,在相对较短的轮次内完成数据传输。仿真结果表明,高时效性节点优先得到资源,传送时延较小,特别在节点数目众多的条件下,节点的平均传送时延得到降低。According to the characteristics of heterogeneous nodes over Internet of Things,herein LEACH algorithm is proposed based on the different aspects of timeliness.First,the nodes send pulse that the more urgent it is the more pulse it sends.Then according to the length of pulse and frequency of the notes,the head node gets the factor of timeliness.At last,combined with the parameters and amount of data,the head node allocates slot of each round dynamically so that the most Emergency nodes are assigned a longer time slot to complete the data transmission in less times of round.The simulation results show that the Emergency nodes get resources priority,especially in the conditions of the large number of nodes,the average transmission delay of the node is reduced.

关 键 词：物联网 成簇 时效性 时隙 平均时延 

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