Jump to content

LASCNN algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Charmk (talk | contribs) at 18:19, 15 August 2020. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

LASCNN is a Localized Algorithm for Segregation of Critical/Non-critical Nodes [1] The algorithm worked on the principle of distinguishing between the critical and non-critical nodes for the network connectivity based on limited topology information [2]The algorithm find the critical nodes with the partial information within a few hops. [3]

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 [4] The performance of LASCNN is scalable and quite competitive compared to other schemes [5]

Pseudocode

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 [6][7] 

Function LASCNN(MAHSN)
 Forβˆ€π΄βˆˆπ‘€π΄π»π‘†π‘
   If (π΄β†’πΆπ‘œπ‘›π‘›πΏπ‘–π‘ π‘‘.getSize()==1)then
      𝐴→SetNonCritical()=LEAF
   Else
      Continue = TRUE
      While (Continue==TRUE)
         Continue = FALSE
            Forβˆ€π΄π‘π‘‘π‘–Vπ‘’πΆπ‘œπ‘›π‘›βˆˆπΆπ‘œπ‘›π‘›πΏπ‘–π‘ π‘‘
               If (π΄βˆ‰π΄π‘π‘‘π‘–Vπ‘’πΆπ‘œπ‘›π‘›)then
                 If (π΄β†’πΆπ‘œπ‘›π‘›π‘π‘’π‘–π‘”β„Žπ‘π‘œπ‘Ÿπ‘ .getSize()==0)
                    π΄β†’πΆπ‘œπ‘›π‘›π‘π‘’π‘–π‘”β„Žπ‘π‘œπ‘Ÿπ‘ .add(𝐴𝑐𝑑𝑖Vπ‘’πΆπ‘œπ‘›π‘›)
                    Continue = TRUE
                 else
                    If (𝐴𝑐𝑑𝑖Vπ‘’πΆπ‘œπ‘›π‘›βˆ©πΆπ‘œπ‘›π‘›π‘π‘’π‘–π‘”β„Žπ‘π‘œπ‘Ÿπ‘ ==TRUE)
                       𝐴𝑐𝑑𝑖Vπ‘’πΆπ‘œπ‘›π‘›βˆͺπΆπ‘œπ‘›π‘›π‘π‘’π‘–π‘”β„Žπ‘π‘œπ‘Ÿπ‘ 
                       Continue = TRUE
                    Endif
                 Endif
              Endif
           End For
     End While
  Endif
  If (π΄β†’πΆπ‘œπ‘›π‘›π‘π‘’π‘–π‘”β„Žπ‘π‘œπ‘Ÿπ‘ .getSize()<π΄β†’π‘π‘’π‘–π‘”β„Žπ‘π‘œπ‘Ÿπ‘ .getSize())
     𝐴→SetCritical()=TRUE
  else
     𝐴→SetNonCritical()=INTERMEDIATE
  Endif
 End For
End Function

See also

References

  1. ^ Muhammad Imran, 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.
  2. ^ N. Javaid, A. Ahmad, M. Imran, A. A. Alhamed and M. Guizani, "BIETX: A new quality link metric for Static Wireless Multi-hop Networks," 2016 International Wireless Communications and Mobile Computing Conference (IWCMC), Paphos, 2016, pp. 784-789, doi: 10.1109/IWCMC.2016.7577157.
  3. ^ Kim, Beom-Su, Kyong Hoon Kim, and Ki-Il Kim. "A survey on mobility support in wireless body area networks." Sensors 17, no. 4 (2017): 797.
  4. ^ 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.
  5. ^ Kasali, F. A., Y. A. Adekunle, A. A. Izang, O. Ebiesuwa, and O. Otusile. "Evaluation of Formal Method Usage amongst Babcock University Students in Nigeria." Evaluation 5, no. 1 (2016).
  6. ^ G. Sugithaetal., International Journal of Advanced Engineering Technology E-ISSN 0976-3945
  7. ^ 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

Category:Networks Category:Network theory

Retrieved from "https://en.wikipedia.org/w/index.php?title=LASCNN_algorithm&oldid=973158550"