DTN-Balance: A Forwarding-Capacity and Forwarding-Queue Aware Routing for Self-organizing DTNs

In delay-tolerant networks (DTNs), intermittent network connectivity and lack of global system information pose serious challenges to achieve effective data forwarding. Most state-of-the-art DTN routing algorithms are based on hill-climbing heuristics in order to select the best available next hop to achieve satisfactory network throughput and routing efficiency. An adverse consequence of this approach is that a small subset of good users take on most of the forwarding tasks. This can quickly deplete scarce resources (e.g. storage, battery, etc.) in heavily utilized devices which degrades the network reliability. A system with a significant amount of traffic carried by a small number of users is not robust to denial of service attacks and random failures. To overcome these deficiencies, this paper proposes a new routing algorithm, DTN-Balance, that takes the forwarding capacity and forwarding queue of the relay nodes into account to achieve a better load distribution in the network. For this, we defined a new routing metric called message forwarding utility combining nodal available bandwidth and forwarding workload. Applying small world theory, we impose an upper bound on the end-to-end hop count that results in a sharp increase in routing efficiency. Queued messages in a forwarding node are arranged by DTN-Balance based on message dropping utility metric for a more intelligent decision in the case of a message drop. The performance of our method is compared with that of the existing algorithms by simulations on real DTN traces. The results show that our algorithm provides outstanding forward efficiency at the expense of a small drop in the throughput.

     

Network queue scheduling algorithm based on self-similar traffic level grading prediction

Self-similarity characteristic of network traffic will lead to the continuous burstness of data in the network.In order to effectively reduce the queue delay and packet loss rate caused by network traffic burst,improve the transmission capacity of different priority services,and guarantee the service quality requirements,a queue scheduling algorithm P-DWRR based on the self-similarity of network traffic was proposed.A dynamic weight allocation method and a service quantum update method based on the self-similar traffic level grading prediction results were designed,and the service order of the queue according was determined to the service priority and queue waiting time,so as to reduce the queuing delay and packet loss rate.The simulation results show that the P-DWRR algorithm can reduce the queueing delay,delay jitter and packet loss rate on the basis of satisfying the different service priority requirements of the network,and its performance is better than that of DWRR and VDWRR.     

具有传输成功率保证的概率路由算法的TTL预测模型

概率路由算法是机会网络中一种常用的路由算法,其TTL的设置将直接影响路由的性能.本文首先利用马尔可夫链对概率路由的转发过程进行建模,并从消息的传输成功率和传输延时方面进行性能评估,不仅可以计算出一个消息从源节点到目的节点所需的传输延时,还可以预测出在给定传输成功率下所需要的最短消息生存周期TTL,这对于TTL的设置具有理论上的指导作用.其次,本文建立的预测模型还可以使一些无法到达目的节点的消息及时被删除,从而减少不必要的转发,达到节约网络资源的目的.最后,在两个真实数据集中的实验结果表明,本文提出的模型能够为概率路由中TTL值的准确设置提供有效参考.     

Tandem Queue Models with Applications to QoS Routing in Multihop Wireless Networks

We consider the problem of quality of service (QoS) routing in multi-hop wireless networks where data are transmitted from a source node to a destination node via multiple hops. The routing component of a QoS-routing algorithm essentially involves the link and path metric calculation which depends on many factors such as the physical and link layer designs of the underlying wireless network, transmission errors due to channel fading and interference, etc. The task of link metric calculation basically requires us to solve a tandem queueing problem which is the focus of this paper. We present a unified tandem queue framework which is applicable for many different physical layer designs. We present both exact and approximated decomposition approaches. Using the queueing framework, we can derive different performance measures, namely, end-to-end loss rate, end-to-end average delay, and end-to-end delay distribution. The proposed decomposition approach is validated and some interesting insights into the system performance are highlighted. We then present how to use the decomposition queueing approach to calculate the link metric and incorporate this into the route discovery process of the QoS routing algorithm. The extension of the queueing and QoS routing framework to wireless networks with class-based queueing for QoS differentiation is also presented.     

Effective Energy Adaptive and Consumption in Wireless Sensor Network Using Distributed Source Coding and Sampling Techniques

Multimedia is the process of handling multiple medium of messages over network with high rate data services in wireless cellular area networks. Communication is the process of exchanging information form one service to another. In wireless networks are significantly growth of affecting network performance and energy consumption. The major problem is end to end delay in each node and meets the quality of services. The followings are considered for implementing wireless sensor network such as reduces the network delay, propagation delay and energy consumption. The senor node can sense the encoding value and reduce the network traffic delay using mitigation method. This paper propose a unique approach to provide simple routing services with reduced traffic delay, end to end delay network performance and to achieve better performance using Distributed Source Coding and Effective Energy Consumption methods. In this paper we use optimal early detection algorithm for improving network performance and energy consumption problem. An iterative Shannon fano and Tuker method is used for finding optimal solution of each node values. Network Simulator-3 is used for simulating network environments and setup the experiments. Our proposed method shows high data rate, good performance and low energy consumptions. The results compare with existing methodologies and performance is good.

     

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

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

Mobile ad hoc network proactive routing with delay prediction using neural network

Existing MANET routing protocols rely heavily on hop count evaluation. Although this is simple and efficient, it sacrifices the potential performance gains obtainable by considering other dynamic routing metrics. In this paper, we propose a delay prediction mechanism and its integration with a MANET proactive routing protocol. We demonstrate our approach of predicting mean queuing delay as a nonstationary time series using appropriate neural network models: Multi-Layer Perceptron or Radial Basis Function. To support MANET proactive routing, our delay prediction mechanism is devised as a distributed, independent, and continuous neural network training and prediction process conducted on individual nodes. We integrated our delay prediction mechanism with a well-known MANET proactive routing protocol—OLSR. The essential part of this integration is our TierUp algorithm, which is a novel node-state routing table computation algorithm. The structure and the key parameters of the resulting extended OLSR, called OLSR_NN, are also discussed. Our simulation shows that because of its capability of balancing the traffic, OLSR_NN is able to increase data packet delivery ratio and reduce average end-to-end delay in scenarios with complex traffic patterns and wide range of node mobility, compared to OLSR.     

一种基于QoS的无线Mesh网络DSR路由优化算法

无线Mesh网络(Wireless Mesh Network,简称WMN)是一种新型的高容量、高速率的分布式宽带无线网络,是下一代无线网络的关键技术。在综合考虑带宽、传输拥塞、网络吞吐量等方面因素,将博弈论的思想引入动态源路由(Dynamic Source Routing,简称DSR)算法中,提出一种基于博弈论的DSR路由优化算法,经分析与仿真表明,该路由能有效减小时延,提高数据传输效率,提升网络传输的服务质量(Quality of Service,简称QoS)。     

基于博弈的协作路由算法

协作虚拟多输入多输出（VMIMO）传输是一种有效的无线传输性能优化技术。将物理层协作VMIMO技术和网络层路由选择技术相结合,设计跨层VMIMO路由选择方案可以利用VMIMO的分集增益,显著地降低网络传输能耗。如何设计VMIMO协作路由协议抵抗无线网络的自私节点和欺骗行为,保证高数据转发率和低传输能耗成为路由设计中的重大挑战。为了提高自私网络的VMIMO路由性能,提出了一种基于重复路由博弈的VMIMO协作路由算法。该算法将网络划分成多个Group、Group间使用VMIMO传输数据。将Group间路由选择过程建模为重复路由博弈过程。为了提高数据转发的成功率,提出适用度函数评估节点参与数据分组转发的信誉。以此为基础,提出基于适用度的路由选择子算法和路由转发子算法。理论证明所提重复路由博弈可达到帕累托最优。仿真实验结果表明本算法可以促进自私节点相互合作,可获得较高的数据转发率,较好地减少数据传输时延以及能量消耗。     

SR架构下的软件定义信息中心网络概率路由策略

传统的TCP/IP路由以IP地址为中心,信息传输效率低下,难以满足网络用户需求.信息中心网络(Information-Centric Network,ICN)开始成为研究热点,ICN以内容为中心,可以高效传输信息.为了利用软件定义网络(Software Defined Network,SDN)和分段路由技术的优势,提高...     

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

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

基于多方议价博弈的机会网络高吞吐量低开销概率路由算法

针对含自私节点的机会网络中现有基于议价博弈的概率路由算法存在的消息单向传递影响转发概率提高、依赖虚拟货币进行交易削弱节点购买力以及消息交易过程有冗余交互的问题,提出一种基于多方议价博弈的高吞吐量低开销概率路由算法——HLPR-MG。HLPR-MG算法通过将节点两两博弈扩展为多方博弈以加快消息转发概率的提升,引入“以物易物”方式增强节点购买力,并且改进现有交互机制以减少博弈次数,从而达到提高网络吞吐量的和减小控制开销的效果。理论分析验证了HLPR-MG算法设计的有效性。仿真结果表明,与基于议价博弈的现有典型路由算法GSCP和BG相比,HLPR-MG算法的吞吐量和消息传送成功率至少提高了3.63%,而控制开销和平均端到端消息时延则分别降低超17.76%和4.03%。     

无线多跳网络快速跨层资源优化分配算法

针对背压路由算法容易造成大量队列积压和收敛速度慢的缺陷,该文研究了无线多跳网络中节点功率受限情况下的联合拥塞控制、路由和功率分配的跨层优化问题。以最大化网络效用为目标,以流平衡条件、功率等为约束条件建模,基于牛顿法提出了一种具有超线性收敛性能的算法,并运用矩阵分裂技术使该算法能够分布式实施。仿真结果表明,该算法在实现网络效用最大化的同时,能够有效提高网络中的能量效用,且能将网络中的队列长度稳定在一个较低水平,降低包传输延时。     

A hybrid approach for the optimization of quality of service metrics of WSN

The core objective behind this research paper is to implement a hybrid optimization technique along with proactive routing algorithm to enhance the network lifetime of wireless sensor networks (WSN). The combination of two soft computing techniques viz. genetic algorithm (GA) and bacteria foraging optimization (BFO) techniques are applied individually on destination sequence distance vector (DSDV) routing protocol and after that the hybridization of GA and BFO is applied on the same routing protocol. The various simulation parameters used in the research are: throughput, end to end delay, congestion, packet delivery ratio, bit error rate and routing overhead. The bits are processed at a data rate of 512 bytes/s. The packet size for data transmission is 100 bytes. The data transmission time taken by the packets is 200 s i.e. the simulation time for each simulation scenario. Network is composed of 60 nodes. Simulation results clearly demonstrates that the hybrid approach along with DSDV outperforms over ordinary DSDV routing protocol and it is best suitable under smaller size of WSN.

     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

A new metric for dynamic routing algorithms

A dynamic routing algorithm that has as its goal the control of congestion in a packet switching network is presented. The algorithm is based in part on the ARPANET SPF algorithm. However, instead of employing a delay metric, the authors make use of a combination of link and buffer utilizations. A detailed simulation model of the ARPANET was constructed to compare the performance of the congestion-based algorithm to the traditional delay-based (SPF) routing algorithm. The results indicate a substantial improvement in the delay and throughput of the network with the congestion-based routing algorithm     

无线网络编码增益感知的低时延路由协议

降低无线网络数据包传递时延对实时应用有重要的意义.该文提出了一种编码增益的计算方法和编码图的简化方法,并基于此提出了编码增益感知的路由协议CGAR(Coding Gain Aware Routing).CGAR利用网络编码增益和无线链路的期望传输次数ETX(Expected Transmission Count)计算传递一个来自新流的数据包所需要的时间,并以此为选路度量,旨在降低数据传递时延.仿真试验表明,CGAR的时延优于COPE和DCAR协议.     

低轨卫星星座快速响应链路损毁路由算法

设计高效弹性的卫星路由算法是未来低轨(Low Earth Orbit, LEO)卫星通信技术的一个重要发展方向。为解决低轨卫星星座网络中星间链路发生故障后存在的传输中断和数据安全问题,提出了一种低轨卫星星座快速响应链路损毁路由算法(Quick-response Link Destruction Routing Algorithm for LEO Satellite Constellation, QRLDRA)。QRLDRA以星座可预测拓扑作为星间路由计算基础,增加星地回传路由设计,快速将星间链路异常回传至地面计算中心处理;引入多优先级动态队列,根据节点链路状态调整星间链路不同数据传输的优先级;综合路由计算、路由上注、链路检测等功能,完成对拓扑变化的及时响应。通过仿真实验与传统算法的比较发现,所提算法有效提高了数据端到端传输的成功率,为用户业务服务质量(Quality of Service, QoS)提供了可靠保障。     

Queue‐based multiple path load balancing routing protocol for MANETs

Congestion in the network is the main cause for packet drop and increased end‐to‐end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue‐based multiple path load balancing routing protocol. This protocol discovers several node‐disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node‐disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end‐to‐end delay, and routing overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

Stable routing protocol based on fuzzy logic system in vehicular ad hoc networks

Vehicular ad‐hoc networks have several roles in alert messages dissemination between vehicles in danger, the most important role is to provide helpful information for drivers (eg, road traffic state). But, some performance improvements are frequently needed in terms of routing. Hence, several clustering approaches have been proposed to optimize the network services. These approaches are based on increasing data delivery, reducing data congestion, and dividing the traffic into clusters. However, a stable clustering algorithm is always required in order to ensure the data dissemination in a dense, mobile, or a large‐scale environment. Therefore, in this paper, we have proposed a stable routing protocol based on the fuzzy logic system, which can deliver alert messages with minimum delay and improve the stability of clusters structure by generating only a small number of clusters in the network. In this work, the fuzzy logic system has been used to create the clusters and select a cluster head for each cluster. We have used the network simulator (NS2) to generate the results. As a result, we could reduce the cluster head changes and increase the cluster member lifetime compared with recent approaches.