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 cluster- heads´ death in a round is reduced and the durability of network enhanced in the variable round mechanism.