Abstract
In this work, we focus on minimizing the overall network energy consumption problem under delay-constrained: N different packets from N time varying channels must be transmitted by a hard deadline of T slots. Each transmitter determines how much power to transmit with, during each time slot based on the current channel quality and the number of un transmitted bits, with the objective of minimizing overall network energy consumption. We transform the non-convex optimization problem into a geometric programming problem which has convex form and propose a distributed approximate optimization algorithm. Moreover, a lazy updating distributed algorithm is also presented for infrequent message passing. Experimental results show that the proposed distributed algorithm converges fast and the results of the distributed algorithm and results of centralized algorithm are very close.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 2014 World Ubiquitous Science Congress |
Subtitle of host publication | 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, DASC 2014 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 344-349 |
Number of pages | 6 |
ISBN (Electronic) | 9781479950799 |
DOIs | |
State | Published - Nov 3 2014 |
Externally published | Yes |
Event | 12th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2014 - Dalian, Liaoning, China Duration: Aug 24 2014 → Aug 27 2014 |
Publication series
Name | Proceedings - 2014 World Ubiquitous Science Congress: 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, DASC 2014 |
---|
Other
Other | 12th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2014 |
---|---|
Country/Territory | China |
City | Dalian, Liaoning |
Period | 8/24/14 → 8/27/14 |
Bibliographical note
Publisher Copyright:© 2014 IEEE.
Keywords
- Delay-constrained
- Distributed algorithm
- Energy-efficient