基于信誉值的ad hoc网络节点自私类型检测

在ad hoc网络中,节点间的合作是一个重要的问题,不相邻节点的信息传递只能依靠中间节点的转发来完成,若中间节点存在自私行为则会较大地影响网络的性能。节点自私类型有不同,对网络功能造成的影响也各不一样,有些自私节点在一定数量上对网络整体性能影响不大,可以容忍;而有些自私节点则必须得采取强硬的惩戒措施,将其驱逐出网络或降低它的信誉值并公布。该文采用基于信誉值的算法检测出ad hoc网络中的问题节点,并对其进行类型定义,仿真查看其对网络性能的影响,方便下一步根据不同自私节点进行机制设计。     

移动Ad Hoc网络中自私节点的监测方法

移动ad hoc网络是一种特殊的对等式无线网络,具有无需基础设施支持、自组织、可快速展开、可移动等特点,其应用正逐渐受到人们的重视.由于移动ad hoc网络中节点既是主机又是路由器,所以容易遭受基于路由信息的攻击.在分析针对路由信息攻击方法的基础上,提出基于上下文感知的自私节点监测方法,并给出自私节点的量化判定方法.     

移动Adhoc网络基于信誉系统的节点协作方案

在移动Ad hoc网络（MANET）中,节点的远距离通信需要中间节点的协作,中间节点通过转发数据包将信息传递给目的节点。但是,自私节点为了节省资源（如电池电量,带宽）将不属于自己的数据包丢弃。如果没有合理的机制处理自私节点,正常的节点将会过载,从而使整个网络的性能退化。提出在Adhoc网络中针对自私节点促使其转发数据包的一种分布式协作方案。方案采用信誉和货币机制相结合的策略达到减少自私节点、改善网络环境的目的。理论分析和仿真结果表明,该方案比传统的方法更快更准确地检测到自私节点,提高合作节点,减少自私节点的吞吐量。     

移动Ad hoc网络基于信誉系统的节点协作方案

在移动Ad hoc网络（MANET）中,节点的远距离通信需要中间节点的协作,中间节点通过转发数据包将信息传递给目的节点。但是,自私节点为了节省资源（如电池电量,带宽）将不属于自己的数据包丢弃。如果没有合理的机制处理自私节点,正常的节点将会过载,从而使整个网络的性能退化。提出在Adhoc网络中针对自私节点促使其转发数据包的一种分布式协作方案。方案采用信誉和货币机制相结合的策略达到减少自私节点、改善网络环境的目的。理论分析和仿真结果表明,该方案比传统的方法更快更准确地检测到自私节点,提高合作节点,减少自私节点的吞吐量。     

移动Ad hoc网络中基于控制域的网络管理及拓扑生成

结合实际的移动ad hoc网络管理研究,钟对以往ad hoc网络管理体系缺乏可扩展性的问题,同时考虑网络中节点的能力差异性,引入了动态的网络管理控制域并定义了管理控制域的生成与合并过程,在此基础上提出了一种动态分布式的ad hoc网络管理体系,并利用管理控制域的生成过程实现了ad hoc网络中的拓扑管理。仿真结果表明,网络中的管理控制域生成算法能够适应网络节点移动性的特点,具有可靠的控制域划分能力。在此基础上的ad hoc网络拓扑生成具有较好的准确性和可靠性。     

一个用于Ad Hoc网络的分簇方法

该文提出了一种ad hoc网络的分簇方法,通过相关性来计算节点的相关度值,利用D—tree算法来对随机分布的移动节点分簇,实现ad hoc网络的层次结构的划分;并对算法进行了分析和模拟计算,得到了ad hoc网络主要技术参数之间的关系．     

灵活移动的网络——Ad Hoc网络

Ad hoc网络是一种自组织,自适应和自管理的网络,由于其组网的快速灵活性,节点的分布性,不需要基础设施等优点,在工业、商业、医疗、家庭、办公环境、军事等领域有着不可替代的作用。本文首先介绍了ad hoc网络及其特点,然后说明了ad hoc网络的一些典型应用。最后对ad hoc网络的发展提出了建议。     

移动ad hoc网络中DOS攻击及其防御机制

移动ad hoc网络由于其动态拓扑、无线信道以及各种资源有限的特点,特别容易遭受拒绝服务(DOS)攻击．提出了移动ad hoc网络中一种新的DOS攻击模型——ad hoc flooding攻击及其防御策略．该攻击主要针对移动ad hoc网络中的按需路由协议,如AODV,DSR等．ad hoc flooding攻击是通过在网络中泛洪发送超量路由查询报文及数据报文,大量地占用网络通信及节点资源,以至于阻塞节点正常的通信．分析ad hoc flooding攻击之后,提出了两种防御策略：其一是邻居阻止,即当入侵者发送大量路由查询报文时,邻居节点降低对其报文的处理优先级,直至不再接收其报文．其二是路径删除,即目标节点将入侵者发送攻击报文的路径删除,以阻止其继续发送攻击报文．模拟实验证实,通过这两种方法的结合．能够有效地阻止网络中的ad hoc flooding攻击行为．     

移动ad hoc网络的入侵响应模型

移动ad hoc网络由于动态拓扑、无线信道等特点,使得其在所有层次上都存在脆弱的安全问题.本文提出了一种基于移动agent的入侵响应模型,该模型结合了移动ad hoc网络和移动agent的移动性和自主性,采用监视agent,决策agent和阻击agent三种agent对移动ad hoc网络中的节点行为进行监视,并根据节点行为判断是否入侵,一旦发现入侵者就将其包围并阻断与其相关的报文,以达到隔离直至消灭入侵者的目的.最后,提出了下一步的研究方向.     

灵活移动的网络——Ad Hoc网络

Ad hoc网络是一种自组织，自适应和自管理的网络，由于其组网的快速灵活性，节点的分布性，不需要基础设施等优点，在工业、商业、医疗、家庭、办公环境、军事等领域有着不可替代的作用。本文首先介绍了ad hoc网络及其特点，然后说明了ad hoc网络的一些典型应用。最后对ad hoc网络的发展提出了建议。     

移动自组织网络中内部丢包的检测模型

无线移动自组织网络中数据的传输是基于中间节点的合作转发的,但由于内部自私节点为了节省带宽和电量或者网络受到恶意节点的攻击,导致丢包行为发生,网络性能严重降低。基于无线自组织网络常用的路由协议AODV,提出了一种新的针对内部丢包攻击的检测模型。该检测模型引入旁信道概念,旁信道节点和看门狗共同检测并记录节点转发报文行为,采用邻居信息表存放检测结果,当相应节点的记录值达到一定下限时就被隔离出网络。由于旁信道可以发送警报报文,该模型能够同时检测到自私节点或合作攻击节点引起的内部丢包攻击。     

无线传感器网络入侵检测的重复博弈建模研究

通过分析无线传感器网络节点影响网络可用性及其整体性能的自私行为,提出了一种无线传感器网络入侵检测的重复博弈模型,集中于检测和响应传感器节点的自私行为以加强网络节点的协作性能,利用节点与其邻居节点进行的重复博弈过程,广播节点的效用变化,即时检测出网络节点的自私行为。通过对网络节点的自私行为引入惩戒机制,从而大大降低了节点背离协作的可能性。仿真结果表明,对节点的自私行为实施惩戒机制,可以大大增强节点间相互协作,从而保证网络的连通性。     

Efficient, Secure, Dynamic Source Routing for Ad-hoc Networks

Routing is a must for networks that do not have a fixed point-to-point infrastructure, such as in an ad hoc wireless network that offers unrestricted mobility. A source node in such a network can communicate with a distant destination node after finding a route, relying on the intermediate nodes to transfer the packets. However, some intermediate nodes might act selfishly and drop packets for other nodes in order to save their own battery power. In this paper, we propose an algorithm to find selfish nodes and deal with them, using a modified Dynamic Source Routing (DSR) protocol, that we call Efficient Secure Dynamic Source Routing (ESDSR). Our results show an increase in the packet delivery ratio in a network containing selfish/unreliable nodes when we compare DSR with our protocol.     

Increasing QoS in selfish overlay networks

A routing overlay network is an application-layer overlay on the existing Internet routing substrate that allows an alternative routing service. Recent studies have suggested that such networks might contain selfish nodes, which develop their strategies by considering only their own objectives. Extremely selfish nodes, called free-riders, might even refuse to share their resources with the network, thus making overlay service unavailable to the nodes that depend on them. The authors use a game-theoretic approach to evaluate the selfish-node mechanism and increase quality of service (QoS) by detecting and excluding free-riders.     

一种机会网络节点重复博弈模型

在资源受限的机会网络中,节点在转发过程中所表现出的自私行为将严重影响网络性能。针对这一问题,建立基于认错机制的“礼尚往来”策略的节点重复博弈模型。节点考虑到将来的利益,迫于对惩罚的恐惧而参与转发。通过该策略,节点协作可以使网络性能达到最优。仿真结果表明,节点间的相互协作增强,在自私节点较多时也能保证较好的网络性能。     

Ad Hoc网络中一种基于节点营救机制的信任模型

为了使AdHoc网络能有效地区分、抵制恶意节点和自私节点对网络造成的危害,提出了一种基于节点营救机制的信任模型,该模型能量化节点间的信任关系,有效地分辨出网络中恶意节点和自私节点,并对不同类型的节点实施不同的处理策略,仿真实验表明．该模型在提高网络可用性、增强网络安全性等方面有显著的成效。     

A dynamic trust model exploiting the time slice in WSNs

Wireless sensor networks (WSNs) are composed of a large number of tiny sensor nodes that are self-organized through wireless communication. It aims to perceive, collect, and process information from network coverage areas. The open nature of WSNs makes them easily exposed to a variety of attacks and brings many security challenges. Furthermore, because of the limited resources, some nodes may refuse to forward packets by dropping them to save their resources such as battery, cache, and bandwidth. To resist the attacks from these selfish nodes and to punish them, we propose a fuzzy-based dynamic trust model in this paper. The model uses fuzzy sets combining with grey theory to evaluate every node’s trust credibility based on direct trust and indirect trust relationship. Only those with higher trust values can be chosen to forward packets. Those untrustworthy nodes with lower trust values will be detected and excluded from the trust list. Thus, our proposal also produces an incentive to compel the selfish nodes to wellbehave again to participate in the WSN again. Additionally, we introduce the time slice scheme to guarantee a reliable node possess enough time to enjoy its services, which can solve the problem that a suddenly interrupted link causes a significant decrease of the trust value. Simulation results show that our dynamic trust model can not only demonstrate the effectiveness in detecting selfish nodes, but also possess better performance even if the bursty traffic exists.     

A hierarchical architecture for detecting selfish behaviour in community wireless mesh networks

Wireless mesh networks (WMNs) consist of dedicated nodes called mesh routers which relay the traffic generated by mesh clients over multi-hop paths. In a community WMN, all mesh routers may not be managed by an Internet Service Provider (ISP). Limited capacity of wireless channels and lack of a single trusted authority in such networks can motivate mesh routers to behave selfishly by dropping relay traffic in order to provide a higher throughput to their own users. Existing solutions for stimulating cooperation in multi-hop networks use promiscuous monitoring or exchange probe packets to detect selfish nodes and apply virtual currency mechanism to compensate the cooperating nodes. These schemes fail to operate well when applied to WMNs which have a multi-radio environment with a relatively static topology. In this paper we, propose architecture for a community WMN which can detect selfish behaviour in the network and enforce cooperation among mesh routers. The architecture adopts a decentralized detection scheme by dividing the mesh routers into manageable clusters. Monitoring agents hosted on managed mesh routers monitor the behaviour of mesh routers in their cluster by collecting periodic reports and sending them to the sink agents hosted at the mesh gateways. To make the detection more accurate we consider the quality of wireless links. We present experimental results that evaluate the performance of our scheme.