148 research outputs found
Estimation over Communication Networks: Performance Bounds and Achievability Results
This paper considers the problem of estimation over communication networks. Suppose a sensor is taking measurements of a dynamic process. However the process needs to be estimated at a remote location connected to the sensor through a network of communication links that drop packets stochastically. We provide a framework for computing the optimal performance in the sense of expected error covariance. Using this framework we characterize the dependency of the performance on the topology of the network and the packet dropping process. For independent and memoryless packet dropping processes we find the steady-state error for some classes of networks and obtain lower and upper bounds for the performance of a general network. Finally we find a necessary and sufficient condition for the stability of the estimate error covariance for general networks with spatially correlated and Markov type dropping process. This interesting condition has a max-cut interpretation
Stabilizing Error Correction Codes for Controlling LTI Systems over Erasure Channels
We propose (k,k') stabilizing codes, which is a type of delayless error
correction codes that are useful for control over networks with erasures. For
each input symbol, k output symbols are generated by the stabilizing code.
Receiving any k' of these outputs guarantees stability. Thus, the system to be
stabilized is taken into account in the design of the erasure codes. Our focus
is on LTI systems, and we construct codes based on independent encodings and
multiple descriptions. The theoretical efficiency and performance of the codes
are assessed, and their practical performances are demonstrated in a simulation
study. There is a significant gain over other delayless codes such as
repetition codes.Comment: Accepted and presented at the IEEE 60th Conference on Decision and
Control (CDC). arXiv admin note: substantial text overlap with
arXiv:2112.1171
Taming and Leveraging Directionality and Blockage in Millimeter Wave Communications
To cope with the challenge for high-rate data transmission, Millimeter Wave(mmWave) is one potential solution. The short wavelength unlatched the era of directional mobile communication. The semi-optical communication requires revolutionary thinking. To assist the research and evaluate various algorithms, we build a motion-sensitive mmWave testbed with two degrees of freedom for environmental sensing and general wireless communication.The first part of this thesis contains two approaches to maintain the connection in mmWave mobile communication. The first one seeks to solve the beam tracking problem using motion sensor within the mobile device. A tracking algorithm is given and integrated into the tracking protocol. Detailed experiments and numerical simulations compared several compensation schemes with optical benchmark and demonstrated the efficiency of overhead reduction. The second strategy attempts to mitigate intermittent connections during roaming is multi-connectivity. Taking advantage of properties of rateless erasure code, a fountain code type multi-connectivity mechanism is proposed to increase the link reliability with simplified backhaul mechanism. The simulation demonstrates the efficiency and robustness of our system design with a multi-link channel record.The second topic in this thesis explores various techniques in blockage mitigation. A fast hear-beat like channel with heavy blockage loss is identified in the mmWave Unmanned Aerial Vehicle (UAV) communication experiment due to the propeller blockage. These blockage patterns are detected through Holm\u27s procedure as a problem of multi-time series edge detection. To reduce the blockage effect, an adaptive modulation and coding scheme is designed. The simulation results show that it could greatly improve the throughput given appropriately predicted patterns. The last but not the least, the blockage of directional communication also appears as a blessing because the geometrical information and blockage event of ancillary signal paths can be utilized to predict the blockage timing for the current transmission path. A geometrical model and prediction algorithm are derived to resolve the blockage time and initiate active handovers. An experiment provides solid proof of multi-paths properties and the numeral simulation demonstrates the efficiency of the proposed algorithm
Linear control of the Pendubot over packet-drop networks
In this thesis we investigate control across stochastic drop-out channels. We seek optimal linear controllers for mean-square stability that make use of the knowledge of whether a packet is received. We establish a fundamental bound on drop-out probability allowable for stabilization, which in some cases is tight. When tight, a convex optimization provides controller design. The main result is a remote stabilization technique that always achieves this bound via acknowledgement from the actuation receiver. Controller information structure and decentralization issues are considered. The theory is then applied to the inverted pendulum experiment Pendubot. The Pendubot is a nonlinear plant that balances the links of an inverted pendulum via a control torque and optical sensors for position. A control strategy is developed using the stabilization technique derived above together with linearization and discretization of the apparatus. The complete design procedure is documented leading to a successful controller. Included are the encountered hardware issues, software issues in Matlab and C programming, theoretical issues, and experiment results. A mock drop-out network is simulated via C programming. The experiments validate that the theoretical design technique actually works, and that the theoretical bounds on allowable drop-out have significant practical bearing
AirFL-Mem: Improving Communication-Learning Trade-Off by Long-Term Memory
Addressing the communication bottleneck inherent in federated learning (FL),
over-the-air FL (AirFL) has emerged as a promising solution, which is, however,
hampered by deep fading conditions. In this paper, we propose AirFL-Mem, a
novel scheme designed to mitigate the impact of deep fading by implementing a
\emph{long-term} memory mechanism. Convergence bounds are provided that account
for long-term memory, as well as for existing AirFL variants with short-term
memory, for general non-convex objectives. The theory demonstrates that
AirFL-Mem exhibits the same convergence rate of federated averaging (FedAvg)
with ideal communication, while the performance of existing schemes is
generally limited by error floors. The theoretical results are also leveraged
to propose a novel convex optimization strategy for the truncation threshold
used for power control in the presence of Rayleigh fading channels.
Experimental results validate the analysis, confirming the advantages of a
long-term memory mechanism for the mitigation of deep fading.Comment: 8 pages, 3 figures, submitted for possible publicatio
- …