Related papers: Toward Resource-Optimal Consensus over the Wireles…
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However for many topologies that are realistic…
Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this…
In this paper, we propose a novel framework for performance optimization in Internet of Things (IoT)-based next-generation wireless sensor networks. In particular, a computationally-convenient system is presented to combat two major…
In this paper, we study distributed consensus in the radio network setting. We produce new upper and lower bounds for this problem in an abstract MAC layer model that captures the key guarantees provided by most wireless MAC layers. In more…
The outage performance of wireless networks with unstructured network topologies is investigated. The network reliability perspective of graph theory is used to obtain the network outage polynomial of generalized wireless networks by…
Improving energy efficiency of wireless systems by exploiting the context information has received attention recently as the smart phone market keeps expanding. In this paper, we devise energy-saving resource allocation policy for multiple…
We characterize the maximum achievable broadcast rate in a wireless network under various fading assumptions. Our result exhibits a duality between the performance achieved in this context by collaborative beamforming strategies and the…
Average consensus algorithms have wide applications in distributed computing systems where all the nodes agree on the average value of their initial states by only exchanging information with their local neighbors. In this letter, we look…
This paper investigates the problem of distributed network-wide averaging and proposes a new greedy gossip algorithm. Instead of finding the optimal path of each node in a greedy manner, the proposed approach utilises a suboptimal…
Offloading of cellular traffic through a wireless local area network (WLAN) is theoretically evaluated. First, empirical data sets of the locations of WLAN internet access points are analyzed and an inhomogeneous Poisson process consisting…
In this paper we address two basic questions in wireless communication: First, how long does it take to schedule an arbitrary set of communication requests? Second, given a set of communication requests, how many of them can be scheduled…
Joint optimization of scheduling and estimation policies is considered for a system with two sensors and two non-collocated estimators. Each sensor produces an independent and identically distributed sequence of random variables, and each…
The performance of systems where multiple users communicate over wireless fading links benefits from channel-adaptive allocation of the available resources. Different from most existing approaches that allocate resources based on perfect…
Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries).…
Energy management is a crucial challenge in wireless sensor networks. To date, many techniques have been proposed to reduce energy consumption. Duty cycle methods reduce the energy consumption of wireless sensor networks since energy…
The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the…
Consensus networks are usually understood as arithmetic mean driven dynamical averaging systems. In applications, however, network dynamics often describe inherently non-arithmetic and non-linear consensus processes. In this paper, we…
Resource-constrained systems are prevalent in communications. Such a system is composed of many components but only some of them can be allocated with resources such as time slots. According to the amount of information about the system,…
Consensus conditions and convergence speeds are crucial for distributed consensus algorithms of networked systems. Based on a basic first-order average-consensus protocol with time-varying topologies and additive noises, this paper first…
Throughput and energy efficiency in fading channels are studied in the presence of randomly arriving data and statistical queueing constraints. In particular, Markovian arrival models including discrete-time Markov, Markov fluid, and…