Energy-latency tradeoff for in-network function computation in random networks
Name
Willsky_Energy-latency tradeoff.pdf
Size
185.57 KB
Format
Adobe PDF
Checksum (MD5)
a6a564afc0f27bab051ae822d87be181
Author(s)
Balister, Paul
Bollobas, Bela
Anandkumar, Animashree
Willsky, Alan S.
Date Issued
June 2011
Journal
Proceedings of the IEEE INFOCOM, 2011
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Balister, Paul et al. “Energy-latency Tradeoff for In-network Function Computation in Random Networks.” Proceedings of the IEEE INFOCOM, 2011. 1575–1583.
Version
Author's final manuscript
Abstract
The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the energy consumption under the latency constraint is analyzed for random networks, where the nodes are uniformly placed in growing regions and the number of nodes goes to infinity. The special case of sum function computation and its delivery to a designated root node is considered first. A policy which achieves order-optimal average energy consumption in random networks subject to the given latency constraint is proposed. The scaling behavior of the optimal energy consumption depends on the path-loss exponent of wireless transmissions and the dimension of the Euclidean region where the nodes are placed. The policy is then extended to computation of a general class of functions which decompose according to maximal cliques of a proximity graph such as the k-nearest neighbor graph or the geometric random graph. The modified policy achieves order-optimal energy consumption albeit for a limited range of latency constraints.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2011.5934949
