Research Of Routing Algorithm Based On RWP Mobile Model In Mobile Wireless Sensor Networks

After years of the mobile wireless sensor networks development,it has beenwidely used in the military, environmental science and wildlife monitoring and otherfields.Currently, the mobile wireless sensor networks is one of the many countries andresearch sectors focused attention.Mobile wireless sensor network is composed of alarge number of mobile sensor nodes deployed in a fixed area, because the nodemobility, dynamic changes in the network topology, the source node to the destinationnode can not maintain a fixed path, so the traditional routing algorithms not apply tomobile wireless sensor networks.In mobile wireless sensor networks, the node moves to comply with the mobilitymodel is the basis of the routing algorithm,design related routing algorithm must fullyconsider the characteristics of the model node mobility, due to memory capacity andthe energy of each mobile sensor nodes are limited, therefore,in the routing selection,the memory capacity of the node effective management is vital to the entire networklife cycle.In this paper, for mobile wireless sensor network characteristics,node-based RWP(Random Way Point) mobility model,we have been studied the routing algorithms andmessage queue management network.related work as follows:Firstly, analysis of the existing routing algorithms, these algorithms are mostlybased on historical information to determine the probability of the node and thedestination node next encounter, and use this probability as a guide for the message tobe forwarded. Due to the nature of historical knowledge to predict the statisticalprobability of encounter, and defects inherent statistical uncertainty.Based on thenature of historical knowledge is to use statistical methods to predict the probabilityof encounter, and statistical methods inherent uncertainty defects.Then in thispaper,node-based RWP mobility model and motion state of the node, we propose anew routing algorithm LDM, the algorithm through the establishment of nodemovement mathematical model,derive the current node transmission probability,whenmaking the routing selection,LDM use the transmission probability and remainingenergy of nodes as a reference to choose the next hop node.Secondly, in LDM algorithm, for the management of message queues, byanalyzing the existing message queue management algorithm DOA, LIFO, MOFO,considering the success rate of transmission, message storage time, messageforwarding times and other factors, proposed based on the age and size of the message management algorithms MDC-AS.Finally, Use ONE emulator with LDM algorithm for the simulation experiments,and with DT, Epidemic, FAD algorithm in the network transmission success rate,average latency, network overhead ratio and network lifetime aspect were compared,the results show, LDM algorithm have more high comprehensive performance.