CNLRA: Critical Node and Link Reconnect Algorithm for Wireless ADHOC Networks using Graph Theory Sugitha G.*, Raj A. Albert** *Research Scholar, Anna University, Chennai, Tamilnadu, India **Professor, DMI Engineering College, Aralvaimozhi, Tamilnadu, India Online published on 2 August, 2016. Abstract Maintaining connectivity is a prime concern in most of the applications in wireless adhoc networks. Failure of a node may partition the network into disjoint segments and may hinder the data communication. Timely identification of such nodes and rapid recovery procedures are of great importance for survivability. In this paper we proposed a graph theoretic based Critical Node Reconnect Algorithm (CNRA) and Critical Link Reconnect Algorithm (CLRA) for connectivity maintenance by endowing with a new link. Through simulation we have shown the efficiency of our algorithm. Compared to similar work, our proposed algorithm has less overhead and delay. The packet delivery ratio and the throughput are increased. Top Keywords Wireless adhoc networks, Critical node, critical link, bi-connectivity, Connectivity restoration. Top |