相关论文: Exploring Design Tradeoffs Of A Distributed Algori…
We consider the distributed optimization problem, where a group of agents work together to optimize a common objective by communicating with neighboring agents and performing local computations. For a given algorithm, we use tools from…
The performance of collaborative beamforming is analyzed using the theory of random arrays. The statistical average and distribution of the beampattern of randomly generated phased arrays is derived in the framework of wireless ad hoc…
We consider distributed algorithms for data aggregation and function computation in sensor networks. The algorithms perform pairwise computations along edges of an underlying communication graph. A token is associated with each sensor node,…
Future wireless networks are expected to be highly heterogeneous with the co-existence of macrocells and small cells as well as provide support for device-to-device (D2D) communication. In such muti-tier heterogeneous systems centralized…
This paper proposes a novel distributed event-triggered algorithmic solution to the multi-agent average consensus problem for networks whose communication topology is described by weight-balanced, strongly connected digraphs. The proposed…
In this work, we propose a novel discrete-time distributed algorithm for finding least-squares solutions of linear algebraic equations with a scheduling protocol to further enhance its scalability. Each agent in the network is assumed to…
We investigate the scenario where a perturbed nonlinear system transmits its output measurements to a remote observer via a packet-based communication network. The sensors are grouped into N nodes and each of these nodes decides when its…
In this article we consider the problems of distributed detection and estimation in wireless sensor networks. In the first part, we provide a general framework aimed to show how an efficient design of a sensor network requires a joint…
With the development of astronomical facilities, large-scale time series data observed by these facilities is being collected. Analyzing anomalies in these astronomical observations is crucial for uncovering potential celestial events and…
We consider a distributed edge computing scenario consisting of several wireless nodes that are located over an area of interest. Specifically, some of the "master" nodes are tasked to sense the environment (e.g., by acquiring images or…
A model-independent search for deviations from the Standard Model prediction has been performed in e+p and e-p collisions at HERA using H1 data. All experimentally measurable event topologies involving isolated electrons, photons, muons,…
The problem of quickest detection of dynamic events in networks is studied. At some unknown time, an event occurs, and a number of nodes in the network are affected by the event, in that they undergo a change in the statistics of their…
Topological event detection allows for the distributed computation of homology by focusing on local changes occurring in a network over time. In this paper, a model for the monitoring of topological events in dynamically changing regions…
This paper studies the traffic monitoring problem in a road network using a team of aerial robots. The problem is challenging due to two main reasons. First, the traffic events are stochastic, both temporally and spatially. Second, the…
We consider a power-constrained sensor network, consisting of multiple sensor nodes and a fusion center (FC), that is deployed for the purpose of estimating a common random parameter of interest. In contrast to the distributed framework,…
In this paper, given a random uniform distribution of sensor nodes on a 2-D plane, a fast self-organized distributed algorithm is proposed to find the maximum number of partitions of the nodes such that each partition is connected and…
Many of the distributed localization algorithms are based on relaxed optimization formulations of the localization problem. These algorithms commonly rely on first-order optimization methods, and hence may require many iterations or…
Firm evidence for a radio emission counterpart of cosmic ray air showers is presented. By the use of an antenna array set up in coincidence with ground particle detectors, we find a collection of events for which both time and arrival…
Many network optimization problems can be formulated as stochastic network design problems in which edges are present or absent stochastically. Furthermore, protective actions can guarantee that edges will remain present. We consider the…
The Pierre Auger Observatory (Auger) and the Telescope Array (TA) are the world's two largest ultra-high-energy cosmic ray (UHECR) observatories. They operate in the Southern and Northern hemispheres, respectively, at similar latitudes but…