检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:乐光学[1,2] 骆丹[1,2] 刘建生[2] 李明明[1,2]
机构地区:[1]嘉兴学院数理与信息工程学院,嘉兴314001 [2]江西理工大学理学院,赣州341000
出 处:《电信科学》2014年第5期65-74,共10页Telecommunications Science
基 金:浙江省自然科学基金资助项目(No.LY12F02019);浙江省公益技术应用研究项目(No.2011C23130);浙江省嘉兴市科技计划基金资助项目(No.2012AY1027)
摘 要:搭便车是网络普遍存在的问题,搭便车节点的规模直接影响无线mesh网络的性能。通过分析无线mesh网络中节点的搭便车行为特征,提出了基于分等级奖罚的抑制策略。首先判定网络是否会造成拥塞,当网络发生拥塞时,依据节点的贡献值优先满足贡献值高的节点,使搭便车节点受到抑制。验证结果表明,该方法能有效抑制节点的搭便车行为,提高网络的服务性能。A large amounts of surveys results show that free riding is a common phenomenon in today's network. Because of wireless mesh networks with limited bandwidth, a large number of free riders lead to network congestion so that will impact the performance of network. A strategy to overcome free riders in wireless mesh network was presented. Firstly, to determine whether could cause congestion as the premise, by trust mechanism based on game and reward and punishment mechanism in grades, made the overload nodes priority to meet the contribution value higher nodes. Free riders in the wireless mesh network were suppressed by this way, and the method was verified by simulation.
关 键 词:无线MESH网络 搭便车 网络拥塞 信任机制 奖罚机制
分 类 号:TN915.04[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117