Search

Abstract: Timely segregation of connectivity-centric critical/non-critical nodes is extremely crucial in mobile ad hoc and sensor networks to assess network vulnerabilities against critical node failures and provide precautionary means for survivability. This paper presents a localized algorithm for segregation of critical/non-critical nodes (LASCNN) that opts to distinguish critical/non-critical nodes to the network connectivity based on limited topology information. Each node establishes and maintains a k-hop connection list and employ LASCNN to determine whether it is critical/non- critical. Based on the list, LASCNN marks a node as critical if its k-hop neighbor's become disconnected without the node, non-critical otherwise. Simulation experiments demonstrate the scalability of LASCNN and shows the performance is quite competitive compared to a scheme with global network information. The accuracy of LASCNN in determining critical nodes is 87% (1-hop) and 93% (2-hop) and non-critical nodes 91% (1-hop) and 93% (2-hop). [Copyright &y& Elsevier]