Research Article
Scalable and Storage Efficient Dynamic Key Management Scheme for Wireless Sensor Network
Algorithm 1
Algorithm for cluster and key setup.
| Require: Network | | 1. Every node broadcast a message Si->: M{Si, ki} | | 2. Upon receiveing the M do following: | | for i and j | | if(ki==kj) list=list+(Si,ki) | | else list=list+(Si,0) | | 3. Every node store the common key in the list else store 0 | | 4. For every node where Kj ==0 Node send a message | | Si->Sj: M{Si,ui} | | 5. Upon receiveing M Sj do the following | | if(ki !==0) | | if(uj<ui) H(uj-ui)Ki | | else | | generate x= Hu0 (uN1 uN2 S1S2) | | list=list+(Ni,x) | | 6. The node with maximum degree is selected as CH | | 7. CH generare a group key and distribute to members | | 8. Every key stored in node is hashed by one more time | | Ki=H(ki), u0=u0+1 |
|