基于链路状态和节点状态信息的DSR增强算法

本文利用链路和节点发送缓存的状态信息对DSR协议进行优化和改进，提出了一种Performance—DSR（PDSR）协议。文中对PDSR协议的路由更新和路由选择机制进行了介绍，并对PDSR协议和DSR协议在节点不同移动速度下的性能进行了分析比较，结果表明PDSR协议比DSR协议更能适应网络拓扑变化快的MANET网络。     

动态源路由协议(DSR)在Linux下的实现

动态源路由协议(DynamicSourceRoutingProtocol,DSR)是由移动节点组成的多跳无线AdHoc网络犤3,4犦中一种简单和行之有效的路由协议犤1犦。协议允许任一结点动态发现到达AdHoc网络中其它任意节点的路由,所有的路由信息由DSR自动地进行维护。每个DSR头部都携带了到达目的节点的完整的路由跃点列表(hoplist),中间节点只需简单地对分组进行转发即可。同时DSR协议完全按需(on-demand)的特性可以显著减少路由协议的开销,节省了电池能量,减少了分组冲突的概率并减少了潜在的大规模的路径更新信息的传播。使用DSR协议可以实现AdHoc网络的完全的自组织和自配置而无需任何已经存在的网络基础设施。论文详细论述了DSR路由协议在Linux操作系统下借助Netfilter的实现。     

基于DSR协议的区域路由研究

动态源路由(DSR,Dynamic Source Routing)协议是典型的按需Ad Hoc路由协议。其缺点在于路由发现和维护过程对网络拓扑变化反映较慢,难以满足对延迟要求高的实时视频业务的传输。针对原DSR协议的不足之处,本文在DSR的基础上增加了区域的概念,并给出了DSR区域路由协议,ZRDSR(Zone-Routing Based DSR)。在ZRDSR中,每个节点都维护一个区域状态表,并对此区域状态表进行及时更新。节点通过区域状态表能获知自己周围的拓扑情况,并将其用于路由发现和路由恢复过程,从而降低路由发现次数,减小路由发现延迟和路径恢复延迟,仿真实验结果表明,采用区域路由方式的DSR协议路由失效次数比原DSR协议减少了70%以上,极大提高了传输性能。     

密集节点区域的自组织网络路由算法研究

提出一种适用于密集节点区域的自组织网络路由算法——分群归簇DSR路由协议,该算法是针对密集节点区域DSR算法的优化,着重阐述该算法新节点路由查询机制、基于优先级的对数函数退避算法。在分析了现行自组织网络路由算法以及密集节点区域特点之后,改进了DSR路由协议,很好地解决了DSR路由协议在密集节点区域的洪泛等问题。通过CC1110软件设计测试了路由协议的可行性。     

基于DSR协议的区域路由研究

动态源路由（DSR，Dynamic Source Routing）协议是典型的按需AdHoc路由协议。其缺点在于路由发现和维护过程对网络拓扑变化反映较慢，难以满足对延迟要求高的实时视频业务的传输。针对原DSR协议的不足之处．本文在DSR的基础上增加了区域的概念，并给出了DSR区域路由协议，zRDSR（Zone—Routing Based DSR）。在zRDSR中，每个节点都维护一个区域状态表，并对此区域状态表进行及时更新。节点通过区域状态表能获知自己周围的拓扑情况．并将其用于路由发现和路由恢复过程，从而降低路由发现次数，减小路由发现延迟和路径恢复延迟．仿真实验结果表明，采用区域路由方式的DSR协议路由失效次数比原DSR协议减少了70％以上．极大提高了传输性能。     

Ad Hoc网络中按需路由协议的仿真与性能分析

对Ad Hoc网络中两种典型的按需路由协议AODV和DSR协议进行了介绍,对两种协议的路由发现和路由维护过程进行了分析与比较。对两种路由协议在不同的运动场景中进行了比较系统的仿真研究。仿真中选取了数据包的传输率、端到端的平均时延、路由开销这三个指标对AODV和DSR路由协议进行了性能评估,并通过改变节点的个数、分组速率和节点暂停时间来分析比较这些参数的改变对这两个协议性能的影响。     

基于小世界理论和QoS支持的DSR协议

动态源路由(DSR)协议是一种按需路由协议,存在着搜索路由时延较大,没有考虑节点能量等问题。针对DSR协议的这些不足,提出一种改进的DSR(IDSR)协议。IDSR协议首先预测即将发送数据的节点,然后应用小世界理论提前探测出该节点所在网络的拓扑结构。当预测准确时,可以省去路由发现过程,减少传输时延。在进行路由选择时,以时延和剩余能量作为最佳路由的选择标准,提供QoS支持。仿真实验表明:与DSR协议相比,IDSR协议降低了路由开销、平均时延和平均跳数,分组抵达率和网络生存周期也有一定程度提高。     

Ad Hoc网络中基于DSR的节能路由协议研究

移动Ad Hoc网络依靠有限寿命的电池供电,因此有效的节能策略在Ad Hoc网络的研究中显得极为重要,而DSR路由协议由于其在无线网络中的优越性,成为节能路由协议研究的热点.介绍了DSR路由协议以及Ad Hoc网络中节能路由协议的技术,然后围绕节点剩余能量和节点生存时间这两个节能参数,从节能效果、网络生存时同、协议复杂度、延迟等方面对基于DSR的各种节能路由协议进行了详细的对比分析,从而总结出基于DSR的节能路由协议的优缺点,最后指出了Ad Hoc网络节能路由协议研究的发展方向.     

一种基于节点位置信息的Ad Hoc网络路由算法

由于传统的DSR路由协议在路由选择时采取向邻居节点全部转发路由信息的策略,在路由请求过多时,容易引起转发次数过多而导致一些节点能量不足,进而导致网络瘫痪,而且在进行最终路由选择时没有充分考虑整个链路的移动性,所以不一定是最佳路由。文中利用移动Ad Hoc网络节点的位置信息提出了一种对DSR路由协议进行改进的路由算法PBDSR。该算法利用通信节点的位置信息构建路由选择区域,取代了传统DSR协议贪婪转发机制,引用链路总体距离和移动性参数作为路由选择的权,可以选择出一种节能路由。仿真表明可以使网络的生存周期和稳定性得到较大改善。     

Ad Hoc网络中按需路由协议的仿真与性能分析

对Ad Hoc网络中两种典型的按需路由协议AODV和DSR协议进行了介绍,对两种协议的路由发现和路由维护过程进行了分析与比较.对两种路由协议在不同的运动场景中进行了比较系统的仿真研究.仿真中选取了数据包的传输率、端到端的平均时延、路由开销这三个指标对AODV和DSR路由协议进行了性能评估,并通过改变节点的个数、分组速率和节点暂停时间来分析比较这些参数的改变对这两个协议性能的影响.     

On supporting high-throughput routing metrics in on-demand routing protocols for multi-hop wireless networks

Researchers have proposed routing metrics other than hop count, such as ETX (expected transmission count) and ETT (expected transmission time), to find routes with high throughput. These metrics are inherently suitable to be used in source routing protocols such as DSR, because link state information needs to be collected for the calculation of the shortest path. In this paper, we propose an efficient and generalized approach called accumulated path metric (APM) for supporting high-throughput metrics (HTMs) in on-demand routing protocols. One advantage of APM is that it is able to find the shortest path, in terms of a particular metric, without collecting topology information and without running a shortest-path algorithm. This will significantly simplify the existing design of supporting HTMs in DSR. We present a proof of the correctness of APM. Moreover, we address the problem of duplicate RREQ (route request) transmissions with existing HTM schemes and present a broadcast ordering (BO) technique to suppress unnecessary RREQ transmissions. We study the performance of APM and BO in both AODV and DSR, and the results verify the effectiveness of the proposed approaches.     

A novel phase performance evaluation method for particle swarm optimization algorithms using velocity-based state estimation

The searching process of particle swarm optimizations (PSO) includes four states: exploration, exploitation, convergence and jump-out. Performance information of each state is essential to learn the characteristics of different algorithms as well as to improve their performances. To this end, this paper discusses a novel performance evaluation method of each phase in PSOs. Firstly, we propose a velocity-based state estimation (VSE) method, which can estimate the real-time state of PSO variants with less computation. Subsequently, we provide a phase performance evaluation based on VSE, which includes phase identification, two kinds of phase performance indicators and ranking method. Finally, we design hybrid algorithm experiments, to compare phase performance of six main PSO algorithms, and the phase replacement experiments is used to verify the experimental results.     

Cooperative state estimation of multi-agent systems subject to bounded external disturbances

This paper deals with the problem of cooperative state estimation of general linear multi-agent systems subject to heterogeneous bounded external disturbances. This problem specifies the objective that each agent estimates its own state by using only relative information from its neighbours. Because of the existence of external disturbances, the problem is challenging especially when stringent exact estimation performance is desired. To this end, two cooperative estimation protocols are proposed, including the discontinuous nonlinear protocol for exact state estimation and the continuous nonlinear protocol for estimation with bounded errors. The overall network stability and convergence properties are analysed using the Lyapunov function method. A simulation example has also been used to demonstrate the effectiveness of the proposed results.     

基于自适应量化信道信息的机会中继选择研究*

针对协同蜂窝网中基于发送量化信道状态信息的中继选择方案下,目的节点需要不停地获取所有中继处第一跳的信道信息而引起的系统开销问题,提出了一种基于自适应量化信道状态信息的机会中继选择方案。新方案下,仅在第一跳的瞬时信道条件高于预先设置的门限值时,各候选中继发送量化后的信道信息比特。仿真结果表明,改进方案在对系统性能影响不大的同时可以获得较高的比特利用率。同时,随着候选中继数从3增加至5时,中继点处设置的发送门限值可相应从0.267 1提升至0.575 6,这表明新方案具有较好的鲁棒性。     

Improving source routing reliability in mobile ad hoc networks

In this paper, we propose a novel on-demand routing protocol called backup source routing (BSR) to establish and maintain backup routes that can be utilized after the primary path breaks. The key advantage of BSR is the reduction of the frequency of route discovery flooding, which is recognized as a major overhead in on-demand protocols. We define a new routing metric, called the route reliability, and use it to provide the basis for the backup path selection. We use a heuristic cost function to develop an analytical model and an approximation method to measure this metric. Various algorithms for our BSR protocol in the route discovery phase and route maintenance phase have been designed based on this cost function. Extensive simulations demonstrated that our routing strategy has two interesting features: 1) in less stressful situations of lower mobility, BSR has similar performance to DSR, 2) in more challenging situations of high mobility, BSR can improve the performance significantly.     

Exploring optimal combination of a file system and an I/O scheduler for underlying solid state disks

Performance and energy consumption of a solid state disk （SSD） highly depend on file systems and I/O schedulers in operating systems. To find an optimal combination of a file system and an I/O scheduler for SSDs, we use a metric called the aggregative indicator （AI）, which is the ratio of SSD performance value （e.g., data transfer rate in MB/s or throughput in IOPS） to that of energy consumption for an SSD. This metric aims to evaluate SSD performance per energy consumption and to study the SSD which delivers high performance at low energy consumption in a combination of a file system and an I/O scheduler. We also propose a metric called Cemp to study the changes of energy consumption and mean performance for an Intel SSD （SSD-I） when it provides the largest AI, lowest power, and highest performance, respectively. Using Cemp, we attempt to find the combination of a file system and an I/O scheduler to make SSD-I deliver a smooth change in energy consumption. We employ Filebench as a workload generator to simulate a wide range of workloads （i.e., varmail, fileserver, and webserver）, and explore optimM combinations of file systems and I/O schedulers （i.e., optimal values of AI） for tested SSDs under different workloads. Experimental results reveal that the proposed aggregative indicator is comprehensive for exploring the optimal combination of a file system and an I/O scheduler for SSDs, compared with an individual metric.     

Robust face tracking control of a mobile robot using self‐tuning Kalman filter and echo state network

This paper presents a novel design of face tracking algorithm and visual state estimation for a mobile robot face tracking interaction control system. The advantage of this design is that it can track a user's face under several external uncertainties and estimate the system state without the knowledge about target's 3D motion‐model information. This feature is helpful for the development of a real‐time visual tracking control system. In order to overcome the change in skin color due to light variation, a real‐time face tracking algorithm is proposed based on an adaptive skin color search method. Moreover, in order to increase the robustness against colored observation noise, a new visual state estimator is designed by combining a Kalman filter with an echo state network‐based self‐tuning algorithm. The performance of this estimator design has been evaluated using computer simulation. Several experiments on a mobile robot validate the proposed control system. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

基于流形距离的生产状态聚类分析*

现代生产中的大量生产数据蕴藏着丰富的生产过程和质量信息,通过聚类分析可以了解生产状态,进行生产故障诊断或有针对性的质量检测,而经常使用的相似性的度量欧式距离只能反映数据空间分布为球形或超球形的结构特性。难以刻画复杂数据分布特性,将流形距离引入到生产过程状态的聚类分析中,利用标准数据、田纳西—伊斯曼过程和热轧带钢实际生产过程数据对方法的有效性进行验证,进而可以更加有效地了解生产过程的状态。     

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

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

方向性天线对MANETs路由协议的性能影响研究

本文研究了方向性天线对DSR路由协议性能的影响。通过仿真证明了,当使用方向天线进行分组发送时,由于网络节点获取拓扑信息的效率降低,导致协议的分组交付率降低和路由开销数量增加。分析了此现象产生原因,并提出了一个改进方法：由DSR协议参与控制分组发送时使用的天线模式,对部分影响协议性能最为严重的分组采用全向发送,其余分组使用方向天线发送。仿真证明了使用该方法后,可以明显改善协议性能。