Research Article
Design of Energy-Efficient Protocol Stack for Nanocommunication Using Greedy Algorithms
Algorithm 1
Formation of nanocluster.
(1) | Notations | (2) | i = no. of deployed nanoNodes | (3) | WNC = residual energy of nanoNode i | (4) | GNN = General nanonode | (5) | imax(Energy) = nanoNode with maximum energy | (6) | Data | (7) | , | (8) | Result | (9) | NanoCluster | (10) | foreach i do | (11) | Calculate Energyresidual using | (12) | Multicast WNC within nanoCluster | (13) | if imax(Energy) then | (14) | status ← nanoClusterNode | (15) | Else | (16) | status ← GNN | (17) | End | (18) | Elected nanoClusterNode multicast message to all GNN | (19) | foreach GNN do | (20) | Check RSSI from nanoClusterNode within range | (21) | Send join request to nanoClusterNode having maximum RSSI | (22) | Register GNN to that nanoCluster | (23) | End |
|