基于ADE优化的IPMSM全速域无传感器控制

为了实现内置式永磁同步电机(IPMSM)全速域的无传感器控制和切换速域的平滑过渡,提出了一种基于自适应差分进化(ADE)算法优化的复合控制方法。分别在零低速域、中高速域采用旋转高频电压注入法和滑模观测器法来对电机转速和转子位置进行估算,并在切换速域采用基于ADE算法的权重系数优化法来实现上述两种控制方法的平滑切换,从而实现IPMSM全速域无传感器控制。仿真结果表明:提出的复合控制方法能够实现电机全速域的无感控制和切换速域的平滑过渡,且具有良好的稳定性。

An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks

A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively.

Multipath Source Self Repair Routing Algorithm for Mobile Ad Hoc Networks

A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.

A reliable routing algorithm based on fuzzy Petri net in mobile ad hoc networks

A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.

Genetic Algorithm Routing Protocol for Mobile Ad Hoc Network

Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.

Ants-Based On-Demand Routing Algorithm for Mobile Ad Hoc Networks

An ants-based on-demand routing algorithm （AORA） specialized for mobile ad hoc networks is proposed. AORA measures the network＇s traffic information including delivery time, route energy etc. by the continuous delivery of data packets, then calculates the compositive parameter for each route which can be seen as the stigmity and uses it to choose the comparatively optimal route in real time. To adjust the weight of each traffic information, the algorithm can meet the different demand of the network＇s user. Multipath source self repair routing （MSSRR） algorithm and dynamic source routing （DSR） can be seen as the special samples of AORA. The routing overhead is not increased in this algorithm. By using simulation, it can be seen that the performance of AORA is better than that of DSR in all scenarios obviously, especially the delivery fraction is increased by more than 100 96.

A Novel Multi-Level Trust Algorithm for Mobile Ad Hoc Networks

Firstly, a multilevel trust algorithm for MANET （mobile ad hoe networks） is presented in this paper and the trust level is defined as a three-tuple type in this multilevel trust algorithm. The paper introduces the multilevel trust into MANET, thereby controlling restricted classified information flows among nodes that have different trust levels. Secondly, the infrastructure of MANET that suit to our multi-level trust is presented, Some conclusions are given at lastly.

Adaptive Backoff Algorithm for IEEE 802.11 MAC Protocol

A Mobile Ad Hoc Network (MANET) is a collection of mobile nodes that can communicate directly over wireless media, without the need for a preconfigured infrastructure. Several approaches have been suggested to improve Quality of Service (QoS) in IEEE 802.11-based MANETs through modifying some of the IEEE 802.11 Medium Access Control (MAC) algorithms, such as the backoff algorithm that is used to control the packets collision aftermath. In this work, an adaptive IEEE 802.11 backoff algorithm to improve QoS is de-veloped and tested in simulations as well as in testbed implementation. While the Binary Exponential Backoff (BEB) algorithm deployed by IEEE 802.11 reacts based on individual packet transmit trials, the new algo-rithm takes the history of successive packet transmit trials into account to provide a better QoS performance. The new algorithm has been tested against the legacy IEEE 802.11 through simulations using QualNet and a Linux-based testbed comprising a number of stations. The performed tests have shown significant im-provements in performance, with up to 33.51% improvement in delay and 7.36% improvement in packet delivery fraction compared to the original IEEE 802.11.

Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions,po-tential high loss rate and the decentralized architecture. To support long and high-quality streams,one viable approach is that a media stream is partitioned into segments,and then the segments are replicated in a network and served in a peer-to-peer(P2P) fashion. However,the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm(HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks,such as low transmitting latency,less jitter times,and low unnecessary traffic. We quantify the performance of our scheme in terms of response time,jitter times,and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.

Handoff Algorithms for Integrated Ad Hoc and Mobile Cellular Systems

Multi-criteria handoff algorithms have been playing a more important role than the traditional handoff algorithms.In order to balance the satisfaction of users and the efficiency of networks,it is necessary to develop new technologies to improve the validity of handoff algorithms.Intelligent and optimized handoff algorithms in hybrid networks that integrate Ad hoc and mobile cellular systems are well-adaptive and robust.They are able to implement handoffs adaptively,according to specific multi-factors such as different Quality of Service(QoS)requirements,network states and mobile node conditions in the future hybrid networks.Therefore,these intelligent and optimized algorithms can make more effective handover decision,and accordingly improve the system’s performance.The future research will tackle intelligent or optimized vertical handoff algorithms for integrated Ad hoc and mobile cellular networks to improve their whole system performance.

Design and analysis of a network coding algorithm for ad hoc networks

Network coding is proved to have advantages in both wireline and wireless networks. Especially, appropriate network coding schemes are programmed for underlined networks. Considering the feature of strong node mobility in aviation communication networks, a hop-by-hop network coding algorithm based on ad hoc networks was proposed. Compared with COPE-like network coding algorithms, the proposed algorithm does not require overhearing from other nodes, which meets confidentiality requirements of aviation communication networks. Meanwhile, it does save resource consumption and promise less processing delay. To analyze the performance of the network coding algorithm in scalable networks with different traffic models, a typical network was built in a network simulator, through which receiving accuracy rate and receiving delay were both examined.The simulation results indicate that, by virtue of network coding, the proposed algorithm works well and improves performance significantly. More specifically, it has better performance in enhancing receiving accuracy rate and reducing receiving delay, as compared with any of the traditional networks without coding. It was applied to both symmetric and asymmetric traffic flows and, in particular, it achieves much better performance when the network scale becomes larger. Therefore, this algorithm has great potentials in large-scale multi-hop aviation communication networks.

Performance Analysis of Grid Based AODV Routing Algorithm for AD Hoc Wireless Networks

In many traditional On Demand routing algorithms in Ad hoc wireless networks, a simple flooding mechanism is used to broadcast route request (RREQ) packets when there is a need to establish a route from a source node to a destination node. The broadcast of RREQ may lead to high channel contention, high packet collisions, and thus high delay to establish the routes, especially with high density networks. Ad hoc on Demand Distance Vector Routing Protocol (AODV) is one among the most effective Reactive Routing Protocols in MANETs which use simple flooding mechanism to broadcast the RREQ. It is also used in Wireless Sensor Networks (WSN) and in Vehicular Ad hoc Networks (VANET). This paper proposes a new modified AODV routing protocol EGBB-AODV where the RREQ mechanism is using a grid based broadcast (EGBB) which reduces considerably the number of rebroadcast of RREQ packets, and hence improves the performance of the routing protocol. We developed a simulation model based on NS2 simulator to measure the performance of EGBB-AODV and compare the results to the original AODV and a position-aware improved counter-based algorithm (PCB-AODV). The simulation experiments that EGBB-AODV outperforms AODV and PCB-AODV in terms of end-to-end delay, delivery ratio and power consumption, under different traffic load, and network density conditions.

结合多路梯度与重排序的AD-Census立体匹配算法

针对局部立体匹配算法在深度不连续和弱纹理区域匹配精度低,且容易受到噪声干扰的问题,提出一种结合多路梯度与重排序的AD-Census立体匹配算法。对传统的AD-Census变换进行改进,重排序不同尺度变换窗口中的像素,取中值作为中心像素点计算Hamming距离,使其对噪声具有更强的鲁棒性,并将八方向梯度信息相融合进行代价计算以增强可靠性;采用十字交叉域和4路径扫描线优化进行代价聚合,提高匹配精度;采用赢家通吃法则进行视差计算,同时引入多步骤视差优化策略得到最终的视差图。在Middlebury测试平台提供的标准立体图像上,所提算法的平均误匹配率低至4.62%,与经典和新颖算法相比,匹配精度明显提高,具有更强的稳健性。

面向大规模飞行自组网的NBATMAN-ADV路由协议

飞行自组网是当前研究的热点,当无人机节点规模较大时,大量的路由开销可能会导致网络瘫痪,因此路由协议的设计具有挑战性。针对大规模无人机场景,首先提出利用统一连通支配集算法构建虚拟骨干网,目的是减少路由洪泛的节点数;其次在骨干节点上部署和运行NBATMAN-ADV路由协议,利用物理层数据的接收信号强度指标和信噪比评价链路质量,在减少路由开销的同时,能够快速感知链路的变化情况。仿真结果表明,较传统的先验式路由协议如优化链路状态路由和目的节点序列距离矢量,该路由协议在数据包交付率、端到端时延和吞吐量上均有明显的提升。在通信模块上的实验结果表明,该路由协议在多跳时延方面有较好的性能。

基于AD采样的软件滤波改进算法研究

文章旨在探讨基于AD采样的软件滤波改进算法,以有效去除跳变干扰数据并提高数据稳定性.在分析滤波算法原理和应用的基础上,介绍了一种改进算法,该算法在跳变干扰数据去除方面表现出色,并在数据处理的稳定性方面取得显著进展.通过实验验证了该算法的有效性,并提出了进一步的研究方向.

Ad hoc网络中的路由算法

Adhoc网络近年来的快速发展可望成为下一代网络的核心.在此背景下,对于相关路由算法进行全面的概括和总结对于Adhoc网络的研究具有很重要的意义.本文介绍和分析了当前Adhoc网络中的各种主要路由算法,包括表驱动路由协议和源发起按需路由,特别是源发起按需路由.对于源发起按需路由的时间复杂性、通信复杂性等作了较为详细的分析和性能比较,给出了各自的缺点和优点分析.同时进一步研究了Adhoc网络中的不同算法的QoS问题,不仅考虑到时延、带宽,也考虑到链路或路由的稳定性、功率消耗等.在文章的后面部分,介绍了作者在QoS路由算法方面的一些研究思路以及多路由算法最新的发展趋势.

一种用于Ad Hoc网络的分布式证书撤销算法

分析了AdHoc网络安全基础设施存在的问题,提出了一种用于AdHoc网络的分布式证书撤销算法.该算法把证书的撤销分为无条件撤销和有条件撤销两类.利用撤销矩阵R(T)和权值向量W(T)分别对网络节点之间的撤销关系和网络节点的可信度进行描述,并引入撤销影响因子α来限制单个节点撤销操作的力度,增加多节点联合撤销的力度,以提高撤销的可靠性.通过权值迭代关系式逐步实现网络运行过程中权值的不断更新变化.最后定量分析了分布式证书撤销算法的可靠性,以及撤销影响因子α的取值和其对证书撤销可靠性的影响.

Ad hoc网络中一种基于权值的分簇算法

adhoc网络是一种多跳、自组织网络.网络中的无线节点无规律的移动,使得网络的路由选择、QoS保障等问题面临新的难题.网络分层管理体系为解决这些难题提供了一种有效的手段.Adhoc网络逐渐呈现分级化的趋势.本文提出了一种基于权值的分簇算法,并通过仿真测试证明了这种方法的有效性.

移动Adhoc网络的体系结构和分簇算法

Ad hoc网络是一种多跳移动自组织网络 ,它需要特殊的体系结构来支持路由、管理和其他网络功能。首先介绍了 Ad hoc网络的一些显著特点 ,然后详细分析了 Ad hoc网络的体系结构。接着介绍了一种性能较好的分簇算法并讨论了簇维护机制和码字分配等问题。