摘要
在前人提出的LEACH-C路由算法的基础之上,提出了对LEACH-C的改进,在过去的LEACH-C路由算法中,采用模拟退火算法,来实现选取簇头,改进后的算法应用图像角点检测算子——SUSAN算子,使其在簇头的选取上,定位更准,速度更快,同时,在簇头选好后,为了节能,通过应用最小树原理,把各个簇头节点连接起来,簇内成员与簇头之间,采用直接通信。通过仿真试验表明,改进后的LEACH-C路由算法,能更好的节能,有效的延长了整个无线传感器网络的寿命。
Based on the previous LEACH-C routing algorithm brings up improvements, the old LEACH-C routing algorithm use sim- ulated annealing algorithm to achieve the selection of cluster heads, this paper applies image corner detection operator --SUSAN op- erator to the improved algorithm , this theory causes positioning faster and more accuratethe for selection of the cluster head, at the same time, after the cluster head being selected, in order to save energy , with the application of principle of minimum tree, the head node of each cluster can be Linked, between members of the cluster and cluster head node use direct communication. The sim- ulation resuhs show that the improved LEACH-C routing algorithm can be better for energy conservation and extend the effective life of the entire wireless sensor network.
出处
《微计算机信息》
2012年第10期469-470,496,共3页
Control & Automation
基金
基金申请人:唐启涛
基金资助项目名称:基于SUSAN算子的LEACH-C路由算法
颁发部门:湖南省教育厅:基金编号:(10C0458)
关键词
SUSAN算子
最小生成树
簇头
路由协议
Key word： SUSAN algorithm
minimum spanning tree
cluster head
routing protocol
