<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Optimization | Junfei Zhan's Website</title><link>https://junfei-z.github.io/tags/optimization/</link><atom:link href="https://junfei-z.github.io/tags/optimization/index.xml" rel="self" type="application/rss+xml"/><description>Optimization</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 07 Dec 2024 00:00:00 +0000</lastBuildDate><image><url>https://junfei-z.github.io/media/icon_hu70bcee51a3cd7a7338014254a2e0c844_1401285_512x512_fill_lanczos_center_3.png</url><title>Optimization</title><link>https://junfei-z.github.io/tags/optimization/</link></image><item><title>Minimizing Maximum Age of Service in Virtualized Green IoT Networks</title><link>https://junfei-z.github.io/research/minimizing-maximum-age-of-service-in-virtualized-green-iot-networks/</link><pubDate>Sat, 07 Dec 2024 00:00:00 +0000</pubDate><guid>https://junfei-z.github.io/research/minimizing-maximum-age-of-service-in-virtualized-green-iot-networks/</guid><description>&lt;p>This project addresses the challenge of embedding and scheduling applications in solar-powered green IoT networks, with the goal of minimizing the &lt;strong>maximum Age of Service (AoS)&lt;/strong> — a freshness metric indicating the delay between data generation and service completion.&lt;/p>
&lt;h2 id="objectives">Objectives&lt;/h2>
&lt;p>The research focuses on virtualized, computation-enabled IoT infrastructures powered by &lt;strong>renewable energy&lt;/strong> (solar). The applications are modeled as &lt;strong>Directed Acyclic Graphs (DAGs)&lt;/strong> with &lt;strong>Virtual Network Functions (VNFs)&lt;/strong> that must be executed under fluctuating energy and computational constraints.&lt;/p>
&lt;h2 id="key-contributions">Key Contributions&lt;/h2>
&lt;h3 id="mixed-integer-linear-programming-milp-formulation">Mixed Integer Linear Programming (MILP) Formulation&lt;/h3>
&lt;ul>
&lt;li>Proposed the &lt;strong>first MILP model&lt;/strong> to jointly optimize:
&lt;ul>
&lt;li>Device selection and sampling time&lt;/li>
&lt;li>DAG request embedding decision&lt;/li>
&lt;li>Energy consumption at devices, gateways, and servers&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>Objective: minimize the &lt;strong>maximum AoS&lt;/strong> across all DAG requests.&lt;/li>
&lt;/ul>
&lt;h3 id="heuristic-and-predictive-control-solutions">Heuristic and Predictive Control Solutions&lt;/h3>
&lt;ul>
&lt;li>Developed &lt;strong>GreedyOL&lt;/strong>, a fast heuristic that embeds DAGs based on current AoS.&lt;/li>
&lt;li>Proposed &lt;strong>RHCOP&lt;/strong>, a &lt;strong>Receding Horizon Control Optimization&lt;/strong> framework:
&lt;ul>
&lt;li>Utilizes &lt;strong>Gaussian Mixture Models (GMMs)&lt;/strong> to predict solar energy arrivals and wireless channel gains.&lt;/li>
&lt;li>Enables real-time scheduling using only causal (non-future) information.&lt;/li>
&lt;/ul>
&lt;/li>
&lt;/ul>
&lt;h3 id="results--insights">Results &amp;amp; Insights&lt;/h3>
&lt;ul>
&lt;li>RHCOP achieves a &lt;strong>1.07×&lt;/strong> and GreedyOL a &lt;strong>1.13×&lt;/strong> min-max AoS compared to optimal MILP.&lt;/li>
&lt;li>More gateways and servers reduce AoS due to enhanced redundancy and flexibility.&lt;/li>
&lt;li>Equal numbers of &lt;strong>VNF-Cs&lt;/strong> (collection) and &lt;strong>VNF-Ps&lt;/strong> (processing) yield optimal freshness.&lt;/li>
&lt;/ul>
&lt;h2 id="broader-impact">Broader Impact&lt;/h2>
&lt;p>The proposed system lays groundwork for &lt;strong>energy-aware, delay-sensitive IoT applications&lt;/strong>, especially in &lt;strong>remote or energy-constrained environments&lt;/strong>. The results provide insights into the tradeoffs between &lt;strong>computation freshness&lt;/strong>, &lt;strong>resource allocation&lt;/strong>, and &lt;strong>green network deployment&lt;/strong> strategies.&lt;/p>
&lt;p>📄 [IEEE Transactions on Services Computing Submission] — Coming Soon&lt;/p></description></item><item><title>Minimizing Maximum Age of Service in Virtualized Green IoT Networks</title><link>https://junfei-z.github.io/zh/research/minimizing-maximum-age-of-service-in-virtualized-green-iot-networks/</link><pubDate>Sat, 07 Dec 2024 00:00:00 +0000</pubDate><guid>https://junfei-z.github.io/zh/research/minimizing-maximum-age-of-service-in-virtualized-green-iot-networks/</guid><description>&lt;p>本项目解决了在太阳能驱动的绿色 IoT 网络中嵌入和调度应用的挑战，目标是最小化&lt;strong>最大 Age of Service (AoS)&lt;/strong> — 一个表示数据生成到服务完成之间延迟的新鲜度指标。&lt;/p>
&lt;h2 id="目标">目标&lt;/h2>
&lt;p>本研究聚焦于由&lt;strong>可再生能源&lt;/strong>（太阳能）驱动的虚拟化、具备计算能力的 IoT 基础设施。应用被建模为包含 &lt;strong>Virtual Network Functions (VNFs)&lt;/strong> 的 &lt;strong>Directed Acyclic Graphs (DAGs)&lt;/strong>，需要在波动的能量和计算约束下执行。&lt;/p>
&lt;h2 id="主要贡献">主要贡献&lt;/h2>
&lt;h3 id="mixed-integer-linear-programming-milp-建模">Mixed Integer Linear Programming (MILP) 建模&lt;/h3>
&lt;ul>
&lt;li>提出了&lt;strong>首个 MILP 模型&lt;/strong>，联合优化：
&lt;ul>
&lt;li>设备选择与采样时间&lt;/li>
&lt;li>DAG 请求嵌入决策&lt;/li>
&lt;li>设备、网关和服务器的能耗&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>目标：最小化所有 DAG 请求的&lt;strong>最大 AoS&lt;/strong>。&lt;/li>
&lt;/ul>
&lt;h3 id="启发式与预测控制方案">启发式与预测控制方案&lt;/h3>
&lt;ul>
&lt;li>开发了 &lt;strong>GreedyOL&lt;/strong>，一种基于当前 AoS 嵌入 DAG 的快速启发式算法。&lt;/li>
&lt;li>提出了 &lt;strong>RHCOP&lt;/strong>，一种 &lt;strong>Receding Horizon Control Optimization&lt;/strong> 框架：
&lt;ul>
&lt;li>利用 &lt;strong>Gaussian Mixture Models (GMMs)&lt;/strong> 预测太阳能到达量和无线信道增益。&lt;/li>
&lt;li>仅使用因果（非未来）信息实现实时调度。&lt;/li>
&lt;/ul>
&lt;/li>
&lt;/ul>
&lt;h3 id="结果与洞察">结果与洞察&lt;/h3>
&lt;ul>
&lt;li>RHCOP 实现了最优 MILP 的 &lt;strong>1.07 倍&lt;/strong> min-max AoS，GreedyOL 为 &lt;strong>1.13 倍&lt;/strong>。&lt;/li>
&lt;li>更多的网关和服务器由于增强的冗余性和灵活性而降低了 AoS。&lt;/li>
&lt;li>&lt;strong>VNF-C&lt;/strong>（采集）和 &lt;strong>VNF-P&lt;/strong>（处理）数量相等时可获得最优新鲜度。&lt;/li>
&lt;/ul>
&lt;h2 id="更广泛的影响">更广泛的影响&lt;/h2>
&lt;p>所提出的系统为&lt;strong>能耗感知、延迟敏感的 IoT 应用&lt;/strong>奠定了基础，尤其适用于&lt;strong>偏远或能源受限的环境&lt;/strong>。研究结果揭示了&lt;strong>计算新鲜度&lt;/strong>、&lt;strong>资源分配&lt;/strong>与&lt;strong>绿色网络部署&lt;/strong>策略之间的权衡关系。&lt;/p>
&lt;p>[IEEE Transactions on Services Computing 投稿] — 即将发表&lt;/p></description></item><item><title>Undergraduate Thesis - Scheduling in Serverless Computing for Solar-Powered IoT Networks</title><link>https://junfei-z.github.io/samples/4_spam/</link><pubDate>Tue, 30 Apr 2024 00:00:00 +0000</pubDate><guid>https://junfei-z.github.io/samples/4_spam/</guid><description>&lt;p>This undergraduate thesis proposes a two-phase optimization framework for solar-powered IoT networks, focusing on dynamic task allocation and energy-aware function configuration. A MILP benchmark and a GMM-enhanced Receding Horizon Control algorithm were developed to improve efficiency and adapt to fluctuating energy and computation conditions.&lt;/p></description></item><item><title>本科毕业论文 - Scheduling in Serverless Computing for Solar-Powered IoT Networks</title><link>https://junfei-z.github.io/zh/samples/4_spam/</link><pubDate>Tue, 30 Apr 2024 00:00:00 +0000</pubDate><guid>https://junfei-z.github.io/zh/samples/4_spam/</guid><description>&lt;p>本科毕业论文提出了一种面向太阳能供电 IoT 网络的两阶段优化框架，重点研究动态任务分配和能量感知的函数配置。开发了 MILP 基准测试和基于 GMM 增强的 Receding Horizon Control 算法，以提升效率并适应波动的能量和计算条件。&lt;/p></description></item><item><title>Task Offloading and Approximate Computing in Solar Powered IoT Networks</title><link>https://junfei-z.github.io/research/task-offloading-and-approximate-computing-in-solar-powered-iot-networks/</link><pubDate>Sun, 07 Jan 2024 00:00:00 +0000</pubDate><guid>https://junfei-z.github.io/research/task-offloading-and-approximate-computing-in-solar-powered-iot-networks/</guid><description>&lt;p>This research proposes a novel framework for minimizing the &lt;strong>total energy consumption&lt;/strong> of solar-powered IoT networks through &lt;strong>task offloading and approximate computing&lt;/strong>. Devices can choose between local execution (exact or approximate) or offloading tasks to a solar-powered edge server.&lt;/p>
&lt;h2 id="core-objectives">Core Objectives&lt;/h2>
&lt;ul>
&lt;li>&lt;strong>Reduce energy usage&lt;/strong> by allowing approximate task execution when tolerable errors are acceptable.&lt;/li>
&lt;li>&lt;strong>Leverage digital twins (DTs)&lt;/strong> to estimate future energy availability and channel conditions.&lt;/li>
&lt;li>&lt;strong>Optimize offloading decisions&lt;/strong> and resource allocation across time slots and channels.&lt;/li>
&lt;/ul>
&lt;h2 id="technical-highlights">Technical Highlights&lt;/h2>
&lt;h3 id="milp-formulation">MILP Formulation&lt;/h3>
&lt;ul>
&lt;li>Designed the &lt;strong>first MILP&lt;/strong> to jointly optimize:
&lt;ul>
&lt;li>Task offloading decisions&lt;/li>
&lt;li>Approximate vs. exact execution&lt;/li>
&lt;li>Channel allocation&lt;/li>
&lt;li>Virtual machine (VM) assignment&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>Captures constraints on energy arrivals, CPU cycles, approximation error bounds, and VM capacity.&lt;/li>
&lt;/ul>
&lt;h3 id="dt-assisted-receding-horizon-control-dt-rhc">DT-Assisted Receding Horizon Control (DT-RHC)&lt;/h3>
&lt;ul>
&lt;li>Introduced a &lt;strong>DT-based control algorithm&lt;/strong> using:
&lt;ul>
&lt;li>&lt;strong>Gaussian Mixture Models (GMMs)&lt;/strong> to predict energy and channel gain&lt;/li>
&lt;li>Sliding-window MILP optimization for dynamic scheduling&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>Achieves energy usage within &lt;strong>1.62×&lt;/strong> of MILP optimal while requiring only &lt;strong>causal (past) data&lt;/strong>&lt;/li>
&lt;/ul>
&lt;h3 id="results--evaluation">Results &amp;amp; Evaluation&lt;/h3>
&lt;ul>
&lt;li>DT-RHC significantly outperforms random strategies across metrics such as:
&lt;ul>
&lt;li>Energy consumption vs. number of devices&lt;/li>
&lt;li>Impact of approximation ratios&lt;/li>
&lt;li>Task completion within extended time horizons&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>Simulations conducted in Python + Gurobi over 100×100 m² deployments using realistic solar input and wireless models.&lt;/li>
&lt;/ul>
&lt;h2 id="conclusion">Conclusion&lt;/h2>
&lt;p>This study demonstrates the viability of integrating &lt;strong>approximate computing and intelligent offloading&lt;/strong> in &lt;strong>renewable-powered IoT environments&lt;/strong>. It provides a robust foundation for future &lt;strong>distributed optimization and adaptive energy-aware network control&lt;/strong>.&lt;/p>
&lt;p>&lt;a href="https://doi.org/10.1109/LNET.2023.3328893">IEEE Paper DOI: 10.1109/LNET.2023.3328893&lt;/a>&lt;/p></description></item><item><title>Task Offloading and Approximate Computing in Solar Powered IoT Networks</title><link>https://junfei-z.github.io/zh/research/task-offloading-and-approximate-computing-in-solar-powered-iot-networks/</link><pubDate>Sun, 07 Jan 2024 00:00:00 +0000</pubDate><guid>https://junfei-z.github.io/zh/research/task-offloading-and-approximate-computing-in-solar-powered-iot-networks/</guid><description>&lt;p>本研究提出了一种新颖的框架，通过&lt;strong>任务卸载和近似计算&lt;/strong>来最小化太阳能驱动 IoT 网络的&lt;strong>总能耗&lt;/strong>。设备可以选择本地执行（精确或近似）或将任务卸载到太阳能驱动的边缘服务器。&lt;/p>
&lt;h2 id="核心目标">核心目标&lt;/h2>
&lt;ul>
&lt;li>在可容忍误差的情况下，通过允许近似任务执行来&lt;strong>降低能耗&lt;/strong>。&lt;/li>
&lt;li>&lt;strong>利用 Digital Twin (DT)&lt;/strong> 估计未来的能量可用性和信道条件。&lt;/li>
&lt;li>&lt;strong>优化卸载决策&lt;/strong>以及跨时隙和信道的资源分配。&lt;/li>
&lt;/ul>
&lt;h2 id="技术亮点">技术亮点&lt;/h2>
&lt;h3 id="milp-建模">MILP 建模&lt;/h3>
&lt;ul>
&lt;li>设计了&lt;strong>首个 MILP&lt;/strong>，联合优化：
&lt;ul>
&lt;li>任务卸载决策&lt;/li>
&lt;li>近似与精确执行&lt;/li>
&lt;li>信道分配&lt;/li>
&lt;li>虚拟机（VM）分配&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>捕获了能量到达、CPU 周期、近似误差界和 VM 容量等约束条件。&lt;/li>
&lt;/ul>
&lt;h3 id="dt-辅助的滑动窗口控制-dt-rhc">DT 辅助的滑动窗口控制 (DT-RHC)&lt;/h3>
&lt;ul>
&lt;li>引入了基于 &lt;strong>DT 的控制算法&lt;/strong>，使用：
&lt;ul>
&lt;li>&lt;strong>Gaussian Mixture Models (GMMs)&lt;/strong> 预测能量和信道增益&lt;/li>
&lt;li>滑动窗口 MILP 优化实现动态调度&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>仅使用&lt;strong>因果（历史）数据&lt;/strong>即可实现 MILP 最优值 &lt;strong>1.62 倍&lt;/strong>以内的能耗&lt;/li>
&lt;/ul>
&lt;h3 id="结果与评估">结果与评估&lt;/h3>
&lt;ul>
&lt;li>DT-RHC 在以下指标上显著优于随机策略：
&lt;ul>
&lt;li>能耗与设备数量的关系&lt;/li>
&lt;li>近似比率的影响&lt;/li>
&lt;li>扩展时间范围内的任务完成率&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>仿真在 100×100 m² 部署上使用 Python + Gurobi 进行，采用真实的太阳能输入和无线模型。&lt;/li>
&lt;/ul>
&lt;h2 id="结论">结论&lt;/h2>
&lt;p>本研究证明了在&lt;strong>可再生能源驱动的 IoT 环境&lt;/strong>中集成&lt;strong>近似计算和智能卸载&lt;/strong>的可行性。它为未来的&lt;strong>分布式优化和自适应能耗感知网络控制&lt;/strong>提供了坚实基础。&lt;/p>
&lt;p>&lt;a href="https://doi.org/10.1109/LNET.2023.3328893">IEEE Paper DOI: 10.1109/LNET.2023.3328893&lt;/a>&lt;/p></description></item></channel></rss>