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

Full description

Bibliographic Details

Published in:	2011 Proceedings IEEE INFOCOM pp. 1575 - 1583
Main Authors:	Balister, P., Bollobas, B., Anandkumar, A., Willsky, A.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.04.2011
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!