未知AdHoc网络中能量有效的随机通信
Energy Efficient Randomized Communication in Unknown AdHoc Networks
摘要:
本文研究了随机和一般AdHoc网络中的广播和闲聊算法。我们的目标不仅是最小化广播和闲聊时间,而且还最小化能量消耗,这是根据发送的消息(或传输)的总数来衡量的。我们假设网络的节点不知道网络,并且它们只能以固定的功率发送,这意味着它们不能调整其消息覆盖的区域大小。我们认为,在这种情况下,传输次数是衡量整体能耗的一个非常好的指标。对于随机网络,我们提出了一个广播算法,每个节点发送最多一次。我们表明,我们的算法广播在$O(\log n)$步骤,w.h.p,其中$n$是节点的数量。然后,我们提出了一个$O(d \log n)$($d$是预期的程度)八卦算法使用每个节点的$O(\log n)$消息。对于一般的网络与已知的直径$D$,我们提出了一个随机广播算法与最佳的广播时间$O(D \log (n/D) + \log^2 n)$,使用预期数量的$O(\log^2 n / \log (n/D))$传输每个节点。我们还展示了广播时间和传输次数之间的折衷结果:我们构建了一个网络,使得任何使用时不变分布的不经意算法都需要每个节点的$Ω(\log^2 n / \log (n/D))$消息,以便在最佳时间完成广播。这证明了我们的上界的紧性。我们还表明,没有不经意的算法可以完成广播w.h.p.使用$o(\log n)$消息每个节点。
英文摘要:
This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks. Our goal is not only to minimise the broadcasting and gossiping time, but also to minimise the energy consumption, which is measured in terms of the total number of messages (or transmissions) sent. We assume that the nodes of the network do not know the network, and that they can only send with a fixed power, meaning they can not adjust the areas sizes that their messages cover. We believe that under these circumstances the number of transmissions is a very good measure for the overall energy consumption. For random networks, we present a broadcasting algorithm where every node transmits at most once. We show that our algorithm broadcasts in $O(\log n)$ steps, w.h.p, where $n$ is the number of nodes. We then present a $O(d \log n)$ ($d$ is the expected degree) gossiping algorithm using $O(\log n)$ messages per node. For general networks with known diameter $D$, we present a randomised broadcasting algorithm with optimal broadcasting time $O(D \log (n/D) + \log^2 n)$ that uses an expected number of $O(\log^2 n / \log (n/D))$ transmissions per node. We also show a tradeoff result between the broadcasting time and the number of transmissions: we construct a network such that any oblivious algorithmusing a time-invariant distribution requires $Ω(\log^2 n / \log (n/D))$ messages per node in order to finish broadcasting in optimal time. This demonstrates the tightness of our upper bound. We also show that no oblivious algorithm can complete broadcasting w.h.p. using $o(\log n)$ messages per node.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。