DocumentCode
2015591
Title
Cherish every joule: Maximizing throughput with an eye on network-wide energy consumption
Author
Jiang, Canming ; Shi, Yi ; Hou, Y. Thomas ; Lou, Wenjing
Author_Institution
Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA
fYear
2012
fDate
25-30 March 2012
Firstpage
1934
Lastpage
1941
Abstract
Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem which we hope will offer insights to both network operators and users. In the first part of this work, we study how to maximize throughput under a network-wide energy constraint. We formulate this problem as a mixed-integer nonlinear program (MINLP). We propose a novel piece-wise linear approximation to transform the nonlinear constraints into linear constraints. We prove that the solution developed under this approach is near-optimal with guaranteed performance bound. In the second part, we generalize the problem in the first part by exploring throughput and network-wide energy optimization via a multi-criteria optimization framework. We show that the weakly Pareto-optimal points in the solution can characterize an optimal throughput-energy curve. We offer some interesting properties of the optimal throughput-energy curve which are useful to both network operators and end users.
Keywords
Pareto optimisation; approximation theory; integer programming; nonlinear programming; piecewise linear techniques; radio networks; MINLP; mixed-integer nonlinear program; multicriteria optimization framework; network-wide energy conservation problem; network-wide energy constraint; network-wide energy consumption; network-wide energy optimization; optimal throughput-energy curve; piecewise linear approximation; throughput maximization; weakly Pareto-optimal point; wireless network; IEC; Optimized production technology;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2012 Proceedings IEEE
Conference_Location
Orlando, FL
ISSN
0743-166X
Print_ISBN
978-1-4673-0773-4
Type
conf
DOI
10.1109/INFCOM.2012.6195570
Filename
6195570
Link To Document