首页> 外文期刊>Computer and Information Science >Traffic Priority Based Adaptive and Responsive Congestion and Rate Control for Wireless Mesh Networks
【24h】

Traffic Priority Based Adaptive and Responsive Congestion and Rate Control for Wireless Mesh Networks

机译:无线网状网络中基于流量优先级的自适应响应拥塞和速率控制

获取原文
           

摘要

Congestion Control in Wireless Mesh Networks (WMNs) has been a widely studied context oriented utilization maximization problem. The traffic in WMNs has a wide range of variations (i.e. bandwidth, jitter, delay jitter sensitive applications) due to its use as the backbone network for accessing Internet. Eventually, traffic variation contributes to channel saturation and may bring up congestion due to contention caused by concurrent transmission, buffer overflows and time varying wireless channel condition. In this paper, we propose a distributed congestion control scheme for wireless mesh networks to ensure higher network throughput while avoiding congestion and maintaining inter-flow fairness where real time and non-real time traffic coexists. Our proposed technique handles congestion by restricting the available transmission rate of downstream nodes among the upstream nodes according to their flow demands based on three basic parameters: packet arrival rate, service rate and buffer occupancy. We also introduce prioritized queues in each node to treat real time and non-real time traffic differently. Therefore, congestion degree calculation, rate allocation and prioritizing traffic ensures higher network throughput and guaranteed delivery of real time traffic. Experiments conducted on ns-2 simulations demonstrate that our proposed algorithm can achieve significant improvements in both overall network throughput and inter-flow fairness for both non real time and delay bound traffic.
机译:无线网状网络(WMN)中的拥塞控制已被广泛研究为面向上下文的利用率最大化问题。由于WMN用作访问Internet的骨干网,因此其流量具有很大的变化范围(即带宽,抖动,对延迟抖动敏感的应用程序)。最终,流量变化会导致信道饱和,并可能由于并发传输,缓冲区溢出和时变无线信道条件引起的争用而引起拥塞。在本文中,我们提出了一种用于无线网状网络的分布式拥塞控制方案,以确保更高的网络吞吐量,同时避免拥塞并保持实时和非实时流量共存的流间公平性。我们提出的技术通过基于三个基本参数:数据包到达速率,服务速率和缓冲区占用率,根据上游节点的流量需求限制下游节点之间的可用传输速率,来处理拥塞。我们还将在每个节点中引入优先队列,以区别对待实时流量和非实时流量。因此,拥塞度计算,速率分配和流量优先级可确保更高的网络吞吐量并保证实时流量的传递。在ns-2仿真上进行的实验表明,对于非实时流量和延迟绑定流量,我们提出的算法可以在整体网络吞吐量和流间公平性方面实现显着提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号