A greedy topology design to accelerate consensus in broadcast wireless sensor networks

作     者：Vecchio, Massimo Lopez-Valcarce, Roberto 

作者机构：CREATE NET I-38123 Trento Italy Univ Vigo Dept Teoria Serial & Comunicac Vigo 36310 Spain 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：2015年第115卷第3期

页      面：408-413页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：European Regional Development Fund (ERDF) Spanish Government [TEC2013-47020-C2-1-R COMPASS, CONSOLIDER-INGENIO 2010 CSD2008-00010 COMONSENS TACTICA] Galician Regional Government [R2014/037, GRC2013/009, Atlant-TIC] 

主　　题：Average consensus Range assignment Topology control Wireless multicast advantage Graph algorithms 

摘      要：We present techniques to improve convergence speed of distributed average consensus algorithms in wireless sensor networks by means of topology design. A broadcast network is assumed, so that only the transmit power of each node can be independently controlled, rather than each individual link. Starting with a maximally connected configuration in which all nodes transmit at full power, the proposed methods successively reduce the transmit power of a chosen node in order to remove one and only one link;nodes are greedily selected either in order to yield fastest convergence at each step, or if they have the largest degree in the network. These greedy schemes provide a good complexity-performance tradeoff with respect to full-blown global search methods. As a side benefit, improving the convergence speed also results in savings in energy consumption with respect to the maximally connected setting. (C) 2014 Elsevier B.V. All rights reserved.