Related papers: Throughput-Optimal Broadcast in Wireless Networks …
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…
Our goal is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition…
This work studies how to preemptively increase the resilience of a network by means of time-varying topological actuation. To do this, we focus on linear dynamical systems that are compatible with a given network, and consider policies that…
We propose an adaptive control strategy for the simultaneous estimation of topology and synchronization in complex dynamical networks with unknown, time-varying topology. Our approach transforms the problem of time-varying topology…
In this paper, we study the distributed control of networked cyber-physical systems when a much more energy-efficient distributed communication management strategy is proposed to solve the well-studied consensus problem. In contrast to the…
This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized…
We address the problem of inferring the topology of a wireless network using limited observational data. Specifically, we assume that we can detect when a node is transmitting, but no further information regarding the transmission is…
In this paper queue stability in a single-hop wireless multicast networks over erasure channels is analyzed. First, a queuing model consisting of several sub-queues is introduced. Under the queueing stability constraint, we adopt Lyapunov…
High energy efficiency and low latency have always been the significant goals pursued by the designer of wireless networks. One efficient way to achieve these goals is cross-layer scheduling based on the system states in different layers,…
In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not…
In this paper, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decision process (MDP) and systematically unravel the structural…
This paper considers a wireless link with randomly arriving data that is queued and served over a time-varying channel. It is known that any algorithm that comes within $\epsilon$ of the minimum average power required for queue stability…
We consider a wireless network with a base station serving multiple traffic streams to different destinations. Packets from each stream arrive to the base station according to a stochastic process and are enqueued in a separate (per stream)…
A communication network modelled by a directed acyclic graph (DAG) is considered, over which a source wishes to send a specified number of bits to a destination node. Each node of the DAG is powered by a separate renewable energy source,…
This paper addresses the challenge of packet-based information routing in large-scale wireless communication networks. The problem is framed as a constrained statistical learning task, where each network node operates using only local…
We propose a throughput-optimal biased backpressure (BP) algorithm for routing, where the bias is learned through a graph neural network that seeks to minimize end-to-end delay. Classical BP routing provides a simple yet powerful…
A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the…
This paper presents a novel dynamic coverage control algorithm allowing a group of robots to track an optimal-deployment configuration for arbitrary time-varying density functions. Building on singular perturbation theory, the proposed…
We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. Modern communication systems are becoming increasingly complex, and are required to handle multiple types of traffic with widely…
We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to…