Abstract
With the emergence of resource powerful sensor nodes, the concept of WSN virtualization is gaining increasing attention from the research community and the industry. One approach to achieve WSN virtualization is to exploit the capabilities of individual sensor nodes to execute tasks of multiple applications concurrently. In this paper, we consider the problem of task allocation in software-defined WSNs (SD-WSNs), which are distinguished by centralized control plane and programmable data plane. We extend our previous work on this topic, where we proposed the control algorithm which determines suitability of a sensor node for task allocation based on the active routing paths and residual energy in the network. Availability of such information can be easily justified in SD-WSNs. Through extensive simulations, the performance of this strategy has been evaluated and compared with two conventional task allocation approaches, which assume traditional minimum-hop routing. In addition, we analysed performance of more simple software defined networking-based approach, which performs resource allocation by considering only residual energy in the network. The obtained results demonstrate benefits of SD-WSN architecture when it comes to virtualization efficiency, and clarify improvements achieved by mutual correlation of routing and task allocation decisions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
