• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2008, Vol. 30 ›› Issue (8): 53-56.

• 论文 • 上一篇    下一篇

WSN中一种基于联合信息熵的拥塞公平性控制算法

唐文胜[1,2] 罗娟[2] 彭宇行[1] 王威[2]   

  • 出版日期:2008-08-01 发布日期:2010-05-19

  • Online:2008-08-01 Published:2010-05-19

摘要:

本文分析了传统公平性定义在无线传感器网络拥塞控制中的不足,引入联合信息熵的概念,提出了基于联合信息熵的公平性定义和拥塞缓解机制。当节点发生拥塞时,节点按上游节点联合信息熵值的大小计算权重,按权值用令牌桶算法限制上游节点流量,分配带宽。仿真实验表明,本文提出的算法在公平性控制上优于目前算法,减少了丢包率 ,降低了能耗。

关键词: 传感器网络 拥塞缓解 信息熵 联合信息熵 公平性

Abstract:

According to the characteristics of WSNs,we introduce a new definition of fairness and a congestion fairness control scheme based on joint entropy. Th e scheme distributes bandwidth in proportion to the value of joint entropy to alleviate node congestion. And the actual rate of the upstream nodes will  be bounded by the algorithm of token-bucket. Extensive simulations demonstrate the scheme can reduce the number of dropped packets,improve energy effici ency and make sure that the number of received data packets is in proportion to the number of useful data which are contained in the data packets.

Key words: sensor network, congestion alleviation, entropy;joint entropy, fairness