Energy optimization of hybrid based H-HEED protocol in inter-cluster based networks

Gitanshu,; Kaushal, Vishal

doi:10.1109/wecon.2016.7993484

Cited by 4 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…LEACH1 (Low1 Energy1 Adaptive1 Clustering1 Hierarchy)1 was1 the1 WSN1 routing1 protocol1 which1 is1 sub-cluster-style.1 Most1 of1 the1 subsequent1 sub-cluster1 routing1 protocols1 are1 developed1 on1 the1 basis1 of1 LEACH.1 LEACH1 conserves1 energy1 because1 it1 uses1 data1 compression1 techniques1 and1 sub-cluster1 dynamic1 routing1 mechanics.1 It1 randomly1 select1 a1 node1 as1 cluster1 head1 node1 and1 balances1 the1 load1 of1 the1 network1 to1 control1 the1 rapid1 loss1 of1 cluster1 head1 nodes1 [10].LEACH1 implements1 a1 cyclic1 process.1 The1 cycle1 is1 divided1 into1 clusters1 of1 the1 establishment1 phase1 and1 stable1 data1 communication1 phase1 [11]. 1 The1 cluster1 head1 selection1 process1 of1 LEACH1 is1 as1 follows:1 a1 random1 number1 generated1 by1 nodes1 is1 between1 0-1,1 if1 it1 founds1 that1 this1 number1 is1 less1 than1 the1 thresholds1 T1 (n),1 then1 it1 publish1 a1 notice1 that1 they1 are1 cluster1 head1 messages1 [10].1 The1 probability1 of1 node1 selection1 is1 T1 (n);1 the1 probability1 of1 cluster1 head1 node1 selection1 will1 increases.1 T1 (n)1 can1 be1 expressed1 as: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 (8) P1 denotes1 cluster1 head1 in1 of1 all1 nodes,1 r1 denotes1 the1 number1 of1 selection1 rounds,1 r1 mod1 (l/P)1 denotes1 the1 number1 of1 cluster1 head1 nodes1 selected1 1 in1 a1 cycle,1 G1 1 denotes1 node1 set1 which1 is1 not1 selected1 as1 cluster1 head.…”

Section: The1 Algorithm1 Of1 Leachmentioning

confidence: 99%

Congestion Control in Wireless Sensor Network using HEED Protocol

2019

IJITEE

View full text Add to dashboard Cite

Tens or thousands of sensor nodes are usually deployed in WSN, dispersed in an area with one or more sinks. In addition, several multi-path routing protocols have been proposed to achieve reliability and load balancing. But these protocols limitation is overhead traffic. Thus, congestion is more likely to occur in this situation. HEED (Hybrid, Energy-Efficient, and Distributed) it is a popular distributed clustering protocol in which gives energy and communication costs in a probabilistic manner to elect Cluster Heads (CHs). This paper uses blurred logic and a non-probabilistic approach to CH elections to improve the HEED protocol. To elect CHs, the protocol uses the remaining energy of the node. In contrast, the probabilistic HEED model for the choice of tentative CHs is eliminated by introducing delays for each node, inversely proportional to the residual energy of the node. Provisional CHs are therefore selected on the basis of priority. Here we are performing the comparison of our approach with LEACH (Energy Adaptive Clustering Hierarchy) protocol. Simulation results show that in terms of network lifetime and also cluster formation, our approach performs better than LEACH.

show abstract

Section: The1 Algorithm1 Of1 Leachmentioning

confidence: 99%