Abstract: A routing algorithm suitable for different node density is proposed for the communication environment underwater（DNDR）. Each node determines its optimal relay nodes based on the relative positional relationship between neighbor nodes and the sink node. When the node density is considerable, the node determines its one-hop relay nodes during the network initialization procedure; while there are fewer nodes in the network, the node determines its relay nodes dynamically through communication with other neighbor nodes. Simulation results show that the route from the algorithm has the advantages of low node energy consumption, high deliver rate and small average delay.

Key words: Underwater Wireless Sensor Network（UWSN）, received signal strength, one-hop relay node, multiple-times relay node

摘要： 针对水下网络通信环境的特点，提出了一种适合不同节点密度的水下传感器网络路由算法，每个节点利用邻居节点相对sink节点的位置关系确定满足最优条件的中继节点。在节点密度较大时，节点在网络初始化时确定其一跳中继节点；节点密度较少时，节点通过相互通信动态确定其中继节点。仿真结果表明，算法生成的路由具有节点能耗低、成功传递率高，平均时延小等优点。

关键词: 水下传感器网络, 接收信号强度, 一跳中继节点, 多倍中继节点