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

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 gr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2011 Proceedings IEEE INFOCOM S. 1575 - 1583
Hauptverfasser: Balister, P., Bollobas, B., Anandkumar, A., Willsky, A.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.04.2011
Schlagworte:
Computational modeling
Context
Electronic mail
Energy consumption
Euclidean random graphs
Function computation
latency-energy tradeoff
Markov processes
minimum broadcast problem
Routing
Wireless sensor networks
ISBN:1424499194, 9781424499199
ISSN:0743-166X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISBN:1424499194
9781424499199
ISSN:0743-166X
DOI:10.1109/INFCOM.2011.5934949