Frequency-Adaptive Cluster Head Election in Wireless Sensor Network

Part 10: Internet of ThingsInternational audienceEfficient 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