A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Review on Compute Analysis of Routing Algorithm for Wireless Sensor Networks
2017
IJARCCE
Recent significant research on wireless sensor networks (WSNs) has led to the widespread adoption of software defined wireless sensor networks (SDWSNs), which can be reconfigured even after deployment. In this paper, we propose an energy-efficient routing algorithm for SDWSNs. In this algorithm, to make the network to be functional, control nodes are selected to assign different tasks dynamically. The selection of control nodes is formulated as an NPhard problem, taking into consideration of
doi:10.17148/ijarcce.2017.6148
fatcat:7t5ufagsejam7k3p74hxqcimza