Energy Optimization Using Reptile Search in Wireless Sensor Networks

Abstract

Energy saving in wireless sensor networks (WSNs) is a critical problem for diversity of applications. Data aggregation between sensor nodes is huge unless a suitable sensor data flow management is adopted. Clustering the sensor nodes is considered an effective solution to this problem. Each cluster should have a controller denoted as a cluster head (CH) and a number of nodes located within its supervision area. Clustering demonstrated an effective result in forming the network into a linked hierarchy. Thus, balancing the load distribution in WSNs to make efficient use of the available energy sources and reducing the traffic transmission can be achieved. In solving this problem we need to find the optimal distribution of sensors and CHs; thus, we can increase the network lifetime while minimizing the energy consumption. In this paper, a Reptile Search Algorithm (RSA) for preserving location privacy and congestion avoidance with less delay guaranteed is proposed. With this routing technique, the complete sensor field is divided into different subdivisions and each subdivision elects a target area by computing its transmission distance. The backbone of the dynamic routing protocol consists of a virtual ring called bell nodes and a radial line called tentacle nodes employs more nodes to construct the network. The amount of radial line and radius of the virtual ring in a network are conjointly determined to ease the communication path from the node to sink. The radial line paths are routed directionally and bell nodes are routed with angular directions probabilistically. From the routing path, the tentacle nodes collect the data to dynamic sink which will assure that the information is going to be collected with less delay and attacker cannot guess their positions. The experimental results show that the proposed RSA method accomplishes enhanced performance in terms of energy consumption, packet delivery delay and lifetime.