We start from a set of users communicating over a Gaussian multiple access wire-tap channel with confidential messages, where users attempt to transmit private messages to a legitimate receiver in the presence of an eavesdropper. While prior work focused on the case where the users were cooperative, we assume that...
Algorithms which are efficient and robust are essential to meet the increasing computational demands in the world today. In this thesis, we consider the analysis and design of both distributed algorithms for dynamic average consensus and centralized algorithms for convex optimization.
Dynamic average consensus consists of a group of agents,...