摘要
在对经典的分簇路由算法LEACH研究的基础之上,提出了一种基于非均匀分簇的新的路由算法EBCA。新算法在簇头的确定和成簇机制上较LEACH做出了一些改进,考虑到节点的剩余能量及最优簇头数目的确定等参数,有效避免低能耗节点被选为簇头。采用非均匀分簇的思想,使远离汇集节点簇的规模大于靠近汇集节点的簇的规模,同一区域内簇头节点间用多跳的方式传输数据。仿真结果表明:新算法EBCA较LEACH算法,从整体上均衡了节点能耗,延长了网络的生命周期。
After the research on the classical clustering algorithms LEACH,a novel routing algorithm baseed on non-uniform clustering EBCA(energy-balanced clustering algorithms) is proposed.The new algorithm improves the cluster head determination and clusters mechanism comparing with LEACH,considering the remaining energy of nodes and the determinating of the optimal cluster and so on,it can avoid choosing the lower energy node as cluster head.The scale of the cluster farther away from the sink have greater sizes than those near the sink.Cluster heads in same region adopt multi-hop communication to send data.The simulations results show that compared with the LEACH,the new algorithm EBCA can balance the energy consume in whole and prolong the life-time of the network.
出处
《计算机与数字工程》
2012年第1期28-30,58,共4页
Computer & Digital Engineering