Research On Geographic Routing Algorithm Based On Node Mobility Prediction In Ad Hoc Networks

Routing algorithm is one of the key technologies in mobile Ad Hoc networks.The reason why energy efficiency is one of the primary goals of routing protocol design is that the power energy,communication distance and computer power of nodes in the mobile Ad Hoc networks are very limited.Beside this,the nodes in Ad Hoc network also have the characteristic of random mobility,and the fast movement of which can cause frequent updates of network topology and communication links.In this paper,a geographic routing algorithm based on node mobility prediction is studied in order to solve the problem of network performance degradation caused by the rapid change of node position in high dynamic mobile Ad Hoc network.The related knowledge of mobile Ad Hoc network and its routing protocol is introduced in this paper,including the characteristics and application scenarios of mobile Ad Hoc network.And the principle and characteristics of the existing main routing protocols are compared and analyzed in detail.We design a beacon free geographic routing algorithm based on link lifetime,which aims at the problem of network communication performance degradation in mobile Ad Hoc networks due to the unstable of communication links.The algorithm selects the best node in the request domain as the relay node to transmit the data considering the residual energy and the geographical location of nodes and the link lifetime in order to improve the network lifetime and the packet delivery ratio.The simulation results show that the algorithm can balance the energy consumption of the nodes,prolong the network lifetime,and improve the packet delivery rate effectively.A geographic routing scheme based on real-time node location prediction is proposed which can improve the success rate of data transmission and energy efficiency.The scheme uses the node location prediction algorithm which combines GPS location and RSSI algorithm to locate the mobile nodes in real time and constructs the least energy consumption routing on the basis of ESGR routing algorithm.Besides this the schem can also predict the location of each node in real time and the communication power of the node is dynamically adjusted as well as predict the communication link break time to find a new route before the link break according to the prediction result of node location.In addition,we propose a path search strategy to solve the problem of routing holes which makes the selection of relay nodes more reasonable and efficient.The simulation results show that the proposed scheme can effectively reduce the network energy consumption and improve the success rate of data transmission.