MERAM-R: Multi-Clustered Energy Efficient Routing Algorithm with Randomly Moving Sink Node

Abstract

Wireless Sensor Network has become an important domain of research due to its applicability in many areas. The focus of the paper is to incorporate mobility of the sink node, where it moves across the whole area of the network randomly to enhance the lifetime of Wireless Sensor Networks (WSNs). An algorithm named as “Multi-clustered Energy-Efficient Routing Algorithm with Mobile Sink Node Moving Randomly (MERAM-R)” has been proposed to distribute energy utilization of the sensor nodes by moving the sink node randomly into different locations in the network area. In this approach, the homogeneous and fixed sensor nodes are deployed randomly across the network and a clustering algorithm is applied to divide the sensor nodes (SNs) into different clusters with their own Cluster Heads (CHs). In order to collect data, the sink node moves to different locations across the network randomly without any fixed trajectory. MERAM-R protocol is simulated and its results are compared with the LEACH protocol, the first clustering protocol where the sink node is placed statically at a distance farther from the sensor nodes. It is observed that the lifetime of WSNs using MERAM-R protocol is longer than WSNs using LEACH protocol.