Abstract

One of the main emphases of the prevalent clustering and routing algorithms in wireless sensor networks is efficient energy utilization aimed towards enhanced network lifetime. In this paper we are proposing a clustering approach where the sensor nodes are clustered together based on a defined spatial correlation and the geographical location of each sensor nodes. The Cluster Head or Cluster Leader along with routing path is decided by our proposed algorithm based on the estimated chance-value during each rounds of data transfer. Thus in our scheme a multi-hop routing is effected wherein either two-level or three-level hops are dynamically chosen based on the spatial correlation existing between the nodes for the data transfer from the sensing node to the sink. It has been observed that our proposed algorithm outperforms the standard algorithms namely Low Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP) and Distributed Energy Efficient Clustering (DEEC) Protocol with regards to system throughput and Network Lifespan of WSN.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call