Study Of An Battlefield Ad Hoc Adaptive Routing Protocol Based On Traffic Graph

Mobile ad hoc networks are not only becoming an important aspect of future mobile communication networks due to their advantages of no center and rapid deployment,but they are also particularly ideal for dealing with communication and networking issues in hostile warfare situations.The battlefield ad hoc network is clearly distinct from the ad hoc network found in regular application environments.Multi-hop transmission,natural classification,node heterogeneity,and cluster mobility are properties of the battlefield ad hoc network.Routing protocols are critical technologies for assisting ad hoc networks in achieving efficient and reliable communication in a battlefield scenario.Interference,fading,and node mobility all increase the likelihood of link disruption and cause link quality to plummet in the battlefield environment.Although the traditional routing protocols consider the influence of link quality on routing performance,how to accurately describe the link quality and its change trend is still a problem worthy of further study.At the same time,these protocols do not make full use of the natural classification characteristics of battlefield networks to construct routing.When applied to data transmission in battlefield environment,there will be a large number of packet loss and frequent rerouting triggered,resulting in a decrease in the throughput of routing protocols and an increase in routing overhead.In view of the above problems,this article uses network traffic graph to describe the link quality information and node information in the network,and proposes an ad hoc network adaptive routing protocol based on network traffic graph to support the communication of ad hoc network in battlefield environment.Firstly,a low overhead construction method of network traffic graph is designed in this article.The statistical information of the node is used to estimate the transmission success rate of the link,and the link duration is calculated by the change of the signal-to-noise ratio of the receiving end.The node information of network traffic graph is obtained by crosslayer parameter sharing and node local calculation.The tree-like logic topology is built based on the natural classification properties of the battlefield network.Based on the tree-like logical topology,a method of adaptively adjusting the interaction period of the network traffic graph according to the local topology change degree is designed to construct the lowcost network traffic graph.At the same time,the method of maintaining network traffic graph based on business flow is designed to realize the timely and low overhead maintenance of network traffic graph.Secondly,according to the characteristics of cluster movement in battlefield environment,relying on the tree-like logic topology,the routing is divided into the routing between nodes in the cluster and the routing between nodes in the cluster.For the routing between nodes in the cluster,relying on the link information maintained in the network traffic graph of the source node,the source node obtains the routing of the destination node by calculation,and the node calculation is used to replace the routing detection,which avoids the link overhead caused by routing detection.For the routing between nodes in the cluster,the mechanism of upward request and downward assignment is adopted.The appropriate gateway node is selected by the management node of the cluster according to the residual energy and other parameters of the node.The data are forwarded through the gateway node,which reduces the transmission of the routing request message and greatly reduces the cost of routing construction.The maintenance of routing path adopts local repair and delay switching to ensure that the data is not lost due to routing failure,so that the data can be transmitted by the optimal path and the network has high throughput.Finally,in order to verify the performance of the routing protocol proposed in this article,the NS3 simulation platform is used to simulate the ad hoc network adaptive routing protocol based on network traffic graph,and the performance is compared with that of DSR,DSDV and ZRP routing protocols.The simulation results show that the ad hoc network adaptive routing protocol based on network traffic graph proposed in this article has better adaptation characteristics to the battlefield network environment,and has low routing overhead and high throughput.