Variants of Energy Efficient Clustering Protocols for Wireless Sensor Networks
Author(s) -
Er. Gautami Daalia,
Er. Ridhi Kapoor
Publication year - 2016
Publication title -
international journal of computer network and information security
Language(s) - English
Resource type - Journals
eISSN - 2074-9104
pISSN - 2074-9090
DOI - 10.5815/ijcnis.2016.11.06
Subject(s) - computer science , wireless sensor network , computer network , sink (geography) , cluster analysis , network packet , node (physics) , routing protocol , sensor node , disjoint sets , distributed computing , key distribution in wireless sensor networks , topology (electrical circuits) , wireless , wireless network , telecommunications , artificial intelligence , mathematics , cartography , structural engineering , combinatorics , engineering , geography
The energy resource-contrived is the most difficult aspect of WSN and that energy cannot be recharged. When every sensor node is needed to move ahead the data packet to the sink node, the problem emerges there. Through unmoving, listening and retransmitting, the accessible energy in every node could be lost in this procedure because of collisions as well as overhearing. Network topology management and energy minimization is done due to Cluster-based WSN routing protocols. In clustering in WSN, sensor nodes are sorted into little disjoint clusters, where every cluster has an organizer referred as CH. In this paper, energy efficient clustering techniques related to WSNs are discussed and comparative analysis is also performed.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom