A significant feature of wireless Ad Hoc network is that rapid changes in topology and connectivity are introduced due to node mobility and the constantly changing wireless channel. So it makes sense to design a connected wireless Ad Hoc network and to maintain its connectivity during a later time.Critical nodes, whose removal or failure will disconnect the network into two or more separate components, were introduced in this paper firstly, and then an algorithm to detect them was proposed with detailed description of each step. Once being detected, critical nodes would be eliminated by compensation measures, greatly reduced the risk of network partition.In this paper, the k-connectivity of the network with Random WayPoint mobility model was studied with emphasis, by simulations and theoretical analysis respectively. And a formula to calculate the probability of network k-connectivity in any convex polygons was deduced based on the available research. The results obtained are of practical value to range assignment to keep a k-connected network. |