检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭建立[1] 吴智博[1] 刘宏伟[1] 董剑[1] 杨孝宗[1]
机构地区:[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001
出 处:《高技术通讯》2009年第9期901-906,共6页Chinese High Technology Letters
基 金:863计划(2006AA01A103);国家自然科学基金(60503015)资助项目。
摘 要:针对移动自组网中自私节点的不合作问题,提出了用于检测并隔离网络中的不合作节点,减小它们对网络性能影响的OIECE方法。OIECE方法工作时,节点周期地向邻居广播自己的检测结果,使得邻居节点能够快速发现周围的不合作节点,对它们进行有效的隔离;在路由发现过程中,源节点和目的节点之间的所有节点,都对经过的路由请求消息和路由应答消息进行过滤,丢弃那些含有不合作节点的路由,有效减小了不合作节点对网络的危害;当节点发送数据时,优先选择含有可信节点的路由,提高了数据发送的成功率。仿真结果显示,当网络中存在不合作节点时,OIECE方法能够显著提高合作节点的吞吐率,同时还能够对不合作节点进行有效的惩罚,降低它们的吞吐率。To cope with the selfish nodes in mobile ad hoc networks (MANETs), the paper proposes a new cooperation enforcement scheme, called the OIECE, to quickly detect and isolate the non-cooperation nodes, decreasing their effect on the networks' performance. In OIECE, each node broadcasts its detecting result to neighbors periodically, making its neighbors find the non-cooperative nodes around it quickly and isolate them from the networks. In the route discovery phase, all the nodes between the source node and the destination node filter the route requests and the route replies, suppressing the routes containing non-cooperative nodes. In the forwarding phase, the source node gives priority to the routes include trust nodes, making the packets more possibly arrive at the destination node. The simulation results show that OIECE can highly improve the throughput of cooperative nodes and severely punish the non-cooperative nodes.
关 键 词:移动自组网(MANETs) 节点合作 一跳信息 看门狗 信誉
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222