共查询到17条相似文献,搜索用时 125 毫秒
1.
针对无线传感器网络路由安全与可靠性的问题,提出了一种基于组合指标的安全路由算法.评估节点通过观测被评估节点的数据包转发行为,计算直接信任值,然后与第三节点推荐的信任值进行加权求和,得到一个综合信任值.为了提高信任的准确性,避免出现合谋攻击,对第三方推荐的信任值进行了信任相似度检测.通过对期望传输次数和信任值进行加权组合,形成一个用于选择下一跳节点的组合路由指标.最后,对所提出的算法进行了仿真验证.结果表明,所提出的算法能够有效地避免恶意节点的攻击,在传递率和总的传输次数方面明显优于其他算法. 相似文献
2.
认知无线电网络中基于信任的安全路由模型 总被引:1,自引:0,他引:1
针对认知无线电网络中路由受到的选择性转发攻击,提出一种基于信任的安全路由模型。通过监视节点的数据转发行为,构建节点的信任以识别恶意节点。基于路由选择必须同频谱分配紧密结合的特点,在路由发现阶段,请求信息中封装节点的可用频谱机会并避免发送给恶意节点。在路由选择阶段,利用节点信任构建可用路径信任,结合延时度量进行路由决定。同时,根据节点的信任划分对其服务请求采取不同的响应,对非可信节点的恶意行为采取更严厉的惩罚,从而激励节点在路由中的合作。仿真结果及分析表明,在选择性转发攻击下,该模型较已有模型在网络吞吐率、端到端延迟方面都有较好的表现。 相似文献
3.
4.
5.
ad hoc网络中一种基于信任模型的机会路由算法 总被引:2,自引:0,他引:2
由于ad hoc网络具有缺乏足够的物理保护、拓扑结构动态变化、采用分布式协作、节点的带宽和计算能力有限等特点,导致传统的路由安全机制不再适合ad hoc网络路由协议的设计。最近当前研究热点之一的机会路由能够在链路不可靠的情况下充分利用无线广播和空间多样性的特性提高网络的吞吐量。因此,考虑在机会路由中引入信任相似性概念设计信任机会路由,建立了基于节点信任度和最小成本的信任机会转发模型,提出了最小成本的机会路由算法MCOR,并对算法进行了理论上的分析和证明。最后采用仿真实验对该算法进行验证,又与经典机会路由协议ExOR以及其他经典的信任路由协议TAODV和Watchdog-DSR进行性能对比。仿真结果表明,MCOR算法能够防范恶意节点的攻击,在吞吐量、端到端时延、期望转发次数(ETX)和成本开销等方面都比其他3种协议表现出性能上的优势。 相似文献
6.
路由策略与策略路由的具体应用 总被引:2,自引:0,他引:2
杨锋 《信息技术与信息化》2007,(2):23-28
路由策略是路由发布和接收的策略,是使用某些策略改变规则,影响路由发布,接收或者路由选择的参教而改变路由发现的结果。策略路由技术是对传统路由技术的扩展和改进,基于策略的路由比传统路由使用更灵活,不仅能够根据目的地址,而且能够根据报文大小、应用或IP源地址来选择转发路径。 相似文献
7.
8.
9.
针对现有基于信誉的信任模型在刻画节点推荐可信度、推荐信任路径搜索及合成算法方面存在的问题,提出基于时间衰减因子、推荐吻合度因子及交互成功率因子的推荐可信度更新算法,进而给出一种新的分布式环境下推荐信任路径选择性搜索算法,该算法以邻居节点间推荐可信度、评分相似度、路径长度等作为控制条件,能直接在搜索过程中规避恶意节点,选择包含有效推荐信息的路径进行搜索并停止对冗余路径的搜索。最后采用一种改进的D-S证据理论合成算法对搜索得到的信任路径进行聚合。仿真实验表明,与已有模型相比,所提模型具有较强的抵制各种恶意节点攻击的能力。 相似文献
10.
11.
This paper presents a novel trust model based on multiple decision factor theory (MDFT) and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first (OSPF) protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm. 相似文献
12.
For the energy limited wireless sensor networks, the critical problem is how to achieve the energy efficiency. Many attackers
can consume the limited network energy, by the method of capturing some legal nodes then control them to start DoS and flooding
attack, which is difficult to be detected by only the classic cryptography based techniques with common routing protocols
in wireless sensor networks (WSNs). We argue that under the condition of attacking, existing routing schemes are low energy-efficient
and vulnerable to inside attack due to their deterministic nature. To avoid the energy consumption caused by the inside attack
initiated by the malicious nodes, this paper proposes a novel energy efficiency routing with node compromised resistance (EENC)
based on Ant Colony Optimization. Under our design, each node computes the trust value of its 1-hop neighbors based on their
multiple behavior attributes evaluation and builds a trust management by the trust value. By this way, sensor nodes act as
router to achieve dynamic and adaptive routing, where the node can select much energy efficiency and faithful forwarding node
from its neighbors according to their remaining energy and trust values in the next process of data collection. Simulation
results indicate that the established routing can bypass most compromised nodes in the transmission path and EENC has high
performance in energy efficiency, which can prolong the network lifetime. 相似文献
13.
A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol. 相似文献
14.
15.
提出了一种综合考虑链路安全、链路冲突、链路可靠度与链路可用带宽的路由判据SIEB。SIEB包括链路安全和链路性能2个方面,在SIEB的链路安全权值计算中,为了抵御各种洞攻击,提出了基于两跳邻居反馈的链路信任值计算方法。在此基础上,提出了链路安全权值计算算法LSWC和链路性能权值计算算法LSPC,提出了分布式满足QoS约束的路由协议SIEBP,SIEBP的目标是:构造安全的路由路径,并且最大化网络吞吐量。仿真结果表明,SIEBP能达到预定目标,构造的路径能抵御黑洞、灰洞、虫洞等攻击,并且获得了较高的网络吞吐量。 相似文献
16.
17.
H. C. Leligou P. Trakadas S. Maniatis P. Karkazis T. Zahariadis 《Wireless Communications and Mobile Computing》2012,12(12):1091-1103
As the applications of wireless sensor networks proliferate, the efficiency in supporting large sensor networks and offering security guarantees becomes an important requirement in the design of the relevant networking protocols. Geographical routing has been proven to efficiently cope with large network dimensions while trust management schemes have been shown to assist in defending against routing attacks. Once trust information is available for all network nodes, the routing decisions can take it into account, i.e. routing can be based on both location and trust attributes. In this paper, we investigate different ways to incorporate trust in location‐based routing schemes and we propose a novel way of balancing trust and location information. Computer simulations show that the proposed routing rule exhibits excellent performance in terms of delivery ratio, latency time and path optimality. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献