Browsing by Author "Zheng, Liang"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item type:Item, Decomposing Data Analytics in Fog Networks(2017-01-01) ;Chang, Ta-Cheng ;Zheng, Liang ;Gorlatova, Maria ;Gitau, ChegeHuang, Ching-YaoFog computing, the distribution of computing resources closer to the end devices along the cloud-to-things continuum, is recently emerging as an architecture for scaling of the Internet of Things (IoT) sensor networking applications. Fog computing requires novel computing program decompositions for heterogeneous hierarchical settings. To evaluate these new decompositions, we designed, developed, and instrumented a fog computing testbed that includes cloud computing and computing gateway execution points collaborating to finish complex data analytics operations. In this interactive demonstration we present one fog-specific algorithmic decomposition we recently examined and adapted for fog computing: a multi-execution point linear regression decomposition that jointly optimizes operation latency, quality, and costs. The demonstration highlights the role fog computing can play in future sensor networking architectures, and highlights some of the challenges of creating computing program decompositions for these architectures. An annotated video of the demonstration is available at [5].Item type:Item, Wireless Max-Min Utility Fairness With General Monotonic Constraints by Perron-Frobenius Theory(2016-12) ;Zheng, Liang ;Hong, Y. -W. Peter ;Tan, Chee Wei ;Hsieh, Cheng-LinLee, Chia-HanThis paper presents a systematic approach for solving wireless max-min utility fairness optimization problems in multiuser wireless networks with general monotonic constraints. These problems are often challenging to solve due to their non-convexity. By establishing a connection between this class of optimization problems and the class of conditional eigenvalue problems that can be addressed by a generalized nonlinear Perron-Frobenius theory, we show how these problems can be solved optimally using an iterative algorithm that converges geometrically fast. The mathematical development in this paper unifies previous work and allows us to handle a broader class of competitive utility functions with general nonlinear monotonic constraints. Several representative applications illustrate the effectiveness of the proposed framework, including the max-min quality-of-service subject to robust interference temperature constraints in cognitive radio networks, the min-max weighted mean-square error subject to signal-to-interference-and-noise ratio constraints in multiuser downlink systems, the max-min throughput subject to nonlinear power constraints in energy-efficient wireless networks, the max-min sigmoid utility in multimedia wireless networks, and the min-max outage probability subject to outage constraints in heterogeneous wireless networks. Numerical results are presented to demonstrate the fast-convergence behavior of the algorithms to the optimal fixed-point solution characterized by our generalized nonlinear Perron-Frobenius theoretic framework.