Research On The Critical Nodes Compensation Algorithm In Mobile Ad-hoc Networks

Multi-hop, dynamic topology, un-infrastructure and network flexibly are the main characters of mobile ad hoc networks (MANET) which offer it a bright application prospect in both military and commercial use. Most researches in this realm are based on the precondition that the network is connected. While the networks may suffer from partition due to the nodes' move or the consumption of energy. Therefore we try to find ways to avoid the network partition. In this paper, firstly the definition of critical nodes and the method to detect them are given, enclosing a comparison with Depth First Search algorithm. Secondly, two compensation algorithms are proposed to avoid the network partitioning, both of which are on the basis of the detection of the critical nodes. In one algorithm, nodes determine their relative position by the use of smart antennas; and in the other power control technology is applied to improve the network connectivity. At the end of the paper, simulation and analysis of the compensation algorithm in OPNET are given, and the compensated network's performance under different mobility models and different parameters are verified. The results show that the compensation algorithms can improve the network performance dramatically.