Abstract: In three-dimensional Ad hoc networks, complex topologies and node random moves can lead to routing difficulties. Therefore, this paper presents routing algorithm using hypercube cluster. With positional information of nodes to build hypercube, cluster-forming process is simple and scalable. Furthermore, cluster reconstruction mechanism is introduced, since nodes move randomly. Using hypercube cluster structure, this paper transforms the network topology, and determines the communication numbers between clusters. The communication numbers between clusters can provide relevant information of route finding, therefore, can effectively simplify the routing process. Simulation results indicate the feasibility of the routing algorithm presented, and it achieves the goal in simplifying the three-dimensional Ad hoc network topology and routing correctly.

Key words: three-dimensional Ad hoc network, hypercube cluster structure, clustering algorithm, routing algorithm

摘要： 针对三维Ad hoc网络拓扑结构复杂和节点随机移动导致寻路困难的问题，提出了基于多层立方体簇结构的路由算法。借助节点的位置信息构建多层立方体，成簇过程简便并且扩展性强;由于节点随机移动，引入了簇重构机制。利用多层立方体簇进行拓扑转化及簇间通信编号。簇间通信编号能够提供到达地址的相关路径信息，有效简化了路由过程。仿真分析表明，提出的策略正确可行，达到了简化三维Ad hoc网络拓扑、正确路由的目的。

关键词: 三维无线自组网, 多层立方体簇结构, 成簇算法, 路由算法