Optimal information propagation in sensor networks

Peng Yang; Randy A Freeman; Kevin M Lynch

doi:10.1109/ROBOT.2006.1642176

Optimal information propagation in sensor networks

Peng Yang^*, Randy A Freeman, Kevin M Lynch

^*Corresponding author for this work

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

18 Scopus citations

Abstract

This paper studies the effect of communication-link weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to agents in a sensor network. Linear programming and LMI solutions are provided for the problem of centralized optimization of communication weights considering the possibility of intermittent bounded communication delays. Heuristic weighting schemes that can be implemented in a distributed fashion are also studied. Consensus convergence time may also be reduced by introducing long-range interactions, creating a "small world" network.

Original language	English (US)
Title of host publication	Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Pages	3122-3127
Number of pages	6
Volume	2006
DOIs	https://doi.org/10.1109/ROBOT.2006.1642176
State	Published - Dec 27 2006
Event	2006 IEEE International Conference on Robotics and Automation, ICRA 2006 - Orlando, FL, United States Duration: May 15 2006 → May 19 2006

Other

Other	2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Country	United States
City	Orlando, FL
Period	5/15/06 → 5/19/06

ASJC Scopus subject areas

Software
Control and Systems Engineering
Artificial Intelligence
Electrical and Electronic Engineering

Access to Document

10.1109/ROBOT.2006.1642176

Fingerprint Dive into the research topics of 'Optimal information propagation in sensor networks'. Together they form a unique fingerprint.

Cite this

@inproceedings{95b964dde81d447890c88896291b6321,

title = "Optimal information propagation in sensor networks",

abstract = "This paper studies the effect of communication-link weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to agents in a sensor network. Linear programming and LMI solutions are provided for the problem of centralized optimization of communication weights considering the possibility of intermittent bounded communication delays. Heuristic weighting schemes that can be implemented in a distributed fashion are also studied. Consensus convergence time may also be reduced by introducing long-range interactions, creating a {"}small world{"} network.",

author = "Peng Yang and Freeman, {Randy A} and Lynch, {Kevin M}",

year = "2006",

month = dec,

day = "27",

doi = "10.1109/ROBOT.2006.1642176",

language = "English (US)",

isbn = "0780395069",

volume = "2006",

pages = "3122--3127",

booktitle = "Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006",

note = "2006 IEEE International Conference on Robotics and Automation, ICRA 2006 ; Conference date: 15-05-2006 Through 19-05-2006",

}

TY - GEN

T1 - Optimal information propagation in sensor networks

AU - Yang, Peng

AU - Freeman, Randy A

AU - Lynch, Kevin M

PY - 2006/12/27

Y1 - 2006/12/27

N2 - This paper studies the effect of communication-link weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to agents in a sensor network. Linear programming and LMI solutions are provided for the problem of centralized optimization of communication weights considering the possibility of intermittent bounded communication delays. Heuristic weighting schemes that can be implemented in a distributed fashion are also studied. Consensus convergence time may also be reduced by introducing long-range interactions, creating a "small world" network.

AB - This paper studies the effect of communication-link weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to agents in a sensor network. Linear programming and LMI solutions are provided for the problem of centralized optimization of communication weights considering the possibility of intermittent bounded communication delays. Heuristic weighting schemes that can be implemented in a distributed fashion are also studied. Consensus convergence time may also be reduced by introducing long-range interactions, creating a "small world" network.

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

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

U2 - 10.1109/ROBOT.2006.1642176

DO - 10.1109/ROBOT.2006.1642176

M3 - Conference contribution

AN - SCOPUS:33845654507

SN - 0780395069

SN - 9780780395060

VL - 2006

SP - 3122

EP - 3127

BT - Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006

T2 - 2006 IEEE International Conference on Robotics and Automation, ICRA 2006

Y2 - 15 May 2006 through 19 May 2006

ER -