基于禁忌搜索的QoS路由算法

多约束的QoS路由问题是NP完全问题,该文将禁忌搜索算法引入多约束QoS路由计算中,提出了一种基于禁忌搜索的QoS路由算法QoS_TS。该算法通过设置长期记忆禁忌表和短期记忆禁忌表以及有效的评价函数,保证了算法实现过程中多样化的有效搜索。文章给出了算法实现的具体流程。实验仿真表明,该算法具有较高的搜索效率和较快的收敛性,通过该算法得到的路由不但满足QoS约束要求,同时可以均衡链路负载,减少路由拥塞。     

基于遗传算法的多参数QoS网络路由算法

目前许多应用都有不同的高质量QoS保障需求,但QoS路由问题是一个非常复杂的问题,而且在两条独立的路径之间寻找可行路径是NP难题。同时,高速网络的QoS路由算法必须具有适应性、灵活性和智能性。论文提出了一种基于遗传算法的QoS路由算法,算法中选择两个QoS路由参数进行路由的优化,仿真结果表明该方法比传统的路由算法及单QoS参数的路由算法具有更高的性能。     

QoE路由算法综述

QoE(Quality of Experience)路由算法主要是从用户角度对网络进行路由,与仅仅考虑网络参数的QoS路由算法不同,QoS路由选择算法无法满足用户体验质量QoE的需求,而QoE路由选择算法能够保障用户体验质量。文章主要讨论了QoE路由算法与QoS路由选择算法的关系,并讨论已有的QoE路由算法。     

DPA:一种动态环境下QoS单播路由算法

目前Internet网络环境下,网络参数的随时变化容易造成路由过期,从而使提供的QoS路由无效,为此提出了一种适合参数动态变化的单播QoS路由算法(DPA),该算法在路径代价随时间不断变化的情况下能够自主地选择最优路由节点,解决多约束QoS单播路由选择不精确的问题.实验表明,本路由算法自适应性和扩展性较好,同时在路由选择方面比传统的路由算法能够提供更好的QoS路由.     

Ad Hoc网络中QoS路由协议算法的研究

Ad Hoc网络是一种由移动节点组成、拓扑结构动态变化的自组织网络,在Ad Hoc网络中实现带有QoS约束的路由是当今研究的重要问题.QoS路由协议算法中最主要的三个方面是:QoS参数的选取,对单向链路的支持和路由协议的多播功能.本文首先介绍了应用较广的几类QoS路由协议的算法,接着选取了以上三个方面中几个典型的QoS路由协议,详细介绍了它们的特点以及算法思想,并对协议的性能进行了具体分析,分析结果对研究QoS路由协议有一定的指导意义.     

基于模糊智能模型的QoS路由算法研究

说明了利用模糊智能方法来实现QoS路由算法的原因和优点，给出模糊路由算法模型并加以解释，通过软件仿真以及将模糊路由算法和静态，动态最短路由算法作比较，说明了模糊QoS路由算法的优越性。     

基于量子遗传算法的QoS路由算法

多约束的QoS路由问题是NP完全问题.量子遗传算法是基于量子计算理论的新遗传算法,具有种群多样性、收敛速度快和全局寻优的特点.将量子遗传算法引入多约束QoS路由计算,提出了一种基于量子遗传算法的QoS路由算法,给出了算法实现的方法和具体流程.实验结果表明,通过该算法得到的QoS路由不但能满足QoS约束要求,同时可以均衡链路负载,减少路由拥塞.     

确保安全QoS的WFS路由算法

中的最关键的功能组件之一就是基于QoS的路由，从本质上看QoS路由实际就是端点到端点的带结点条件限制和边条件限制的最短路径问题，在文[1]中指出这种问题是NP完全的。本文研究对丢失敏感对延时不敏感的QoS路由模型——确保安全QoS的路由算法，并提出了一种新启发式算法；首先，我们讨论QoS一般模型，然后利用图论中的WFS算法求解QoS路由，该算法的时间复杂度为O(nlog(n)+n×d×K_0)，优于化前在该问题上的求解算法。     

双向搜索蚁群算法在QoS单播路由中的应用

近几年来,网络的QoS路由问题已经成为一个研究热点。考虑到现有解决方法的一些不足,引入了一种改进的蚁群算法并应用于QoS单播路由问题。该算法针对网络路由问题,对原算法的信息素更新策略进行了修改,同时结合了网络化简策略和双向搜索策略。与现有QoS路由算法比较的仿真结果表明,该算法能够满足QoS单播路由的要求,并且具有较好的最优解求解能力、较快的收敛速度和较强的鲁棒性。     

Ad Hoc网中基于熵的长寿分布式QoS路由算法

在分析Ad Hoc网的单播QoS路由问题的基础上,提出了一种新的Ad Hoc网的分布式QoS路由算法--EBLLD(entropy-based long-life distributed QoS routing)算法.其核心思想是提出了衡量路径稳定性的新尺度--熵,并利用熵来选择长寿的路径,减少了重建路由(或路由修复)的次数,从而在Ad Hoc网的网络拓扑频繁变化的环境中尽可能地提供QoS保证.同时该算法还利用本地组播机制和启发函数排序过滤和熵尺度排序过滤减小了其路由消息开销.仿真结果表明,EBLLD算法能够以较小的路由消息开销获得较高的路由成功率.此外,EBLLD算法具有可扩展性,可以应用于较大规模的Ad Hoc网中.     

一种跨平台的自组网路由协议实现框架

为了减少不同平台上自组网(MANET)路由协议的重复实现和保证协议在不同平台下实现的正确性与一致性,设计并实现了一种可以在Windows、Linux,以及NS-2模拟器上运行的自组网路由协议框架,并用典型的自组网反应式路由协议AODV对其可行性进行了验证。该框架设计中将协议实体与周边环境抽象开来的方法具有通用性,可以适用于其他自组网路由协议甚至其他网络协议(例如TCP),也可以扩展支持其他操作系统。     

MANET中基于动态资源管理的QoS路由模型研究

由于时变链路和节点移动的无规则性导致了常规路由协议在MANET环境下无法正常工作,在MANET中确立QoS路由和保障QoS路由传输是促使该网络走向实用的关键。针对这一情况,在通用QoS框架和INSIGNIA结构基础上,提出了一种基于动态资源管理的QoS路由模型,该模型通过QoS路由建立模块和动态资源调整机制来实现MANET中路由的QoS保障。模拟结果显示该模型可以有效地支持MANET中满足QoS需求的多媒体信息传输。     

Robust and secure routing scheme for wireless multihop network

Mobile ad hoc network (MANET) is an appealing technology that has attracted lots of research efforts. On-demand routing protocol such as AODV may suffer from frequent topological changes. Due to frequent communication failures, multipath MANET is preferred than single-path MANET in many applications as former is used for achieving robustness and load balancing and improving reliability. Although multipath MANET is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; MANETs are known to be particularly vulnerable to security attack. The paper presents a design of robust and secure framework for multipath MANET. In this paper, we propose not only a robust multipath routing protocol but also an extended security scheme. We discuss security analysis for proposed security scheme. And we also conduct simulation to evaluate such a framework through different performance metrics. Results show that the proposed routing protocol achieves better performance in terms of various metrics than other protocols.     

A qualitative comparison evaluation of the greedy forwarding strategies in Mobile Ad Hoc Network

The Mobile Ad Hoc Network (MANET) is wireless network which provides communication among wireless mobile hosts without the need of any standing network infrastructure. In such networks, and to facilitate communication between participating nodes, every node has to offer routing services. Routing in MANET is responsible for selecting and forwarding packets along optimal paths. Finding an optimal route is a crucial task in MANET where routes tend to be multi-hop. Many routing protocols have been proposed in literature. However, few of them are efficient when the network is sparse and highly dynamic. Position-based routing and forwarding provides the opportunity for improving the efficiency and performance of the existing MANET routing strategies. This research work presents an extensive overview of geographic forwarding techniques in MANET. In particular, it focuses on the presentation of the basic operation mode of geographic forwarding, which is greedy forwarding. Meanwhile, this research work presents a qualitative evaluation of the most current and popular greedy forwarding strategies used with position based routing protocols. Furthermore, the findings have been used to conclude the most appropriate unicast forwarding policy for future research efforts.     

Hybrid trust and weight evaluation-based trust assessment using ECK-ANFIS and AOMDV-REPO-based optimal routing in MANET environment

Many researchers have been inspired to work on diverse challenges by a particularly favourable platform, namely mobile ad hoc networks (MANET) routing optimization. However, the lack of trust assessment is one of MANET’s main flaws. As a result, trust-based routing has received increasing attention in MANET over the last few years. Hence, the majority of recent work has focused on the development of routing protocols for security enhancement in a hostile environment. However, on the MANET environment, these protocols have many weaknesses and are also not that much secure. Hence, the primary goal of this study is to design a framework for balancing multiple performance measures in order to find the optimal multipath routing solution. In this scheme, we have employed the exponential cauchy kernelized adaptive neuro-fuzzy inference system (ECK-ANFIS) focused trust assessment with hybrid trust (HT) evaluation and optimal MANET routing. The ECK-ANFIS evaluates the trust after the nodes are initialised where, HT and the weight value, which are estimated for each node throughout the evaluation. The performance of the proposed mechanism has been measured using the various metrics defined in the existing protocols and also proved the superiority of the scheme by comparing it with other related ones.

     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.     

Standardisation advancements in the area of routing for mobile ad-hoc networks

Mobile Ad hoc Networks (MANETs) are self-organized and fully distributed networks that rely on the collaboration of participating devices to route data from source to destination. The MANET paradigm is expected to enable ubiquitous mobile communication and thus the proliferation of pervasive applications. The MANET Working Group (WG) of the Internet Engineering Task Force (IETF) is responsible for standardizing an appropriate Internet Protocol (IP) based routing protocol functionality for both static (mesh) and dynamic (mobile) wireless ad hoc network topologies. In this paper, we provide a background on the possibility to use MANETs for enabling future pervasive internet and innovative ubiquitous services. We also describe the work achieved by the MANET WG thus far on the area of secure unicast and multicast routing for MANETs. We also examine non-IETF work on this area, chiefly based on adaptive and hybrid routing. The paper then presents comparative performance evaluations of discussed routing protocols. It is mainly observed that there is a need for adaptive hybrid routing approaches in order to support future innovative and pervasive applications. Consequently, we present our conclusions.     

Uncertainty analysis framework for trust based routing in MANET

MANET (Mobile Ad hoc Network) has distinctive characteristics like node mobility, broadcast nature of wireless communication, and peer to peer data transfer. Due to these characteristics uncertainty is an integral part of MANET behavior. Uncertainty quantification is important for performance evaluation and better decision making in MANET. Packet dropping is a serious issue in MANET which degrades the performance of the network to a great extent. The packet dropping attack increases uncertainty in the network communication and eventually of the MANET. Trust based routing mechanisms are useful for neutralizing packet dropping attack. There are many existing trust based routing protocols which uses uncertainty for precise trust calculations. Thus, trust and uncertainty are closely related to each other. The paper proposes Uncertainty Analysis Framework (UAF) for MANET, it calculates the network Belief, Disbelief, and Uncertainty (BDU) values. The UAF framework integrated into different trust variants of AODV protocol which use direct trust, indirect trust, and global trust. The research work discovers impact of different trust models on MANET BDU using various mobility models. Experimental analysis shows that, trust based routing protocols show average 3 % gain in packet delivery ratio and at least 5 % increase in the network belief.     

Route manipulation aware Software-Defined Networks for effective routing in SDN controlled MANET by Disney Routing Protocol

In MANET network management, the Software-Defined Networking (SDN) plays a vital role in terms of controller plane and data plane. It is always easy to manage the data communication over the MANET because of logically centralized control on the SDN. Since the dynamic route on MANET, are controls the packets and changes the route between the source to destination alternatively. Hence the maintenance of real-time SDN analysis-based application planes is a crucial process. To maintain the effective MANET communication over the Software-Defined Network, it essential to improve the control and data plane process on the SDN controlled MANET based OpenFlow switching procedure. Nevertheless, SDN allows for route interaction against security threads. In this research article, the four stages were suggested to preserve the security measures in packet-based data transmission that are conceived in MANET. In this article, an SDN controlled MANET based OpenFlow switching scenario for effective security threading is proposed. The major part played by an SDN controlled MANET in bringing about a result of being effective without wasting time and energy on routing. The proposed Distinct Network Yarning (DISNEY) routing protocol for SDN controlled MANET overcomes the congestion communication on MANET routing. To decrease performance degradation, efficient routing is maintained by the route matrix manipulation table. This routing scheme helps to find the optimal routing with a secure and intelligent manner. The proposed result was compared to existing approaches. As a result, the proposed illustration to be improved by routing and data transmission. In comparison to the proposed method achieves a better ratio for packet transmission delay, throughput, and data transmission rate.     

基于P2P的大规模MANET多路径路由模型研究*

由于P2P网络与移动自组织网络存在许多相似特性,提出基于P2P的大规模移动自组织网络多路径路由模型,以提高移动自组织网络可扩展性和路由效率。新模型通过掩码轮换匹配机制发现多路径路由,并按照最优传输权重机制进行流量分配,达到动态感知移动自组织网络物理拓扑变化和平衡网络负载的目的。仿真实验证明,新模型能够适用于大规模移动自组织网络环境,并且有效提高了大规模移动自组织网络路由性能。