Title :
A Variable Round Mechanism for Routing Protocols Based on LEACH
Author :
Xiaojin Guo ; Lanlan Chen
Author_Institution :
Coll. of Commun. & Inf. Eng., Chongqing Univ. of Posts & Telecommun., Chongqing
Abstract :
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.
Keywords :
pattern clustering; routing protocols; LEACH; classical hierarchical clustering protocol; routing protocols; variable round mechanism; Arithmetic; Base stations; Clustering algorithms; Communications technology; Contamination; Educational institutions; Monitoring; Routing protocols; Wireless communication; Wireless sensor networks;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-2107-7
Electronic_ISBN :
978-1-4244-2108-4
DOI :
10.1109/WiCom.2008.907