一种基于地理定位信息的Ad Hoc分簇算法

Ad hoc网络的分簇机制目的是为了利用网络的分级结构来管理众多的移动设备。为了创建和维持一个当节点高速移动时仍然有效的分级结构,必须满足下面的需求:(1)分级结构中每个移动设备能够根据本地信息自动转换它的角色;(2)分级结构的管理负载要小,每个簇内的节点数目要尽可能地相同。该文提出了一个基于地理定位系统的自适应的多跳分簇机制,试验结果表明新的算法不依赖于节点的移动速度和传播范围,满足上面两个要求。     

移动自组网路由局部修复算法的研究

移动自组织网(mobile ad hoc networks,MANET)的多跳的无线连接、动态拓扑和有限的带宽等特征,给其路由协议带来了很多挑战.当多跳路径失效时,路由协议需要对其进行修复.已有的修复机制需要很多的开销和很长的端到端时延.在此修复机制的基础上,提出了一种新的路由局部修复算法,将修复尽量限制在断链的局部范围内,以减少对链路断裂的反应时间和降低路由维护的开销,而且不用考虑失效链路在整个路由上的相对位置,都可以对其进行修复,提高了处理失效链路的能力,有利于提高MANET的可扩展性.仿真表明,这种新的路由局部修复算法明显地提高了网络多方面的性能.     

Routing with adaptive path and limited flooding for mobile ad hoc networks

In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this packet until it reaches the destination. It will have large flooding overhead, poor network performance and undesirable battery power consumption. To improve network performance, we design a novel routing protocol called RAPLF (Routing with Adaptive Path and Limited Flooding) for mobile ad hoc networks. Simulation results show that our protocol has better performance especially in packet delivery rate and flooding overhead when compared to similar protocols.     

一种新的基于DSR的移动自组网节能路由策略

移动自组网是由一组带有无线收发装置的移动节点组成的一个支持多跳的临时性的网络自治系统。由于移动自组网的大多数节点是由有限寿命的电池来提供的，因此能量保护策略成为制定路由协议的一个重要依据。该文提出了一种新的基于动态源路由协议的节能路由策略。仿真表明该策略有效地延长了网络的生存时间。并很好地均衡了节约能耗和保护网络传统性能的需求。     

Certification-based trust models in mobile ad hoc networks: A survey and taxonomy

A mobile ad hoc network is a wireless communication network which does not rely on a pre-existing infrastructure or any centralized management. Securing the exchanges in such network is compulsory to guarantee a widespread development of services for this kind of networks. The deployment of any security policy requires the definition of a trust model that defines who trusts who and how. There is a host of research efforts in trust models framework to securing mobile ad hoc networks. The majority of well-known approaches is based on public-key certificates, and gave birth to miscellaneous trust models ranging from centralized models to web-of-trust and distributed certificate authorities. In this paper, we survey and classify the existing trust models that are based on public-key certificates proposed for mobile ad hoc networks, and then we discuss and compare them with respect to some relevant criteria. Also, we have developed analysis and comparison among trust models using stochastic Petri nets in order to measure the performance of each one with what relates to the certification service availability.     

Robustness Analysis and Enhancement of MANETs Using Human Mobility Traces

Understanding network behavior that undergoes challenges is essential to constructing a resilient and survivable network. Due to the mobility and wireless channel properties, it is more difficult to model and analyze mobile ad hoc networks under various challenges. In this paper, we provide a model to assess the vulnerability of mobile ad hoc networks in face of malicious attacks. We analyze comprehensive graph-theoretical properties and network performance of the dynamic networks under attacks against the critical nodes using real-world mobility traces. Motivated by minimum spanning tree and small-world networks, we propose a network enhancement strategy by adding long-range links. We compare the performance of different enhancement strategies by evaluating a list of robustness measures. Our study provides insights into the design and construction of resilient and survivable mobile ad hoc networks.     

A stability-based distributed routing mechanism to support unicast and multicast routing in ad hoc wireless network

An ad hoc network can be envisioned as a collection of mobile routers, each equipped with a wireless transceiver, which are free to move about arbitrarily. In ad hoc wireless networks, even if two nodes are outside the wireless transmission range of each other, they may still be able to communicate in multiple hops using other intermediate nodes. However, the dynamics of these networks, as a consequence of mobility and disconnection of mobile hosts, pose a number of problems in designing routing schemes for effective communication between any pair of source and destination. In this paper, a stability-based unicast routing mechanism, that considers both link affinity and path stability in order to find out a stable route from source to destination, is proposed. It is then extended to support multicast routing as well where only local state information (at source) is utilized for constructing a multicast tree. The performance of the proposed scheme is evaluated on a simulated environment to show that the stability-based scheme provides a unified framework for both unicast and multicast routing and reduces the probability of route error drastically in both the cases.     

Toward secure and scalable time synchronization in ad hoc networks

Time synchronization is crucial in ad hoc networks. Due to the infrastructure-less and dynamic nature, time synchronization in such environments is vulnerable to various attacks. Moreover, time synchronization protocols such as IEEE 802.11 TSF (Timing Synchronization Function) often suffer from scalability problem.In this paper, we address the security and the scalability problems of time synchronization protocols in ad hoc networks. We propose a novel suite of time synchronization mechanisms for ad hoc networks based on symmetric cryptography. For single-hop ad hoc networks, we propose SSTSP, a scalable and secure time synchronization procedure based on one-way Hash chain, a lightweight mechanism to ensure the authenticity and the integrity of synchronization beacons. The “clock drift check” is proposed to counter replay/delay attacks. We then extend our efforts to the multi-hop case. We propose MSTSP, a secure and scalable time synchronization mechanism based on SSTSP for multi-hop ad hoc networks. In MSTSP, the multi-hop network is automatically divided into single-hop clusters. The secure intra-cluster synchronization is achieved by SSTSP and the secure inter-cluster synchronization is achieved by exchanging synchronization beacons among cluster reference nodes via bridge nodes.The proposed synchronization mechanisms are fully distributed without a global synchronization leader. We further perform analytical studies and simulations on the proposed approaches. The results show that SSTSP can synchronize single-hop networks with the maximum synchronization error under 20 μs and MSTSP 55–85 μs for multi-hop networks, which are, to the best of our knowledge, among the best results of currently proposed solutions for single-hop and multi-hop ad hoc networks. Meanwhile, our approaches can maintain the network synchronized even in hostile environments.     

移动自组网中Anycast路由协议的研究

讨论了Anycast通信协议模型和研究现状，提出一种基于AODV的Anycast路由协议用于移动自组网IP流通信．同时，在NS2模拟器中扩充了Anycast协议模块，并采用不同的网络参数测试了协议的性能．模拟结果显示，Anycast协议能有效平衡网络负载，减少包传输延时，增大网络吞吐能力．在节点移动性高且链路断裂频繁的情况下，Anycast服务也能提高移动自组网的性能．     

移动Ad hoc网络的能量约束路由协议

移动Ad hoc网络中,节点采用电池一类的可耗尽能源来提供电源,很容易因某个节点能量耗完而导致网络分裂。同时,节点在网络中的不断移动可能引起路由失效,从而导致路由重建,降低网络的性能。针对这个问题,从节点能量消耗入手,通过对网络中各节点能量消耗速度的预测,并周期性地监控与节点相关的链路的变化情况,近似获得代表节点移动快慢的移动性参数,提出一种结合节点移动性和节点剩余能量状态预测的路由协议——EMRP。仿真表明EMRP能提高数据传送率,延长整个网络的生存时间,改善网络性能。     

移动Ad Hoc网络中一种多播路由协议算法实现

MANET是一个多跳,节点无中心、自组织、互相通信而不依赖于预先架设的固定基础设施无线移动网络。本文提出了采用按需路由发现策略的移动Ad Hoc多播路由算法。此算法不需要维护全局的路由信息,通过按需路由发现过程,动态更新路由信息和建立多播转发组。多播数据包在转发组成员间进行有限泛洪,能够降低带宽的占用及减少路由更新信息的传播。仿真实验显示多播算法在带宽较低、多播组成员数量变化较大的移动分组无线网环境中,具有较好的可靠性和工作效率。     

Minimum disruption service composition and recovery in mobile ad hoc networks

The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can satisfy the end-to-end quality of service requirements and minimize the effect of service disruptions caused by dynamic link and node failures. Although existing research on mobile ad hoc networks has focused on improving reliability, little existing work has considered service deliveries spanning multiple components. Moreover, service composition strategies proposed for wireline networks (such as the Internet) are poorly suited for highly dynamic wireless ad hoc networks.This paper proposes a new service composition and recovery framework designed to achieve minimum service disruptions for mobile ad hoc networks. The framework consists of two tiers: service routing, which selects the service components that support the service path, and network routing, which finds the optimal network path that connects these service components. Our framework is based on the disruption index, which is a novel concept that characterizes different service disruption aspects, such as frequency and duration, that are not captured adequately by conventional metrics, such as reliability and availability.Using the definition of disruption index, we formulate the problem of minimum-disruption service composition and recovery (MDSCR) as a dynamic programming problem and analyze the properties of its optimal solution for ad hoc networks with known mobility plan. Based on the derived analytical insights, we present our MDSCR heuristic algorithm for ad hoc networks with uncertain node mobility. This heuristic algorithm approximates the optimal solution with one-step lookahead prediction, where service link lifetime is predicted based on node location and velocity using linear regression. We use simulations to evaluate the results of our algorithm in various network environments. The results validate that our algorithm can achieve better performance than conventional methods.     

自组网环境下基于模糊控制的自适应动态源路由协议

自组网是由一组带有无线收发装置的移动节点组成的一个能够支持多跳的临时性的计算机通信网络，大多数节点是由有限寿命的电池来提供的，因此能量保护策略成为设计该类网络路由协议的一个重要依据．同时，拓扑的动态变化是该类网络的另一主要特征，它将影响路由的稳定性．通过对节点当前剩余电池能量和邻居节点之间链路稳定性的观察，并使用模糊逻辑控制策略，文中提出了一种基于动态源路由的自适应路由协议，仿真表明该协议有效地延长了网络的生存时间，并提高了报文提交率．     

移动Ad Hoc网络中带路由机制的密钥管理

移动Ad Hoc网络是一种无中心自组织的多跳无线网络,有效的密钥管理是网络安全的关键。因此,本文提出了一个能够快速响应的密钥管理框架。这个框架通过应用可验证的秘密共享方案来建立PKI,并通过引入路由机制构造了一个快速响应的服务器组。服务器组可以对组内结点的私钥分量更新和所有结点的证书更新提供快速响应。为了验证框架的
的性能,本文通过仿真给出了实验结果。     

Applying link stability estimation mechanism to multicast routing in MANETs

Mobile ad hoc networks are self-organizing network architectures of mobile nodes. Node mobility causes network topologies to change dynamically over time, which complicated important tasks such as routing. In this paper, a novel link stability estimation model based on received signal strength indication is proposed. We have integrated this model into MAODV and present a stability-based multicast routing protocol termed as SMR. SMR can discover more available stable routes and better adapt to network topology changes. Simulation results show the superiority of SMR over the existing methods in terms of packet delivery ratio, average end-to-end delay and routing packet overhead.     

Ad Hoc网络移动模型研究

无线移动AdHoc网络是一种不依赖任何固定设施的移动无线多跳网络。如何选择最贴近实际、最易于实现的移动模型是研究的基础,也是成功的关键。论文研究了几个典型的用于AdHoc网络中的移动模型。分析各种移动模型的关联和差异,给出了各自适用的范围及选择的依据条件,有利于AdHoc网络协议的研究和评价。     

基于MANET的无线自组织网按需路由协议DSR的优化研究与实现

无线自组织网络由不需要任何基础设施的一组具有动态组网能力的节点组成,因此网络可以通过节点路由发现机制转发分组,并进行路由维护。这种网络适应了军事和商用中对网络和设备移动性的要求,而引起了人们的关注,并在20世纪90年代以后获得了广泛的研究和发展。文章对DSR(动态源路由协议)的路由发现过程进行了优化,并采用OPNET仿真软件对基于DSR协议的Ad Hoc网络的路由开销和时延等关键参数进行了仿真统计,分析了改进后的路由协议对网络质量的影响。     

基于改进萤火虫群优化的无线自组网路由算法

针对无线自组网络拓扑结构多变、网络生存时间受限及数据包分组传输效率低下等问题,借鉴萤火虫群优化算法,提出了一种改进萤火虫群优化的无线自组网络路由算法.路由算法将萤火虫优化算法中的荧光素强度更新与无线自组网络中的节点移动速度、拥塞程度、节点剩余能量、节点间距离等因素进行相互映射,同时改进萤火虫群优化算法中的搜索萤火虫、驻留萤火虫及回溯萤火虫用于完成无线自组网络中路由协议的路由发现、路由选择及路由维护等过程,整个协议无须传送大量的控制分组,即可实现无线自组网络的稳定传输.仿真实验结果表明,与AODV及基于蚁群优化的路由算法AntRouting协议相比,本文所提出的路由算法在端到端延时、分组数据传输率及网络生存时间上均有良好的性能.     

移动自组网路由协议DSR性能评价

研究移动自组网的难点之一是开发能够跟随网络拓扑变化，在移动节点之间快速找到有效路径的路由协议。DSR协议作为一种简洁有效的按需机制路由协议，成为IETF的MANET工作组提出的草案之一。本文利用MANET工作小组推荐的Ns2仿真软件对DSR进行模拟，从源节点个数、分组发送频率、移动速度、节点密度、节点个数五个方面分析DSR的性能，指出对DSR性能影响最大的因素。分析随分组频率降低协议性能下降是由于它的路径缓存策略引起，提出将针对DSR路径缓存，搜索，抛弃策略进行改进。     

基于移动IPv6的Ad Hoc网络Internet接入方法

通过对移动IP协议与移动Ad Hoc网络的研究,提出了一种基于移动IPv6的Ad Hoc网络Internet接入方法MaMv6.将移动IP技术同移动Ad Hoc网络结合起来,既能使移动结点在移动过程中保持与Internet的连接,又能利用移动Ad Hoc网络的多跳特性来扩展接入点范围,提供了一种在IPv6背景下、在全局范围内实现移动性Intemet连接的可能.