Algoritmos bioinspirados para el encaminamiento de datos en redes inal ambricas de sensores

Abstract

Wireless Sensor Networks have become an active research topic in the last years. The routing problem is a very important part of this kind of networks that need to be considered in order to maximize the network life time and minimize data transmissions latency. As the size of the network increases, the routing problem becomes more complex due the amount of sensor nodes in the network. These sensor nodes are very constrained in memory capabilities, processing power, wireless communications and batteries. On the other hand, Ant Colony Optimization based routing algorithms have been proposed to solve the routing problem, trying to deal with the constraints of the sensor nodes. In this thesis is presented a comparison of two Ant Colony-Based Routing Algorithms, under di erent scenarios at simulation level. Furthermore, in order to increase the wireless sensor network life time a new routing algorithm that combines the characteristics of the studied algorithms is de ned. The comparison takes into account current amounts of energy consumption as fair as possible.