Research On Mobile Aware Routing Algorithm In IPv6 Wireless Sensor Networks

In real life,the application of IPv6 wireless sensor network is more and more extensive,and the traditional static network can no longer fully meet the application requirements of mobile operations.The RPL routing protocol has solved the problem of implementing packet routing on resource-constrained devices to a certain extent,but it cannot meet the need to provide mobility support between nodes,which will affect the overall life and reliability of the network.Therefore,based on the RPL routing protocol,a mobile-aware routing algorithm that can find the optimal parent node in time during node movement and reduce energy consumption is proposed.main tasks as follows:1.Analyze the current research status of the mobility of IPv6 wireless sensor networks,and classify the node movement scenarios,including uniform speed movement and random movement.Introduce the RPL routing protocol and analyze the node mobility problems of IPv6 wireless sensor networks,respectively elaborating the problems caused by node mobility,node mobility scenario classification,optimal parent node selection,node mobility detection and links Switch.2.Aiming at the problem of high packet loss rate and high energy consumption in nodes moving at a constant speed,this thesis proposes a mobile-aware routing algorithm that can quickly forward messages and reduce network energy consumption.The algorithm first modifies the ICMPv6 control message and optimizes the objective function according to multi-metrics,then introduces link indicators to achieve mobility detection,dynamically adjusts the DIS message sending interval according to the moving speed and direction of the mobile node,and finally designs a combination of soft and hard handover Link switching mechanism.3.Aiming at the problems of high energy consumption and low packet transmission rate in the random movement of nodes,this thesis proposes an energy-saving optimal parent node selection algorithm,and proposes a dynamic Trickle algorithm.The optimal parent node selection algorithm selects the optimal parent node for the mobile node based on adding multiple routing metrics and improving the objective function.The dynamic Trickle algorithm dynamically adjusts the time interval according to the number of neighbor nodes to solve the problem of listening only for a long time.The routing algorithm can improve the network packet transmission rate and reduce energy consumption.4.This thesis uses Cooja under Contiki to verify the two proposed mobile-aware routing algorithms.Compared with the existing OR-RPL,E-Trickle,m RPL,ME-RPL and other algorithms,the simulation results show that in a uniform speed environment,the average packet loss rate is reduced by 25%,and the average number of DIS messages sent is reduced 27.2%,the average energy consumption decreased by 4.3%.In a random mobile environment,end-to-end latency is reduced,and the average packet transmission rate is increased by 11.7%,reducing energy consumption.