计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2015年
2期
108-112,189
,共6页
低能量自适应聚类层次(LEACH)%无线传感器网络%散列链%网格%簇头身份标识编号
低能量自適應聚類層次(LEACH)%無線傳感器網絡%散列鏈%網格%簇頭身份標識編號
저능량자괄응취류층차(LEACH)%무선전감기망락%산렬련%망격%족두신빈표식편호
Low Energy Adaptive Clustering Hierarchy(LEACH)%Wireless Sensor Networks(WSNs)%hash chain%grid%cluster head ID number
LEACH（Low Energy Adaptive Clustering Hierarchy）路由协议是无线传感器网络拓扑控制中最具代表性和重要性的算法之一。针对LEACH路由协议簇头分布不均匀，节点死亡率高，易产生路由空洞及其所面临安全威胁等问题，提出一种基于散列链的区域划分网格自治安全路由协议LEACH-SEED。剔除低能量节点入选簇头的权利，改进簇头选举机制，簇头选举完成之后，每个簇头节点随机从散列链组成的密钥池中分配q个链密钥，其他节点利用单向哈希函数和伪随机函数生成通信密钥，网络遭受攻击后利用网格自治和待选簇头身份标识编号进行网络恢复。实验结果表明，改进的分簇算法能有效地降低节点死亡率，增强抗攻击能力，提高数据融合度，延长网络生存时间。
LEACH（Low Energy Adaptive Clustering Hierarchy）路由協議是無線傳感器網絡拓撲控製中最具代錶性和重要性的算法之一。針對LEACH路由協議簇頭分佈不均勻，節點死亡率高，易產生路由空洞及其所麵臨安全威脅等問題，提齣一種基于散列鏈的區域劃分網格自治安全路由協議LEACH-SEED。剔除低能量節點入選簇頭的權利，改進簇頭選舉機製，簇頭選舉完成之後，每箇簇頭節點隨機從散列鏈組成的密鑰池中分配q箇鏈密鑰，其他節點利用單嚮哈希函數和偽隨機函數生成通信密鑰，網絡遭受攻擊後利用網格自治和待選簇頭身份標識編號進行網絡恢複。實驗結果錶明，改進的分簇算法能有效地降低節點死亡率，增彊抗攻擊能力，提高數據融閤度，延長網絡生存時間。
LEACH（Low Energy Adaptive Clustering Hierarchy）로유협의시무선전감기망락탁복공제중최구대표성화중요성적산법지일。침대LEACH로유협의족두분포불균균，절점사망솔고，역산생로유공동급기소면림안전위협등문제，제출일충기우산렬련적구역화분망격자치안전로유협의LEACH-SEED。척제저능량절점입선족두적권리，개진족두선거궤제，족두선거완성지후，매개족두절점수궤종산렬련조성적밀약지중분배q개련밀약，기타절점이용단향합희함수화위수궤함수생성통신밀약，망락조수공격후이용망격자치화대선족두신빈표식편호진행망락회복。실험결과표명，개진적분족산법능유효지강저절점사망솔，증강항공격능력，제고수거융합도，연장망락생존시간。
LEACH(Low Energy Adaptive Clustering Hierarchy)is a wireless sensor networks routing protocol in topology control algorithm of the most representative and important one. In order to solve LEACH uneven distribution of routing protocol suite, node high mortality rates, easy to produce issues of routing hole, security threats, it proposes an improved algorithms and simulation based on hash-chain and grid in wireless sensor networks. It deprives the right of selecting the low-energy node as a cluster node and improves cluster-head election mechanism. Each cluster head node is assigned with q chain keys from the hash chain randomly after cluster head selection. The other nodes use one-way hash function and pseudo-random function to generate communication keys. The network is recovered by adaptive grid and the cluster-head ID after attacking. The experimental results show that the improved clustering algorithm can reduce mortality node effec-tively, strengthen anti-attack ability of the network, improve data alignment and prolong network lifetimes.
