增强Ad-hoc网络可生存性的健壮多维信任模型

针对目前攻击者可以结合多种攻击手段对ad hoc网络进行复合攻击的现状,提出了一种健壮的多维信任模型(RMTM)以增强ad hoc网络的可生存性.RMTM基于D-S证据理论,将节点的攻击证据分成多个维度,每个维度的信任根据基本信度分配函数计算,并通过多维信任融合实现对节点的综合评价.同时,为了应对攻击者对信任模型本身进行攻击,设计了相应容忍算法以提高RMTM的健壮性.仿真实验验证了RMTM可在较低系统开销内有效防御ad hoc网络复合攻击和信任模型攻击,进而大幅度地增强了ad hoc网络可生存性.     

基于改进粒子群算法的Ad Hoc网络移动模型研究

 移动模型是研究ad hoc网络路由算法的基础.为解决基本粒子群算法的速度突变问题,使其适用于ad hoc网络移动模型,本文首先在基本粒子群算法的速度和位移更新公式中引入加速度和环境因子的概念,并提出用直角坐标系对其速度和位移进行分解.接着,我们建立了包含障碍物模型、速度初始化函数和无边界仿真区域的改进粒子群算法移动模型.为证实新移动模型的可行性和有效性,我们用Matlab和网络仿真软件OPNET进行仿真实验.结果表明,与传统的随机位点移动模型比较,基于改进粒子群算法的移动模型更贴近实际情景,并能够有效地应用在ad hoc网络中.     

基于朋友机制的移动ad hoc网络路由入侵检测模型研究

从如何有效检测移动ad hoc网络路由入侵行为、如何准确地响应并将恶意路由节点移除网络,提供可信路由环境的角度进行分析,提出了一种基于朋友机制的轻量级移动ad hoc网络入侵检测模型,并以典型的黑洞攻击为例,通过OPNET网络建模仿真及实验分析,验证了该模型的可行性和有效性。     

无线ad hoc网络中多路径负载平衡性能分析

提出了一种新颖的分析模型来计算无线ad hoc网络中多路径情况下的负载。该模型考虑到多路径的数目、路由的选取方法以及网络中节点的密度等条件，能够对不同网络条件下的负载进行较好的分析与理论计算。仿真结果与理论计算有良好的一致性，结果表明在无线ad hoc网络中简单地使用多路径路由并不能有效地平衡网络负载。这一结论与目前普遍认定的结论（在无线ad hoc网络中使用多路径路由和在有线网络中使用多路径路由一样，可以很好地平衡网络负载、增加网络的吞吐量）是不一致的。     

无线ad hoc网络多性能指标基本性能边界

在无线ad hoc网络中,基本性能边界对路由算法和资源分配协议的分析和评价具有重要的意义。对无线ad hoc网络多性能指标基本性能边界进行了研究,包括理论上最优的性能边界和实际可以得到的性能边界。提出了一种稳定状态(steady state)下的网络基本性能指标分析模型。该模型考虑了无线网络广播特性和无线信道干扰,可同时分析多个性能指标,包括：吞吐量、端到端延迟和能量消耗。基于该模型,针对ad hoc网络中最常见的多流—单/双中继拓扑分析基本性能指标,求解多目标优化问题得到基本性能边界。仿真结果验证了模型的准确性,均方根误差小于10-3量级。     

D-PRMA：一种新的无线Ad Hoc网络资源预留MAC机制

支持资源预留的介质访问控制(MAC)机制是无线ad hoc网络提供服务质量保证的关键。本文在分析分组预留多址接入(PRMA)的基础上，给出了一种新的支持资源预留的无线ad hoc网络MAC机制：分布式PRMA(D-PRMA)。D—PRMA的主要特点是分布式的，这适合无线ad hoc网络无中心的特点，同时，D—PRMA具有很短的碰撞持续时间，支持不同速率的实时业务，避免了对分组的分片和重组。通过仿真，本文进一步分析了D—PRMA的性能，仿真结果表明D—PRMA能保证实时业务的带宽和时延。     

Ad hoc网络时钟同步研究

由于ad hoc网络应用环境的多样性且不同的应用具有不同的同步要求，没有一种时钟同步协议可以适应各种情况。在分析了网络时钟同步困难的基础上，结合不同的ad hoc网络应用，探讨了不同应用环境下时钟同步协议的特殊性，并介绍了现有典型的ad hoc网络时钟同步协议。最后，针对ad hoc网络时钟同步中值得进一步研究的几个问题做了初步的分析。     

基于完美信息博弈的多无线电信道分配算法

无线网络的信道分配博弈分析,可分为单冲突域和多冲突域建模。在ad hoc网络中,采用多冲突域建模更符合实际。将ad hoc网络建模为多冲突域模型,提出一种基于完美信息的非合作信道分配算法,验证了算法的收敛性,仿真结果表明该算法相比其他算法在多冲突域中更能最大化信道使用率。     

盲区环境下集成移动蜂窝和ad hoc网络的系统性能分析

首先介绍了一种在盲区环境下集成移动蜂窝和ad hoc网络的系统结构,接着分析了在这种环境下集成系统可获得中继节点的概率。然后结合这个概率,建立了集成移动蜂窝和ad hoc网络系统的解析模型,并且在这个模型的基础上,通过数学解析方法分别得到了传统蜂窝和集成网络系统的会话丢弃概率。最后通过数值仿真比较了在盲区环境中2种系统的性能,并分析了各种系统参数对集成移动蜂窝和ad hoc网络系统性能产生的影响。     

ad hoc网络的可生存性问题及设计挑战

本文介绍了ad hoc网络可生存性面临的问题和挑战,特别强调了军事需求.其中从三个方面探讨了ad hoc网络的可生存性问题:可生存的网络连接、可生存的通信服务及可生存性技术,尤其是对可生存性技术进行了较全面的剖析.     

Connectivity Probability of Wireless Ad Hoc Networks: Definition, Evaluation, Comparison

The paper presents a new approach investigating mobile ad hoc network connectivity. It is shown how to define and evaluate the connectivity probability of a mobile network where the position of the nodes and the link quality changes over time. The connectivity probability is a measure that can capture the impact of the node movement on the network connectivity. A number of mobility models is considered ranging from the classical Random Direction model to the Virtual World model based on the mobility measurements of a multi–player game. We introduce an Attractor model as a simple way to model non–homogeneous node distribution by incorporating viscosity regions in the simulation area. Methods of ergodic theory are used to show the correctness of the approach and to reduce the computational time. Simulation results show how the node density distribution affects the network connectivity.     

Contrôle de topologie orienté stratégie basé sur des routeurs mobiles dédiés

Due to the inherent mobility within the ad hoc environment, network topology plays a key role on routing and network performance. In this paper we propose to control the ad hoc network morphology using a set of dedicated routers. The idea is to use positively the mobility, in order to enhance ad hoc network performance. Two deployment policies are studied for a global network connectivity or a limited network diameter. We describe the Mixed Integer Linear Programming (Milp) models for these deployment policies with respect to the constraints, and show the efficiency, of the described approach through simulations (NS-2).     

A Statistical Analysis of the Long-Run Node Spatial Distribution in Mobile Ad Hoc Networks

In this paper, we analyze the node spatial distribution of mobile wireless ad hoc networks. Characterizing this distribution is of fundamental importance in the analysis of many relevant properties of mobile ad hoc networks, such as connectivity, average route length, and network capacity. In particular, we have investigated under what conditions the node spatial distribution resulting after a large number of mobility steps resembles the uniform distribution. This is motivated by the fact that the existing theoretical results concerning mobile ad hoc networks are based on this assumption. In order to test this hypothesis, we performed extensive simulations using two well-known mobility models: the random waypoint model, which resembles intentional movement, and a Brownian-like model, which resembles non-intentional movement. Our analysis has shown that in Brownian-like motion the uniformity assumption does hold, and that the intensity of the concentration of nodes in the center of the deployment region that occurs in the random waypoint model heavily depends on the choice of some mobility parameters. For extreme values of these parameters, the uniformity assumption is impaired.     

Extending Global IP Connectivity for Ad Hoc Networks

Ad hoc networks have thus far been regarded as stand-alone networks without assumed connectivity to wired IP networks and the Internet. With wireless broadband communications and portable devices with appropriate CPU, memory and battery performance, ad hoc connectivity will become more feasible and demand for global connectivity through ad hoc networking is likely to rapidly grow. In this paper we propose an algorithm and describe a developed prototype for connectivity between an ad hoc network running the ad hoc on-demand distance-vector protocol and a wired IP network where mobile IP is used for mobility management. Implementation issues and performance metrics are also discussed.     

固定航线的航空自组网连通性研究

网络连通性是组网与路由研究的前提和基础,针对目前对固定航线航空自组网连通性研究较少的现状,提出一种连通性研究方法.该方法结合实际航线分层、双向的特点,通过建立飞机分布模型与航线模型,推导出了一维航线连通性表达式.在此基础上,运用基于概率矩阵的概率图求解方法对航线网的连通性进行理论研究,并用实验证明其正确性.随后,根据实际航班数据对我国部分空域内一维航线及航线网的连通性进行仿真,结果表明航空自组网在上述空域具备可行性.最后,从航班安排、航线规划等4个方面对提升连通性给出了合理性建议.     

Power-aware routing protocols in ad hoc wireless networks

An ad hoc wireless network has no fixed networking infrastructure. It consists of multiple, possibly mobile, nodes that maintain network connectivity through wireless communications. Such a network has practical applications in areas where it may not be economically practical or physically possible to provide a conventional networking infrastructure. The nodes in an ad hoc wireless network are typically powered by batteries with a limited energy supply. One of the most important and challenging issues in ad hoc wireless networks is how to conserve energy, maximizing the lifetime of its nodes and thus of the network itself. Since routing is an essential function in these networks, developing power-aware routing protocols for ad hoc wireless networks has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. This article surveys the current state of power-aware routing protocols in ad hoc wireless networks.     

Topology and mobility considerations in mobile ad hoc networks

A highly dynamic topology is a distinguishing feature and challenge of a mobile ad hoc network. Links between nodes are created and broken, as the nodes move within the network. This node mobility affects not only the source and/or destination, as in a conventional wireless network, but also intermediate nodes, due to the network’s multihop nature. The resulting routes can be extremely volatile, making successful ad hoc routing dependent on efficiently reacting to these topology changes.

In order to better understand this environment, a number of characteristics have been studied concerning the links and routes that make up an ad hoc network. Several network parameters are examined, including number of nodes, network dimensions, and radio transmission range, as well as mobility parameters for maximum speed and wait times. In addition to suggesting guidelines for the evaluation of ad hoc networks, the results reveal several properties that should be considered in the design and optimization of MANET protocols.     

Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with Bernoulli nodes

Nodes in wireless ad hoc networks may become inactive or unavailable due to, for example, internal breakdown or being in the sleeping state. The inactive nodes cannot take part in routing/relaying, and thus may affect the connectivity. A wireless ad hoc network containing inactive nodes is then said to be connected, if each inactive node is adjacent to at least one active node and all active nodes form a connected network. This paper is the first installment of our probabilistic study of the connectivity of wireless ad hoc networks containing inactive nodes. We assume that the wireless ad hoc network consists of n nodes which are distributed independently and uniformly in a unit-area disk, and are active (or available) independently with probability p for some constant 0

相似文献   

Network connectivity of one-dimensional MANETs with random waypoint movement

An analysis of network connectivity of one-dimensional mobile ad hoc networks with a particular mobility scheme is presented, focusing on the random waypoint mobility scheme. The numerical results are verified using simulation to show their accuracy under practical network conditions. Observations on RWP properties further lead to approximations and an eventual simple network connectivity formula.