Modifled Lowest ID Algorithm for Practical Wireless Clustered Network
Wojciech Bednarczyk · 2015
E-ciency of the Lowest Node ID (LNID) clustering algorithm has been assessed in this paper. In the article we proposed the LNID clustering based on the classical Lowest ID algorithm. The proposed algorithm has the following crucial features: stabilizing procedures, ability to change the state during work, a state machine with semi-stable states and MAC address as ID nodes. Tests have been done for static network assuming Free Space Path Loss propaga- tion model with assumed reliability of information delivery ratio link. The performance of this algorithm is evaluated through simulation and results are promising.