In decentralized optimization, nodes cooperate to minimize an overall objective function that
is the sum (or average) of per-node private objective functions. Algorithms interleave local …

The recent advances of compressive sensing (CS) have witnessed a great potential of
efficient compressive data gathering (CDG) in wireless sensor network systems (WSNSs) …

In this paper, we study the problem of data gathering with compressive sensing (CS) in
wireless sensor networks (WSNs). Unlike the conventional approaches, which require …

In machine learning, a popular tool to analyze the structure of graphs is the hitting time and
the commute distance (resistance distance). For two vertices u and v, the hitting time Huv is …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes n. The protocol relies …

We consider the problem of timely exchange of updates between a central station and a set
of ground terminals, via a mobile agent that traverses across the ground terminals along a …

Random walk (RW) routing for monitoring purposes in Wireless Sensor Networks (WSNs)
has been proven to be an energy-efficient method. In this paper, we exploit the integration …

We reconsider the problem of geographic routing in wireless ad hoc networks. We are
interested in local, memoryless routing algorithms, ie each network node bases its routing …

This supplement is devoted to the proof of our main results: Theorems 2 and 3 of the main
paper. For convenience, we formulate all proofs in terms of the effective resistance between …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes $ n $. The protocol is …