«上一篇
 文章快速检索 高级检索

 哈尔滨工程大学学报  2019, Vol. 40 Issue (9): 1549-1554  DOI: 10.11990/jheu.201803070 0

### 引用本文

YANG Jianmin, QIAO Gang, LIU Songzuo, et al. Neighbor discovery mechanism for directional transmission underwater acoustic communication networks[J]. Journal of Harbin Engineering University, 2019, 40(9), 1549-1554. DOI: 10.11990/jheu.201803070.

### 文章历史

1. 中山大学 海洋工程与技术学院, 广东 广州 518000;
2. 哈尔滨工程大学 水声工程学院, 黑龙江 哈尔滨 150001;
3. 南方海洋科学与工程广东省实验室(珠海), 广东 珠海 519000;
4. 东北农业大学 电气与信息学院, 黑龙江 哈尔滨 150001

Neighbor discovery mechanism for directional transmission underwater acoustic communication networks
YANG Jianmin 1,2,3, QIAO Gang 2, LIU Songzuo 2, YIN Yanling 4
1. School of Marine Engineering and Technology, Sun Yat-sen University, Guangzhou 518000, China;
2. College of Underwater Acoustic Engineering, Harbin Engineering University, Harbin 150001, China;
3. Marine Science and Engineering Guangdong Laboratory(Zhuhai), Zhuhai 519000, China;
4. College of Electrical and Information Engineering, Northeast Agricultural University, Harbin 150001, China
Abstract: Considering the unstable topology of directional underwater communication networks, this paper studies its neighbor discovery mechanism. In this mechanism, the node has two types of data transmission methods:directional and omnidirectional. The neighbor discovery mechanism divides the neighbor nodes of the newly added nodes into two categories:the neighbor nodes in the omnidirectional transmission range and the neighbor nodes in the directional transmission range. The neighbor nodes in the omnidirectional transmission range select some nodes as the neighbor nodes according to the neighbor node discovery mechanism. The selected neighbor node representative then sends the neighbor node information to the newly added node according to its own situation to complete the neighbor node discovery process. In this paper, the performance of the proposed neighboring nodes is verified by theoretical calculation and simulation analysis. The theoretical results are in good agreement with the simulation results. The simulation results also show that the number of nodes participating in the neighbor discovery process is less than the omnidirectional transmission range. The number of nodes. The main finding of this paper have an important reference value and guidance function to underwater acoustic communication networks.
Keywords: underwater acoustic communication networks    neighbor discovery    directional transmission    representative nodes    information redundancy    omni-directional transmission    network topology    transmission rang

1 邻节点发现机制

 ${N_{{\rm{md}}}} = {N_{\rm{m}}} - {N_{{\rm{mo}}}}$ (1)

1) 集合R中所有邻节点代表的定向传输范围的并集应覆盖新增节点n的定向传输范围；

2) 在满足第1个原则的前提下，保证集合R中节点数量最小。

1) 按照新增节点n全向范围内邻集合Nno中节点与新增节点n的距离确远近定该节点是否属于集合R及在集合R中的节点次序。选取离节点n最近的邻节点添加进代表集合R，并编号为m1。如图 4所示，节点m1向新增节点n发送集合NnNm1中包含的邻节点信息，这包括节点m1与节点n定向传输范围内所有节点n的邻节点；

 Download: 图 4 邻节点m1向节点n发送邻节点信息的节点集合 Fig. 4 The node set of the neighbor node m1 sends neighbor information to the node n

2) 将节点n全向传输范围内邻节点集合Nno中距离节点n第2近的节点添加进邻节点代表集合R，并编号为m2。节点m2向新增节点n发送以下集合中的邻节点信息：

 $({N_{\rm{n}}} \cap {N_{{\rm{m2}}}}) - [({N_{\rm{n}}} \cap {N_{{\rm{m1}}}}) \cap {\rm{ }}({N_{\rm{n}}} \cap {N_{{\rm{m}}2}})]$ (2)

 Download: 图 5 全向传输范围内邻节点工作流程 Fig. 5 Omnidirectional neighbor nodes neighbor discovery workflow

 Download: 图 6 邻节点发现机制示例 Fig. 6 Example of the proposed neighbor discovery mechanism

2 性能分析与仿真结果

λ为节点n全向传输范围内预期节点数量：

 $\lambda = \rho {\rm{ \mathsf{ π} }}{d^2}$ (3)

P(m)表示节点n在全向传输范围内发现P(m)个邻节点的概率，P(m)服从泊松分布。P(m)可以表示为：

 $P\left( m \right) = \frac{{{\lambda ^m}{{\rm{e}}^{ - \lambda }}}}{{m!}}$ (4)

 ${\rm{E}}\left[ {C\left( m \right)} \right] = \sum\limits_{k = 0}^{1{\rm{ }}000} {P\left( k \right)C\left( k \right)}$ (5)

 Download: 图 9 `平均邻节点代表数量 Fig. 9 Average number of the representative nodes
3 结论

1) 本文设计的邻节点机制能够提升网络中节点通信距离，增加网络覆盖范围，并且能够提高通信隐蔽性。

2) 随着新增节点全向传输范围内邻节点数量的增加，所提邻节点发现机制对新增节点定向传输范围内平均覆盖率同时增加，当全向传输范围内邻节点数量增加到一定程度时，所提邻节点发现机制能覆盖新增节点全部定向传输范围。

3) 不需要新增节点全向范围内所有邻节点参与到邻节点发现过程，随着新增节点全向范围内邻节点数量增加，所需邻节点代表数量越少。