检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《小型微型计算机系统》2011年第7期1249-1254,共6页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(60633020)资助
摘 要:由于Ad hoc网络具有缺乏足够的物理保护、拓扑结构动态变化、采用分布式协作、节点的带宽和计算能力有限等特点,导致传统的路由安全机制不再适合Ad hoc网络路由协议的设计.同时,满足QoS需求的路由协议研究也是当前的研究热点之一.因此,本文引入非密码学方式中的信任模型,结合QoS的要求,提出一种既满足QoS时延最小又保证节点可信度尽可能高的新路由判据,采用分布式启发式算法TRQ来建立路由,并对该算法进行理论的可行性分析,最后采用仿真实验对TRQ算法进行了验证,又与经典的QAODV协议进行性能对比.总之,TRQ算法对网络的实时性QoS要求和安全都提供了保证.Due to the absence of enough physical protection, dynamic topology, distributed collaboration, the limited bandwidth and computing ability in Ad hoc networks, traditional routing security mechanism can't adapt to the design of routing protocols. Meanwhile, recently, satisfying QoS demand of routing protocol is one of the research hotspots. So, integrated the demand of QoS, the paper introduces a trust model from non-cryptography means, proposes a new routing metric that meets the minimum of total delay on each wireless link and higher degree of trust of each node on a route, utilizes the distributed heuristic algorithm of TRQ to establish a route and analyzes the feasibility from the theory of TRQ point of view. Finally, TRQ algorithm is verified by simulation using NS2 and compared the performance with the classic routing about QAODV. In conclusion,TRQ algorithm can assure the QoS need in real time aspect and security.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.252.203