Research On Routing Algorithm Based On Multi-mobile Agents In Wireless Sensor Networks

With the rapid development of microelectronics,wireless communication and other technologies,wireless sensor network technology has been widely used and researched,and gradually integrated into all areas of people's lives,changing the way people interact with the physical world,which has improved people's ability to recognize and transform the physical world.The wireless sensor network is composed of a large number of micro-sensor nodes deployed in a specific area.The energy of the sensor nodes is limited and difficult to supplement.Therefore,how to design efficient and energy-efficient routing algorithms to extend the life cycle of the network has become a hot research topic in wireless sensor networks.Mobile agent technology is a new type of distributed technology.Compared with the traditional client / server model,mobile agent technology can perform data operations at the node level rather than the aggregation level,which can effectively reduce redundant data on the network and improve performance.In this paper,mobile agent technology is applied to wireless sensor networks,and heuristic algorithms are used to optimize the migration path of mobile agents.Multi-mobile agents routing algorithm based on data load balancing(DLB)and multi-mobile agents routing algorithm based on multiple neighborhood guided local search(MNGLS)are proposed.The algorithm proposed in this paper effectively reduces the energy consumption of the network and extends the life cycle of the network.The main research work of this article is as follows:(1)Multi-mobile agents routing algorithm based on data load balancing is proposed.The algorithm considers not only the geographic information of the nodes,but also the load limitation of the mobile agent.First,establish a polar coordinate system.According to the data size of each sensor node,the sensor nodes are divided into non-uniform sectors with different sizes.Each directed sector dispatches a mobile agent,and the data size collected by the mobile agent meets the capacity constraints;then,the heuristic algorithm of 2-opt iterative local search is used to optimize the migration path of each mobile agent,further reducing the energy consumption of the network;finally,the Sink node dispatches mobile agents to collect data according to the data collection strategy.(2)Multi-mobile agents routing algorithm based on multiple neighborhood guided local search is proposed.The algorithm first uses the nearest neighbor algorithm to initialize the mobile agent path;then from this initial solution,it simultaneously performs local search in multiple neighborhood structures(exchange,insertion,2-opt,and 2-opt *);when the algorithm falls into the local optimum,a penalty strategy is used to punish the arc with the largest utility value in the current optimal solution,and the objective function is adjusted;through the continuous modification of the objective function,the algorithm jumps out of the current local optimal solution and continues to approach the global optimal solution.Finally,the algorithm outputs the number of mobile agents and the migration path,and the Sink node dispatches the mobile agent.(3)Experimental simulation and analysis.Through the Castalia platform simulation experiment,the two algorithms proposed in this paper are compared with the EMIP algorithm and TBID algorithm.The experimental results show that the DLB and GLS algorithms proposed in this paper have good performance in network energy consumption and task delay.