Research Of Mobile Coverage And Routing Algorithms Based On Redundancy In Wireless Sensor Networks

Wireless sensor networks, especially the dynamic wireless sensor networks, withthe advantages of high fidelity sensing data, node position adjustable, controllablenode mobility and network deployment flexibility, it has been widely used inunattended scene, disaster scene, emergency rescuing scene and health caremonitoring. For the great value in use and very broad application prospects ofwireless sensor networks, it has become an industry and academic focus. As theexcessive consumption of energy caused by mobile coverage problem and mobileagent routing problem, we did contributions as follows:Firstly, for the problem of energy consumption involved in mobile coverage androuting algorithms, we proposed a new model for energy management based onredundancy model, which helps decrease the energy consumption from the overallview. And also we bring in virtual force, dynamic coverage sensing model and mobileagent technology, which makes the new model more adapted to the mobile maximumarea coverage algorithm based on sustaining mobility and redundancy based mobileagent algorithm.Secondly, since the coverage rate is very low in the static and sparse wirelesssensor networks, and there is no need to make every point of the target area monitoredall the time. We proposed a mobile maximum area coverage algorithm based onsustaining mobility, in which we use virtual force to get workspace for every sensornode, and also the theorem of equal circumference is imported to shorten the movingdistance and reduce the overlapped area and sensing energy. According to thesimulation we made, the mobile maximum coverage algorithm based on sustainingmobility can improve the coverage rate effectively, and the energy effectiveness of thenetwork is improved greatly. Obviously, it has well utility.Thirdly, for the excessive consumption of energy caused by the mobile agentrouting problem in wireless sensor networks, we proposed a redundancy based mobileagent algorithm, in which we bring in redundancy parameter together with residualenergy parameter and shortest distance parameter. Methods adopted to eliminateredundant nodes and optimize mobile agent itinerary includes threshold processing and improved post-order transversal. According to the simulation we made, theredundancy based mobile agent algorithm decreases data delay, and consumes lessenergy than GAor NOID.So the network lifetime is prolonged.