The New Clustering Algorithm for Sensor Nodes' Mobility and Variability

摘要

Wireless sensor networks are making the secure monitoring a various environments. Many researches have been done for extending the network lifetime. In this paper we are looking at routing protocols, especially LEACH protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. However, there is a problem that the data transmission success rate decreases when nods move because movement of nodes is not considered. The LEACH-Mobile protocol improves the data transmission success rate by considering the mobility of nodes. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. LEACH-Mobile didn't consider the situations where the number of total nodes is variable within sensor field. In this paper we propose LEACH-VMN (Variable Mobile Nodes) protocol considering nodes' mobility and variability. In order to verify the performance of the proposed protocol, a scenario I considering only nodes' mobility and a scenario II considering nodes' mobility and variability simultaneously are simulated and compared with the LEACH-Mobile protocol.