A Variable Round Mechanism for Routing Protocols Based on LEACH
Give a new arithmetic of variable round mechanism to reduce the cluster-heads death in a round. We analyze the classical hierarchical clustering protocol LEACH, and discuss the existed routing protocols based on LEACH and present their problems. Finally we introduce a new a variable round mechanism. A simulation comparison is made between the traditional constant round and the variable round mechanism. The simulation and comparison results show that the clusterheads death in a round is reduced and the durability of network enhanced in the variable round mechanism.
WSNs LEACH Round
Guo Xiaojin Chen Lanlan
College of Communication and Information Engineering Chongqing University of Posts & Telecommunications Chong Qing, China
国际会议
大连
英文
1-4
2008-10-12(万方平台首次上网日期,不代表论文的发表时间)