초록
Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related 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. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.