Threshold password authentication against guessing attacks in Ad hoc networks

Password authentication has been accepted as one of the commonly used solutions in network environment to protect resources from unauthorized access. The emerging mobile Ad hoc network, however, has called for new requirements for designing authentication schemes due to its dynamic nature and vulnerable-to-attack structure, which the traditional schemes overlooked, such as availability and strong security against off line guessing attacks in face of node compromise. In this paper, we propose a threshold password authentication scheme, which meets both availability and strong security requirements in the mobile Ad hoc networks. In our scheme, t out of n server nodes can jointly achieve mutual authentication with a registered user within only two rounds of message exchanges. Our scheme allows users to choose and change their memorable password without subjecting to guessing attacks. Moreover, there is no password table in the server nodes end, which is preferable since mobile nodes are usually memory-restricted devices. We also show that our scheme is efficient to be implemented in mobile devices.     

移动自组织网中的移动模型

移动模型对移动自组织网的仿真性能有重要影响.本文在总结当前移动模型研究状况的基础上,着重分析了两大类中共六种移动模型,对它们的移动方式、算法、特点和应用范围等作了较为详细的论述,对自组织网络的仿真研究和实际应用具有指导和借鉴意义.     

MANET路由协议的最新发展

由于移动Ad hoc网络(MANET)自身的特殊性,其路由协议的设计与传统固定网络有很大不同。本文在MANET路由协议的设计原则的基础上,分析了几种典型的MANET路由协议的特点,并对MANET路由协议未来的发展方向作出了展望。     

移动自组网中一种新颖的基于概率权重的门限签名方案

提出了一种新颖的基于概率权重的门限签名方案.该方案是数字签名与公钥密码体制的有机集成.它在传统的(n, t)门限签名方案的基础上针对不同安全级别的服务节点设置了不同的签名概率权重.因此,该方案增加了网络的抗攻击能力,在一定的条件下还可以实现入侵检测的功能.     

基于节点度的移动自组网络Grover路由算法研究

移动自组网络是当前无线网络研究的热点问题,网络路由算法研究是其中的一个关键问题.在深入分析现有移动自组网络路由协议基础上,本文结合动态源路由协议的特点,提出了一种基于节点度值计算的Grover路由算法.该方法系统地研究移动自组网络的主要特征:节点度值、节点能量等,利用Grover搜索算法构造操作矩阵和概率扩散矩阵计算得...     

合作博弈论在MANET安全模型中的应用

本文介绍了MANET网络的一种安全机制模型及改进。由于MANET网络动态性、随机接入的特点，对于安全隐患的感知必须依赖成员节点的相互协作才能完成，而当前已有的理论模型均存在一些明显缺陷，比如不能有效检测到威胁，或者虚警率过高等，严重影响了这一类模型的实际应用价值。本文中通过引入安全分级，使用合作博弈论的算法来处理大量不同节点感测到的系统威胁的相关信息，给出合理的综合判断，并且对于各个节点本身也做出了一定的评估结果，有利于模型参数的优化。经过仿真验证，说明合作博弈论应用于该安全模型使得模型性能得到明显的改善。     

AODV routing overhead analysis based on link failure probability in MANET

This article puts forward an Ad-hoc on-demand distance vector routing(AODV)routing overhead analysis method in mobile Ad-hoc network(MANET).Although multiple routing protocols have been proposed to improve the performance,scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way.Routing overhead consumes part of network resources and limits the supported traffic in the network.For on-demand routing protocols like AODV,the routing overhead depends on the link failure probability to a great extent.This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability.In chain and rectangle scenarios,it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability.Simulations on OPNET 14.5platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.     

基于策略的动态自适应MANET网QoS保障技术研究

文章从MANET网QoS研究现状入手,提出了应用于MANET网络端到端的业务QoS保障方案——基于策略的动态自适应MANET网QoS解决方案,阐述了该方案的体系架构及技术实现途径。     

移动Ad hoc网络可靠多路径路由协议的综述

分析研究了移动Adhoc网络（MANET）的可靠多路径路由协议,可靠多路径路由协议的主要目标是提供可靠的通信、以确保负载平衡以及提高服务质量（QoS）。本文分析了Adhoc网络多路径路由技术的研究进展,论述了典型的Adhoc网络多路径路由协议性能,最后对Adhoc网络多路径路由的发展趋势进行了展望。     

ON-CRP：机会网络缓存替换策略研究

提出了一种新的机会网络缓存替换策略(ON-CRP,opportunistic networking cache replacement policy).与现有策略不同,该策略基于节点与数据项的相关度来选择要替换的缓存数据,并利用人类移动模式提取了目标地址匹配概率这一关键因素来对相关度进行判定;同时结合数据项的访问与更新频率比值这一重要因素来对缓存数据替换标准进行设计.仿真实验结果表明ON-CRP能够有效降低数据的远程访问延迟,与其他缓存替换算法相比网络开销降低了约30%,而数据的缓存命中率性能有约10%～30%的提高.