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

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