@inproceedings{61cd7afdf4044abbb6e357d5d09218fd,
title = "Quantized consensus",
abstract = "We study the distributed averaging problem on arbitrary connected graphs, with the additional constraint that the value at each node is an integer. This discretlzed distributed averaging problem models averaging in a network with finite capacity channels (and in this form has applications to distributed detection in sensor networks) and load balancing in a processor network. We describe simple randomized distributed algorithms which achieve consensus to the extent that the discrete nature of the problem permits.",
author = "Akshay Kashyap and T. Ba{\c s}ar and R. Srikant",
year = "2006",
doi = "10.1109/ISIT.2006.261862",
language = "English (US)",
isbn = "1424405041",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "635--639",
booktitle = "Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006",
note = "2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",
}