Optimization of clustering in SPIN-C and LEACH for data centric wireless sensor networks

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Routing the data in wireless sensor network (WSN) is a main issue in the guaranteed data transmission. Contextually, many algorithms consider the power and resource limitation, energy efficiency, scalability, attributes and location based with the assumption of homogeneous and heterogeneous distribution of nodes for data transferring. Therefore data dissemination is required to provide the effective data transmission from source node to sink node. This paper introduces the cluster head selection scheme used in SPIN to efficiently disseminate observations gathered by individual sensor nodes in the network. The paper proposes the cluster head selection scheme used in SPIN protocol and evaluated the performance of proposed protocol to prolong the time interval from the start of network operation till the death of the first node which is important reliable issues in wireless sensor networks for many feedback applications. The scheme is implemented and simulated with LEACH in NS2.34. Simulation shows proposed protocol exhibits significant performance gains over the LEACH for lifetime of network and guaranteed data transmission.

Cite

CITATION STYLE

APA

Tripathi, A., Yadav, N., & Dadhich, R. (2014). Optimization of clustering in SPIN-C and LEACH for data centric wireless sensor networks. Advances in Intelligent Systems and Computing, 335, 197–205. https://doi.org/10.1007/978-81-322-2217-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free