Related papers: The Induced Bounded-Degree Subgraph Problem and St…
Control of multihop Wireless networks in a distributed manner while providing end-to-end delay requirements for different flows, is a challenging problem. Using the notions of Draining Time and Discrete Review from the theory of fluid…
This paper addresses the problem of robust control of a linear discrete-time system subject to bounded disturbances and to measurement and control budget constraints. Using Q-parameterization and a polytope containment method, we prove that…
In this paper, a gradient-free distributed algorithm is introduced to solve a set constrained optimization problem under a directed communication network. Specifically, at each time-step, the agents locally compute a so-called…
Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently used to model such data. For many of today's data-centric…
We consider the classic maximal and maximum independent set problems in three models of graph streams: In the edge-arrival model we see a stream of edges which collectively define a graph, this model has been well-studied for a variety of…
This paper addresses the problem of voltage regulation in power distribution networks with deep-penetration of distributed energy resources, e.g., renewable-based generation, and storage-capable loads such as plug-in hybrid electric…
This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…
This work addresses the design of optimal linear transmit filters for the Multiple Input-Multiple Output (MIMO) Broadcast Channel (BC) when several spatial streams are allocated to each user.We also consider that the Channel State…
A solution is given to the basic distributed feedback control problem for a multi-channel linear system assuming only that the system is jointly controllable, jointly observable and has an associated neighbor graph which is strongly…
Developing of an effective flow control algorithm to avoid congestion is a hot topic in computer network society. This document gives a mathematical model for general network at the beginning, and then discrete control theory is proposed as…
We investigate a distributed optimization problem over a cooperative multi-agent time-varying network, where each agent has its own decision variables that should be set so as to minimize its individual objective subject to local…
We consider the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network. Focusing first on arbitrary network topologies, we provide (i) fundamental limits on…
This paper presents a characterization of distributed controllers subject to delay constraints induced by a strongly connected communication graph that achieve a prescribed closed loop $\mathcal{H}_\infty$ norm. Inspired by the solution to…
This paper studies the stability and dynamic control of underlay mobile edge networks. First, the stability region for a multiuser edge network is obtained under the assumption of full channel state information. This result provides a…
System performance for networks composed of interconnected subsystems can be increased if the traditionally separated subsystems are jointly optimized. Recently, parallel and distributed optimization methods have emerged as a powerful tool…
A new interference management scheme based on integer forcing (IF) receivers is studied for the two-user multiple-input and multiple-output (MIMO) interference channel. The proposed scheme employs a message splitting method that divides…
Motivated by the fact that intelligent traffic control systems have become inevitable demand to cope with the risk of traffic congestion in urban areas, this paper develops a distributed control strategy for urban traffic networks. Since…
We consider stochastic influence maximization problems arising in social networks. In contrast to existing studies that involve greedy approximation algorithms with a 63% performance guarantee, our work focuses on solving the problem…
We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem.…
This paper proposes a simplified version of classical models for urban transportation networks, and studies the problem of controlling intersections with the goal of optimizing network-wide congestion. Differently from traditional…