Energy-Latency Tradeoff for In-Network Function Computation in Random Networks

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

A shorter version appears in Proc. of IEEE INFOCOM 2011

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Energy-Latency Tradeoff for In-Network Function Computation in Random Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Energy-Latency Tradeoff for In-Network Function Computation in Random Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Energy-Latency Tradeoff for In-Network Function Computation in Random Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-265915

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.