主动层次多目通信路由模型

许多应用需要IP多目通信.在Internet大规模应用IP Multicast时,有效的路由是关键.这样的多目路由协议必须是有效的、可伸缩的和增量可配置的.但是传统的Internet路由对性能是不敏感的,不能平衡负载和处理拥塞.现有的大多数多目通信路由协议不仅负责数据转发,还负责路由树的构造,这给路由器带来了极大的复杂性,而且协议的配置是手动的、费时费钱的工作.该文提出一个主动层次式Multicast路由的体系结构,采用主动网络技术将多目通信路由协议的数据转发和控制机制分开,根据链路的状态信息用主动报文控     

Intra-domain routing convergence with centralized control

The decentralized control scheme for routing in current IP networks has been questioned, and a centralized routing scheme has been proposed as an alternative. In this paper, we compare the convergence of centralized control scheme with decentralized link-state routing protocols. We first review the architectural advantages and challenges of centralized control. Thereafter, we identify and discuss the components of the convergence time in both schemes. We present how to achieve fast routing convergence in networks with centralized control. In particular, we analyze how to distribute forwarding information efficiently. Finally, we perform simulation studies on the convergence time for both real and synthetic network topologies and study the impact of control element location, link weights, and number of failures on the convergence time. The results show that the centralized control scheme can provide faster routing convergence than link-state routing protocols.     

Link-state routing without broadcast storming for multichannel mesh networks

A link-state routing protocol tailored for multichannel mesh networks is proposed. One drawback of using multichannel communications is the high overhead involved in broadcast operations: a transmitter should transmit a broadcast packet to all channels that may be occupied by receivers. This makes certain broadcast-intensive mechanisms, such as link-state routing, difficult to implement. The link-state routing protocol proposed in this paper is tailored for multichannel mesh networks by minimizing the broadcast overheads. This is achieved by a special set of nodes, called cluster-heads. We have implemented our protocol on a multichannel mesh network test bed and compared its performance with an AODV-like reactive routing protocol, also tailored for multichannel mesh networks. The measurements show that the proposed link-state routing protocol provides transient communications with comparable or better performance. Ways to improve the performance of the proposed routing with infrastructure access is also discussed.     

OSPF的区域类型、路由类型和末梢区域的配置

OSPF路由协议是一种典型的链路状态(Link-state)的路由协议,一般用于同一个路由域内。在这里,路由域是指一个自治系统(Autonomous System),即AS,它是指一组通过统一的路由政策或路由协议互相交换路由信息的网络。在这个AS中,所有的OSPF路由器都维护一个相同的描述这个AS结构的数据库,该数据库中存放的是路由域中相应链路的状态信息,OSPF路由器正是通过这个数据库计算出其OSPF路由表的,作为一种链路状态的路由协议,OSPF将链路状态广播数据LSA(Link State Advertisement)传送给在某一区域内的所有路由器,这一点与距离矢量路由协议不同。运行距离矢量路由协议的路由器是将部分或全部的路由表传递给与其相邻的路由器。     

一种基于Android的OLSR路由协议实现方案

OLSR路由协议是一种适用于移动Ad Hoc网络的主动式路由协议,是对经典链路状态路由算法优化的结果。文中在深入剖析OLSR路由协议工作原理的基础上,结合Android操作系统的特点实现了OLSR路由协议的总体设计方案。首先,对移动Ad hoc网络做了简要的概述,其次详细阐述了OLSR路由协议各个模块的实现方案,最终在Android平台上实现了OLSR路由,并搭建可控的拓扑网路,在Google手机终端上做了详细的测试和验证工作。测试的结果表明文中实现的基于Android的OLSR协议是正确可行的。     

探讨在路由器上配置OSPF路由协议

主要介绍链路状态路由协议的相关基本内容,并在Cisco路由器上配置链路状态路由协议OSPF。     

A reliable QoS aware routing protocol with slot assignment for mobile ad hoc networks

A mobile ad hoc network (MANET) is a collection of mobile hosts that form a temporary network on the fly without using any fixed infrastructure. Recently, the explosive growth in the use of real-time applications on mobile devices has resulted in new challenges to the design of protocols for MANETs. Chief among these challenges to enable real-time applications for MANETs is incorporating support for quality of service (QoS), such as bandwidth constraints. However, MANETs having a high ratio of topology change make routing especially unstable; making stability is an important challenge, especially for routing having a quality of service provision. In this paper, we propose a reliable multi-path QoS routing (RMQR) protocol with a slot assignment scheme. In this scheme, we examine the QoS routing problem associated with searching for a reliable multi-path (or uni-path) QoS route from a source node to a destination node in a MANET. This route must also satisfy certain bandwidth requirements. We determine the route expiration time between two connected mobile nodes using global positioning system (GPS). Then, two parameters, the route expiration time and the number of hops, are used to select a routing path with low latency and high stability. Simulation results show that the proposed RMQR protocol have some outstanding properties when compared with Lin's [Lin C-R. On-demand QoS routing in multihop mobile networks. In: Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies (INFOCOM), vol. 3(22–26), 2001, p. 1735–44], Liao's [Liao W-H, Tseng Y-C, Wang S-L, Sheu J-P. A multi-path QoS routing protocol in a wireless mobile Ad Hoc network. Telecommunication Systems 2002;19(3–4):329–47], and Chen's [Chen Y-S, Tseng Y-C, Sheu J-P, Kuo P-H. An on-demand, link-state, multi-path QoS routing in a wireless mobile Ad-Hoc network. Computer Communications 204;27(1):27–40] protocols.     

Robust and secure routing scheme for wireless multihop network

Mobile ad hoc network (MANET) is an appealing technology that has attracted lots of research efforts. On-demand routing protocol such as AODV may suffer from frequent topological changes. Due to frequent communication failures, multipath MANET is preferred than single-path MANET in many applications as former is used for achieving robustness and load balancing and improving reliability. Although multipath MANET is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; MANETs are known to be particularly vulnerable to security attack. The paper presents a design of robust and secure framework for multipath MANET. In this paper, we propose not only a robust multipath routing protocol but also an extended security scheme. We discuss security analysis for proposed security scheme. And we also conduct simulation to evaluate such a framework through different performance metrics. Results show that the proposed routing protocol achieves better performance in terms of various metrics than other protocols.     

基于规则引擎的无线传感器网络动态路由系统

无线传感器网络路由协议往往是针对特定的任务类型和网络状态设计的,动态路由系统可以在运行时,自适应地选择性能最优的路由协议.利用规则引擎设计了一种无线传感器网络动态路由系统.采用了模块化的设计方法,使得多路由协议共存时可以共享资源.利用规则引擎的灵活性和智能性实现路由协议的自适应切换机制.实验结果显示,在多任务网络环境下,动态路由在满足服务质量的同时可以有效地降低网络能耗.     

基于拓扑的MANET路由协议性能与网络覆盖密度相关性的研究

结合实际的移动adhoc组网研究,针对以往MANET路由协议性能评价中没有考虑网络连通性的问题,引入了反映网络节点通信能力和网络连通性的网络覆盖密度概念,并进行了基于拓扑的MANET典型路由协议性能与网络覆盖密度相关性的研究.仿真结果分析表明,基于拓扑的adhoc路由协议包递送率随着网络密度的增加而增加,并与其构成S曲线.通过最低网络覆盖密度的定义,为实际的adhoc组网中各种路由协议的适用条件提供了明确的评判依据.     

An on-demand routing protocol for improving channel use efficiency in multichannel ad hoc networks

In wireless ad hoc networks, end-to-end delivery over network is a critical concern for routing protocols. The capacity of routing protocols is constrained by the intra-flow interference introduced by adjacent nodes on the same path, and inter-flow interference generated by nodes from neighboring paths. In this paper, we develop an on-demand routing protocol M-AODV-R that solves the channel assignment, reuse and routing problem jointly. The proposed channel reuse scheme and channel assignment scheme can enhance channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel ad hoc networks over existing routing protocols. Simulation results show that the proposed routing M-AODV-R can effectively increase throughput and reduce delay, as compared to AODV protocol.     

Ad hoc网络中的简单跨层流控机制

为了提高Ad hoc网络中传输层协议的性能,基于跨层思想设计了一种简单可行的跨层流控机制。该机制结合网络层路由反馈、传输层协议和应用层速率自适应调节,通过跨层信息交互,应用层可根据网络层反馈的路由信息来调节业务的发送速率,将网络负载维持在合理的水平以最大化网络吞吐量。计算机模拟评价表明该机制能改善基于UDP和TCP的业务性能,在网络负载较低的情况下效果尤为明显。     

无线移动自组织网路由协议性能研究

路由是无线移动自组织网的关键技术之一。目前已经提出的MANET路由协议有很多种，因此如何针对一定应用场景选择一个最佳的路由协议，是人们十分关心的一个问题。该文对已经通过IETF认可的三种MANET路由协议：DSR、AODV和OLSR进行了仿真对比分析。设计了大量的场景，通过对路由协议的分组传送率、端到端时延和所选路径长度等指标的比较，得出了在不同的网络环境下MANET最佳路由协议选择方案。仿真中发现同是采用按需的路由发现策略的DSR和AODV在高移动、高负荷的网络环境下的性能存在较大差异，对此原因进行了深入分析，并根据分析对DSR提出了改进方案。     

Universal Continuous Routing Strategies

We analyze universal routing protocols, that is, protocols that can be used for any communication pattern in any network, under a stochastic model of continuous message generation. In particular, we present two universal protocols, a store-and-forward and a wormhole routing protocol, and characterize their performance by the following three parameters: the maximum message generation rate for which the protocol is stable, the expected delay of a message from generation to service, and the time the protocol needs to recover from worst-case scenarios. Both protocols yield significant performance improvements over all previously known continuous routing protocols. In addition, we present adaptations of our protocols to continuous routing in node-symmetric networks, butterflies, and meshes. Received October 1996, and in final form April 1997.     

A global security architecture for operated hybrid WLAN mesh networks

Hybrid Wireless Mesh Network (HWMN) is a new wireless networking paradigm. Unlike traditional wireless networks, in HWMNs, hosts may rely on each other to keep the network connected. Operators and wireless internet service providers are choosing HWMNs to offer Internet connectivity, as it allows fast, easy and affordable network deployments. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we investigate the main security issues focusing on the most vulnerable part of the hybrid WLAN mesh infrastructure which concerns the ad hoc network part. Through our proposed architecture, Security Architecture for Operator’s Hybrid WLAN Mesh Network (SATHAME), we identify the new challenges and opportunities posed by this emerging networking environment and explore approaches to secure users, data and communications. From the analysis of strengths and weaknesses of secured routing protocols, we designed a new robust routing structure called MacroGraph (MG). MG structure is extracted from the mesh ad hoc network for each communication to be established between a source and a destination. Especially, MG is a robust structure based on node-disjoint path routing scheme and dynamic trust management that can be adapted to respond to applications’ security requirements. We present a performance analysis of our efficient, robust and scalable multipath reactive secured routing protocol. We investigate the behavior of our proposed scheme under two attack scenarios: Packet Dropping and Route Error attacks in dense network configurations.     

无线传感器网络安全路由协议的设计与分析

路由安全是无线传感器网络安全的关键因素,而现有的无线传感器网络路由协议在设计时都没有充分考虑安全问题。在充分考虑网络路由协议攻击方法和无线传感器网络自身特点的基础上,结合基于ID的认证密钥协商技术以及秘密共享技术,提出了无线传感器网络路由的安全策略及其设计思想。同时,在路由建立阶段增加安全机制,提出了一种较优的安全路由协议。经过安全性分析,该路由协议可防御虚假路由信息、Sybile、确认欺骗等常见攻击。     

A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks

Reliable routing of packets in a Mobile Ad Hoc Network (MANET) has always been a major concern. The open medium and the susceptibility of the nodes of being fault-prone make the design of protocols for these networks a challenging task. The faults in these networks, which occur either due to the failure of nodes or due to reorganization, can eventuate to packet loss. Such losses degrade the performance of the routing protocols running on them. In this paper, we propose a routing algorithm, named as learning automata based fault-tolerant routing algorithm (LAFTRA), which is capable of routing in the presence of faulty nodes in MANETs using multipath routing. We have used the theory of Learning Automata (LA) for optimizing the selection of paths, reducing the overhead in the network, and for learning about the faulty nodes present in the network. The proposed algorithm can be juxtaposed to any existing routing protocol in a MANET. The results of simulation of our protocol using network simulator 2 (ns-2) shows the increase in packet delivery ratio and decrease in overhead compared to the existing protocols. The proposed protocol gains an edge over FTAR, E2FT by nearly 2% and by more than 10% when compared with AODV in terms of packet delivery ratio with nearly 30% faulty nodes in the network. The overhead generated by our protocol is lesser by 1% as compared to FTAR and by nearly 17% as compared to E2FT when there are nearly 30% faulty nodes.     

A new approach for delay-constrained routing

Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We believe that such paths are prone to delay constraint violations during load variations in the network. The root of such violations can be found in the imprecision of delay information during the routing process. In this paper, we propose a new approach for delay-constrained routing which captures the tradeoff between cost minimization and the risk level regarding to the delay constraint. We propose a protocol called Parameterized Delay-Constrained Routing protocol that implements our approach using a simple and efficient parameterized selection function. We expand this work to multicasting by proposing three new delay-constrained multicast routing protocols based on the source (Naïve), destination (Greedy) and mixed multicast routing techniques. Our simulations show that our protocols produce paths and trees which are stable, less risky and suitable for various network conditions.     

Moving routing protocols to the user space in MANET middleware

Mobile Ad Hoc Network (MANET) middleware must be aware of the underlying multi-hop topology to self-adapt and to improve its communication efficiency. For this reason, many approaches rely on specific cross-layer communications to interact with the network protocols in the kernel space. But these solutions break the strict layering of the network stack and hinder the portability of middleware and applications.The main argument of this paper is to move the routing protocols to the user space to simplify the development, testing, deployment and portability of middleware and applications. If routing is just another software component in the user space, cross-layering can be elegantly solved using advanced software engineering techniques like component frameworks and explicit APIs. As a consequence, a slight performance cost must be paid to achieve portability and easy deployment. But we will demonstrate that the performance obtained by a user-space routing protocol is satisfactory for a wide range of applications.We have implemented the unicast MANET OLSR protocol in Java (jOLSR) and, on top of it, we have created a novel overlay multicast protocol (OMOLSR). We have then integrated both routing protocols (jOLSR, OMOLSR) as software components in a well-known group communication toolkit (JGroups). Modifying the JGroups toolkit, we have devised a topology-aware group communication middleware for MANETs (MChannel). In our MChannel middleware, group membership is obtained directly from OMOLSR multicast trees and failure detection is obtained from jOLSR active probing. We have validated our approach in several real testbeds to demonstrate the feasibility and efficiency of our middleware.     

A survey of routing protocols for smart grid communications

With the recent initiatives to upgrade the existing power grid to the Smart Grid (SG), there has been a significant interest in the design and development of an efficient communications infrastructure for connecting different components of the SG. In addition to the currently used underlying networks and protocols, new wired/wireless approaches are being planned for deployment for different components/applications of the SG. Based on the data requirements of the applications, new challenges have arisen at the network layer of the protocol stack with respect to routing and data forwarding. In this paper, we focus on the routing issues in the SG communications infrastructure which consists of different network components, such as Home Area Networks (HANs), Neighborhood Area Networks (NANs) and Wide Area Networks (WANs). We provide a comprehensive survey of the existing routing research and analyze the advantages and disadvantages of the proposed protocols with respect different applications areas. We also identify the future research issues that are yet to be addressed with respect to the applications and network components. This survey is the first to identify routing design issues for the SG and categorize the proposed routing protocols from the SG applications perspective. We believe that this work will be valuable for the utilities and other energy companies whose target is to develop and deploy a specific SG application that may span different network components. In addition, this work will provide valuable insights for the newcomers who would like to pursue routing related research in the SG domain.