1. AD-HOC SENSOR NETWORK USING HYBRID ENERGY EFFICIENT DISTRIBUTED CLUSTERING PRESENTED BY, Rajeswari S

2. AGENDA  1. INTRODUCTION  2. Single Hop  3. Multi Hop  4. Clustering problem  5. HE 2D Protocol  6. Psuedocode  7. Conclusion

3. INTRODUCTION

4. Single Hop  With clustering without clustering

5. Multi Hop  With clustering without clustering

6. Clustering problem Requirements 1) Clustering is entirely distributed. 2) Clustering ends within a fixed number of iterations 3) At the end of each T CP, each node is either a cluster head, or not a cluster head that belongs to accurately one cluster.

7. HE2D PROTOCOL  3.1. Clustering Parameters it define the parameters used in the clustering process.  3.2 Protocol Operation it presents the protocol Operations

8. pseudocode I. Initialize 1. S nbr {v: v lies within my cluster range} 2. Compute and broadcast cost to ε S nbr 3. CHprob max(Cprob × Eresidual/Emax, pmin) 4. is _final _CH FALSE

9. II. Repeat 1. If ((S CH {v: v is a cluster head})≠Ø) 2. My_ cluster _head least_ cost(S CH ) 3. If (my_ cluster head = NodeID) 4. If (CHprob = 1) 5. Cluster head msg(NodeID,final _CH,cost) 6. Is_ final_ CH TRUE 7. Else 8. Cluster_head _msg(NodeID, tentative _CH,cost) 9. ElseIf (CHprob = 1) 10. Cluster_ head _msg(NodeID,final_ CH,cost) 11. Is_ final_ CH TRUE 12. ElseIf Random(0,1) < CHprob 13. Cluster_head _msg(NodeID,tentative_ CH,cost) 14. CHprevious CHprob 15. CHprob min(CHprob × 2, 1) Until CHprevious = 1

10. III. Finalize 1. If (is_ final_ CH = FALSE) 2. If ((S CH {v: v is a final cluster head})≠Ø ) 3. my_ cluster head least cost(SCH) 4. join _cluster(cluster_ head_ ID, NodeID) 5. Else Cluster_ head_ msg(NodeID, final _CH, cost) 6. Else Cluster_ head _msg(NodeID, final_ CH, cost)

11. CONCLUSION  This method can be applied to the design of numerous types of sensor network protocols that require scalability, prolonged network lifetime, fault tolerance, and load balancing.

12. THANK YOU

13. QUERIES