Research On Routing Optimization For Wireless Sensor Network Based On Ant-Colony Algorithm

Wireless sensor network (WSN) generally refers to a multi-hop ad hoc network,which consists of a number of sensor nodes. They communicate with each other by way of wireless communication. The characteristics of the sensor nodes are small size, low power consumption and wireless communication function. It has widely used in military, intelligent transportation, health, environmental monitoring and other fields at present. The core content of WSN routing algorithm is the sensor nodes have limited energy and weak communication capacity.WSN routing algorithm refers to the sensor nodes forward data packets from the source node to the destination node as necessary. Firstly, this paper describes the structure, feature, and protocol stack model of WSN, then compared several routing algorithms, finally proposed an ant colony algorithm as a mathematical model for the routing problem solution. Against basic ant colony algorithm has a long convergence time and easy fall into local optima, the author improves it from three aspects as follows:the ant pheromone update strategy, energy strategy and the transition probability strategy. Then the author spread out the simulation analysis throughout the MATLAB. Simulation results show that the improved ant colony algorithm can find the optimal path more effectively, converge faster, and have a lower power consumption.On the basis of the software simulation, the author take the Field-Programmable Gate Array(FPGA) as the control core, design a hardware realization based on improved ant colony algorithm. After the design of each module, the entire system was functional simulated. The results show that the improved ant colony algorithm based on FPGA run faster, there are certain engineering practice.