利用节点的移动特性，为在不破坏原有链路的基础上减少或消除Ad hoc 网络中的分割节点，提出了一种基于接收信号强度的节点移动算法．该算法在网络中存在分割节点时，根据接收信号强度分别确定移动节点、目标连接节点以及节点移动的目标位置．文中还根据接收信号强度定义了链路的代价函数，节点的移动就是搜索该函数最小值的过程．仿真结果表明，在节点位置信息未知的情况下，移动单个节点可以增强网络连通性，同时最大程度地保持网络覆盖．

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.