An Energy Efficient Routing Protocol Based on Closeness Factor for Wireless Sensor Networks

Abstract

Wireless sensor networks are used in a wide variety of applications in our day to day life, these networks consists of small electronic devices called node or motes. These nodes will be deployed in large numbers, which are self powered, gather information or detect the required events and communicate it to the base station in a wireless mode. Sensor networks provide more number of opportunities, but at the same time pose challenge like scarcity of energy, as they have non-rechargeable batteries. As the nodes are deployed in the random fashion, due to high density of nodes, more than one node may fall in a very close proximity or in other words, two or more nodes which are very closely situated will be sensing a similar data. In this paper, we present an energy efficient routing protocol based on the closeness factor. In this approach, as soon as the deployment of the nodes is made, the base station will be grouping the set of nodes deployed in to two disjoint sets based on the closeness factor of the nodes and keep one set of nodes inactive till the other node’s energy gets depleted. Simulation results prove that lifetime of the entire network can be improved by the proposed method