A Scalable Max-Consensus Protocol For Noisy Ultra-Dense Networks

@article{Agrawal2019ASM,
  title={A Scalable Max-Consensus Protocol For Noisy Ultra-Dense Networks},
  author={Navneet Agrawal and M. Frey and S. Stańczak},
  journal={2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)},
  year={2019},
  pages={1-5}
}
  • Navneet Agrawal, M. Frey, S. Stańczak
  • Published 2019
  • Computer Science, Mathematics
  • 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
We introduce ScalableMax, a novel communication scheme for achieving max-consensus in a network of multiple agents which harnesses the interference in the wireless channel as well as its multicast capabilities. In a sufficiently dense network, the amount of communication resources required grows logarithmically with the number of nodes, while in state-of-the-art approaches, this growth is at least linear. ScalableMax can handle additive noise and works well in a high SNR regime. For medium and… Expand
Distributed Approximation of Functions over Fast Fading Channels with Applications to Distributed Learning and the Max-Consensus Problem
TLDR
This work takes fast fading into account and gives explicit probability bounds for the approximation error allowing us to derive bounds on the number of channel uses that are needed to approximate a function up to a given approximation accuracy. Expand
The Magic of Superposition: A Survey on the Simultaneous Transmission Based Wireless Systems
TLDR
The survey shows that simultaneous transmission can bring scalability, security, low-latency, lowcomplexity and energy efficiency for certain distributed wireless scenarios which are inevitable with the emerging Internet of things (IoT) applications. Expand
Over-The-Air Computation for Distributed Machine Learning
TLDR
This paper considers noisy fast-fading channels that pose major challenges to the ``over-the-air'' computation of a function of data captured at different wireless devices and approximated function values are approximated from superimposed noisy signals transmitted by different devices. Expand
Over-The-Air Computation in Correlated Channels
TLDR
This paper provides non-asymptotic, theoretical guarantees for OTA computation in fast-fading wireless channels where the fading and noise may be correlated and makes any assumptions on the distribution of the sources and therefore, it can, e.g., be applied to arbitrarily correlated sources. Expand

References

SHOWING 1-10 OF 20 REFERENCES
Exploiting the Superposition Property of Wireless Communication for Max-Consensus Problems in Multi-Agent Systems
TLDR
A comparison with traditional approaches shows that the proposed consensus protocol achieves a faster convergence. Expand
Exploiting the Superposition Property of Wireless Communication For Average Consensus Problems in Multi-Agent Systems
TLDR
A consensus algorithm that exploits the broadcast property of the wireless channel is proposed that is expected to exhibit fast convergence and high efficiency in terms of the usage of scarce wireless resources. Expand
A Distributed Consensus-Based Cooperative Spectrum-Sensing Scheme in Cognitive Radios
TLDR
A fully distributed and scalable cooperative spectrum-sensing scheme based on recent advances in consensus algorithms that not only has proven sensitivity in detecting the primary user's presence but also has robustness in choosing a desirable decision threshold. Expand
Max-consensus in a max-plus algebraic setting: The case of fixed communication topologies
  • B. M. Nejad, S. Attia, J. Raisch
  • Mathematics, Computer Science
  • 2009 XXII International Symposium on Information, Communication and Automation Technologies
  • 2009
TLDR
A new approach using max-plus algebra is proposed to analyze convergence of max-consensus algorithm, which is needed for applications such as minimum time rendezvous and leader election in time-invariant communication topologies. Expand
Distributed algorithms for reaching consensus on general functions
TLDR
This paper identifies a class of smooth functions for which one can synthesize in a systematic way distributed algorithms that achieve consensus, applies this result to the family of weighted power mean functions, and characterize the exponential convergence properties of the resulting algorithms. Expand
Analysis of Max-Consensus Algorithms in Wireless Channels
TLDR
It is proved that the convergence time of two heuristic algorithms is finite with probability one, an upper-bound on their mean convergence time is derived, and they exhibit a bound on their convergence time dispersion. Expand
A One-Parameter Family of Distributed Consensus Algorithms with Boundary: From Shortest Paths to Mean Hitting Times
TLDR
The proposed algorithms recover both the Bellman-Ford iteration for finding shortest paths as well as the algorithm for calculating the mean hitting time of a random walk on a graph to demonstrate the potential utility of these algorithms for routing in adhoc networks. Expand
Consensus problems in networks of agents with switching topology and time-delays
TLDR
A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol. Expand
A consensus approach to the assignment problem: Application to mobile sensor dispatch
TLDR
A consensus protocol is proposed to solve the assignment problem in a completely distributed manner without any central management or global knowledge and ensures convergence to an assignment that is within n∈ of being optimal where n is the number of agents and ∈ is a design parameter. Expand
Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies
TLDR
This work considers consensus seeking of networked agents on directed graphs where each agent has only noisy measurements of its neighbors' states and uses Stochastic approximation type algorithms to generalize the algorithm to networks with random link failures and prove convergence results. Expand
...
1
2
...