检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谭冕 戴昊峰[1] 张晖[1] 宋波[1] TAN Mian, DAI Hao-feng, ZHANG Hui, SONG Bo (Chongqing Communication Institute, Chongqing 400035, China}
机构地区:[1]重庆通信学院,重庆400035
出 处:《电脑知识与技术》2014年第10期6622-6626,共5页Computer Knowledge and Technology
基 金:基金项目:科学基金资助项目(No.cstc2012jjA40033)
摘 要:在ad hoc网络中,节点间的合作是一个重要的问题,不相邻节点的信息传递只能依靠中间节点的转发来完成,若中间节点存在自私行为则会较大地影响网络的性能。节点自私类型有不同,对网络功能造成的影响也各不一样,有些自私节点在一定数量上对网络整体性能影响不大,可以容忍;而有些自私节点则必须得采取强硬的惩戒措施,将其驱逐出网络或降低它的信誉值并公布。该文采用基于信誉值的算法检测出ad hoc网络中的问题节点,并对其进行类型定义,仿真查看其对网络性能的影响,方便下一步根据不同自私节点进行机制设计。In the ad hoc network, the cooperation between nodes is an issue of crucial importance, and the information transfer of non-adjacent nodes only depends on forwarding in terms of intermediate nodes. However, the performance of network would be largely influenced if the intermediate nodes have selfish act. The types of selfish nodes are different, which cause diverse effect on the function of network. Some of them, which just create little influence on the overall network performance, can be overlooked; while the others, which cause huge effects on them, should be evicted out of network or reduced reputation and publish them by tough punitive actions. This paper is not only trying to detect the problematic nodes by the algorithm of reputa-tion, but also define the types of the problematic nodes and detect their influences on performance of network in a simulate way, which is easy to mechanism design basing on different types of selfish nodes.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.223.25