摘要
在Leach-C算法的基础上,提出一种能耗均衡的WSN分簇路由算法——EBLeach-C。采用SOM+Kmeans聚类算法,将位置相邻、能量级别相同的节点自组织成簇。设计一个新的代价函数,用于在簇头(CH)与基站(BS)之间选择最优中继节点,从而实现CH-CH-BS的通信。仿真结果表明,EBLeach-C能避免远离基站的簇过早死亡,并且均衡节点能耗,提高网络覆盖率。
Based on Leach-C, this paper proposes a novel routing algorithm for energy consumption balance, named EBLeach-C. It uses Self-organization Mapping（SOM）＋Kmeans clustering method to self-organize and creates clusters with adjacent coordinate and equal energy level nodes. A new cost function is introduced to select an optimum relay node between cluster head and base station. Simulation results demonstrate that the proposed algorithm can effectively avoid the early dying of cluster which is far away from base station, balance the energy consumption, and increase the network coverage range.
出处
《计算机工程》
CAS
CSCD
2012年第14期79-81,共3页
Computer Engineering
基金
国家自然科学基金资助项目"基于核向量机的油藏历史拟合代理模型研究"(40872087)
关键词
无线传感器网络
自组织映射
分簇路由算法
网络生命周期
粒子群优化
Wireless Sensor Network（WSN）
Self-organization Mapping（SOM）
clustering routing algorithm
network life cycle
Particle Swarm Optimization（PSO）
