4.4 Article

Ensuring Energy Efficiency When Dynamically Assigning Tasks in Virtualized Wireless Sensor Networks

Journal

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TGCN.2021.3118967

Keywords

Task analysis; Wireless sensor networks; Virtualization; Earthquakes; Costs; Temperature sensors; Resource management; Internet of Things; resource allocation; virtualization; wireless sensor networks

Funding

  1. Canadian Natural Sciences and Engineering Research Council (NSERC) Discovery Grant
  2. Canada Research Chair program
  3. Concordia University

Ask authors/readers for more resources

Traditional wireless sensor networks have high deployment and maintenance costs due to embedded applications. Virtualization technologies address this issue but come with energy-delay cost. This research aims to solve the task assignment challenge in virtualized WSNs while minimizing energy consumption and meeting deadlines.
Traditional non-virtualized Wireless Sensor Networks (WSNs) suffer from high deployment and maintenance costs, mainly because their applications are embedded in sensor nodes. Virtualization technologies address these challenges by allowing multiple sensing tasks to run over the same deployed WSN infrastructure. However, virtualization comes at an energy-delay cost, making it both essential and challenging to allocate physical and/or virtual resources efficiently to applications with different sensing tasks, especially for delay-sensitive applications. Our goal is to address the challenge of task assignment in virtualized WSNs while minimizing the overall energy consumption and meeting the given deadlines. After formulating the problem as an Integer Linear Programming (ILP), we propose a scalable heuristic. We evaluate the performance of our proposed heuristic in different scenarios and compare it with the optimal solution as well as a recent work from literature. The results indicate that our proposed heuristic leads close-to-optimal solutions with good performance in terms of execution time. It shows that the proposed DTA solution can not only achieve up to a 97% reduction of the execution time for small-scale scenarios, as compared to the optimal solution, but it also outperforms the existing benchmarks in terms of successful task execution rate by 100%.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available