• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Telecommunication Networks and Applications Conference >Can observed entropy detect congestion in Ad-Hoc networks?
【24h】

Can observed entropy detect congestion in Ad-Hoc networks?

机译：观察到的熵可以检测Ad-Hoc网络中的拥塞吗？

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Congestion presents a significant challenge in ad hoc networks due to their unstructured and distributed nature. In most congestion detection schemes for such networks, the affected node itself detects whether it is congested or not. The detection approach proposed in this paper performs detection with information estimators from neighbouring uncongested nodes that may be able to relieve the congestion. The type of information estimator studied here is the entropy of the difference between subsequent sequence numbers of TCP packets sent to or via the node under congestion monitoring. Using the hidden node problem as background, this paper argues that entropy estimates are as sensitive to congestion as the observed retransmission rate, but easier to compute.
机译：由于ad hoc网络的非结构化和分布式性质，因此拥塞提出了严峻的挑战。在此类网络的大多数拥塞检测方案中，受影响的节点本身会检测其是否拥塞。本文提出的检测方法使用来自相邻未拥塞节点的信息估计器执行检测，这些信息估计器可能能够缓解拥塞。此处研究的信息估计器的类型是在拥塞监控下发送到节点或通过节点的TCP数据包的后续序列号之间的差值的熵。本文以隐藏节点问题为背景，认为熵估计对拥塞的敏感度与观察到的重传率一样，但更易于计算。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号