A Survey on Routing Algorithms for Opportunistic Mobile Social Networks

Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.     

动态频谱接入网络的路由技术研究

新一代宽带无线通信网络迫切需要引入认知无线电技术以提升系统性能。针对动态频谱接入(DSA)的无线网络环境,首先探讨了其路由技术研究所面临的新挑战,然后以体现动态频谱管理特征的独特分类方式,分析了其路由技术研究的最新进展,最后展望了路由技术研究的未来发展方向。     

认知无线电网络路由研究综述

 在对近期认知无线电网络路由研究成果进行研究的基础上,从邻居节点发现、“耳聋”、邻居节点消失、路由发现和跨层设计等5个方面,对认知无线电网络路由研究面临的重要挑战进行了分析;从研究方法的角度,对路由研究中对公共控制信道的依赖、路径延时,以及需要考虑的技术指标进行了讨论。最后,从介质、信道、节点和网络等4个方面,对路由研究场景设计进行了归纳总结;并从路由优化方案和路由拓扑算法协议两个方面,对主要研究成果进行了分析和讨论。     

Algorithms for Dynamic Routing in All-Optical Networks

In this paper, we have studied a number of algorithms for routing in all-optical wavelength routed networks. We have considered situations where a lightpath is dynamically created in response to a request for communication and the WDM channels constituting the lightpath are reclaimed when the communication is over. We have looked at two schemes for dynamic wavelength allocation. In the first scheme we have assumed the existence of a central agent to maintain a database of existing lightpaths where the central agent attempts to generate a new lightpath in response to a request for communication. In the second scheme, we attempt to generate a new lightpath using a distributed algorithm. In the first scheme we have exploited the existence of multiple paths between any pair of nodes in a network in order to reduce the blocking probability. For the second scheme, we have proposed three distributed strategies to determine, if possible, a lightpath when there is a request for communication. Each of these strategies have their advantages and disadvantages in terms of the expected blocking probability and the set-up time. We have studied the performances of both the schemes using Monte Carlo simulation.     

Routing in Distributed Cognitive Radio Networks: A Survey

Cognitive Radio Networks (CRNs) have been receiving significant research attention recently due to their ability to solve issues associated with spectrum congestion and underutilization. In a CRN, unlicensed users (or Secondary Users, SUs) are able to exploit and use underutilized licensed channels, but they must evacuate the channels if any interference is caused to the licensed users (or Primary Users, PUs) who own the channels. Due to the dynamicity of spectrum availability in CRNs, design of protocols and schemes at different layers of the SU’s network stack has been challenging. In this article, we focus on routing and discuss the challenges and characteristics associated with it. Subsequently, we provide an extensive survey on existing routing schemes in CRNs. Generally speaking, there are three categories of challenges, namely channel-based, host-based, and network-based. The channel-based challenges are associated with the operating environment, the host-based with the SUs, and the network-based with the network-wide SUs. Furthermore, the existing routing schemes in the literature are segregated into three broad categories based on the relationship between PUs and SUs in their investigation, namely intra-system, inter-system, and hybrid-system; and within each category, they are further categorized based on their types, namely Proactive, Reactive, Hybrid, and Adaptive Per-hop. Additionally, we present performance enhancements achieved by the existing routing schemes in CRNs. Finally, we discuss various open issues related to routing in CRNs in order to establish a foundation and to spark new interests in this research area.     

光突发交换网络中的偏射路由算法

首先对偏射路由算法的基本概念、竞争解决机制及其优缺点进行了论述,针对其存在的缺陷详细分析了两种改进的偏射路由算法,重点研究了改进的偏射路由算法的实现机制,并对今后偏射路由算法的研究重点和发展趋势表达了作者的观点。     

无线网状网络路由安全协议综述

无线网状网络(Wireless Mesh Networks,WMN)是近年来得到长足发展的一项新兴技术。它是一种分布式的无线网络,并将Ad hoc以及WLAN的优势结合起来,因此具有很广阔的应用前景。然而,目前的WMN技术还不够成熟,存在诸多安全问题,如何完善网络中的安全机制就成了目前研究的重点之一。本文从介绍WMN的基本结构开始,逐步介绍其安全性所面临的问题,以及各种安全的路由协议,最后对一些路由安全协议进行对比分析。     

Multipath Routing Techniques in Wireless Sensor Networks: A Survey

Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are especially critical in the resource constrained system such as WSNs. In this paper we provide a survey of the state-of-the-art of proposed multipath routing protocols for WSNs, which are classified into three categories, infrastructure based, non-infrastructure based and coding based, based on the special techniques used in building multiple paths and delivering sensing data. For each category, we study the design of protocols, analyze the tradeoff of each design, and overview several representing protocols. In addition, we give a summery of design goals, challenges, and evaluation metrics for multipath routing protocols in resource constrained systems in general.     

Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: (1) routing decisions are made locally by network nodes without the centralized information of the entire network topology; (2) routing decisions minimize throughput loss under a single-link attack with respect to different session models; and (3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings.     

Routing Correlated Data in Wireless Sensor Networks: A Survey

Sensory data gathered from sensor nodes in physical proximity tend to exhibit strong correlation. To minimize such redundancy and hence curtail the load in wireless sensor networks with a goal to conserve energy, effective in-network fusion schemes have been extensively proposed in the literature. To this end, routing schemes supporting data fusion are extremely important as they dictate where and when sensory data streams shall intersect with each other and thus fusion will be performed. In this article we briefly articulate this problem and classify recently proposed routing schemes supporting data fusion in wireless sensor networks into three categories: routing-driven, coding-driven, and fusion-driven. We also give an overview of various algorithms in each category by summarizing their design approaches, benefits, and drawbacks.     

容断网络中的组播路由算法研究

容断网络是一种新型的网络架构,主要用来解决频繁发生分离的网络场景中的数据通信.它为很多面临挑战的网络 (如星际网络、传感器网络、陆地移动网络等) 提供了互操作性,同时也可以满足特殊场合的应用,如军事战场、灾难营救、深空通信、边远地区的因特网接入等等.文章给出了一种新的容断网络中组播路由算法分类,并剖析了现有主要的组播路由算法.为容断网络组播的路由算法进一步研究提了一定的参考价值.     

路由表快速查找算法

路由器中路由表查找速度是当前英特网发展的瓶颈之一。归纳了设计中路由表快速查找算法时需考虑的问题,分析并比较了各种典型算法的原理。     

基于社会上下文认知的机会路由算法

无线智能设备的普遍使用促进了机会网络的发展.这类网络处于间歇性连接状态,以自组织方式转发数据.路由协议设计时考虑节点携带者的社会特征和日常行为能够提高机会网络的性能.提出了一种基于社会上下文认知的机会路由算法SCOR,该算法利用网络中的社会上下文信息,通过BP神经网络模型预测节点的移动行为.路由决策过程充分考虑移动节点活动的时间和空间属性,当接收节点与发送节点同时处于网络中的同一连通域时,数据转发采用同步方式,否则采用异步方式.仿真分析和实验结果表明,与其它经典算法相比,SCOR算法提高了数据成功转发的比率,减少了网络的开销.     

Routing in Wireless Sensor Networks Using Optimization Techniques: A Survey

Wireless Personal Communications - Over the past few decades, one of the important advancements in wireless communication is low cost and limited power devices known as wireless sensor networks...     

Fast Routing Algorithms for Lightpath Establishment in Wavelength-Routed Optical Networks

In this paper, we study shortest-path routing in wavelength-routed optical networks with an objective to optimize the average-case running time for path computation. Four fast routing algorithms are proposed for dynamically computing the shortest lightpaths or semilightpaths in a network with or without wavelength converters. To reduce the average-case running time for path computation, sequential search, backward routing, and informed search are used in the algorithm design. Simulation results show that the proposed algorithms can significantly reduce the average-case computational overhead for path computation as compared with existing algorithms.      

WDM光传送网的选路和波长分配算法

文章综述了波分复用(WDM)光传送网的选路和波长分配(RWA)算法;考虑了两种需求情况一种是从建立光路的需求出发,另一种是从运送分组业务的需求出发;还概述了RWA设计中要考虑的附加问题,包括波长变换、抗毁和服务策略.     

Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change.     

Efficient Algorithms for Reliability Analysis of Planar Networks?A Survey

We survey some recent polynomial-time algorithms for the exact computation of network reliability. The algorithms apply to several classes of planar networks, which include series-parallel, inner-cycle-free, inner-four-cycle-free and planar cube-free. We describe these classes and discuss the related polynomial algorithms for computing their reliability.     

IP over WDM网中的综合选路算法

研究了IP over WDM网中,当节点不具备波长变换能力并且配备有限光收发器对时,如何利用综合选路(IR)算法为到达业务请求建立标签交换路径(LSP)。提出一种新颖的辅助图模型(AGM)表示网络的当前状态,基于AGM提出一种动态IR算法-最小光收发器对法(MTA)。MTA总是选择占用光收发器对最少的通路来建立LSP,仿真结果表明：与已有算法相比,MTA可以降低全网的阻塞率,从而提高业务通过率,并且有利于减少业务连接所经光／电变换的次数。     

无线传感器网络定位算法综述

无线传感器网络(WSN)是一个多学科的研究领域,具有很广泛的应用前景,其中,WSN的定位是非常重要的研究方向。介绍了国内外研究机构在WSN定位方面的研究进展,并对这些工作进行了归纳和总结。将每种定位算法按照需不需要测距分为两大类,而且在具体算法中讨论了其以下几个特征,包括:需要/不需要锚节点、集中式/分布式、固定/移动等。