Toward Resource-Optimal Consensus Over the Wireless Medium

被引:12
作者
Nokleby, Matthew [1 ]
Bajwa, Waheed U. [3 ]
Calderbank, Robert [2 ]
Aazhang, Behnaam [4 ]
机构
[1] Duke Univ, Dept Elect & Comp Engn, Durham, NC 27705 USA
[2] Duke Univ, Dept Comp Sci, Durham, NC 27705 USA
[3] Rutgers State Univ, Dept Elect & Comp Engn, Piscataway, NJ 08854 USA
[4] Rice Univ, Dept Elect & Comp Engn, Houston, TX 77005 USA
基金
美国国家科学基金会; 芬兰科学院;
关键词
Average consensus; distributed algorithms; gossip algorithms; wireless sensor networks; DISTRIBUTED AVERAGE CONSENSUS; CAPACITY; NETWORKS; GOSSIP; INFORMATION;
D O I
10.1109/JSTSP.2013.2246765
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We carry out a comprehensive study of the resource cost of averaging consensus in wireless networks. Most previous approaches suppose a graphical network, which abstracts away crucial features of the wireless medium, and measure resource consumption only in terms of the total number of transmissions required to achieve consensus. Under a path-loss model, we study the resource requirements of consensus with respect to three wireless-appropriate metrics: total transmit energy, elapsed time, and time-bandwidth product. First, we characterize the performance of several popular gossip algorithms, showing that they may be order-optimal with respect to transmit energy but are strictly suboptimal with respect to elapsed time and time-bandwidth product. Further, we propose a new consensus scheme, termed hierarchical averaging, and show that it is nearly order-optimal with respect to all three metrics. Finally, we examine the effects of quantization, showing that hierarchical averaging provides a nearly order-optimal tradeoff between resource consumption and quantization error.
引用
收藏
页码:284 / 295
页数:12
相关论文
共 28 条
[1]  
[Anonymous], P 4 INT S INF PROC S
[2]   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
[3]   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
[4]   The Distributed Multiple Voting Problem [J].
Benezit, Florence ;
Thiran, Patrick ;
Vetterli, Martin .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2011, 5 (04) :791-804
[5]   Order-Optimal Consensus Through Randomized Path Averaging [J].
Benezit, Florence ;
Dimakis, Alexandros G. ;
Thiran, Patrick ;
Vetterli, Martin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (10) :5150-5167
[6]   Randomized gossip algorithms [J].
Boyd, Stephen ;
Ghosh, Arpita ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2508-2530
[7]   On colouring the nodes of a network [J].
Brooks, RL .
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197
[8]   DYNAMIC LOAD BALANCING FOR DISTRIBUTED MEMORY MULTIPROCESSORS [J].
CYBENKO, G .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 7 (02) :279-301
[9]   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
[10]   Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling [J].
Duchi, John C. ;
Agarwal, Alekh ;
Wainwright, Martin J. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2012, 57 (03) :592-606