论文信息 - A Time-based Cluster-Head Selection Algorithm for LEACH

A Time-based Cluster-Head Selection Algorithm for LEACH

A wireless sensor network consists of hundreds or thousands of small energy-limited sensors that are densely deployed in a large geographical region. It has been demonstrated that low-energy adaptive clustering hierarchy (LEACH) is an energy-efficient routing algorithm for wireless sensor networks (WSN). In this paper, we present a Time-based cluster-head selection algorithm for LEACH. We call this new protocol TB-LEACH. We state the principle of TB-LEACH and give the main flowchart and pseudo codes realizing TB-LEACH. We provide a comparison between our protocol and LEACH protocol. The implementation of this protocol is figured out by NS2. Simulation results show that our algorithm outperforms original LEACH by about 20% to 30% in terms of system lifetime.

[1] D.P. Agrawal,et al. APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[2] Cauligi S. Raghavendra,et al. PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[3] Wendi B. Heinzelman,et al. Application-specific protocol architectures for wireless networks , 2000 .

[4] Elizabeth M. Belding-Royer,et al. A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[5] Anantha P. Chandrakasan,et al. An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..