Abdmel
Newbie level 1
I'm student and I want some one to help me how run Connected K-Neighborhood(CKN) algorithm
ALGORITHM 1. ENERGY CONSUMED UNIFORMLY-CKN (EC-CKN)
(* Run the following at each node su *)
1. Get the information of current remaining energy Eranku;
2. Broadcast Eranku and receive the energy ranks of its currently
awake neighbors Nu. Let Ru be the set of these ranks.
3. Broadcast Ru and receive Rv from each sv 2 Nu.
4. If Nu < k or Nv< k for any sv from Nv, remain awake.
Return.
5. Compute Eu = sv/sv from Nu and Erank v > Erank u;
6. Go to sleep if both the following conditions hold. Remain awake
otherwise.
Any two nodes in Eu are connected either directly themselves
or indirectly through nodes which is in the su’s 2-hop
neighborhood that have Erankv larger than Eranku;
Any node in Nu has at least k neighbors from Eu.
7. Return.
ALGORITHM 1. ENERGY CONSUMED UNIFORMLY-CKN (EC-CKN)
(* Run the following at each node su *)
1. Get the information of current remaining energy Eranku;
2. Broadcast Eranku and receive the energy ranks of its currently
awake neighbors Nu. Let Ru be the set of these ranks.
3. Broadcast Ru and receive Rv from each sv 2 Nu.
4. If Nu < k or Nv< k for any sv from Nv, remain awake.
Return.
5. Compute Eu = sv/sv from Nu and Erank v > Erank u;
6. Go to sleep if both the following conditions hold. Remain awake
otherwise.
Any two nodes in Eu are connected either directly themselves
or indirectly through nodes which is in the su’s 2-hop
neighborhood that have Erankv larger than Eranku;
Any node in Nu has at least k neighbors from Eu.
7. Return.
