CaltechAUTHORS
  A Caltech Library Service

Energy-latency tradeoff for in-network function computation in random networks

Balister, Paul and Bollobás, Béla and Anandkumar, Animashree and Willsky, Alan (2011) Energy-latency tradeoff for in-network function computation in random networks. In: 2011 Proceedings IEEE INFOCOM. IEEE , Piscataway, NJ, pp. 1575-1583. ISBN 978-1-4244-9919-9. https://resolver.caltech.edu/CaltechAUTHORS:20170925-092119382

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170925-092119382

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/INFCOM.2011.5934949DOIArticle
http://ieeexplore.ieee.org/document/5934949PublisherArticle
Additional Information:© 2011 IEEE. The first and second authors are supported in part by NSF grants DMS-0906634, CNS-0721983 and CCF-0728928, and ARO grant W911NF-06-1-0076. The third and the fourth authors are sponsored in part by a MURI funded through ARO Grant W911NF-06-1-0076. The third author is supported in part by the setup funds at UCI.
Funders:
Funding AgencyGrant Number
NSFDMS-0906634
NSFCNS-0721983
NSFCCF-0728928
Army Research Office (ARO)W911NF-06-1-0076
University of California, IrvineUNSPECIFIED
Subject Keywords:Function computation, latency-energy tradeoff, Euclidean random graphs, minimum broadcast problem
Record Number:CaltechAUTHORS:20170925-092119382
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170925-092119382
Official Citation:P. Balister, B. Bollobás, A. Anandkumar and A. Willsky, "Energy-latency tradeoff for in-network function computation in random networks," 2011 Proceedings IEEE INFOCOM, Shanghai, 2011, pp. 1575-1583. doi: 10.1109/INFCOM.2011.5934949 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5934949&isnumber=5934870
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:81800
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:25 Sep 2017 16:56
Last Modified:03 Oct 2019 18:47

Repository Staff Only: item control page