Distributed average consensus using bounded transmissions

Sivaraman Dasarathan; Mahesh Banavar; Cihan Tepedelenlioglu; Andreas Spanias

doi:10.1109/ACSSC.2012.6489212

Distributed average consensus using bounded transmissions

Sivaraman Dasarathan, Mahesh Banavar, Cihan Tepedelenlioglu, Andreas Spanias

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

A distributed consensus algorithm in which every sensor maps its state value through a bounded function before transmission is proposed. It is shown that when the step size of the algorithm is chosen appropriately, the state values of all the nodes converge exponentially to the sample average of the initial observations provided that the transmission function has a bounded first derivative. The convergence factor is shown to depend on the derivative of the transmission function. The performance of various bounded transmission functions are studied through simulations. It is shown that by appropriately choosing the step size, the proposed algorithm could achieve the same speed of convergence as that of the best case linear consensus algorithm based on the Laplacian heuristic.

Original language	English (US)
Title of host publication	Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Pages	1202-1206
Number of pages	5
DOIs	https://doi.org/10.1109/ACSSC.2012.6489212
State	Published - Dec 1 2012
Event	46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 - Pacific Grove, CA, United States Duration: Nov 4 2012 → Nov 7 2012

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)	1058-6393

Other

Other	46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Country/Territory	United States
City	Pacific Grove, CA
Period	11/4/12 → 11/7/12

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/ACSSC.2012.6489212

Cite this

Dasarathan, S., Banavar, M., Tepedelenlioglu, C., & Spanias, A. (2012). Distributed average consensus using bounded transmissions. In Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 (pp. 1202-1206). Article 6489212 (Conference Record - Asilomar Conference on Signals, Systems and Computers). https://doi.org/10.1109/ACSSC.2012.6489212

Distributed average consensus using bounded transmissions. / Dasarathan, Sivaraman; Banavar, Mahesh; Tepedelenlioglu, Cihan et al.
Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012. 2012. p. 1202-1206 6489212 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Dasarathan, S, Banavar, M, Tepedelenlioglu, C & Spanias, A 2012, Distributed average consensus using bounded transmissions. in Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012., 6489212, Conference Record - Asilomar Conference on Signals, Systems and Computers, pp. 1202-1206, 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012, Pacific Grove, CA, United States, 11/4/12. https://doi.org/10.1109/ACSSC.2012.6489212

@inproceedings{6448db7fe79c4b1784fa49fe8e98d0d8,

title = "Distributed average consensus using bounded transmissions",

abstract = "A distributed consensus algorithm in which every sensor maps its state value through a bounded function before transmission is proposed. It is shown that when the step size of the algorithm is chosen appropriately, the state values of all the nodes converge exponentially to the sample average of the initial observations provided that the transmission function has a bounded first derivative. The convergence factor is shown to depend on the derivative of the transmission function. The performance of various bounded transmission functions are studied through simulations. It is shown that by appropriately choosing the step size, the proposed algorithm could achieve the same speed of convergence as that of the best case linear consensus algorithm based on the Laplacian heuristic.",

author = "Sivaraman Dasarathan and Mahesh Banavar and Cihan Tepedelenlioglu and Andreas Spanias",

year = "2012",

month = dec,

day = "1",

doi = "10.1109/ACSSC.2012.6489212",

language = "English (US)",

isbn = "9781467350518",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

pages = "1202--1206",

booktitle = "Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012",

note = "46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 ; Conference date: 04-11-2012 Through 07-11-2012",

}

TY - GEN

T1 - Distributed average consensus using bounded transmissions

AU - Dasarathan, Sivaraman

AU - Banavar, Mahesh

AU - Tepedelenlioglu, Cihan

AU - Spanias, Andreas

PY - 2012/12/1

Y1 - 2012/12/1

N2 - A distributed consensus algorithm in which every sensor maps its state value through a bounded function before transmission is proposed. It is shown that when the step size of the algorithm is chosen appropriately, the state values of all the nodes converge exponentially to the sample average of the initial observations provided that the transmission function has a bounded first derivative. The convergence factor is shown to depend on the derivative of the transmission function. The performance of various bounded transmission functions are studied through simulations. It is shown that by appropriately choosing the step size, the proposed algorithm could achieve the same speed of convergence as that of the best case linear consensus algorithm based on the Laplacian heuristic.

AB - A distributed consensus algorithm in which every sensor maps its state value through a bounded function before transmission is proposed. It is shown that when the step size of the algorithm is chosen appropriately, the state values of all the nodes converge exponentially to the sample average of the initial observations provided that the transmission function has a bounded first derivative. The convergence factor is shown to depend on the derivative of the transmission function. The performance of various bounded transmission functions are studied through simulations. It is shown that by appropriately choosing the step size, the proposed algorithm could achieve the same speed of convergence as that of the best case linear consensus algorithm based on the Laplacian heuristic.

UR - http://www.scopus.com/inward/record.url?scp=84876228524&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876228524&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.2012.6489212

DO - 10.1109/ACSSC.2012.6489212

M3 - Conference contribution

AN - SCOPUS:84876228524

SN - 9781467350518

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 1202

EP - 1206

BT - Conference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012

T2 - 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012

Y2 - 4 November 2012 through 7 November 2012

ER -

Distributed average consensus using bounded transmissions

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this