• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Wireless personal communications: An Internaional Journal >A Cooperative Routing for MANET Based on Distributed Trust and Energy Management
【24h】

A Cooperative Routing for MANET Based on Distributed Trust and Energy Management

机译：基于分布式信任和能量管理的移动自组网协同路由

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A mobile ad-hoc network is an autonomous system having collection of mobile nodes connected by wireless links. Mobile nodes in a MANET communicate with each other based on unconditional cooperation and inherited trustworthiness. MANET is vulnerable due to the characteristics such as dynamic topology and openness. This leads to the exploitation of MANET by performing various kinds of attacks by the presence of malicious and (or) selfish nodes. Such nodes affect the normal routing process in a MANET thereby impacting the routing performances such as packet delivery ratio. Hence, the necessity of trust factor between communication nodes is substantiated. In this paper the proposed solution identifies the malicious and selfish behaviour of nodes by dynamic calculation of trust and energy values of the nodes in the topology. The proposed algorithm, Trust and Energy based Ad hoc On Demand Distance Vector improves the traditional AODV algorithm by the dynamic incorporation of trust and energy values for each node in the topology in order to achieve cooperative routing. In Trust and Energy based Ad hoc On Demand Distance Vector, the source node selects the cooperative path rather than the shortest path thereby isolating the malicious and selfish nodes. Finally, the simulation results show that the proposed Trust and Energy based Ad hoc On Demand Distance Vector routing algorithm isolate the malicious and selfish nodes, and substantially improves the routing performance such as packet delivery ratio and average end to end latency.
机译：移动自组织网络是具有通过无线链路连接的移动节点的集合的自治系统。 MANET中的移动节点基于无条件合作和继承的可信赖性相互通信。由于动态拓扑和开放性等特性，MANET容易受到攻击。通过存在恶意和（或）自私的节点来执行各种攻击，从而导致对MANET的利用。这样的节点会影响MANET中的正常路由过程，从而影响路由性能，例如数据包传递率。因此，证实了通信节点之间的信任因子的必要性。本文提出的解决方案通过动态计算拓扑中节点的信任度和能量值来识别节点的恶意和自私行为。所提出的算法，即基于信任和能量的临时按需距离矢量，通过动态合并拓扑中每个节点的信任和能量值来改进传统的AODV算法，以实现协作路由。在基于信任和能量的临时按需距离向量中，源节点选择协作路径而不是最短路径，从而隔离了恶意和自私的节点。最后，仿真结果表明，所提出的基于信任和能量的Ad hoc按需距离矢量路由算法可以隔离恶意节点和自私节点，并显着提高了路由性能，例如数据包传递率和平均端到端延迟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号