检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《仪器仪表学报》2012年第8期1779-1785,共7页Chinese Journal of Scientific Instrument
基 金:国家工信部2011年物联网发展专项资金;国家科技支撑计划(2011BAK07B03;2011BAJ03B13);重庆市科技攻关项目(CSCT2010AA2036)资助
摘 要:针对LEACH(low energy adaptive clustering hierarchy)算法以随机概率轮选簇头,存在簇头分布不均匀、簇头数量波动大以及簇头选取时未考虑节点剩余能量等问题,提出簇头半径自适应层次型路由算法(cluster-head range adaptive adjustment clus-tering routing,CRACR),引入节点剩余能量作为权重因子选取簇头,采用自适应调节机制控制簇头广播消息的广播半径大小,根据节点的位置和剩余能量分配时隙。通过仿真实验,结果表明CRACR算法的第1个节点死亡"回合"数比LEACH提高了55%以上,节能性能得到了明显的提高。low energy adaptive clustering hierarchy (LEACH) algorithm uses random probability rotation to choose cluster heads, yet has deficiencies like unbalanced cluster-head distribution, rebounded amount of cluster-heads, and ignorance of the residual energies of sensor nodes. A cluster-head range adaptive adjustment clustering routing (CRACR) protocol is proposed in this paper. Firstly, node residual energy is introduced as a weight factor while choosing cluster-heads. Secondly, adaptive control mechanism is adopted to control the communication range of broadcast packet when a sensor node is chosen to be a cluster-head. Finally, the cluster-heads assign time slots according to the positions and residual energies of the nodes. Simulation results show that compared with LEACH, CRACR outperforms LEACH at least 55% when the first node dies. The energy-saving performance is greatly enhanced.
关 键 词:无线传感器网络 分簇路由 LEACH 半径自适应调节 能量高效
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175