Wireless ad ho network is becoming a new research fronter, in which security is an important issue. Usually some nodes act maliciously and they are able to do different kinds of Denial of Service (Dos). Because of the...Wireless ad ho network is becoming a new research fronter, in which security is an important issue. Usually some nodes act maliciously and they are able to do different kinds of Denial of Service (Dos). Because of the limited resource, intrusion detection system (IDS) runs all the time to detect intrusion of the attacker which is a costly overhead. In our model, we use game theory to model the interactions between the intrusion detection system and the attacker, and a realistic model is given by using Bayesian game. We solve the game by finding the Bayesian Nash equilibrium. The results of our analysis show that the IDS could work intermittently without compromising on its effectiveness. At the end of this paper, we provide an experiment to verify the rationality and effectiveness of the proposed model.展开更多
从演化博弈论的角度,提出一种能有效激励无线Ad Hoc网络节点参与数据分组中继协作的纳什均衡策略:G-TFT(Generous Tit for Tat).以节点中继的分组数与所需的能量开销为均衡点,建立了中继协作过程的单阶段博弈模型G,验证了节点的自私性动...从演化博弈论的角度,提出一种能有效激励无线Ad Hoc网络节点参与数据分组中继协作的纳什均衡策略:G-TFT(Generous Tit for Tat).以节点中继的分组数与所需的能量开销为均衡点,建立了中继协作过程的单阶段博弈模型G,验证了节点的自私性动机;将G扩展为基于时间序列、策略可转换的演化博弈R,并根据R的纳什均衡提出了协作激励策略G-TFT.仿真结果表明,通过调整宽容因子g,G-TFT能有效地激励节点参与中继协作.展开更多
为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而...为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而不需要知道每一个局中人的信息,并且在足够大的局中人数目情况下性能更加近似马尔科夫均衡。仿真实验显示:提出的MFEA路由协议在包投递率、时延和归一化开销方面均优于AODV(Ad hoc on-demand distance vector routing)协议,在节点密集的无线自组织网络中仍可获得比较好效果。展开更多
该文针对Ad hoc网络中同时存在的快、慢衰落情况,提出一种依据节点信号干扰噪声比(Signal toInterference plus Noise Ratio,SINR)计算并行传输门限的方法。该方法在获知节点信道质量的分布情况后,采用贝叶斯非合作博弈理论对不同源目...该文针对Ad hoc网络中同时存在的快、慢衰落情况,提出一种依据节点信号干扰噪声比(Signal toInterference plus Noise Ratio,SINR)计算并行传输门限的方法。该方法在获知节点信道质量的分布情况后,采用贝叶斯非合作博弈理论对不同源目的节点对之间的并行传输进行建模。考虑到该模型会使信道质量长时间低于并行传输门限的节点处于发送"饥饿"状态,该文引入协作通信机制来解决"饥饿"节点的并行传输问题,且与已存在的源目的节点通信对并存。仿真结果显示,该文提出的CTCG(Concurrent Transmission based on Channel qualitywith Game theory aid)模型能较大程度增加Ad hoc网络的并行传输机会,提高系统吞吐量,且能够较好的解决"饥饿"节点的发送抑制问题。展开更多
文摘Wireless ad ho network is becoming a new research fronter, in which security is an important issue. Usually some nodes act maliciously and they are able to do different kinds of Denial of Service (Dos). Because of the limited resource, intrusion detection system (IDS) runs all the time to detect intrusion of the attacker which is a costly overhead. In our model, we use game theory to model the interactions between the intrusion detection system and the attacker, and a realistic model is given by using Bayesian game. We solve the game by finding the Bayesian Nash equilibrium. The results of our analysis show that the IDS could work intermittently without compromising on its effectiveness. At the end of this paper, we provide an experiment to verify the rationality and effectiveness of the proposed model.
文摘从演化博弈论的角度,提出一种能有效激励无线Ad Hoc网络节点参与数据分组中继协作的纳什均衡策略:G-TFT(Generous Tit for Tat).以节点中继的分组数与所需的能量开销为均衡点,建立了中继协作过程的单阶段博弈模型G,验证了节点的自私性动机;将G扩展为基于时间序列、策略可转换的演化博弈R,并根据R的纳什均衡提出了协作激励策略G-TFT.仿真结果表明,通过调整宽容因子g,G-TFT能有效地激励节点参与中继协作.
文摘为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而不需要知道每一个局中人的信息,并且在足够大的局中人数目情况下性能更加近似马尔科夫均衡。仿真实验显示:提出的MFEA路由协议在包投递率、时延和归一化开销方面均优于AODV(Ad hoc on-demand distance vector routing)协议,在节点密集的无线自组织网络中仍可获得比较好效果。
文摘该文针对Ad hoc网络中同时存在的快、慢衰落情况,提出一种依据节点信号干扰噪声比(Signal toInterference plus Noise Ratio,SINR)计算并行传输门限的方法。该方法在获知节点信道质量的分布情况后,采用贝叶斯非合作博弈理论对不同源目的节点对之间的并行传输进行建模。考虑到该模型会使信道质量长时间低于并行传输门限的节点处于发送"饥饿"状态,该文引入协作通信机制来解决"饥饿"节点的并行传输问题,且与已存在的源目的节点通信对并存。仿真结果显示,该文提出的CTCG(Concurrent Transmission based on Channel qualitywith Game theory aid)模型能较大程度增加Ad hoc网络的并行传输机会,提高系统吞吐量,且能够较好的解决"饥饿"节点的发送抑制问题。
