As the failure of a critical node will directly partition a network
a theorem for critical node identification was proved
which indicates that node degree Ni and elementary loop degree Mi of node i are two decisive factors for the exis-tence of a critical node and shows that Ni-Mi≥ 2 is the necessary and sufficient condition for node i being critical.Based on the theorem
a distributed topology partition detection algorithm(distributed partition detection protocol
DPDP) was presented for large scale networks
which achieves the goal of partition detection efficiently by detecting critical nodes in a local area.Theoretic analysis and experiment results show that DPDP has the advantages of low complexity
Critical nodes selection based on trust evaluation in Ad Hoc networks
Analysis of load balance performance of multipath in wireless ad hoc networks
Congestion control scheme based on frame transmission utility in wireless ad hoc networks
Related Author
Zhuo-chao LIU
Li YANG
Qi JIANG
Wei WANG
Chun-jie CAO
WANG Hui
YU Neng-hai
YE Jin1
Related Institution
School of Computer Science and Technology,Xidian University
Science and Technology on Communication Information Security Control Laboratory,the 36th Research Institue of CETC
College of Information Science and Technology,Hainan University
Department of Electronic Engineering and Information Science, MOE-Microsoft Key Laboratory of Multimedia Computing and Communication, University of Science and Technology of China