Routing algorithm of WSN under interference environment

Interference is one of the most crucial factors in any wireless communication system. Dealing with it could be very complicated because of its unpredictability, but it is essential in order to deliver complete and comprehensible information to the destination. The aim of this work is to implement a routing algorithm, based on the classic AODV (Ad-hoc On-Demand Distance Vector), which is able to find a new route to the destination in case one or more interference sources affect packets' routes. The algorithm looks for the shortest route to the destination going around the interference areas. Both static and dynamic interference sources have been considered. As demonstrated from the experimental tests, it achieves better performance than the classic AODV since the process of finding a new route is in most of the cases faster and in particular the network utilization is drastically reduced, which leads to a considerable power saving.