Abstract

Major points of concern in implementing a wireless sensor network (WSN) are the network lifetime and energy utility within any delay tolerant network. Both these parameters define the success of the sensor network. The higher the expectancy of network Lifetime, the higher is the probability of acceptance of the network. Similarly, better the energy utilization in the network, better are the chances of success and implementation of the sensor network. Clustering is one such scheme adopted in WSN towards harnessing the best of above specified parameters for the network implemented. Most popular clustering techniques are the variants of LEACH protocol that facilitate cluster formation based on the proximity of an individual node to other nodes in the sensor network. These protocols are based on a single hop structure from the selected cluster heads in the network. This paper embarks on a multi-hop clustering algorithm that takes into consideration the spatial correlation between the nodes to form clusters and implements a highly energy efficient routing scheme which selects the multi-hop path in the network in a dynamic fashion.

Highlights

  • Wireless Sensor Networks find its application in almost all fields of study like agriculture, environment monitoring, seismological study, defense and security and even extending into today’s IoT [1]

  • Throughput is better using our proposed algorithm which is greater than LEACH and Enhanced LEACH by about 1.2 to 1.4 times

  • As we decrease the value of σ to 0.3, we see throughput increases from 1.8 to 2.3 times the throughput observed using LEACH and Enhanced LEACH

Read more

Summary

INTRODUCTION

Wireless Sensor Networks find its application in almost all fields of study like agriculture, environment monitoring, seismological study, defense and security and even extending into today’s IoT [1] It generally consists of high density sensor nodes that are spatially distributed in a given area of interest. Many algorithms have adopted a clustering approach [2,3,4,5,6,7,8,9,10,11] with the cluster heads choosing a single hop data transfer mechanism to the sink.

RELATED WORK
PROPOSED CORRELATION MODEL
ENERGY MODEL
PROPOSED METHOD
ALGORITHM
RESULT
No of bits per message packet
Observation-1
Observation-2
Observation-3
Observation-4
Findings
CONCLUSION
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.