Geographic Routing in Clustered Wireless Sensor Network

Abstract

A WSN is a network of gadgets that is known as nodes. It consists of sensor nodes distributed over a geographical area. The main task of a sensor node is to sense and collect data from certain domain, process them and transmit it to the sink where the application lies. Clustering provides a productive way to prolong the lifetime of WSN. In this paper, we first propose a distributed technique called energy efficient homogenous clustering technique that selects cluster heads to create a connected backbone network. EHC selects CHs on the basis of their residual energy and utility of sensor to its neighbors. Then we propose a route optimization technique in WSNs to make the best use of routing path among obstacles using Dijkstra’s shortest path algorithm. The simulation results show a reduction in average hop count, packet delay, and energy consumption of WSNs.