Energy efficient localized routing algorithm for Wireless Sensor Networks

Many localization schemes with intelligence of location verification algorithms have been proposed till date in order to provide an efficient estimate of the sensor location. The knowledge of sensor location is very important to many applications proposed for Wireless Sensor Networks which require accurate locations for various calculations. Also, many advanced routing algorithms for Wireless Sensor Networks have been implemented till date with energy conservation as an essential design issue. This paper proposes a new energy efficient routing algorithm which can solve the localization problem in Wireless Sensor Networks with average packet delay, network throughput, average node lifetime, and end-to-end delay as the major performance metrics. In the process, we also propose an idea to enhance the existing WSN by considering the energy metric involved during the routing. The proposed solution to deal with various performance issues are algorithmic in nature.

I. INTRODUCTION

A wireless sensor network (WSN) is a wireless network which consists of spatially distributed nodes that are typically smart dust sensors. These nodes help in monitoring the physical and environmental conditions of the location in which they have been placed [1]. The sensor nodes are smart devices with wireless communication capability, which collect information pertaining to their surroundings like temperature, sound, etc., process the information, and transfer them to other nodes in the WSN. They sense accuracy and scalability of sensing areas [2]. Every sensor node has a limited battery life and is characterized by limited energy and computation power.