Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

Multicast routing algorithms and protocols: a tutorial

Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. There has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-survey of the various multicast routing algorithms and their relationship with multicast routing protocols for packet-switched-wide-area networks. Our contribution should be of particular benefit to the generic networking audience (and, to a lesser extent, to the expert on this subject)     

QoS routing for wireless ad hoc networks: problems, algorithms, and protocols

QoS routing plays an important role for providing QoS in wireless ad hoc networks. The goals of QoS routing are in general twofold: selecting routes with satisfied QoS requirement(s), and achieving global efficiency in resource utilization. In this article we first discuss some key design considerations in providing QoS routing support, and present a review of previous work addressing the issue of route selection subject to QoS constraint(s). We then devise an on-demand delay-constrained unicast routing protocol. Various strategies are employed in the protocol to reduce the communication overhead in acquiring cost-effective delay-constrained routes. Simulation results are used to verify our expectation of the high performance of the devised protocol. Finally, we discuss some possible future directions for providing efficient QoS routing support in wireless ad hoc networks.     

安全DSR路由协议分析与设计

获取正确的路由信息是移动adhoc网络安全路由协议的主要安全设计目标。首先分析了SRP和Ariadne协议的安全缺陷,在此基础上提出并证明了保障DSR路由协议应对active-1-y(y≥1)敌手能力、不返回不正确路由的充分条件,最后设计了一个安全DSR路由协议SDSR,并用串空间方法证明它满足提出的充分条件,从而可保证不返回不正确的路由。     

机会网络中用户属性隐私安全的高效协作者资料匹配协议

在机会网络中,用户通过移动造成的相遇性机会,借助协作者实现消息的传输与内容的共享。为了克服现有协作者匹配协议加解密效率不高的问题,针对机会网络中用户的不同隐私要求,设计了3个不依赖同态加密的高效隐私内积计算协议,可以证明所提出的协议是隐私安全并且正确的。在此基础上,对所提出的3个协议的计算开销与通信开销,与现有工作进行了理论上的比较。仿真结果表明,所提协议能够高效地完成隐私安全匹配,其加解密时间要比基于Paillier加密体系的协议要少至少一个数量级。     

CPTR: conditional probability tree based routing in opportunistic networks

In opportunistic networks due to the inconsistency of the nodes link, routing is carried out dynamically and we cannot use proactive routes. In these networks, nodes use opportunities gained based on store-carry-forward patterns to forward messages. Every node that receives a message when it encounters another node makes decision regarding the forwarding or not forwarding the node encountered. In some previous methods, the recognition of whether encounter with current node is considered as an appropriate opportunity or not has been carried out based on the comparison of the probability of carrier node and the node encountered. In these methods, if the message is delivered to the encountered node, a better opportunity would be lost. To fight with this challenge we have posed CPTR method by using conditional probability tree method through which in addition to the probability of the delivery of carrier and encountered nodes’ message delivery, the opportunities for after encounter will be involved in messages’ forwarding. Results of simulation showed that the proposed method can improve the ratio of delivery and delay of message delivery compared to other similar methods in networks with limited buffer.     

Internet multicast routing and transport control protocols

Multicasting is a mechanism to send data to multiple receivers in an efficient way. We give a comprehensive survey on network and transport layer issues of Internet multicast. We begin with an introduction to the current Internet protocol multicast model-the "host group" model and the current Internet multicast architecture, then discuss in depth the following three research areas: (1) scalable multicast routing; (2) reliable multicast; and (3) multicast flow and congestion control. Our goal is to summarize the state of the art in Internet multicast and to stimulate further research in this area     

Secure routing in wireless sensor networks: attacks and countermeasures

We consider routing security in wireless sensor networks. Many sensor network routing protocols have been proposed, but none of them have been designed with security as a goal. We propose security goals for routing in sensor networks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into powerful attacks against sensor networks, introduce two classes of novel attacks against sensor networks––sinkholes and HELLO floods, and analyze the security of all the major sensor network routing protocols. We describe crippling attacks against all of them and suggest countermeasures and design considerations. This is the first such analysis of secure routing in sensor networks.     

Channel access protocols for multihop opportunistic networks: challenges and recent developments

Heavy traffic over the unlicensed portion of the spectrum along with inefficient usage of the licensed spectrum gave impetus for a new spectrum allocation policy, the main purpose of which is to improve spectrum efficiency through opportunistic spectrum access. Cognitive radios have been proposed as a key enabling technology for such an opportunistic policy. One of the key challenges to enabling multihop CR communications is how to perform opportunistic medium access control while limiting the interference imposed on licensed users. In this article we highlight the unique characteristics of multihop cognitive radio networks, discuss key MAC design challenges specific to such networks, and present some of the work that has been done on MAC design for CRNs.     

Survey on IoV routing protocols: Security and network architecture

As today, vehicles are equipped with wireless sensors and on‐board computers capable of collecting and processing a large amount of data; they can communicate to each other via different communication types and through different relay nodes. Internet of Vehicles (IoV) routing protocols are deployed to monitor these communications with various strategies to achieve a high availability of communication. In this paper, we propose to extend an existing taxonomy representing the necessary criteria to build IoV routing algorithms, by adding two new important criteria: security aspect and network architecture. Enhanced vehicular routing protocols with different security mechanisms have been studied, compared, and classified with respect to the authentication, the integrity, the confidentiality, the nonrepudiation, and the availability of data and communications. Routing protocols using the software‐defined networking (SDN) paradigm have also been reviewed in order to compare with those with traditional network architectures. Three types of SDN routing protocols, namely, centralized, decentralized, and hybrid control planes, have been analyzed. This survey will be useful for the choice of IoV routing protocols that take into account the flexibility, the scalability, and the intelligence of vehicular networks, as well as the security mechanisms against cyberattacks while being cost aware.     

A comparison between two routing protocols: OSPF and IS-IS

A comparison is made of the open shortest path first (OSPF) and intermediate system-to-intermediate system (IS-IS) routing protocols in terms of their ability to route internet protocol (IP) traffic. Common characteristics of the two protocols are briefly indicated. The differences between the two are explored with respect to packet encoding, area partitions, level 2 partitions, injection of level 2 information, authentication, designated router election, link state packet propagation, synchronized parameter setting, and neighbor initialization     

Combining on-demand and opportunistic routing for intermittently connected networks

While current on-demand routing protocols are optimized to take into account unique features of mobile ad-hoc networks (MANETs) such as frequent topology changes and limited battery life, they often do not consider the possibility of intermittent connectivity that may lead to arbitrarily long-lived partitions. In this work, we introduce the space-content-adaptive-time routing (SCaTR) framework, which enables data delivery in the face of both temporary and long-lived MANET connectivity disruptions. SCaTR takes advantage of past connectivity information to effectively route traffic towards destinations when no direct route from the source exists. We show through simulations that, when compared to traditional on-demand protocols, as well as opportunistic routing (e.g., epidemic), SCaTR increases delivery ratio with lower signaling overhead in a variety of intermittently connected network scenarios. We also show that SCaTR performs as well as on-demand routing in well-connected networks and in scenarios with no mobility predictability (e.g., random mobility). In the latter case, SCaTR delivers comparable reliability to epidemic routing with considerably lower overhead.     

Sharing spray and wait routing algorithm in opportunistic networks

Due to the instability and intermittent connectivity of links among the nodes and the lack of connectivity in opportunistic network, it is not feasible to use common routing for delivering messages. The only practical method for routing and delivering messages is to use the store-carry-forward routing method. As a case in point, spray and wait is considered to be one of the most appropriate routing methods. The efficiency of this method depends directly on the proper selection of the next hop and the number of copies when it encounters a node. In this paper, a method was proposed that constantly selects the next node and considers the number of copies a node can deliver. In the proposed method, the selection of the next node and the number of message copies to be transmitted by the next hop are based on message carrying time and the probability of message delivery. The network model, based on Markov chain, is extended for analysis. Simulation and analysis results showed that significant enhancement is obtained with the proposed method when measuring metrics such as delay, delivery ratio and copy do comparisons with similar methods.     

The viewserver hierarchy for interdomain routing: protocols andevaluation

We present an interdomain routing protocol based on a new hierarchy, referred to as the viewserver hierarchy. The protocol satisfies policy and type of service (ToS) constraints, adapts to dynamic topology changes including failures that partition domains, and scales well to a large number of domains without losing detail (unlike the usual scaling technique of aggregating domains into superdomains). Domain-level views are maintained by special nodes called viewservers. Each viewserver maintains a view of a surrounding precinct. Viewservers are organized hierarchically. To obtain domain-level source routes, the views of one or more viewservers are merged (up to a maximum of twice the levels in the hierarchy). We also present a model for evaluating interdomain routing protocols, and apply this model to compare our viewserver hierarchy against the simple approach where each node maintains a domain-level view of the entire internetwork. Our results indicate that the viewserver hierarchy finds many short valid paths and reduces the amount of memory requirement by two orders of magnitude     

Bluetooth scatternets: criteria, models and classification

Bluetooth ad hoc networks are constrained by a master/slave configuration, in which one device is the master and controls the communication with the slave devices. The master and up to seven active slave devices can form a small Bluetooth network called a piconet. In order to build larger network topologies, called scatternets, the piconets must be interconnected. Scatternets are formed by allowing certain piconet members to participate in several piconets by periodically switching between them. Due to the fact that there is no scatternet formation procedure in the Bluetooth specification, numerous different approaches have been proposed. We discuss criteria for different types of scatternets and establish general models of scatternet topologies. Then we review the state-of-the-art approaches with respect to Bluetooth scatternet formation and compare and contrast them.     

Secure and reliable routing in cognitive radio networks

Due to the mobility of node and different spectrum availability pattern, CR networks are frequently divided into unpredictable partitions. Usually, these partitions are irregularly connected; hence, secure and reliable routing becomes major issue for these types of network. In order to overcome these issues, we propose a secure and reliable routing in CRN based on distributed Boltzmann–Gibbs learning algorithm. This algorithm is implemented for relay node selection phase. In addition, the authentication is done based on secure routing distributed Boltzmann–Gibbs learning algorithm. We consider the metrics such as trust value and total delay for the successful and reliable transmission of the packet. Also, in order to increase the reliability, we implement LDPC code at the time of relay node selection phase. The proposed code helps to cancel any kind of electronic interference and channel noise interference.     

Road traffic and geography topology based opportunistic routing for VANETs

The message delivery .ratio and transmission delay is affected deeply by road traffic flow in vehicular ad hoc networks （VANETs）. An opportunistic routing based on geography and road traffic flow for VANETs （ORRIS） was proposed. ORRIS leverages the knowledge of geography positions, motion vectors and road traffic flows. In order to estimate the traffic flow density, the history of encounter number of the vehicles in the opposite direction is considered in ORRIS. The forwarding decisions are made by distributed vehicles based on the geography topology and the road traffic flow. The real map based simulation results show that ORRIS has a better performance than other algorithms, especially when the road traffic is busy or the traffic flow rates have great differences between roads.     

Network anomaly detection and classification via opportunistic sampling

Abstract In this article the emphasis is placed on the evaluation of the impact of intelligent flow sampling techniques on the detection and classification of network anomalies. Based on the observation that for specific-purpose applications such as anomaly detection a large fraction of information is contained in a small fraction of flows, we demonstrate that by using sampling techniques that opportunistically and preferentially sample traffic data, we achieve ?magnification? of the appearance of anomalies within the sampled data set and therefore improve their detection. Therefore, the inherently ?lossy? sampling process is transformed to an advantageous feature in the anomaly detection case, allowing the revealing of anomalies that would be otherwise untraceable, and thus becoming the vehicle for efficient anomaly detection and classification. The evaluation of the impact of intelligent sampling techniques on the anomaly detection process is based on the application of an entropy-based anomaly detection method on a packet trace with data that has been collected from a real operational university campus network.     

MrFbP: Markov random field-driven spatial entropy-based routing protocol in opportunistic networks

Recently, research towards technologies associated with the 5G communication is in full operation. Amongst these enabling technologies, device-to-device(D2D) communication is one of the critical factors for scaling up the network efficiency in 5G communication. Intermittent connections due to higher mobility lead to frequent path breaks, and hence a mobility-based opportunistic routing is suitable enough to control the forwarding process. Opportunistic networks (OppNet) use the pairwise opportunistic contacts and higher mobility to rely on the store-carry and forward mechanism for routing purpose. In this work, a novel mobility-induced context-based routing process has been designed to support D2D communication. The designed Markov random field-induced protocol (MrFbP) is based on spatial entropy for capturing the coverage span of the forwarding node in the network. The work relies on the monitored historic mobility of a node and is then used to capture the utility metric for taking forwarding decision. MrFbP is compared against the established Direct Delivery (DD), Epidemic (EP), Spray & Wait (SW), and PropHet (PR) on parameters like throughput, delay, hops, overheads, and energy consumption. Simulation has been carried out using ONE simulator to validate an improvement in the design of a designed protocol against the baseline protocols.     

量子移动互联通信传输及路由协议研究

构建了量子无线通信网络模型,通过中继点两端量子信道的建立获得源端所发出的信息,实现多级量子无线网络信息的传输;基于经典认证,采用量子隐形传态和纠缠交换技术传输携带信息的量子态,实现了无线通信网络的身份认证;结合Grover量子搜索算法,在限定跳数内搜索路由度量最大的路径作为目标解径,避免了量子信道因纠缠量子对的消耗而断开,保证了成功率,降低了量子通信网络的计算量,使路由搜索快速收敛.