A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Critical Node Detection <s> This correspondence considers networks where nodes are connected randomly and can fail at random times. It provides scaling laws that allow to find the critical time at which isolated nodes begin to appear in the system as its size tends to infinity. Applications are in the areas of sensor and ad-hoc networks where nodes are subject to battery drainage and 'blind spots' formation becomes a primary concern. The techniques adopted are based on the Chen-Stein method of Poisson approximation, which allows to obtain elegant derivations that are shown to improve upon and simplify previous related results that appeared in the literature. Since blind spots are strongly related to full connectivity, we also obtain some scaling results about the latter. <s> BIB001 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Critical Node Detection <s> Ad hoc routing protocols have been designed to efficiently reroute traffic when confronted with network congestion, faulty nodes, and dynamically changing topologies. The common design goal of reactive, proactive, and hybrid ad hoc routing protocols is to faithfully route packets from a source node to a destination node while maintaining a satisfactory level of service in a resource-constrained environment. Detecting malicious nodes in an open ad hoc network in which participating nodes have no previous security associations presents a number of challenges not faced by traditional wired networks. Traffic monitoring in wired networks is usually performed at switches, routers and gateways, but an ad hoc network does not have these types of network elements where the intrusion detection system (IDS) can collect and analyze audit data for the entire network. A number of neighbor-monitoring, trust-building, and cluster-based voting schemes have been proposed in the research to enable the detection and reporting of malicious activity in ad hoc networks. The resources consumed by ad hoc network member nodes to monitor, detect, report, and diagnose malicious activity, however, may be greater than simply rerouting packets through a different available path. This paper presents a method for determining conditions under which critical nodes should be monitored, describes the details of a critical node test implementation, presents experimental results, and offers a new approach for conserving the limited resources of an ad hoc network IDS. <s> BIB002 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Critical Node Detection <s> The communication networks having different types of nodes, links and other resources cause uneven distribution of the traffic loads. Also the chances of failure increase with the growth of the network size. To avoid such uneven traffic distribution and failure, and to continue with the usual traffic load, some precautions must be taken. This paper as a remedy, introduces a concept of critical nodes (CN) and the formation of critical rings (CR) around CN to relive the networks from such unequal traffic distribution and failure. In brief, a node is termed as critical node that establishes maximum source-terminal paths and a critical ring is defined as the nearest ring around a CN by considering the nodes directly connected to the CN, which may require inserting one or more links. The merits of this CR are that it can bypass some of the routes of the CN and convert it into non- critical node, and can tolerate fault(s) occurring on or around CN, thus make the network fault-tolerant. The proposed concepts have been applied to a sample network of 11 nodes and above mentioned remedies have been achieved. <s> BIB003 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> Protocols for Critical Node Detection <s> This paper considers a network where nodes are connected randomly and can fail at random times. The critical- node test detects nodes, whose failures are malicious behavior, disconnects or significantly degrades the performance of the network. The critical node is an element, position or control entity whose disruption, is immediately degrades the ability of a force to command, control or effectively conducts combat operations. If a node is critical node, then more attention must be paid to it to avoid its failure or removal of a network. So how to confirm critical nodes in the ad hoc network is the premise to predict the network partition. A critical node is the most important node within the entity of a network. This paper suggests methods that find the critical nodes of a network based on residual battery power, reliability, bandwidth, availability and service traffic type. The metrics for evaluation has been considered as packet delivery ratio, end-to-end delay and throughput. Nodes in Mobile Ad hoc Networks (MANETs) are battery powered and hence have limited lifetime. Due to excessive utilization a node may die which can result in energy depletion problem and thereby affect overall network performance. Local rate of energy consumption based on application can be monitored. Thus early detection and avoidance of energy depletion problem is possible based on monitoring of power and remaining battery lifetime. As and when the rate of consumption based on the application returns to efficient levels, the mobile relay is released so that it can be made available for other critical nodes. This technique can be applied to any protocol used in MANETs such as DSDV, DSR, AODV, TORA etc. In this work, we focus on maximizing avoidance of network partition, rather than after the network partition, then taking some remedial measures. We describe the critical nodes compensation approach to increase the network connectivity and improve packet delivery rate. First, we detect the critical nodes which may lead to the network partitioning. Secondly, propose the compensation algorithm to avoid the network partitioning. This approach described in this paper is built around the notion of a critical node in an ad hoc network. Our definition of a critical node is a node, whose failure or malicious behavior disconnects or significantly degrades the performance of the network. Once identified, a critical node can be monitored in terms of resource. If a node is not considered critical, this metric can be used to decide if the application or the risk environment warrant the expenditure of the additional resources required to monitor, diagnose, and alert other nodes about the problem. Determining the global network topology in a MANET gives the time delays of the diagnostic packets and the mobility of the nodes makes this task futile, but determining an approximation of this topology or subset of this topology, within a certain time frame may be useful. An approximation of the network topology can still provide useful information about network the density, network mobility, critical paths, and critical nodes. Even with the uncertainty associated with correctly reconstructing the network topology for a given time period, this additional information can help to reduce the resources consumed to monitor all nodes in the absence of this information. <s> BIB004
The communication networks having different types of nodes, links, and other resources cause uneven distribution of the traffic loads. Also the chances of failure increase with the growth of the network size. To avoid such uneven traffic distribution and failure and to continue with the usual traffic load, some precautions must be taken. Critical rings BIB003 are conceptual rings formed around critical nodes to relieve the networks from such unequal traffic distribution and failure. A critical ring is defined as the nearest ring around a critical node by considering the nodes directly connected to that node, which may require inserting one or more links. Repeated formation of critical rings may eventually convert the critical node into noncritical node and can make the network fault tolerant. These critical nodes shall also be detected well in advance by critical node prediction  . Alternatively, critical nodes compensation algorithm BIB004 is also proposed in order to prevent network from partitioning, thereby insuring network connectivity and throughput. DFS was equally used to detect critical nodes BIB001 . The algorithms in BIB002 require that a node should be aware of global topology. In practice, this method is inefficient and involves huge communication overhead. Distributed algorithms for critical node detection algorithm for wireless ad hoc networks greatly reduce communication overheads and the speed of detection BIB004 . Clustering the nodes is a wiser solution to reduce overhead and equally to achieve lesser critical nodes, but, here, a significant source of overhead is the reclustering of nodes due to dynamic changes in network topology. If we manage to minimize the effect of reclustering then we expect the performance of the network to be improved (e.g., more scalable and survivable network). One solution is to group the nodes by some operating mobility characteristics (like the direction of mobility, velocity, and location) and then to cluster them accordingly  . By this approach, the topology changes will not affect the intracluster connectivity. However,