Abstract
Performing end-to-end energy management for the data aggregation application poses certain unique challenges particularly when the computational demands on the individual nodes are significant. In this paper, we address the problem of minimizing the total energy consumption of data aggregation with an end-to-end latency constraint while taking into account both the computational and communication workloads in the network. We consider a model where individual nodes support both dynamic voltage scaling (DVS) and dynamic modulation scaling (DMS) power management techniques and explore the energy-time tradeoffs these techniques offer. Specifically, we make the following contributions in this paper. First, we present an analytical problem formulation for the ideal case where each node can scale its frequency and modulation continuously. Second, we prove that the problem is NP-hard for practical scenarios where such continuity cannot be supported. We then present a mixed integer linear programming (MILP) formulation to obtain the optimal solution for the practical problem. Further, we present polynomial time heuristic algorithms which employ the energy-gain metric. We evaluated the performance of the proposed algorithms for a variety of scenarios and our results show that the energy savings obtained by the proposed algorithms are comparable to that of MILP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Parallel and Distributed Systems
Disclaimer: 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.