Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.     

基于网络编码的机会网络高效路由算法

针对采用Epidemic机制的机会网络路由算法在数据分组传送阶段存在通信冗余的问题,提出了一种基于网络编码的高效路由算法--NCBER(network-coding-based epidemic routing）。NCBER在传送数据分组的过程中使用主动异或网络编码和多播,并取消了 Request（请求）控制分组,从而减少数据分组的转发次数和控制分组数量,降低网络开销,缩短分组传输时延。理论分析和仿真结果表明,NCBER 算法在网络开销和数据分组端到端时延性能方面优于经典的Epidemic路由算法及其改进算法MRRMR（message redundancy removal of multi-copy routing）,并且使数据传送成功率保持在100%。     

A learning automata and clustering-based routing protocol for named data networking

Named data networking (NDN) is a new information-centric networking architecture in which data or content is identified by a unique name and saved pieces of the content are used in the cache of routers. Certainly, routing is one of the major challenges in these networks. In NDN, to achieve the required data for users, interest messages containing the names of data are sent. Because the source and destination addresses are not included in this package, routers forward them using the names that carried in packages. This forward will continue until the interest package is served. In this paper, we propose a routing algorithm for NDN. The purpose of this protocol is to choose a path with the minimum cost in order to enhance the quality of internet services. This is done using learning automata with multi-level clustering and the cache is placed in each cluster head. Since the purpose of this paper is to provide a routing protocol and one of the main rules of routing protocol in NDN is that alternative paths should be found in each path request, so, we use multicast trees to observe this rule. One way of making multicast trees is by using algorithms of the Steiner tree construction in the graph. According to the proposed algorithm, the content requester and content owners are the Steiner tree root and terminal nodes, respectively. Dijkstra’s algorithm is one of the proper algorithms in routing which is used for automata convergence. The proposed algorithm has been simulated in NS2 environment and proved by mathematical rules. Experimental results show the excellence of the proposed method over the one of the most common routing protocols in terms of the throughput, control message overhead, packet delivery ratio and end-to-end delay.     

软件定义无人机自组网高效自适应路由维护机制

为解决软件定义无人机自组网路由维护存在的控制开销和数据包延迟偏大的问题,基于现有的OpenFlow协议提出了一种高效自适应的软件定义无人机自组网路由维护机制( Efficient and Adaptive Software-defined Unmanned Aerial Vehicle Ad Hoc Network R...     

3D-VANET中基于模糊逻辑和Q学习的拓扑感知路由协议

城市三维车载自组网（Three-Dimensional Vehicular Ad-hoc Network,3D-VANET）中往往存在多种道路形式,每种道路网络拓扑变化特点各异,平面路由协议不能根据道路特点动态调整选路策略,不宜直接用于3D-VANET,为此设计了一种基于模糊逻辑和Q学习的拓扑感知路由协议。该协议通过模糊逻辑方法感知网络拓扑变化与网络负载情况动态调整信标间隔,以平衡邻节点信息准确性与控制开销成本。在此基础上,采用Q学习算法对网络建模,根据链路质量以及链路质量变化调整Q学习算法参数,以灵活选择下一跳转发节点,更好适应网络拓扑的频繁变化。仿真结果表明,与对比协议相比,该协议有利于降低控制开销,同时提高包投递率和减少平均端到端时延。     

Robust multi-path routing for dynamic topology in wireless sensor networks

Wireless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing (DSR) by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.     

Load balancing routing with queue overflow prediction for WSNs

The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

     

Multipath Security Aware Routing Protocol for MANET Based on Trust Enhanced Cluster Mechanism for Lossless Multimedia Data Transfer

The dynamic nature of mobile nodes of ad hoc network is mostly affected by security problems which reduce data forwarding rate in multimedia sources. Due to the rapid growth of wireless applications, the different multitalented routing protocols are proposed in recent years. But the recent protocols are not efficient for multimedia applications, till now, specific security aware routing protocols are not proposed for multimedia data transfers. In this paper, we proposed trust enhanced cluster based multipath routing (TECM) algorithm. We use energy efficient PSO algorithm used to create cluster formation and cluster head, super cluster head are selected from trust values, which compute form proposed TECM algorithm. The multi trust factors are used for trust computation, such as frame/packet loss ratio, frame/packet forward energy, frame/packet receiving energy, routing overhead, received signal strength, frame/packet forward rate, average forward delay and protocol deviation flag. We then combine proposed TECM algorithm with standard multipath OLSR protocol (TECM-OLSR) to analyze the performance of proposed algorithm. The simulated results show that proposed TECM-OLSR protocol is very effective in terms of loss and delivery rate, delay, routing overhead and network lifetime compare to FPNT-OLSR.     

基于限制广播域和节点剩余能量的按需路由算法研究

按需路由协议AODV的路由发现使用洪泛方式的扩散法,导致网络超负荷运行和拥塞,而且在选择转发路由时,总是选择最少跳数的路由,造成无线传感网络中节点能量不均,减少网络寿命.本文提出了AODV-DE算法,该算法引入广播域的概念,限制RREQ分组的转发范围,同时避免使用剩余能量低的节点转发数据分组,选择路由路径时选择总剩余能量最多的路径进行信息的传送.仿真结果表明,AODV-DE协议在路由开销、网络寿命和端到端的延迟这三个方面表现出了优势.     

A hybrid multiagent routing approach for wireless ad hoc networks

Wireless ad-hoc networks are infrastructureless networks that comprise wireless mobile nodes able to communicate each other outside wireless transmission range. Due to frequent network topology changes in one hand and the limited underlying bandwidth in the other hand, routing becomes a challenging task. In this paper we present a novel routing algorithm devoted for mobile ad hoc networks. It entails both reactive and proactive components. More precisely, the algorithm is based on ant general behavior, but differs from the classic ant methods inspired from Ant-Colony-Optimization algorithm [1]. We do not use, during the reactive phase, a broadcasting technique that exponentially increases the routing overhead, but we introduce a new reactive route discovery technique that considerably reduces the communication overhead. In the simulation results, we show that our protocol can outperform both Ad hoc On-demand Distance Vector (AODV) protocol [2], one of the most important current state-of-the-art algorithms, and AntHocNet protocol [5], one of the most important ant-based routing algorithms, in terms of end-to-end delay, packet delivery ratio and the communication overhead.     

移动自组网AOMDV协议应对衰落改进方案

在移动自组网中,信道条件直接决定了数据包传输的可靠性.为有效应对信道衰落,提出一种基于信道状态、可实时监控链路的路由方案来改进AOMDV协议.该方案在路由寻找过程中,以信道平均无衰时间（ANFD）作为路由度量来选择稳定的链路,并采用一种根据信道状态信息抢先切换的策略来维护连接的可靠性.仿真结果表明,通过该改进方案,AOMDV协议在网络吞吐量、平均端到端时延、路由控制开销和数据包投递率等性能上均有改善.     

移动Ad Hoc网络中的负载均衡路由算法

移动Ad Hoe网络(MANET)中的路由算法应尽量使网络负载均衡,不均衡不仅导致正在通信的路由由于过度拥塞而引起数据包延时过大、吞吐量下降,而且会使拥塞节点的能量提前耗尽,从而加剧网络拓扑结构的变化及节点之间的不公平性。本文对目前提出的一些负载均衡路由算法进行了简要比较和分析,在此基础上,指出了目前负载均衡路由算法中存在的一些问题,并提出了一个实现负载均衡路由算法的一般模型。基于该模型,文中提出了一种简单的负载均衡路由算法。仿真结果表明,负载均衡路由算法比未考虑负载均衡的路由算法具有更高的数据包投递率和更低的数据包传输延时。     

A novel hierarchical model for vehicular traffic regulation

The aim of the research is to regulate the vehicular traffic in the most effective and efficient way in Vehicular Adhoc Networks (VANET). The challenges faced by the existing networks are ripple effect of reclustering, communication complexity, mobility, throughput and delay in an urban environment. Moreover unpredictable topology changes in VANET, obstruct expected packet delivery ratio and leads to congestion by overheads for link maintenance. The existing routing techniques suffer from excessive loss of data, delay and need for continuous monitoring where group member’s loss their link in randomwaypoint mobility scenarios. In this paper, a novel hierarchical model combining the features of hierarchical clustering, hybrid mobility model and location based 2hop Multicast Flooding (L2MF) for data forwarding has been proposed. By comparing the proposed protocol with previous protocols, the enhanced performance in packet delivery ratio, control overhead, and end-to-end delay has been proved.     

基于局部梯度场的VANET路由研究

车载自组织网络(VANET,Vehicular Ad hoc Network)近几年受到高度关注,同时多跳安全消息路由成为VANET应用的核心问题之一。试图借助梯度场的方法,研究VANET网络安全消息的定向、受限空间及拓扑动态变化条件的传播机制,以达到快速准确地传播安全消息的目的。提出了一种局部梯度场的路由协议(LGFR,Local Gradient Field Routing),并与城市场景下的贪婪边界无状态路由(GPSR,Greedy Perimeter Stateless Routing)和无线自组网按需平面距离矢量路由(AODV,Ad hoc On-DemandDistance Vector Routing)进行了对比。仿真结果表明,LGFR在数据包丢包率、数据包端到端平均时延和全局数据吞吐量方面具有较好的性能。     

Integrated Social and QoS Trust-Based Routing in Delay Tolerant Networks

We propose and analyze a class of integrated social and quality of service (QoS) trust-based routing protocols in mobile ad-hoc delay tolerant networks. The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only QoS trust properties but also social trust properties to evaluate other nodes encountered. We prove that our protocol is resilient against bad-mouthing, good-mouthing and whitewashing attacks performed by malicious nodes. By utilizing a stochastic Petri net model describing a delay tolerant network consisting of heterogeneous mobile nodes with vastly different social and networking behaviors, we analyze the performance characteristics of trust-based routing protocols in terms of message delivery ratio, message delay, and message overhead against connectivity-based, epidemic and PROPHET routing protocols. The results indicate that our trust-based routing protocols outperform PROPHET and can approach the ideal performance obtainable by epidemic routing in delivery ratio and message delay, without incurring high message overhead. Further, integrated social and QoS trust-based protocols can effectively trade off message delay for a significant gain in message delivery ratio and message overhead over traditional connectivity-based routing protocols.     

QoS-aware multi-path video streaming for urban VANETs using ACO algorithm

Drivers can be provided with several beneficial services associated with video streaming in a vehicular ad-hoc network (VANET). Given the dynamic topology and high mobility of VANETs, a single path cannot support the required quality of service (QoS). To maximize global QoS metrics, a two-path model is proposed based on a disjoint algorithm to forward sub-streams over diverse paths from the transmitter to the receiver vehicle. In this solution, the video information spread in separate paths is categorized based on their priority. For this purpose, the protocol for transmitting each kind of video data should be selected cautiously. The present study aims to propose an ant colony optimization-based technique to establish the primary and secondary paths and enhance the QoS of routing paths. To achieve this goal, the QoS routing issue is formulated mathematically as a problem of constrained optimization. Moreover, to achieve high-quality video streaming, inter-frames are transmitted over the user datagram protocol and intra-frames are transmitted over the transmission control protocol (TCP). TCP transmission delays are also minimized using a TCP-ETX algorithm for selecting appropriate paths. According to the simulation results, the proposed two-path solution can be used to improve the quality of video streaming and to enhance the performance in terms of end-to-end delay, packet delivery ratio, and overhead. In this way, the proposed method can outperform several prominent routing algorithms such as adaptive QoS-based routing for VANETs, geographic source routing (GSR), intersection-based geographical routing protocol, and efficient GSR.

     

GDSR：一种基于车载自组网的分组路由协议

针对DSR路由协议因节点频繁移动,路由发现和路由维护过程频繁发生,导致数据传输的时延增加和丢包率增加的问题.在DSR路由协议基础上,提出一种带有分组的DSR路由协议（GDSR）.该协议通过K-medoids聚类算法合理地选择组头,使得分组路由协议更加适合车载自组网的多变的拓扑结构.仿真结果表明,带有分组的GDSR路由协议能够降低数据传输的端到端的时延和丢包率.     

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (caching and multiple path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.     

A new distributed routing protocol using partial traffic information for vehicular ad hoc networks

In vehicular ad hoc networks, road traffic information can be used to support efficient routing. However, dissemination of up-to-date global road traffic information usually consumes considerable network resources and may also lead to the scalability issue. On the other hand, the highly dynamic nature of road traffic information makes it difficult to collect and disseminate such information in a timely fashion. Outdated information can lead to inefficient routing decisions and thus degraded routing performance. This paper proposes a distributed routing protocol using partial accurate routing information (RPPI). In RPPI, each node uses accurate local traffic information in its local zone and statistical traffic information in remote areas for route selection, which can significantly reduce the communication overhead. Simulation results show that RPPI can achieve better routing performance in terms of end-to-end packet delivery ratio and end-to-end packet delivery delay as compared with existing work.     

移动自组网AODV协议的优化设计与仿真测试

在提出移动自组网AODV优化协议——AODV—PC的基础上，对该路由协议的设计，在NS2中的实现、仿真和性能分析的整个过程做了详细的阐述。通过仿真表明，引入路径收集机制的AODV—PC协议在提高分组发送成功率、降低路由开销、缩短端端延迟方面效果比另一种带路径收集机制的AODV-PA协议更加显著。