Reasearch On The Algorithm Of Topology Control In Directional Ad Hoc Network

Characteristics such as self-organziation,self-maintainence,multi-hop and so on make Ad Hoc network suitable for military field and urban field such as post disaster emergency communication.The topology control mechanism of Ad Hoc network directly affects the performance of network,such as network capacity,ability of anti-jamming and network life.With the development of antenna technology,the application of directional antennas in Ad Hoc network is increasing.The directional antenna in Ad Hoc network can expand the communication range of nodes,improve the spatial multiplexing of the network and enhance the anti-interference ability of the network.At the same time,the fan-shaped communication area and directivity gain of the directional antenna will affect the network connectivity,all these factors make topology construction more complicated.In this paper,the topological control algorithm of directional Ad Hoc network is classified and summarized,and the directional topology control algorithm based on multi-beam switching antenna and MRA(Multiple Radio per node Architecture)structure is designed respectively.The proposed algorithm is simulated and analyzed in MATLAB.Based on the switch beam antenna,the topology control algorithms are designed.Considering switch beam antenna has non-uniform radiation pattern within the beamwidth,with such model of gain,two directional topology control algorithms are designed with given antenna oriention and ungiven antenna oriention: MPGO(MinPower with Given Antenna Orientation)and MPUO(MinPower with Ungiven Antenna Orientation),both two algorithms are heuristic algorithms.The topology goal of the two algorithms is to minimize the communication power of the network on the basis of the network connected and achieve the goal of energy saving.The two algorithms are simulated by MATLAB,and the communication power of two algorithms are compared.The influence of node density and beam width on the network communication power are analyzed.The DCDT(Degree Constrained Delaunay Triangulation)algorithm,DCCN(Degree Constrained Closet Neighbor)algorithm and DCTD(Degree Constrained Traffic Delivery)algorithm based on MRA structure are proposed.All three algorithms are degree constraint algorithm and also centralized algorithm.Among them,the main goal of DCDT algorithm and DCCN algorithm is to make the communication distance between nodes small under the constraint of node degreesd with connected network.DCTD algorithm is a heuristic algorithm.The main goal is to construct the topology based on the location information,traffic matrix,node degrees and link capacity of the nodes.Compared with the DCDT algorithm and the DCCN algorithm,DCTD algorithm out performs in improving the network capacity,and reducing the network load.The DCTD algorithm is simulated and analyzed by MATLAB,and compared with the DCDT algorithm and DCCN algorithm.