Gossip and consensus in mobile networks

被引：0

作者：

Sarwate, Anand D. ^{[1
]}

Dimakis, Alexandros G. ^{[2
]}

机构：

[1] Univ Calif San Diego, Informat Theory & Applicat Ctr, La Jolla, CA 92093 USA

[2] Univ Southern Calif, Dept Elect Engn Syst, Los Angeles, CA USA

来源：

2009 3RD IEEE INTERNATIONAL WORKSHOP ON COMPUTATIONAL ADVANCES IN MULTI-SENSOR ADAPTIVE PROCESSING (CAMSAP 2009) | 2009年

关键词：

SENSOR NETWORKS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We analyze the effect of node mobility on the convergence time of pairwise gossip algorithms. We use a simple mobility model and illustrate how to transform a gossip with mobile agents into gossip in a static network with a nonuniform distribution on selecting neighbors. We describe two methods for analyzing Markov chain convergence that can be used to derive upper and lower bounds on the convergence time of the network. Several examples are given to show the usefulness of these methods.

引用

页码：57 / +

页数：2

共 26 条

[1] Distributed average consensus with dithered quantization [J].

Aysal, Tuncer Can ;

Coates, Mark J. ;

Rabbat, Michael G. .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (10) :4905-4918

[2] Broadcast Gossip Algorithms for Consensus [J].

Aysal, Tuncer Can ;

Yildiz, Mehmet Ercan ;

Sarwate, Anand D. ;

Scaglione, Anna .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2009, 57 (07) :2748-2761

[3]

Benezit F., 2007, P ALL C COMM CONTR C

[4]

Bertsekas D. P., 1997, Parallel and Distributed Computation: Numerical Methods

[5]

Bettstetter C., 2001, ACM MOBILE COMPUTING

[6]

Boyd S., 2006, IEEE T INFO THEORY, V52

[7]

Broch J., 1998, MOBILE COMPUTING NET

[8]

Denantes P., 2008, P IEEE INF

[9]

DIACONIS P, 1991, ANN APPL PROBABILITY, V1

[10] Geographic gossip: Efficient averaging for sensor networks [J].

Dimakis, Alexandros D. G. ;

Sarwate, Anand D. ;

Wainwright, Martin J. .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (03) :1205-1216

← 1 2 3 →