Math @ Duke

Publications [#236081] of Robert Calderbank
Papers Published
 Nokleby, M; Bajwa, WU; Calderbank, R; Aazhang, B, Hierarchical averaging over wireless sensor networks,
2015 Ieee International Conference on Acoustics, Speech, and Signal Processing (Icassp)
(2012),
pp. 31213124, ISSN 15206149 [doi]
(last updated on 2018/10/17)
Abstract: We introduce an approach to gossip algorithms that exploits three aspects of the wireless medium: superposition, broadcast, and power control. Instead of sending pairwise messages between neighbors on a fixed network topology, we construct gossip algorithms in which nodes can simultaneously recover multiple neighbors' messages and in which nodes can adjust the set of their neighbors by adjusting transmit power. We present two averaging algorithms, each based on a hierarchical clustering of the network. In the first algorithm, clusters of nodes transmit their estimates locally and randomly select a representative node for communications at the next level. In the second, each cluster mutually averages and then cooperatively transmits at the next level. For pathloss environments, these schemes achieve orderoptimal or near orderoptimal performance. © 2012 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

