Research On Greedy Perimeter Stateless Routing Protocol In Unmanned Aerial Vehicle Ad Hoc Network

With the increasing maturity of Unmanned Aerial Vehicle technology and the need of future battlefield,Unmanned Aerial Vehicle Ad Hoc Network(UAVANET)has been widely concerned by many researchers.However,due to the high-speed movement of Unmanned Aerial Vehicle nodes,the topology of UAVANET changes too frequently and the links are easily broken,which seriously affects the performance of UAVANET.In order to establish more reliable communication,the research on UAVANET routing protocol has become one of the important topics in this field.With the rapid development of location technology,Unmanned Aerial Vehicle can easily obtain its own location information,which makes the routing protocol based on geographic location widely used in UAVANET.Greedy perimeter stateless routing(GPSR)protocol,as a typical geographic route,is simple and efficient,and has become a research hotspot.However,in the highly dynamic UAVANET,GPSR protocol will show problems such as frequent peripheral forwarding and inaccurate information maintained by neighbor list.In order to solve the above problems,the main research contents of this paper are as follows:Firstly,a GPSR protocol based on mobile prediction and node stability(GPSR-MPNS)is proposed to solve the problem of inaccurate location of neighbor nodes caused by periodic HELLO mechanism and poor link stability caused by high-speed movement of node in GPSR protocol.The protocol introduces a failure node screening mechanism to predict the position of neighbor nodes and eliminate the failed neighbor nodes in the neighbor list,which reduces the probability of data forwarding by the failure nodes.At the same time,it comprehensively considers the distance between neighbor nodes and destination nodes,link lifetime and the number of effective neighbor nodes to select the next hop forwarding node,in order to improve the stability of the selected node and make the established link more reliable.Secondly,in the GPSR protocol,while improving the accuracy of neighbor node location information in order to avoid the low data forwarding efficiency caused by the selected nodes becoming hole nodes,a GPSR protocol based on neighboring node screening(GPSR-NS)is proposed.In this protocol,firstly,the failure node screening mechanism is also adopted to eliminate the failed neighbor nodes in the neighbor list.Then,a hole node screening mechanism is introduced to eliminate neighbor nodes that the next hop may become a hole node in the set of pending neighbor nodes.Finally,in the set of effective neighbor nodes,the original greedy forwarding mode is used to forward the data.The GPSR-NS protocol can improve the effectiveness of neighbor list by avoiding the failed nodes and the hole nodes in neighbor list in advance,thus improve the forwarding efficiency of data packets.Finally,the average end-to-end delay,packet loss rate,routing overhead and network throughput are taken as evaluation indexes.In Ubuntu16.04 and NS2.35 simulation platform,GPSR-MPNS protocol and GPSR-NS protocol are simulated and compared with the existing GPSR protocol and MP-GPSR protocol.The simulation results show that the two protocols proposed in this paper can effectively reduce the average end-to-end delay,packet loss rate and routing overhead of UAVANET,and improve the network throughput.Between them,the performance of GPSR-NS protocol is better than GPSR-MPNS protocol,which can better adapt to the highly dynamic UAVANET.