面向无线ad hoc网络的一种平面t-支撑图

拓扑控制算法的目标是为无线ad hoc网络确定合适的底层拓扑。在无线ad hoc网络中，几何路由协议是一类重要的路由协议，为了保证消息转发的可达性和限制路由长度，它要求底层拓扑满足连通性、平面性和稀疏性，并且是原拓扑的t-支撑图。本文提出了一种新的几何结构AUDel图，并提出了两种低通信开销的构造AUDel图的局部拓扑控制算法。理论分析表明，AUDel图满足上述要求，我们提出的拓扑控制算法的通信歼销小于其它构造平面t-支撑图的拓扑控制算法。模拟实验验证了以上结论。     

ad hoc网络组播对于DoS攻击畦抵抗策略分析

与固定有线网络相比,无线ad hoc网络动态的拓扑结构、脆弱的无线信道、网络有限的通信带宽以及节点兼备主机和路由功能等特点,使得网络容易遭受拒绝服务（DOS）攻击。文章针对ad hoc网络的组播应用在抵御DoS攻击方面的不足,提出外部和内部两种组播DoS泛洪攻击模型,同时针对ad hoc网络组播组内的攻击提出相应的两种抵抗策略和具体实现步骤。     

MANET路由选择协议性能分析

Ad hoc网是由一组无线移动节点在没有任何现存网络基础设施或集中管理的情况下建立的暂时的无线移动网络。由于网络节点的自组织性、多跳性和高速移动使得网络拓扑经常变化,导致路由开销增大。首先讨论了Ah hoc网络中路由选择协议的分类策略。介绍了几种典型的Ad hoc路由选择协议。通过ns2仿真工具,分析比较了DSDV、AODV和TORA等3种典型的ad hoc路由选择协议在不同环境下的性能,并给出了结论。     

一种集成ad hoc与蜂窝的4G新型网格（IACG）

在第四代移动通信系统( 4G)中,采用ad hoc网络为核心技术,以满足2 0 1 0年后市场对大容量、高带宽、无缝漫游的需求,是近一两年来全球业界提出的一种崭新的技术思路和发展方向。本文根据4G工程原则和ad hoc网络框架,构建了一种新型的集成ad hoc与蜂窝网格( Integrated Cellular and Ad hoc Grid,IACG)。在此基础上,研究提出了其容量提高方案、移动预测模型、网络动态变化中的容错设计、基于代理的可靠路由协议以及低功耗无线多层优化协议,解决了当前ad hoc网络如何在移动通信领域走向实用化的关键技术     

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

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

一种基于信道阻力的Ad hoc网络多路径路由算法

该文提出了一种基于信道阻力的Ad hoc网络多路径动态源路由算法。算法中定义了信道阻力的概念,并以信道阻力为依据来进行多条路径的流量分配,由于信道阻力计算中综合考虑了链路质量的各个度量参数,因此能够根据各条路径的传输能力合理分配数据流量。NS2环境下的仿真表明,新算法能够有效地平衡网络负载,提高网络的吞吐量。     

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

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

移动Ad hoc网络路由协议分析

Ad hoc无线网络是一种自组织，自适应和自管理的网络。由于其组网的灵活性，节点的分布性，不依赖任何固定的网络实体等优点，在工业、商业、军事等领域有着不可替代的作用。本文首先介绍了ad hoc网络的特点，然后对表驱动和按需路由协议进行了分析，比较了现存的ad hoc路由协议的优缺点，最后提出了ad hoc的发展建议。     

Ad hoc网络中基于节能的AODV路由算法改进

Ad hoc网络是一种没有中心的特殊自组织网络，目前，移动Ad hoc网络已经成为研究的热点。由于其移动性，路由问题一直是其关键的课题．另一方面，由于网络中的移动节点是便携式设备，能量有限，因此，ad hoc的节能问题也日益受到关注．文中试图提出一种基于节能的路由策略，在原有的AODV的路由算法的基础上，通过调整节点的发射功率，改变路由代价函数，能动的关闭无线接口，来达到节能的目的。文中完整描述了新策略，并给出了NS-2下的仿真结果，从结果可以看出．改进后的AODV在节能方面效果明显。     

Ad hoc网络在智能家居中的应用研究

本文构建了采用脉冲超带宽无线传输技术,基于ad hoc网络架构的智能家居系统,给出了智能家居系统的体系结构与模块的组成,并且对所建立的家庭网络协议与网络管理功能进行了全面的分析与阐述.针对家庭区域网络的节点特征,设计了一种适合家庭网络的路由协议,有效地降低了网络的负载,提高了传输的效率,为智能家居的具体实现提供了一种可行的方案.     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

Statistical Multipath Queue-Wise Preemption Routing for ZigBee-Based WSN

Nowadays, wireless sensor network (WSN) is an important component in IoT environment, which enables efficient data collection and transmission. Since WSN consists of a large number of sensor nodes, network congestion can easily occur which significantly degrades the performance of entire network. In this paper a novel scheme called SMQP (Statistical Multipath Queue-wise Preemption) routing is proposed to balance the load and avoid the congestion for ZigBee-based WSN. This is achieved by employing statistical path scheduling and queue-wise preemption with multiple paths between any source and destination node. NS2 simulation reveals that the proposed scheme significantly improves the QoS in terms of delivery ratio, end-to-end delay, and packet delivery ratio compared to the representative routing schemes for WSN such as ad hoc on-demand distance vector and ad hoc on-demand multipath distance vector scheme.     

Load balancing maximal minimal nodal residual energy ad hoc on-demand multipath distance vector routing protocol (LBMMRE-AOMDV)

Mobile ad hoc multipath routing protocols have attracted considerable research attention over the past decade, but the limited battery life of nodes remains a significant obstacle. Many researchers have designed multipath routing protocols that balance the data load between the generated paths, but there is always some tradeoff between conserving the nodes’ energy and delivering data. In this paper, I introduce a load balancing (LB) multipath routing protocol based on maximal minimal nodal residual energy (MMRE) in the ad hoc on-demand multipath distance vector (AOMDV) protocol. The proposed LBMMRE-AOMDV protocol evaluates the generated paths based on the maximal nodal residual energy and the actual number of packets that could be transmitted over that path without depleting the nodes’ energy. The performance of the proposed protocol was tested and evaluated using different scenarios and performance metrics, and achieved good results compared with MMRE-AOMDV and AOMDV. In particular, the proposed method can increase packet delivery and decrease the number of dead nodes, thus reducing the probability of network portioning.     

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.     

Multipath routing in mobile ad hoc network with probabilistic splitting of traffic

Multipath routing is a burning issue in mobile ad hoc network due to its various advantages over single path routing. Some of these advantages are load balancing, bandwidth aggregation, and fault tolerance. Multipath routing means multiple paths exist between source and destination pair. Many works discussed in section 2 addressed queuing delays, but none of them suggested queuing delay for multiple path deliveries of data in mobile ad hoc network context. In this paper, we have designed a mathematical model to compute delay and throughput for multipath. Our model follow the network of M/M/1 queues, and we have applied Burke’s theorem to calculate the queuing delay of the packet in mobile network scenario. This model can be used to estimate delay and throughput of an individual path. Further, through the analysis the best path for data delivery out of available multiple paths as well as the multipath path can be used simultaneously for data delivery to the destination. Simulation result shows that splitted traffic multiple paths outperform splitted traffic. Therefore, our model is useful for design and analysis of ad hoc network. The simulation work has been carried out in Qualnet simulator.     

SMORT: Scalable multipath on-demand routing for mobile ad hoc networks

Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol.     

Spatial Energy Balancing Through Proactive Multipath Routing in Wireless Multihop Networks

In this paper, we investigate the use of proactive multipath routing to achieve energy-efficient operation of ad hoc wireless networks. The focus is on optimizing tradeoffs between the energy cost of spreading traffic and the improved spatial balance of energy burdens. We propose a simple scheme for multipath routing based on spatial relationships among nodes. Then, combining stochastic geometric and queueing models, we develop a continuum model for such networks, permitting an evaluation of different types of scenarios, i.e., with and without energy replenishing and storage capabilities. We propose a parameterized family of energy balancing strategies and study the spatial distributions of energy burdens based on their associated second-order statistics. Our analysis and simulations show the fundamental importance of the tradeoff explored in this paper, and how its optimization depends on the relative values of the energy reserves/storage, replenishing rates, and network load characteristics. For example, one of our results shows that the degree of spreading should roughly scale as the square root of the bits middot meters load offered by a session. Simulation results confirm that proactive multipath routing decreases the probability of energy depletion by orders of magnitude versus that of a shortest path routing scheme when the initial energy reserve is high     

无线自组织网络中一种拥塞意识的多径路由算法

提出了无线自组织网络中一种拥塞意识的多径路由算法。该算法在路由发现过程中,综合节点的队列长度和路径跳数来动态确定路由请求消息的转发概率,可以在保证路由请求消息有一定送达率的条件下,降低路由开销;在路径选择和流量分配过程中,综合考虑节点的队列长度和路径质量作为路由度量,发现流量高吞吐量低拥塞路径,并基于该度量值进行流量分配。仿真结果显示,所提出的多径路由算法能有效提高网络性能。     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.     

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.