Search

Dynamic multipath routing gives users flexibility over the transmitting path to deliver messages for security. Several protocols have already presented, such as multipath TCP, random routing mutation. However, they often limited to scalability, which mainly reflects on two aspects of network resource consumption and compossibility with other main transfer protocols. In this paper, to enhance the security of data delivery in wide area networks, a novel multipath routing scheme for end‐to‐end communication is proposed. The basic idea is concurrently using two paths (a fixed path and a changing path) to deliver the data of a pair, the fixed routing path undertakes the main delivery tasks, and the continually changing routing path only transfers a little data of the flow during the whole communication period. For systematically achieving security, Information Dispersal Algorithm disperses the flow data over the two paths for resisting anyone routing path compromised. Further, the method can maintain more routing path change since the burst network resource requirement decreases significantly at the routing mutation moment. Meanwhile, it brings a small amount of bandwidth disturbance over the traffic statuses of the network, thus alleviating instead of worsening the compossibility with other protocols. [ABSTRACT FROM AUTHOR]

Automatic Dependent Surveillance‐Broadcast (ADS‐B) system provides significant improvements in air traffic control system such as optimal routing in non‐radar environments with a new level of safety and efficiency. The ADS‐B system is being installed in many aircrafts in recent year. The ADS‐B equipped aircraft broadcasts the air traffic information to nearby aircraft and ground stations either once or twice per second. Because of the open channel communication atmosphere, the ADS‐B system is affected by many security attacks. Many authentication and batch verification schemes are available to provide data integrity and source authentication for the ADS‐B system. But they are suffering from computational overhead and communication overhead. Hence, an efficient anonymous authentication scheme is proposed for the ADS‐B system with batch verification based on Message Recovery Signature (MRS). The security and performance analysis section ensure that the proposed scheme provides essential security features with less computational and communication overhead comparison with the other existing schemes. [ABSTRACT FROM AUTHOR]

Software-defined networking (SDN) is a representative next generation network architecture, which allows network administrators to programmatically initialize, control, change, and manage network behavior dynamically via open interfaces. SDN is widely adopted in systems like 5G mobile networks and cyber-physical systems (CPS). However, SDN brings new security problems, e.g., controller hijacking, black-hole, and unauthorized data modification. Traditional firewall or IDS based solutions cannot fix these challenges. It is also undesirable to develop security mechanisms in such an ad hoc manner, which may cause security conflict during the deployment procedure. In this paper, we propose OSCO (Open Security-enhanced Compatible OpenFlow) platform, a unified, lightweight platform to enhance the security property and facilitate the security configuration and evaluation. The proposed platform supports highly configurable cryptographic algorithm modules, security protocols, flexible hardware extensions, and virtualized SDN networks. We prototyped our platform based on the Raspberry Pi Single Board Computer (SBC) hardware and presented a case study for switch port security enhancement. We systematically evaluated critical security modules, which include 4 hash functions, 8 stream/block ciphers, 4 public-key cryptosystems, and key exchange protocols. The experiment results show that our platform performs those security modules and SDN network functions with relatively low computational (extra 2.5% system overhead when performing AES-256 and SHA-256 functions) and networking performance overheads (73.7 Mb/s TCP and 81.2Mb/s UDP transmission speeds in 100Mb/s network settings). [ABSTRACT FROM AUTHOR]

The characteristics of MANET such as decentralized architecture, dynamic topologies make MANETs susceptible to various security attacks. Sequence number attacks are such type of security threats which tend to degrade the network functioning and performance by sending fabricated route reply packets (RREP) with the objective of getting involved in the route and drop some or all of the data packets during the data transmission phase. The sequence number adversary attempts to send a fabricated high destination number in the RREP packet which attracts the sender to establish a path through the adversary node. This paper proposes a proactive secure routing mechanism which is an improvement over the authors previously proposed scheme. It makes use of linear regression mechanism to predict the maximum destination sequence number that the neighboring node can insert in the RREP packet. As an additional security checkpoint, it uses a bait detection mechanism to establish confidence in marking a suspicious node as a malicious node. The proposed approach works in collaboration with the ad hoc on-demand distance vector routing (AODV) protocol. The simulation results depict that the approach improves the network performance in the presence of adversaries as compared to previously proposed scheme. [ABSTRACT FROM AUTHOR]

Summary: A smart opportunistic environment is a physical space, which allows the smart physical objects to communicate in the presence of disruption in connectivity. Because, the objects in such an environment are buffer constrained, some of the objects will not participate in data forwarding, when there is scarcity of storage (buffer) space. In this paper, we focus on such selfish behavior of objects triggered by space constraints in a smart opportunistic environment. We propose a novel data forwarding algorithm, selfishness and buffer‐aware routing (SBR), in which a node is chosen as a relay, based on its capability, which is a function of its available buffer space and past encounter history (delivery predictability) with the destination. SBR can efficiently utilize the limited buffer space in a node with a buffer management scheme, WSD. It can also detect space constraint driven selfish behavior of nodes and resolve it using a reputation‐based technique, MSD. We have conducted simulation using both synthetic and real‐world traces for evaluating our proposed SBR algorithm. For analyzing the performance of the algorithm in real‐time, a smart vehicular test‐bed is developed. Simulation results and test‐bed implementation show that our algorithm performs better in terms of higher delivery ratio, lower overhead ratio, and lower delivery delay, compared with existing opportunistic data forwarding algorithms. [ABSTRACT FROM AUTHOR]

In dynamic flex-grid optical transport networks, Lightpath Admission Control (LAC) is the task of finding a Routing and Spectrum Assignment (RSA) solution for a current lightpath request; otherwise, the request is blocked if there are not enough free available resources. When rerouting is supported, one or more currently established lightpaths can be rerouted and/or assigned with a different spectrum in order to accommodate the current lightpath request. We propose LAC methods based on mixed integer linear programming that provide a RSA solution for the current request aiming to maximize the acceptance probability of future lightpath requests. When rerouting is supported, we consider that only one currently established lightpath can be rerouted. We compare the proposed methods with the traditional shortest path-based approach through simulation. Without lightpath rerouting, the blocking probability is significantly improved. With lightpath rerouting, the number of rerouting operations is significantly decreased while the blocking probability is marginally improved. Moreover, the blocking fairness between lightpaths with different spectrum widths is improved both with and without lightpath rerouting. In all cases, the CPU times of the mixed integer linear programming approaches are a few seconds, on average. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 151-163 2017 [ABSTRACT FROM AUTHOR]

This article is devoted to nonlinear single-path routing problems, which are known to be NP-hard even in the simplest cases. For solving these problems, we propose an algorithm inspired from Game Theory in which individual flows are allowed to independently select their path to minimize their own cost function. We design the cost function of the flows so that the resulting Nash equilibrium of the game provides an efficient approximation of the optimal solution. We establish the convergence of the algorithm and show that every optimal solution is a Nash equilibrium of the game. We also prove that if the objective function is a polynomial of degree [ABSTRACT FROM AUTHOR]

During the planning of communication networks, the routing decision process (distributed and online) often remains decoupled from the network design process, that is, resource installation and allocation-planning process (centralized and offline). To reconcile both processes and take into account demand variability, we generalize the capacitated multicommodity fixed charge network design class of problems by including different types of fixed costs (installation and maintenance costs) and variable costs (routing costs) but also variable traffic demands over multiple periods. However, conventional integer programming methods can typically solve only small to medium size instances of this problem. Two major difficulties are encountered when using commercial solvers to solve the associated mixed integer programs: (i) problems are large scale and even solving the linear relaxation of the problem can be challenging; and (ii) the solver hardly find good feasible solutions for medium to large scale instances. As an alternative, we propose a Lagrangian approach for computing a lower bound by relaxing the flow conservation constraints such that the Lagrangian subproblem itself decomposes by node. Though this approach yields one subproblem per network node, solving the Lagrangian dual by means of the bundle method remains a complex computational tasks. However, it always provides a lower bound on the optimal solution. Moreover, based on this relaxation, we propose a Lagrangian heuristic that makes the approach more robust than a black-box usage of a Mixed Integer Programming (MIP) solver. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 110-123 2017 [ABSTRACT FROM AUTHOR]

In this paper, we analyze the performance of two contact graph routing (CGR) enhancements, namely, CGR with earliest transmission opportunity (CGR-ETO) and overbooking management. CGR-ETO aims to improve the accuracy of predicted bundle delivery time by exploiting existing information on queueing delay, in routing decisions. Overbooking management aims to proactively handle contact oversubscription, which occurs when high-priority bundles are forwarded to a contact that is already fully subscribed by lower-priority bundles. These two enhancements have been recently included in the official CGR version as part of the Interplanetary Overlay Network delay-tolerant/disruption-tolerant networking implementation maintained by the National Aeronautics and Space Administration. In parallel to the comparative evaluation of the enhancements against the original CGR, we introduce an experimental version of CGR-ETO that exploits information on locally routed data to calculate queueing delays in all hops through the path to destination, rather than in the first hop only. We evaluate the aforementioned enhancements in a set of emulation experiments conducted on a GNU/Linux testbed and compare official and experimental versions of CGR. Results show that the two enhancements are complementary and can significantly improve routing decisions compared with older versions of CGR, particularly in the presence of parallel routes and traffic of different priorities. These advantages are further extended when the experimental version of ETO is considered. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In telecommunication networks, packets are carried from a source [ABSTRACT FROM AUTHOR]

ABSTRACT The usability of wireless sensor networks in modern applications requires the fulfillment of dynamic Quality of Service (QoS) requirements that can only be met in a reactive manner by the introduction of composite routing metrics, capturing several distinct network characteristics. However, combining routing metrics is neither a trivial nor an arbitrary task, given the routing protocol requirements and routing metrics properties. In this paper, the theoretical framework of routing algebra formalism is adopted and extended to incorporate single or composite routing metrics, because the satisfaction of routing algebra properties ensures convergence, optimality, and loop-freeness. Moreover, packet forwarding indication is defined as a new trust metric for systems (a) with or (b) without network retransmissions to avoid forwarding attacks, while a novel composite routing metric is presented, combining link reliability and trust-awareness in an additive manner, fulfilling the theoretical requirements. Finally, this composite metric is applied to the Routing Protocol for Low Power and Lossy Networks via simulations, which verify its efficiency in several scenarios, including the comparison between lexical and additive metric composition approaches. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature.We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered longdistance packets with reasonable packet delay than A-STAR. [ABSTRACT FROM AUTHOR]

SUMMARY Because inter-satellite links (ISLs) among the distributed satellite nodes can be used to support autonomous control in satellite system operation to reduce dependency on the ground stations, it becomes a popular communication paradigm for the future satellite systems. However, this introduces great technical challenges, particularly for routing protocol to support such space communication system. Facing the challenges, we present out study of routing technology in this paper tailored for satellite network of MEO (Table 1) and IGSO with ISLs in addition to satellite-ground links. The study aims to explore the routing strategies and algorithms of satellite network based on the evolution law of network topology to provide reference design for data exchange in autonomous satellite system. A comprehensive investigation, ranging from the analysis of relevant factors affecting data exchange in satellite networks to the primary application and resource constraints in designing satellite routing strategy, has been conducted. Our main contribution is to propose an on-demand computing and caching centralized routing strategy and algorithm on the satellite network. The routing strategy and algorithm is designed for satellite network topology dynamic grouping. The route calculation for user data transmission is divided into three phases: direction estimation, direction enhancement, and congestion avoidance. The strategy and algorithm provide significant advantages of high efficiency, low complexity, and flexible configuration, by which the satellite networks can provide the features of flexible configure, efficient transferring, easy management, structural survivability, and great potential in scalability. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

SUMMARY In IP-based networks, IP address uniqueness is one of the most important requirements since a node has to participate in unicast communications and routing. Often nodes are assumed to have unique IP addresses configured a priori. However, this is not the case and cannot be achieved easily in mobile ad hoc networks (MANETs). Most of the existing dynamic address allocation schemes of MANET rely on network-wide flooding for address solicitation and/or duplicate address detection. As a result, several types of security threats can be seen at the time of address allocation. In this paper, we present an ID-based distributed dynamic IP configuration scheme that securely allocates IP addresses to the authorized nodes without flooding the entire network. Here each node acquires capability of generating unique IP addresses from its own IP address and can assign those addresses to the new nodes. The proposed scheme provides security against the associated threats with dynamic IP allocation protocol without the help of a trusted third party. It also efficiently handles the network partitioning and merging and reduces the chance of address conflicts. Performance analysis and simulation results are present to show that the proposed addressing scheme has low communication overhead and fairly low addressing latency with added security mechanisms compared to the similar existing dynamic address allocation schemes. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

ABSTRACT Because of the dynamic nature of delay tolerant networks (DTNs), many replication-based routing schemes were proposed to increase the probability of delivery by making multiple copies of each message. In such schemes, one concern is how many replicas of a message should be distributed in the network. In this paper, we propose a routing scheme for DTNs, called adaptive spraying based on the intercontact time (ASBIT). The scheme is based on the idea of that each node dynamically chooses the right number of message copies disseminated to respond to the current conditions of the network. When forwarding, ASBIT selects the node with a higher centrality as the next hop, and utilises the multi-attribute decision making theory for the division of the replication number between two nodes. Simulation results show that ASBIT achieves comparable delivery ratio and delivery delay while maintaining lower overhead compared with some well-known routing schemes in sparse scenarios. Copyright © 2012 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses various reports within the issue on topics including energy consumption in resilient telecommunication network, triangle inequalities and path routing problems.

Rate region precisely measures the transmission ability of a network. Three graph processing techniques are presented: reduced graph, union reduced graph, and virtual node. Applying these techniques, an operable method to completely solve the calculation of rate regions for unicast routing networks is developed. The correctness of the method is proved theoretically and illustrated with an example. This method is helpful in both theoretical perspective and industrial implementation. [ABSTRACT FROM AUTHOR]