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

A Congestion Fairness Control Scheme Based on Joint Entropy in WSNs

作　　者：唐文胜[1] 罗娟[2] 彭宇行[1] 王威[2] 

机构地区：[1]并行与分布处理国家重点实验室,湖南长沙410073 [2]湖南师范大学计算机部,湖南长沙410081

出　　处：《计算机工程与科学》2008年第8期53-56,共4页Computer Engineering & Science

基　　金：湖南省自然科学基金资助项目(07JJ3129);湖南省青年骨干教师培养基金资助项目;湖南省教育厅项目(06C521)

摘　　要：本文分析了传统公平性定义在无线传感器网络拥塞控制中的不足,引入联合信息熵的概念,提出了基于联合信息熵的公平性定义和拥塞缓解机制。当节点发生拥塞时,节点按上游节点联合信息熵值的大小计算权重,按权值用令牌桶算法限制上游节点流量,分配带宽。仿真实验表明,本文提出的算法在公平性控制上优于目前算法,减少了丢包率,降低了能耗。According to the characteristics of WSNs,we introduce a new definition of fairness and a congestion fairness control scheme based on joint entropy. The 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 efficiency 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.

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]