Revision as of 18:32, 15 August 2020 edit Charmk (talk \| contribs) Extended confirmed users 6,013 edits No edit summary ← Previous edit		Revision as of 18:33, 15 August 2020 edit undo Charmk (talk \| contribs) Extended confirmed users 6,013 edits No edit summary Next edit →
Line 6: The LASCNN algorithm establishes k hop neighbor list and a duplicate free pair wise connection list based on k hop information. If the neighbors are stay connected then the node is non critical <ref>G. Sugithaetal., International Journal of Advanced Engineering Technology E-ISSN 0976-3945</ref><ref>~~Alnuem,~~ Mohammed Alnuem, 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> <pre>

LASCNN algorithm: Difference between revisions