Related papers: Fault-tolerant Network Design for Bounded Delay Da…
We consider the problem of distributed optimal power flow (OPF) for multi-area electric power systems. A novel distributed algorithm is proposed, referred to as the rotated coordinate descent critical region exploration (RCDCRE). It allows…
The distributed biased min-consensus (DBMC) protocol is an iterative scheme that solves the shortest path problem asymptotically, requiring only local information exchange between neighboring nodes. By appropriately designing the gain…
We study the problem of building a maximum lifetime data collection tree for periodic convergecast applications in wireless sensor networks. We experimentally observe that if two nodes transmit same number of data packets, the amount of…
We consider the optimal control design problem for discrete-time LTI systems with state feedback, when the actuation signal is subject to unmeasurable switching propagation delays, due to e.g. the routing in a multi-hop communication…
Machine learning (ML) algorithms deployed in real-world environments are often faced with the challenge of adapting models to concept drift, where the task data distributions are shifting over time. The problem becomes even more difficult…
Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate…
We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links of the communication network, while capacity captures their…
This paper deals with the problem of remote estimation of the state of a discrete-time stochastic linear system observed by a sensor with computational capacity to calculate local estimates. We design an event-triggered communication (ETC)…
In this paper, phasor measurement unit (PMU) placement for power grid state estimation under different degrees of observability is studied. Observability degree is the depth of the buses' reachability by the placed PMUs and thus constitutes…
In this paper, we propose an adaptive Medium Access Control (MAC) protocol for full-duplex (FD) cognitive radio networks in which FD secondary users (SUs) perform channel contention followed by concurrent spectrum sensing and transmission,…
This paper studies the tracking control problem of nonlinear networked and quantized control systems (NQCSs) with communication delays. The desired trajectory is generated by a reference system. The communication network is to guarantee the…
This paper proposes a centralized predictive flow controller to handle multi-connectivity for ultra-reliable low latency communication (URLLC) services. The prediction is based on channel state information (CSI) and buffer state reports…
Accurate channel modeling has become critical for evaluating multiple-input multiple-output (MIMO) performance, especially as 5G standardization matures and efforts toward 6G begin. Recent studies within the 3rd Generation Partnership…
A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set $V$ of wireless nodes, compute a spanning tree $T$, so that the total cost of $T$ is minimized. In recent years, there has been a lot…
We study transmission delay minimization of a wireless powered communication (WPC) system in a point-to-point scenario with one hybrid access point (HAP) and one WPC node. In this type of communications, the HAP sends energy to the node at…
Wireless network scheduling and control techniques (e.g., opportunistic scheduling) rely heavily on access to Channel State Information (CSI). However, obtaining this information is costly in terms of bandwidth, time, and power, and could…
Grant-free protocols exploiting compressed sensing (CS) multi-user detection (MUD) are appealing for solving the random access problem in massive machine-type communications (mMTC) with sporadic device activity. Such protocols would greatly…
Tightening performance bounds of ring networks with cyclic dependencies is still an open problem in the literature. In this paper, we tackle such a challenging issue based on Network Calculus. First, we review the conventional timing…
Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these…
Recent progress in robotics has underscored the demand for real-time control in applications such as manufacturing, healthcare, and autonomous systems, where the timely delivery of mission-critical commands under heterogeneous robotic…