车联网环境下基于节点认知交互的路由算法

针对车联网（IoV）环境下消息传输效率低下、网络资源开销较大等诸多问题，提出一种适用于城市交通场景下基于车辆节点认知交互的路由算法。首先，依据信任理论提出节点认知交互度的概念，并在此基础上对车联网中的车辆节点进行分类，赋予它们不同的认知交互度初值；同时还引入车辆节点交互时间、交互频率、车辆节点物理间隔距离、间隔跳数以及消息生存时间等影响因子，进而构建了车辆节点认知交互评估模型。基于该模型计算并更新节点的认知交互度，并通过比较对应车辆节点间的认知交互度值来选取认知交互度相对较高的邻居节点作为中继节点进行消息转发。仿真实验结果表明，与Epidemic和Prophet路由算法相比，所提路由算法有效提高了消息投递率并降低了消息投递时延，同时显著降低了网络资源的开销，有助于提升车联网环境的消息传输质量。     

节点度估计和静态博弈转发策略的Ad Hoc网络路由协议

针对Ad Hoc网络路由发现过程中广播路由请求分组导致的广播风暴问题，提出了一种基于节点度估计和静态博弈转发策略的Ad Hoc网络路由协议NGRP.NGRP考虑边界影响，采用分段函数的思想将网络场景分为中心、边和角区域，分别估算网络中节点在不同区域的节点度，避免了周期性广播Hello消息获取节点度导致的开销；NGRP路由请求分组的转发采用静态博弈转发策略，利用节点度估算参与转发路由请求分组的节点数量，将转发和不转发作为策略集合，设计效益函数，通过纳什均衡获得节点转发路由请求分组的转发概率，从而减少了路由请求分组广播过程中产生的大量的冗余、竞争和冲突，提高了路由发现过程中路由请求分组的广播效率.运用NS-2对协议的性能进行大量的仿真，结果表明：NGRP的分组投递率、路由开销、MAC层路由开销和吞吐率这4项指标明显优于AODV+FDG，AODV with Hello和AODV without Hello协议.     

应急情况下最少转发节点的传感器网络组播路由树算法

在抢险救灾等应急情况下,传感器网络的节点能量更为有限。为减少无用转发的能量消耗,利用无线信道的广播特性,根据广播子树删除思想,提出一种基于最短路由树、具有最少转发节点的组播路由树生成算法。对该算法进了证明和详细分析,并针对实际需要,给出使用范围更广泛的分布式实现方法。仿真分析说明,算法的分布式实现方法可减少ODMRP的转发节点数,大大降低数据发送次数,接收成员节点较多时尤为明显。最少转发节点的组播路由树的网络总开销最小,是延长网络生存时间的有效方法。     

Towards best practice implementation and application of models for analysis of water resources management scenarios

Water resources management models are widely used to evaluate planning or operational scenarios to support water resource management decision-making. However, the approaches to modelling used in the past have led to problems, such as modellers having difficulty establishing the credibility of their model with stakeholders, and stakeholders having difficulty understanding and trusting model results. A best practice approach to the implementation and application of water resources management models based on a quality assurance procedure is an appropriate means of overcoming these difficulties, and there are a number of guidelines and papers available promoting this approach. However, guidance in these on the use of models to analyse water resource planning scenarios is limited or not provided. This paper therefore provides guidance on the implementation and application of water resources management models with an emphasis on scenario analysis. This guidance is principally intended for practising modellers, and also for peer reviewers and stakeholders such as managers, decision makers, and community-based groups. Adoption strategies and recommendations for future directions are also discussed.     

A fast IP lookup scheme for high speed routers

Abstract

One of the key design issues for the next generation of IP routers is the IP lookup mechanism. IP lookup is an important action in a router, that is, to find the next hop for each incoming packet with a longest‐prefix‐match address in the routing table. In this paper, we propose an IP lookup mechanism with the number of memory accesses for an IP lookup being one in the best case and being four in the worst case. The forwarding table needed by our mechanism is small enough to fit in the SRAM. For example, a large routing table with 40000 routing entries can be compacted to a forwarding table of 260KBytes in our scheme.     

A venues‐aware message routing scheme for delay‐tolerant networks

With their proliferation and increasing capabilities, mobile devices with local wireless interfaces can be organized into delay‐tolerant networks (DTNs) that exploit communication opportunities arising out of the movement of their users. As the mobile devices are usually carried by people, these DTNs can also be viewed as social networks. Unfortunately, most existing routing algorithms for DTNs rely on relatively simple mobility models that rarely consider these social network characteristics, and therefore, the mobility models in these algorithms cannot accurately describe users’ real mobility traces. In this paper, we propose two predict and spread (PreS) message routing algorithms for DTNs. We employ an adapted Markov chain to model a node's mobility pattern and capture its social characteristics. A comparison with state‐of‐the‐art algorithms demonstrates that PreS can yield better performance in terms of delivery ratio and delivery latency, and it can provide a comparable performance with the epidemic routing algorithm with lower resource consumption. Copyright © 2013 John Wiley & Sons, Ltd.     

基于SDN的端到端无缝MPLS组网技术研究

针对MPLS技术在运营商应用中存在问题的分析,结合SDN思想和概念,将网络抽象为“网络转发”、“业务控制”和“运营支撑”三个平面,提出端到端无缝MPLS组网的解决方案。     

软件定义网络安全研究

软件定义网络（SDN）采用控制和转发的分离架构,使研究者可以通过软件实现任意的网络控制逻辑,而不需对网络设备本身进行修改,具备极强的灵活性,已经在路由决策、网络虚拟化、无线接入、云计算数据中心网络等领域得到研究和应用,成为一项热点技术。但SDN在蓬勃发展的同时,也引入了新的安全风险,带来新的安全问题。另一方面,SDN也给传统安全技术以冲击,带来创新的网络安全应用发展的机会。鉴于此,结合SDN网络架构的特点综述了SDN安全的研究现状,包括SDN安全风险分析和安全技术及应用,并思考了SDN对信息安全的意义。     

虚拟化路由交换平台转发可重构技术分析

开放性和平台化是网络交换设备体系结构的发展趋势,虚拟化路由交换平台是一种能灵活支持现有业务和未来业务的新型虚拟化网络设备。文中对虚拟化路由交换平台基本功能进行了抽象定义,分析了转发处理技术的重要性,而近年来硬件性能的持续提高,特别是网络处理器和FPGA对可编程和可重构的支持日益完善,为实现网络虚拟化创造了良好的条件。最后分析了虚拟化路由交换平台转发处理功能的3种不同实现方案,并重点对基于FPGA和网络处理器的实现方案进行了阐述。     

Cooperative strategies of wireless access technologies: A game-theoretic analysis

The wireless Internet has to overcome the problem of spectrum scarcity as the number of mobile equipments could increase even by an order of magnitude in the next decade; the cooperation of mobile devices is foreseeable as a feasible solution to the problems. There exists a large body of literature on opportunistic ad hoc networking including Pelusi et al. (2006) [25], Chen et al. (2006) [26], Hui et al. (2005) [27]; however, the impact of the location of the devices on their access method selection is not yet appropriately dealt with. In this paper, we address this issue based on game-theoretic analyses. The key contribution of our work is threefold. First, we model the access method selection of mobile devices by extending the classical forwarding game with position, mobility, and availability of the devices. Second, we apply the model in game-theoretic analyses to better understand the optimal cooperation strategies in the presence of heterogeneous wireless technologies. We further extend our framework to include uncertainty. Finally, we present the applicability of the model in a cognitive radio scenario where complex structures of parameters are included.