Routing in Large-Scale Wireless Mesh Networks Using Temperature Fields

Many wireless mesh networks are based on unicast routing protocols even though those protocols do not provide a particularly good fit for such scenarios. In this article, we report about an alternative routing paradigm, tailor-made for large multihop wireless mesh networks: field-based anycast routing. In particular, we present HEAT, a routing protocol based on this paradigm. In contrast to previous protocols, HEAT requires communication only between neighboring nodes. The underlying routing concept is a field similar to a temperature field in thermal physics. In extensive simulation experiments, we found that HEAT has excellent scalability properties due to a fully distributed implementation, and it provides much more robust routes than the unicast protocols, AODV and OLSR. As a consequence, in large-scale mobile scenarios, the packet delivery ratio with HEAT is more than two times higher, compared to AODV or OLSR. These promising results indicate that HEAT is suitable for large-scale wireless mesh networks that cover entire cities.     

A survivable routing protocol for two-layered LEO/MEO satellite networks

Due to the rapid development of space communication, satellite networks will be confronted with more complex space environment in future, which poses the important demand on the design of the survivable and efficient routing protocols. Among satellite networks, two-layered Low Earth Orbit (LEO)/Medium Earth Orbit (MEO) satellite networks (LMSNs) have become an attractive architecture for their better communication service than single-layered satellite networks. To determine the topological dynamics of LMSN, the satellite group and group manager (SGGM) method is a prevalent strategy. However, it can not precisely capture the topological dynamics of the LEO layer, which may result in the unreliability of data transmission. Besides, most existing routing protocols based on the SGGM method will collapse once any top satellite fails. To overcome both limitations, this paper proposes a new topology control strategy for LMSNs. The proposed strategy determines the snapshot in terms of the topological change of the LEO layer, which ensures the topological consistency of routing calculation. Moreover, a new survivable routing protocol (SRP) is presented for LMSNs by combining both centralized and distributed routing strategies. The SRP can provide strong survivability under the LEO or MEO satellite failure. Besides, it can also achieve the minimum delay routing provided the MEO layer can effectively work. The performance of SRP is also evaluated by simulation and analysis.     

VANETs路由协议的研究进展

车辆自组织网络是传统自组织网络派生出的一个分支,其与应用场景高度相关.传统路由协议不能有效的适用于车辆自组织网络,因此,针对车辆自组织网络提出了许多新的路由协议.首先在总结车辆自组织网络的特性后,分别介绍了单播路由、广播路由和地域性多播路由的概念,然后着重分析和总结了近年来具有代表性的路由协议的核心路由机制及其优缺点,...     

卫星网络路由技术现状及展望

与地面固定通信网络不同,卫星网络的节点高度动态性、有限的星上处理能力和网络拓扑周期性变化的特点给卫星互联网的路由协议与算法设计带来了新的挑战。该文系统梳理了学术界针对卫星网络所提出的路由技术,提出了卫星路由技术未来的发展方向。首先介绍了卫星网络架构和目前在卫星通信系统上应用的主要路由协议,并且简要介绍了卫星光通信网络的路由问题;其次,根据卫星节点的管理方式以及路由表生成方式将路由算法分类为集中式卫星路由、分布式卫星路由以及混合式卫星路由,详细介绍了各类卫星路由方法的代表性成果并总结其优化目标和适用场景;接着,总结了不同卫星网络场景和网络需求下如何选择合适的卫星路由算法;最后,阐述目前卫星路由技术面临的挑战以及未来的发展趋势,并在附录中介绍了当前主流的卫星网络仿真平台。     

A survey of routing attacks in mobile ad hoc networks

Recently, mobile ad hoc networks became a hot research topic among researchers due to their flexibility and independence of network infrastructures, such as base stations. Due to unique characteristics, such as dynamic network topology, limited bandwidth, and limited battery power, routing in a MANET is a particularly challenging task compared to a conventional network. Early work in MANET research has mainly focused on developing an efficient routing mechanism in such a highly dynamic and resource-constrained network. At present, several efficient routing protocols have been proposed for MANET. Most of these protocols assume a trusted and cooperative environment. However, in the presence of malicious nodes, the networks are vulnerable to various kinds of attacks. In MANET, routing attacks are particularly serious. In this article, we investigate the state-of-the-art of security issues in MANET. In particular, we examine routing attacks, such as link spoofing and colluding misrelay attacks, as well as countermeasures against such attacks in existing MANET protocols.     

Separability and topology control of quasi unit disk graphs

A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protocols for wireless networks—routing, topology control, information storage/retrieval and numerous other applications—have been based on the idealized unit-disk graph (UDG) network model. The significant deviation of the UDG model from many real wireless networks is substantially limiting the applicability of such protocols. A more general network model, the quasi unit-disk graph (quasi-UDG) model, captures much better the characteristics of wireless networks. However, the understanding of the properties of general quasi-UDGs has been very limited, which is impeding the designs of key network protocols and algorithms. In this paper, we present results on two important properties of quasi-UDGs: separability and the existence of power efficient spanners. Network separability is a fundamental property leading to efficient network algorithms and fast parallel computation. We prove that every quasi-UDG has a corresponding grid graph with small balanced separators that captures its connectivity properties. We also study the problem of constructing an energy-efficient backbone for a quasi-UDG. We present a distributed local algorithm that, given a quasi-UDG, constructs a nearly planar backbone with a constant stretch factor and a bounded degree. We demonstrate the excellent performance of these auxiliary graphs through simulations and show their applications in efficient routing.     

Congestion management techniques for disruption‐tolerant satellite networks

Delay and disruption‐tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end‐to‐end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay‐ and disruption‐tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation.     

Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.     

Three-dimensional greedy routing in large-scale random wireless sensor networks

In this paper, we investigate how to design greedy routing to achieve sustainable and scalable in a large-scale three-dimensional (3D) sensor network. Several 3D position-based routing protocols were proposed to seek either delivery guarantee or energy-efficiency in 3D wireless networks. However, recent results [1], [2] showed that there is no deterministic localized routing algorithm that guarantees either delivery of packets or energy-efficiency of its routes in 3D networks. In this paper, we focus on design of 3D greedy routing protocols which can guarantee delivery of packets and/or energy-efficiency of their paths with high probability in a randomly deployed 3D sensor network. In particular, we first study the asymptotic critical transmission radius for 3D greedy routing to ensure the packet delivery in large-scale random 3D sensor networks, then propose a refined 3D greedy routing protocol to achieve energy-efficiency of its paths with high probability. We also conduct extensive simulations to confirm our theoretical results.     

Performance analysis of an ad hoc network for emergency and collaborative environments

Ad hoc networks can be used for quickly set up small spontaneous networks, such as in emergency situations or during sessions of cooperative works as in conferences, teaching rooms or meetings. Real-life tests of such networks are invaluable in order to assess models used in simulation. However, the number of factors affecting the performance of an ad hoc network is high, theoretically infinite. There are, for example, system factors, such as routing protocols, MAC and physical layer protocols and their cross-layer interaction, as well as environment factors, such as the presence of walls, foliage and surrounding moving objects. In order to optimize protocols, it is important both to design repeatable experiments of the network and to identify the parameters which really affect the system behavior. We accomplish the former demand by building a simple network by means of off-the-shelf hardware and software. For the latter point, we propose to use methods of statistical testing theory to identify these parameters in a compact manner. In particular, we use OLSR as a routing protocol. Results from real experiments in outdoor and indoor scenarios confirm the horizon effect of ad hoc multi-hop networks and show that there is a treatment effect caused by the window size of OLSR.     

Design guidelines for quality of service support in Optimized Link State Routing-based mobile ad hoc networks

The proposals for quality of service in mobile ad hoc networks have focused on adding QoS mechanisms in best-effort routing protocols while keeping the same assumptions regarding both the network representation and the routing protocol design. Most of the solutions concentrate the algorithmic effort on QoS route computation and relax the constraint of optimizing flooding, which has, however, a great impact on resource consumption. The goal of this paper is to present guidelines that allow the design of efficient solutions accurately presented and easily comparable with each other. We first define the QoS metric as an abstraction that can be instantiated for any kind of metric, and we propose a MANET representation that integrates this abstraction into the definition of the network graph and properties. Using these concepts, while flooding optimization and QoS-aware MPR selection have usually been performed separately, we then propose a formalism that unifies MPR selection in such a way that both objectives are achieved simultaneously in a single selection. Finally, we propose a heuristic that provides an efficient solution for this problem while allowing us to control the trade-off between both objectives. Evaluations carried out on network graphs considering different spatial distributions of nodes show that our heuristic outperforms existing heuristics.     

An algebraic theory of dynamic network routing

We develop a non-classic algebraic theory for the purpose of investigating the convergence properties of dynamic routing protocols. The algebraic theory can be regarded as a generalization of shortest-path routing, where the new concept of free cycle generalizes that of a positive-length cycle. A primary result then states that routing protocols always converge, though not necessarily onto optimal paths, in networks where all cycles are free. Monotonicity and isotonicity are two algebraic properties that strengthen convergence results. Monotonicity implies protocol convergence in every network, and isotonicity assures convergence onto optimal paths. A great many applications arise as particular instances of the algebraic theory. In intra-domain routing, we show that routing protocols can be made to converge to shortest and widest paths, for example, but that the composite metric of Internet Gateway Routing Protocol (IGRP) does not lead to optimal paths. The more interesting applications, however, relate to inter-domain routing and its Border Gateway Protocol (BGP), where the algebraic framework provides a mathematical template for the specification, design, and verification of routing policies. We formulate existing guidelines for inter-domain routing in algebraic terms, propose new guidelines contemplating backup relationships between domains, and derive a sufficient condition for signaling correctness of internal-BGP.     

Performance comparison of trust-based reactive routing protocols

Ad hoc networks, due to their improvised nature, are frequently established in insecure environments and hence become susceptible to attacks. These attacks are launched by participating malicious nodes against different network services. Routing protocols, which act as the binding force in these networks, are a common target of these nodes. A number of secure routing protocols have recently been proposed, which make use of cryptographic algorithms to secure the routes. However, in doing so, these protocols entail a number of prerequisites during both the network establishment and operation phases. In contrast, trust-based routing protocols locate trusted rather than secure routes in the network by observing the sincerity in participation by other nodes. These protocols thus permit rapid deployment along with a dynamically adaptive operation, which conforms with the current network situation. In this paper, we evaluate the performance of three trust-based reactive routing protocols in a network with varying number of malicious nodes. With the help of exhaustive simulations, we demonstrate that the performance of the three protocols varies significantly even under similar attack, traffic, and mobility conditions. However, each trust-based routing protocol has its own peculiar advantage making it suitable for application in a particular extemporized environment.     

Dissecting the routing architecture of self-organizing networks

The proper operation of self-organizing networks (SONs) relies on the autonomous behavior of their individual nodes. Routing in such networks has been a challenging task since their conception, due to their nontraditional characteristics and design requirements. Although a large amount of routing architectures and protocols for SONs has been proposed, very little work has been done on the fundamental characteristics that make a routing strategy efficient for a particular network and/or design requirement. Contrary to traditional techniques where the routing architecture is structured as a single unit, we suggest in this article that routing be thought of as a combination of four main architectural components, namely, addressing, dissemination, discovery, and forwarding. This logical decomposition offers significant advantages from both the analysis and the design perspectives. We conclude from our observations that routing architectures should be scenario-driven, in the sense that the configuration parameters are not necessarily universally good for all application scenarios     

Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

Routing is one of the most basic networking functions in mobile ad hoc networks. Hence, an adversary can easily paralyze the operation of the network by attacking the routing protocol. This has been realized by many researchers and several "secure" routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. We propose a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner. Our framework is tailored for on-demand source routing protocols, but the general principles are applicable to other types of protocols too. Our approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but, to the best of our knowledge, it has not been applied in the context of ad hoc routing so far. We also propose a new on-demand source routing protocol, called endairA, and we demonstrate the use of our framework by proving that it is secure in our model     

Exploring the impact of social properties on routing in cognitive radio networks

In this paper, we study the social properties, including community, friendship, and individual selfishness of cognitive radio networks and analyze the effect of these social properties on the performance of routing protocols. We first introduce the concept of cooperation willingness considering social relations and individual selfishness. Then, we model the impact of cooperation willingness on the routing performance in cognitive radio networks. After that, we perform extensive simulations to evaluate the accuracy of our model. The simulation results show that our model matched the simulation results well. Finally, our results suggest that community members, friends, and nodes with lower individual selfishness should be selected in the forwarding routes.     

SecMR – a secure multipath routing protocol for ad hoc networks

Multipath routing in ad hoc networks increases the resiliency against security attacks of collaborating malicious nodes, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols vulnerable to collaborating malicious nodes. We propose an on-demand multipath routing protocol, the secure multipath routing protocol (SecMR), and we analyze its security properties. Finally, through simulations, we evaluate the performance of the SecMR protocol in comparison with existing secure multipath routing protocols.     

Overview of wideband packet protocols

Wideband packet networks operate at rates equal to, or higher than, 64 kb/s, but lower than the basic broadband rate of 150 Mb/s, on cables or satellite links. Wideband packet protocols are the transmission protocols for these networks. They define open interfaces that can be used for public and private ISDNs. The protocols are defined in CCITT Recommendations G.764 and G.765. This paper describes the objectives of the wideband protocols, and how the objectives were achieved.     

IP路由协议在MF-TDMA卫星系统中适应性研究

MF-TDMA卫星通信系统可以实现卫星资源的有效利用和灵活组网,具有很大的潜在应用市场。同时,以IP技术为核心的宽带网络迅速发展,卫星通信作为一种广域网手段,实现对IP业务的接入,是其发展的必然趋势。主要研究了目前地面网络中常用的几种IP路由协议在MF-TDMA卫星通信系统中的适应性,利用OPNET网络仿真软件对MF-TDMA卫星通信系统进行仿真建模。通过对仿真结果的分析,给出了适合MF-TDMA卫星通信环境下的IP路由协议。     

The evolution of multicast: from the MBone to interdomain multicastto Internet2 deployment

Multicast communication-the one-to-many or many-to-many delivery of data-is a hot topic. It is of interest in the research community, among standards groups, and to network service providers. For all the attention multicast has received, there are still issues that have not been completely resolved. One result is that protocols are still evolving, and some standards are not yet finished. From a deployment perspective, the lack of standards has slowed progress, but efforts to deploy multicast as an experimental service are in fact gaining momentum. The question now is how long it will be before multicast becomes a true Internet service. The goal of this article is to describe the past, present, and future of multicast. Starting with the Multicast Backbone (MBone), we describe how the emphasis has been on developing and refining intradomain multicast routing protocols. Starting in the middle to late 1990s, particular emphasis has been placed on developing interdomain multicast routing protocols. We provide a functional overview of the currently deployed solution. The future of multicast may hinge on several research efforts that are working to make the provision of multicast less complex by fundamentally changing the multicast model. We survey these efforts. Finally, attempts are being made to deploy native multicast routing in both Internet2 networks and the commodity Internet. We examine how multicast is being deployed in these networks