Research On Routing Algorithms In WSN Based On The Ant-Colony Algorithm

Wireless Sensor Networks(WSN)are composed of a large quantity of micro-sensors deployed in monitoring fields, they form the multi-hop and self-organizing network systems via wireless communicating. These sensors are used in cooperation with others to feel, collect, and process the information transmitted to the observer in monitoring fields. As a new researching area of computer science and technology, WSN, which will be used widely in the future, has aroused high attention in both academia and industrial circles.Routing technique is not only the key technique in WSN, but also one of the most important factors affecting the performance of the network. Investigations about routing in WSN is very challenging due to several characteristics that distinguish it from contemporary communication and Ad hoc networks. In recent years, some specific routing protocols for WSN have emerged, such as Flooding, SPIN, DD, and so on. This paper makes detail investigations on those routing protocols. On the basis of assimilating the excellent ideas among them, an Ant-Colony-Based Routing Algorithms in WSN is proposed.Ant-colony-based routing algorithm is that: Sink node regularly broadcasts IMP(Interest Message Packet) through the network in order to setup and update gradient field, at the same time, it can also form and update pheromone on each route, then transmit data which is interested by Sink node to the whole network. The gradient and remaining energy of the neighborhood are integrated into the computation of pheromone concentration. If a node has the right data to send, it becomes a source node which will transmit ant-like data packet to Sink. When choosing the route, the node will choose its next hop with probability, which is computed on the basis of pheromone concentration. And the data packet will not always be transmitted on the same route. Meanwhile, some nodes just live for a little while because of forwarding too many data packets from sources, and it leads to the loss of monitoring for some particular area. So an energy threshold for each node is set in the algorithm to prevent it. When the energy of some node is less than the energy threshold, it should avoid undertaking data-transmitting task. The simulation of Ant-Colony-Based Routing Algorithm proves itself to be effective, and simulation results also show that such algorithm is of less average delay and average dissipated energy...