文章引用说明 更多>> (返回到该文章)

Tassiulas, L. and Sarkar, S. (2002) Max-min fair scheduling in wireless networks. INFOCOM 2002. 21st Annual Joint Conferences of the IEEE Computer and Communications Societies, 763-772.

被以下文章引用:

  • 标题: 基于自适应速率限制的拥塞控制算法研究A Research Based on Adaptive Rate Limiting Congestion Control Algorithm

    作者: 张品, 高大冬, 王春霞, 张洪峰

    关键字: 无线传感器网络, 拥塞控制, 松弛技术, 最大–最小公平性Wireless Sensor Network, Congestion Control, Relaxation Technology, Max-Min Fairness

    期刊名称: 《Hans Journal of Wireless Communications》, Vol.5 No.1, 2015-02-10

    摘要: 由于无线传感器网络(WSN)中传感节点的局限性,网络数据流在节点处聚集易引起网络拥塞,造成大量数据包的丢失,从而降低网络的服务质量。如何限制网络数据流的传输速率,对拥塞进行控制一直是无线传感器网络的研究热点之一。为解决无线传感器网络中的拥塞问题,本文结合松弛技术的速率限制方式和最大–最小公平性的资源共享分配方式,提出一种基于自适应速率限制的拥塞控制算法(ARLCC)。仿真实验表明,ARLCC方案不仅能有效缓解拥塞,还保证了数据包传输的可靠性和公平性。Due to the limit of sensor node in Wireless Sensor Network (WSN), the network will lead to con-gestion when a lot of data streams aggregate in a node. This situation will result in the loss of large amounts of data packets and the deterioration of Quality-of-Service. It has been a hot topic to limit the rate of data traffic and avoid possible congestion in the WSN. By integrating the rate limiting method of the relaxation technology (RT) and the equitable distribution method of max-min fair (MMF) resource sharing, this paper proposes a novel adaptive rate limiting congestion control (ARLCC) algorithm to solve the congestion in WSN. The experiments show that ARLCC scheme can alleviate the network congestion and ensure the fairness and reliability of data transmission.

在线客服:
对外合作:
联系方式:400-6379-560
投诉建议:feedback@hanspub.org
客服号

人工客服,优惠资讯,稿件咨询
公众号

科技前沿与学术知识分享