LASCNN algorithm: Difference between revisions

Revision as of 15:43, 15 August 2020

Revision as of 16:03, 15 August 2020

Line 1:

LASCNN is a Localized Algorithm for Segregation of Critical/Non-critical Nodes <ref>Imran, Muhammad, Mohamed A. Alnuem, Mahmoud S. Fayed, and Atif Alamri. "Localized algorithm for segregation of critical/non-critical nodes in mobile ad hoc and sensor networks." Procedia Computer Science 19 (2013): 1167-1172.</ref><ref>Alnuem, Mohammed, Nazir Ahmad Zafar, Muhammad Imran, Sana Ullah, and Mahmoud S. Fayed. "Formal specification and validation of a localized algorithm for segregation of critical/noncritical nodes in MAHSNs." International Journal of Distributed Sensor Networks 10, no. 6 (2014): 140973</ref>

This algorithm can distinguish the critical nodes of the network with high precision, and the accuracy can reach 90%. The accuracy of this algorithm can reach 100% when identifying non-critical nodes <ref>Zhang, Y.; Zhang, Z.; Zhang, B. A Novel Hybrid Optimization Scheme on Connectivity Restoration Processes for Large Scale Industrial Wireless Sensor and Actuator Networks. Processes 2019, 7, 939. </ref>

==Pseudocode==

Line 34 ⟶ 36:

(28)End For

</pre>

<ref>Alnuem, Mohammed, Nazir Ahmad Zafar, Muhammad Imran, Sana Ullah, and Mahmoud S. Fayed. "Formal specification and validation of a localized algorithm for segregation of critical/noncritical nodes in MAHSNs." International Journal of Distributed Sensor Networks 10, no. 6 (2014): 140973</ref>

==See also==