ABSTRACT
The recent advances in the application of Software Defined Networks
(SDN) concepts in Wireless Sensor Networks (WSNs) leads the
implementation of centralized algorithms. In this work, the SDN
concept is considered, together with two routing procedures, with
the purpose of disjoint paths generation, aiming to extend WSN’s
lifetime. Both approaches are based on Dijkstra algorithm for the
selection of minimum paths. The first approach allocates distinct
paths for various flows towards the same destination. The second
one, penalizes computed paths using an adaptive cost function.
Simulation results are performed using the Cooja sensor network
simulator.