期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2016
卷号：42
期号：1
页码：26-32
DOI：10.14445/22312803/IJCTT-V42P105
出版社：Seventh Sense Research Group
摘要：There are some points in a ad hoc network called as critical points whose failure results in partioning of the network in two or more components and makes the network disconnected and if the network become disconnected the data will not be sent to desired destination. It will lead to less throughout and delay of packets. To alleviate this problem , in this paper we proposed a new algorithm based on results from algebraic graph theory, that can find the weak points in the network for single and multiple failure cases. In addition this, the complexity of our algorithm is O(n2), which is better then previous algorithm deployed for finding critical nodes. Experimental results to evaluate the proposed algorithm to detect the nodes and links failure under network conditions are presented.
关键词：Ad hoc networks; connectivity; topology control; critical transmitting range; nodedensity; eigenvector; fiedler vector; Eigen values; laplacian matrix; articulation nodes
