Ad hoc网络中一种基于身份的组密钥协商协议

移动Ad hoc网络是一种资源有限的移动多跳无线网络。在网络中构建组密钥协商协议时应尽可能地减少资源开销。文中在基于身份的网络安全环境下,设计了一种基于环状结构的组密钥协商协议。该协议采用椭圆曲线上的双线性配对,仅通过单轮通信完成组密钥协商。经过分析,该协议具有等献性,已知密钥安全,无密钥控制等安全属性,适用于Ad hoc网络。     

移动Ad Hoc网络分布式多跳认证授权方案

提出一个分布式的具有多跳认证授权支持的移动Ad Hoc网络方案。该方案利用门限密钥分享技术把认证授权功能完全分散化,每个节点持有一个密钥份额,只有达到门限值规定数量的节点联合起来才能提供认证服务,而认证服务将不仅仅局限于本地节点,多跳范围内的节点也可以参与这项工作。此外,本文还采用多播来取代广播以减少杂项开销。本文解决了多跳认证授权所遇到的技术难题,并通过仿真验证了方案的可行性和有效性。     

A Trust-Distortion Resistant Trust Management Scheme on Mobile Ad Hoc Networks

Trust management is a promising approach to conduct nodes’ transactions and establish management interactions in mobile ad hoc networks, in which collaboration between nodes is critical to achieve system goals. Lack of centralized management, severe resource constraints (e.g. computing power, energy, bandwidth), and important network dynamics (e.g. topology changes, node mobility, node failure, propagation channel conditions) make the trust management a challenging task in such a network. Mainly, trust management frameworks are prone to attacks trying to deceive nodes’ estimation on other nodes’ trustworthiness, referred to as trust-distortion attacks. In order to inhibit such attacks, we propose a Trust-distortion Resistant Trust Management Scheme (TRTMS) which provides nodes with an accurate estimation on other nodes’ behavior and enables them to handle different trust-distortion attacks in a multi-attack environment. Simulation results prove that TRTMS significantly outperforms the existing alternatives in the literature in presence of simultaneous and contradictory different trust-distortion attacks.     

移动Ad hoc网络中的密钥管理

首先阐述了移动adhoc网络中密钥管理的重要性,接着探讨了几种密钥管理的方法,包括局部分布式认证授权中心、完全分布式认证授权中心、自发证书、安全Pebblenets、指示性标志、基于口令验证的密钥交换等,并对这些方法进行了较完整的概括总结和深入的比较分析,最后提出了一些研究移动adhoc网络中密钥管理方法所必须注意的问题。     

Distributed Event Notification for Mobile Ad Hoc Networks

Emergency-and-rescue applications must be continually available, placingstrong demands on middleware solutions running over mobile ad hoc networks.This highly available distributed event notification service can help byreaching the different network partitions and providing a useful deliverysemantic.     

Spontaneous Group Management in Mobile Ad Hoc Networks

This paper deals with the problem of Location Management in mobile ad hoc networks where users are organized in groups. In the following this type of systems are referred to as Mobile Ad hoc Networks for Group Operations (MANGO). This paper proposes a framework for location management which exploits the trend of mobile users to spontaneously form groups in MANGOs. The management procedures required to support such spontaneous groups, which are by nature dynamic, are introduced as well. The proposed spontaneous group management is based on a hierarchical location database architecture and the concept of Group Leader, which is a terminal responsible for the location update of a group of terminals. Objective of the proposed framework is minimizing the burden on location databases and, at the same time, the signaling issued by terminals. In this paper, distributed operations required to support the whole framework are properly introduced and described. Simulation experiments have been run in order to assess the proposed scheme. Performance results show that the introduced methodology allows reduced signaling and location updating.     

一种适用于Ad Hoc网络的密钥管理方案

为了Ad Hoc网络能够更好的应用和发展,必须有效的解决其安全隐患,由于Ad Hoc网络中不存在可信任的中心,其密钥管理就显得尤为重要.文中提出了一种改进的Ad Hoc网络密钥管理方案.改进后的方案采用可验证的秘密共享、公钥加密和随机数相结合的技术.分析结果表明,该方案进一步提高了安全性,同时降低了计算量.     

Leader Based Group Routing in Disconnected Mobile Ad Hoc Networks with Group Mobility

When there is disconnection in mobile ad hoc network under group mobility, it falls into the delay-tolerant network (DTN). However, most existing research in DTN targets entity mobility. In this paper, we consider the routing strategy for DTN with group mobility, and propose the leader based group routing (LBGR) by making full use of group structure in group mobility. Three major mechanisms closely related to the group mobility are proposed in LBGR. First, we treat each group as one individual unit during routing execution to substantially reduce the routing overhead and the resource requirement. Second, we consider the resource allocation in each group and propose the leader-dominating routing in LBGR to reduce the impact of the group dynamics on network performance. Third, to make better use of the rare contact opportunities in DTN, we propose the group based packet exchange, in which the contact of any two nodes from two groups will trigger the packet exchange between the two groups. By extensive simulation we show that LBGR outperforms two traditional routing protocols, epidemic routing and DSR, in various network conditions. Especially, we will find that the impact of the group dynamics on LBGR is very limited.     

基于虚拟骨干网技术的自组网络移动IP方案

在自组网络中，虚拟骨干网技术的基本思想是数据包的分发控制由构成虚拟骨干网的节点负责，从而能够有效地提高无线自组网络的链路利用率，并能更好地适应快速网络拓扑变化。提出了一种基于虚拟骨干网技术的移动IP方案，它结合虚拟骨干网技术和移动IP的优势，具有易实现性和较好的性能。     

移动Ad Hoc网络关键技术研究

文章介绍了移动ad hoc网络的概念、各种应用以及关键技术,着重对无线TCP进行了研究对TCP Reno中选择确认(SACK)的缺点提出一种新的ASACK方法,使吞吐量得以提高,在节点高速移动时效果尤为明显对TCP Vegas作了改进,提出一种采用RTT通知的TCP Vegas方案,结果使节点高速移动时系统吞吐量明显提高.     

基于椭圆曲线密码组合公钥的ad hoc密钥管理方案

Ad Hoc网络是一种独具特色的网络,作为一种新型的无线,多跳、无中心分布式控制网络,它无需网络基础设施,具有很强的自组织性,鲁棒性.抗毁性和容易构建的特点,其安全问题一直是研究的热点和难点.文中提出了一种改进的基于椭圆曲线密码组合公嘲的ad hoc密钥管理方案.与原方案相比,除了保持快捷地计算出节点的公私钥对、扩展性好、无需证书等特性外,新方案进一步提高了ad hoc网络的安全性,避免了单点失败.     

一种新的基于椭圆曲线密码体制的 Ad hoc组密钥管理方案

在安全的组通信中,组密钥管理是最关键的问题.论文首先分析了组密钥管理的现状和存在的问题,然后基于椭圆曲线密码体制,针对Ad hoc网络提出了一种安全有效的分布式组密钥管理方案,并对其正确性和安全性进行了证明,由椭圆曲线离散对数困难问题保证协议的安全.针对Ad hoc网络节点随时加入或退出组的特点,提出了有效的组密钥更新方案,实现了组密钥的前向保密与后向保密.与其他组密钥管理方案相比,本方案更加注重组成员的公平性,没有固定的成员结构,并且还具有轮数少、存储开销、通信开销小等特点,适合于在Ad hoc网络环境中使用.     

Trust Based Intrusion Detection Technique to Detect Selfish Nodes in Mobile Ad Hoc Networks

The applications and protocols conceived for mobile ad hoc networks rely on the assumption of cooperation amongst the mobile nodes because of lacking infrastructure. All nodes have to spend their precious resources (e.g. battery power, memory, computational power, and network bandwidth) for routing and packet forwarding operations for other nodes, in a cooperative way in the network. However, there are some nodes that may intentionally turn themselves to behave selfishly in order to conserve their valuable resources. The selfish behaviour of such nodes drastically reduces the desired degree of cooperation amongst the mobile nodes. Over the course of time, the non-cooperative activities of, such selfish nodes would paralyze the normal functioning of the whole network. Therefore, these types of nodes should be detected and isolated from the network, as soon as they begin to exhibit their selfish behaviour. In this paper, a dynamic trust based intrusion detection technique is presented to detect and isolate the selfish nodes from the network, where the direct trust degree based on direct communication interactions and indirect (recommended) trust degree based on the neighbours’ recommendations are taking into account to accurately judge the selfishness nature of the nodes. The results obtained throughout the simulation experiments clearly show the feasibility and effectiveness of the proposed intrusion detection technique.     

Mobility Aware Clustering Scheme with Bayesian-Evidence Trust Management for Public Key Infrastructure in Ad Hoc Networks

Wireless Personal Communications - The autonomous nodes in Mobile Ad Hoc Networks (MANETs) are vulnerable to attacks ranging from passive to active, due to the dynamic mobility paradigm. Earlier,...     

A Distributed Intelligent Broadcasting Protocol for Mobile Ad Hoc Networks

The control and routing performances of mobile ad hoc networks (MANETs) depend upon the efficiency of the network-wide broadcasting schemes that are in place. Ad hoc networks are often characterized by poor infrastructure quality, limited resources, dynamic variation and a need for mobility; therefore, ease of deployment, adaptability and potential for energy-savings are the primary drivers considered in the design of typical broadcasting schemes. This paper proposes a distributed intelligent broadcasting protocol (DIBP) that is capable of dynamically determining the broadcasting nodes in a MANET, based upon the distribution of network nodes. This eliminates the need for active network monitoring and periodical maintenance is not required. In addition, the distributed intelligent broadcasting protocol employs an adjustable parameter for determining the broadcasting node, broadcasting timing and the number of broadcasting nodes. This parameter can be changed dynamically based on different operational requirements; such as energy savings, hop count, network delay and other similar targets. Simulations of networks employing the protocol yield results showing that the DIBP performs better in terms of delivery delay, number of rebroadcast nodes, and delivery ratio.     

移动Ad Hoc云中基于能量收集的分布式卸载方案研究

在物联网快速发展的驱动下,移动Ad Hoc云计算和能量收集(EH)技术通过共享邻近设备的闲置资源满足数据处理等需求,实现绿色通信。然而,由于Ad Hoc云网络的时变性以及EH的随机不稳定性,合理的任务卸载方案研究面临着严峻的挑战。针对以上问题,该文运用Lyapunov优化理论和博弈论,提出一种分布式动态卸载方案。理性的终端设备不可能无偿地为其他终端设备服务,为了鼓励终端设备积极参与计算卸载过程,提出一种基于动态报价的激励机制。相比于现有方案,仿真结果表明所提方案可以有效提升系统收益,稳定电池能量和减少任务队列积压。     

一种基于冗余路径的自组网密钥管理方案研究

基于部分分布式门限机制的密钥管理方案能提供高的安全性,但认证成功率较低,可扩展性差;基于证书链的密钥管理方案适合自组网的特点,但不能满足高安全要求的应用环境.在Hubaux证书链方案的基础上,文中提出了基于冗余路径的自组网密钥管理方案,该方案提高了系统的安全性,防止了不诚实节点的欺骗攻击;仿真结果表明,通过增加本地节点存储的证书数量,可以达到较高的认证成功率,满足自组网应用的高安全要求.     

移动Ad Hoc网络中的安全问题

移动自组网(Mobile Ad HoC Network)是一种无基础设施的无线网络由于它具有开放的媒质、分布式的合作、动态的拓扑结构和受限的网络能力等特点,所以特别容易受到攻击.为此文章结合移动Ad Hoc网络的特点分析了移动Ad Hoc网络面临的安全威胁,并对移动Ad Hoc网络的安全路由和安全报文传送问题进行了详细讨论.     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

RandomCast: An Energy-Efficient Communication Scheme for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), every node overhears every data transmission occurring in its vicinity and thus, consumes energy unnecessarily. However, since some MANET routing protocols such as Dynamic Source Routing (DSR) collect route information via overhearing, they would suffer if they are used in combination with 802.11 PSM. Allowing no overhearing may critically deteriorate the performance of the underlying routing protocol, while unconditional overhearing may offset the advantage of using PSM. This paper proposes a new communication mechanism, called RandomCast, via which a sender can specify the desired level of overhearing, making a prudent balance between energy and routing performance. In addition, it reduces redundant rebroadcasts for a broadcast packet, and thus, saves more energy. Extensive simulation using ns-2 shows that RandomCast is highly energy-efficient compared to conventional 802.11 as well as 802.11 PSM-based schemes, in terms of total energy consumption, energy goodput, and energy balance.