摘要
提出了一种新的改进算法ILEACH,能够使簇头分布更加均匀,相互之间的距离保持一个较优值。新的策略首先根据计算出的网络最优簇首数目进行分簇,这样使得网络划分的簇的数目是最优的,然后利用PSO算法,根据由节点的剩余能量和节点之间的距离组成的适值函数,迭代求解在簇中下一轮最适合的簇首。实验结果表明I,LEACH算法能有效延长网络的生存时间。
In this thesis,we propose a novel cluster formation algorithm named ILEACH,which select cluster head more evenly.First of all,according to a new strategy to calculate the optimal cluster numbers,which makes the network division of the number of clusters is optimal.It use PSO algorithm to choose the most suitable cluster head in the next round in accordance with the residual energy of nodes and the distance between the nodes.Simulation results prove that ILEACH performs better than LEACH in lifetime.
出处
《苏州大学学报(工科版)》
CAS
2011年第1期1-5,共5页
Journal of Soochow University Engineering Science Edition (Bimonthly)
基金
国家自然科学基金资助项目(编号60573141
70271050)
国家高技术研究发展计划("863"计划)基金资助项目(编号2005AA775050
2007AA701301)
江苏省自然科学基金资助项目(编号BK2005146)