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

Celý popis

Podrobná bibliografia

Vydané v:	2011 Proceedings IEEE INFOCOM s. 1575 - 1583
Hlavní autori:	Balister, P., Bollobas, B., Anandkumar, A., Willsky, A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.04.2011
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!