A simple and scalable algorithm for alignment in broadcast networks

Authors:
Roberto Pagliari;Mehmet E. Yildiz;Shrut Kirti;Kristi A. Morgansen;Tara Javidi;Anna Scaglione
Affiliations:
Department of Electrical and Computer Engineering, Cornell University, Ithaca, NY;Department of Electrical and Computer Engineering, Cornell University, Ithaca, NY;Department of Electrical and Computer Engineering, Cornell University, Ithaca, NY;Department of Aeronautics and Astronautics, University of Washington, Seattle, WA;Department of Electrical and Computer Engineering, University of California at San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California at Davis, Davis, CA
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Year:
2010

Citing 8
Cited 0

A scheme for robust distributed sensor fusion based on average consensus

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
A survey of practical issues in underwater networks

WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Quantized consensus

Automatica (Journal of IFAC)
Vision-based, distributed control laws formotion coordination of nonholonomic robots

IEEE Transactions on Robotics
Broadcast gossip algorithms for consensus

IEEE Transactions on Signal Processing
Distributed Average Consensus With Dithered Quantization

IEEE Transactions on Signal Processing - Part I
Coding With Side Information for Rate-Constrained Consensus

IEEE Transactions on Signal Processing - Part I
Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of coordinating a group of mobile nodes communicating through a wireless medium. The objective of the network is the alignment of all the nodes towards a common direction through local interactions, without the need for global knowledge such as the network topology or the maximum degree of the network, or even local parameters, such as the number of neighbors. The key feature of our algorithm is that each node state update is done through voting, where the probability of each vote is biased by the state of the node neighbors. We propose two possible physical implementations for our algorithm. The first is based on the explicit exchange of packetized messages, while the second is a cross-layer approach. Our analysis unveils key convergence properties of this simple class of alignment algorithms, via analytical and simulated results.