• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >On the Capacity of Ad Hoc Networks Under Random Packet Losses
【24h】

On the Capacity of Ad Hoc Networks Under Random Packet Losses

机译：随机丢包情况下自组织网络的容量

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the problem of determining asymptotic bounds on the capacity of a random ad hoc network. Previous approaches assumed a link layer model in which if a transmitter-receiver pair can communicate with each other, i.e., the signal to interference and noise ratio (SINR) is above a certain threshold, then the transmitted packet is received error-free by the receiver thereby. Using this model, the per node capacity of the network was shown to be $Theta left ( {{ 1}over { sqrt {nlog {n}}}}right )$. In reality, for any finite link SINR, there is a nonzero probability of erroneous reception of the packet. We show that in a large network, as the packet travels an asymptotically large number of hops from source to destination, the cumulative impact of packet losses over intermediate links results in a per-node throughput of only $Oleft ( {{ 1}over { n}}right )$ under the previously proposed routing and scheduling strategy. We then propose a new scheduling scheme to counter this effect. The proposed scheme provides tight guarantees on end-to-end packet loss probability, and improves the per-node throughput to $Omega left ( {{ 1}over { sqrt {n} left ({log {n}}right )^{{ alpha {+2}}over { 2(alpha -2)}}}}right )$ where $alpha >2$ is the path loss exponent.
机译：我们考虑确定随机ad hoc网络容量的渐近边界的问题。先前的方法假设采用链路层模型，其中如果一个收发器对可以相互通信，即信噪比（SINR）高于某个阈值，则传输的数据包将被无误接收。从而接收。使用此模型，网络的每个节点容量显示为$ Theta左（{{1}上{sqrt {nlog {n}}}}右）$。实际上，对于任何有限链路SINR，都有错误接收分组的可能性为非零。我们显示出，在大型网络中，随着数据包从源到目的地的渐近跳数，中间链路上数据包丢失的累积影响导致每个节点的吞吐量仅为$ Oleft（{{1} n}} right）$在先前提出的路由和调度策略下。然后，我们提出了一种新的调度方案来应对这种影响。所提出的方案为端到端分组丢失概率提供了严格的保证，并将每个节点的吞吐量提高到$ Omega左（{{1}超过{sqrt {n}左（{log {n}} right）^^ {alpha {+2}}在{2（alpha -2）}}}}右）$上，其中$ alpha> 2 $是路径损耗指数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号