检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆邮电大学光互联网及无线信息网络研究中心,重庆400065
出 处:《重庆邮电大学学报(自然科学版)》2007年第5期613-616,共4页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基 金:重庆市教委科学技术研究项目(KJ070521);重庆市科委项目(8817);重庆邮电学院青年基金项目(A2005-27)
摘 要:针对LEACH分簇路由协议在选簇首时没有考虑节点能量而影响网络寿命的问题,提出了一种根据节点的剩余能量来调节节点生成随机数的大小,从而调整节点成为簇首概率的簇首选择算法,剩余能量越多的节点成为簇首的概率越大。仿真结果表明,此改进算法比LEACH算法能延长网络寿命10%以上,网络性能得到了提高。As for the problem of LEACH clustering routing protocol not considering the energy of nodes when selecting cluster heads, which impacts the lifetime of networks, an enhancing cluster head selection algorithm was proposed. It adjusts the values of random numbers generated by sensor nodes according to their residual energy, so as to adjust the possibility of node becoming a cluster head, and the node with more energy has bigger possibility to be come the cluster head. The result of simulation proved that this enhancing algorithm can prolong the lifetime of network by more than 10% compared with LEACH, and thus the performance of network is improved.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28