Skip to Main Content
Green Communications and Networking
book

Green Communications and Networking

by F. Richard Yu, Xi Zhang, Victor C.M. Leung
April 2016
Intermediate to advanced content levelIntermediate to advanced
399 pages
11h 49m
English
CRC Press
Content preview from Green Communications and Networking
Optimization with General Attributes 251
9.2.1 Mapping to the Task Scheduling Problem
To illustrate the generality of this framework, this subsection uses the new
notation to exactly represent the task scheduling problem from Section 9.1.
For that problem, one can define the control action α[k]tohavetheform
α[k]=(c[k],m[k],I[k]), and the action space A is then the set of all (c, m, I)
such that c ∈{1,...,N}, m ∈M,and0 I I
max
.
The frame size is T [k]=D[k]+I[k], and
ˆ
T (α[k]) is given by:
ˆ
T (α[k]) =
ˆ
D(c[k],m[k]) + I[k]
We then define y
0
[k] as the energy expended in frame k,sothaty
0
[k]=e[k]
and ˆy
0
(α[k]) = ˆe(c[k],m[k]). There are N constraints, so define ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Green Networking and Communications

Green Networking and Communications

Shafiullah Khan, Jaime Lloret Mauri
Green Communications

Green Communications

Jinsong Wu, Sundeep Rangan, Honggang Zhang

Publisher Resources

ISBN: 9781439899144