An official website of the United States government
Wearable internet of things (IoT) devices can enable a variety of biomedical applications, such as gesture recognition, health monitoring, and human activity tracking. Size and weight constraints limit the battery capacity, which leads to frequent charging requirements and user dissatisfaction. Minimizing the energy consumption not only alleviates this problem, but also paves the way for self-powered devices that operate on harvested energy. This paper considers an energy-optimal gesture recognition application that runs on energy-harvesting devices. We first formulate an optimization problem for maximizing the number of recognized gestures when energy budget and accuracy constraints are given. Next, we derive an analytical energy model from the power consumption measurements using a wearable IoT device prototype. Then, we prove that maximizing the number of recognized gestures is equivalent to minimizing the duration of gesture recognition. Finally, we utilize this result to construct an optimization technique that maximizes the number of gestures recognized under the energy budget constraints while satisfying the recognition accuracy requirements. Our extensive evaluations demonstrate that the proposed analytical model is valid for wearable IoT applications, and the optimization approach increases the number of recognized gestures by up to 2.4× compared to a manual optimization.
more »
« less
REAP: Runtime Energy-Accuracy Optimization for Energy Harvesting IoT Devices
The use of wearable and mobile devices for health and activity monitoring is growing rapidly. These devices need to maximize their accuracy and active time under a tight energy budget imposed by battery and form-factor constraints. This paper considers energy harvesting devices that run on a limited energy budget to recognize user activities over a given period. We propose a technique to co-optimize the accuracy and active time by utilizing multiple design points with different energy-accuracy trade-offs. The proposed technique switches between these design points at runtime to maximize a generalized objective function under tight harvested energy budget constraints. We evaluate our approach experimentally using a custom hardware prototype and 14 user studies. It achieves 46% higher expected accuracy and 66% longer active time compared to the highest performance design point.
more »
« less
- Award ID(s):
- 1651624
- PAR ID:
- 10172803
- Date Published:
- Journal Name:
- 2019 56th ACM/IEEE Design Automation Conference (DAC)
- Page Range / eLocation ID:
- 1 to 6
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Small form factor and low-cost wearable devices enable a variety of applications including gesture recognition, health monitoring, and activity tracking. Energy harvesting and optimal energy management are critical for the adoption of these devices, since they are severely constrained by battery capacity. This paper considers optimal gesture recognition using self-powered devices. We propose an approach to maximize the number of gestures that can be recognized under energy budget and accuracy constraints. We construct a computationally efficient optimization algorithm with the help of analytical models derived using the energy consumption breakdown of a wearable device. Our empirical evaluations demonstrate up to 2.4 x increase in the number of recognized gestures compared to a manually optimized solution.more » « less
-
We investigate the energy efficiency (EE) problem in a downlink multi-user millimeter wave (mmWave) rate-splitting multiple access (RSMA) system and propose an energy-efficient one-layer RSMA hybrid precoder design for K users with quality of service constraints. This scheme is applicable to the design of sustainable sixth generation (6G) cellular networks. To make the problem tractable, the analog and the digital precoder designs are decoupled. First, the analog precoder is designed to maximize the desired signal power of each user while ignoring multi-user interference. Second, the digital precoder is designed to manage multi-user interference according to the EE optimization design criterion. We adopt a successive convex approximation-based algorithm for joint optimization of the digital precoders, power, and common rate allocation. Simulation results show that the proposed RSMA scheme always performs at least as well as a baseline spatial division multiple access (SDMA) hybrid precoding scheme and outperforms it under certain channel conditions. These results suggest that RSMA is suitable as a flexible physical layer design for future 6G mmWave networks.more » « less
-
Crowdsourcing is an effective and efficient paradigm for obtaining labels for unlabeled corpus employing crowd workers. This work considers the budget allocation problem for a generalized setting on a graph of instances to be labeled where edges encode instance dependencies. Specifically, given a graph and a labeling budget, we propose an optimal policy to allocate the budget among the instances to maximize the overall labeling accuracy. We formulate the problem as a Bayesian Markov Decision Process (MDP), where we define our task as an optimization problem that maximizes the overall label accuracy under budget constraints. Then, we propose a novel stage-wise reward function that considers the effect of worker labels on the whole graph at each timestamp. This reward function is utilized to find an optimal policy for the optimization problem. Theoretically, we show that our proposed policies are consistent when the budget is infinite. We conduct extensive experiments on five real-world graph datasets and demonstrate the effectiveness of the proposed policies to achieve a higher label accuracy under budget constraints.more » « less
-
Crowdsourcing is an effective and efficient paradigm for obtaining labels for unlabeled corpus employing crowd workers. This work considers the budget allocation problem for a generalized setting on a graph of instances to be labeled where edges encode instance dependencies. Specifically, given a graph and a labeling budget, we propose an optimal policy to allocate the budget among the instances to maximize the overall labeling accuracy. We formulate the problem as a Bayesian Markov Decision Process (MDP), where we define our task as an optimization problem that maximizes the overall label accuracy under budget constraints. Then, we propose a novel stage-wise reward function that considers the effect of worker labels on the whole graph at each timestamp. This reward function is utilized to find an optimal policy for the optimization problem. Theoretically, we show that our proposed policies are consistent when the budget is infinite. We conduct extensive experiments on five real-world graph datasets and demonstrate the effectiveness of the proposed policies to achieve a higher label accuracy under budget constraints.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1145/3316781.3317892
