| Wireless Sensor Network(WSN)is a new information access and treatment technologies, developing with progress in MEMS technology,embedded computing technology and wireless communications. People can obtain the interesting information by deploying plenty of cheap micro sensors in inspecting area.Wireless Sensor node is composed of sensing unit, processing unit, transceiver unit, and power unit. Sensor networks can be defined as constitution of a group of sensors to form self-organizing cable or wireless network. The purpose of sensor networks is to perceive, collection and processing of the object information that covered by network in the geographical regions perception cooperated, and disseminate the information to the observer. Wireless Sensor Network has the characters of fast deploy,self-organizing and strong robust. This kind of networks has much broad applying futures in areas of military, bio-medical, environmental monitoring uses.Wireless Sensor Networks have the characters of limit hardware resources, limit communication, multi-jump routing, dynamic topology, lots of motes and denseness distributing. It has several distributed optimization problem, such as reducing raw date and routing. Now many existing routing protocols are not applicable.Regardless of the traditional network, or in wireless sensor networks, routing algorithms is the key support network transmission technology. Wireless sensor network routing algorithm is an important research direction. Existing algorithms can be divided into tow types: flat and hierarchical. The representative algorithms for flat are flooding and gossiping, SPIN, directed diffusion, SAR, etc. And for hierarchical are LEACH, TEEN, TTDD, multi- clustering, etc.In resent years, many researchers have applied the mobile agent to the treatment of the Wireless Sensor Networks data and the choice of the routing. Mobile agent has the characters of autonomous, reactive, and mobility. It is a distributed computing method and has a great prospect. In the Wireless Sensor Networks, the data fusion is calculated by distributing mobile agent, only the final result is transmitted, but not the raw data and the intermediate data. This method can reduce the throughput of the redundancy data in the Wireless Sensor Networks effectively, and the costs of the communication are greatly reduced. In addition, mobile agent can search routings according to the node local information. And it needs not the routing plan of the control centre, so that the centralized control is eliminated.The algorithm that cooperate the technology of mobile agent and the design optimization is a researcher thinking that has great prospect. Ant algorithm is a hybrid artificial intelligent optimization method. It provide a dispersed method to solute the problem of having no centralized control and supplying no whole model. Thinking of the above factors, the focus of our work is to study the wireless sensor routing algorithm that based on the cooperation of mobile agent and ant algorithm.After analysis he technology of mobile agent and the ant algorithm, in this paper we give a new wireless sensor networks mobile algorithm. The algorithm considers the balance of the router efficiency and the node load. It can not only make full use of the Computing Capacity and improve the treatment efficiency of network data but also reduce the redundancy data, reduce the costs of the communication, extension the life of the sensor.The following list contains the main innovations of our work.(1) During the choice of the routing, cluster nodes first distribute mobile agent routing to search the router and then distribute the mobile agent to collect data. This method can avoid the great costs of the energy network.(2) During calculating the transfer probability of agent, we considered of the concentration of the information, the surplus energy of the node that transferred to, the transfer consumption and some other factor. To do this can avoid the failure of individual node or path that caused by excessive use. |
PDF Full Text Request