arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.0858cs.NImath.CO
收藏

随机网络中网内函数计算的能量-延迟权衡

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

Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan Willsky

摘要:

考虑了在延迟约束条件下,以最小能量消耗设计网络内函数计算策略的问题。分析了随机网络中节点均匀分布在增长区域且节点数趋于无穷大时,在时延约束下的能量消耗的标度行为.首先考虑和函数计算及其传递到指定根结点的特殊情况。提出了一种在给定时延约束条件下实现随机网络中平均能量消耗阶数最优的策略。最优能量消耗的缩放行为取决于无线传输的路径损耗指数和节点所在的欧几里得区域的维数。然后,该策略扩展到计算的一般类的功能分解,根据最大集团的邻近图,如$k$ -最近邻图或几何随机图。修改后的策略实现了订单最优的能源消耗,虽然有限的范围内的延迟约束。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑