Frequency-Adaptive Cluster Head Election in Wireless Sensor Network - Intelligent Information Processing VI Access content directly
Conference Papers Year : 2012

Frequency-Adaptive Cluster Head Election in Wireless Sensor Network


Efficient information routing mechanism is a critical research issue for wireless sensor networks (WSN) due to the limit energy and storage resource of sensor nodes. The clustering-based approaches (e.g. LEACH, Gupta and CHEF) for information routing have been developed. Although these approaches did actually improve the routing efficiency and prolong the network lifetime, the clustering frequency f is usually pre-designed and fixed. However, the network context (e.g. Energy and load) often dynamically changes, which can provide the dynamical adjustment determination for f. Hence, in this paper, we propose a frequency-adaptive cluster-head election approach, which applies the network context for making corresponding f adjustment. Furthermore, an f -based clustering algorithm is presented as well. The case study and experimental evaluations demonstrate the effectiveness of the proposed approach.
Fichier principal
Vignette du fichier
978-3-642-32891-6_39_Chapter.pdf (243.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01524988 , version 1 (19-05-2017)





Tianlong Yun, Wenjia Niu, Xinghua Yang, Hui Tang, Song Ci. Frequency-Adaptive Cluster Head Election in Wireless Sensor Network. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.311-319, ⟨10.1007/978-3-642-32891-6_39⟩. ⟨hal-01524988⟩
103 View
74 Download



Gmail Facebook X LinkedIn More