Proposed in this paper is a node moving algorithm based on the receiving signal strength,which is used to reduce or eliminate the cut nodes through the node movement without disconnecting the existing links. In this algorithm,according to the receiving signal strength,the moving node,the target node that the moving node tries to connect to,and the moving target position are respectively determined in the presence of cut nodes. Also,the cost
function of links is defined,by which the movement of node is transformed into a process of minimizing the cost function value. Simulated results show that,with the help of the proposed algorithm,the connectivity of Ad hoc networks can be improved only by moving a single node even when the node information is unavailable,and the network coverage keeps unchanged.