Showing papers on "Routing table published in 2017"

Routing or Computing? The Paradigm Shift Towards Intelligent Computer Network Packet Transmission Based on Deep Learning

Abstract: Recent years, Software Defined Routers (SDRs) (programmable routers) have emerged as a viable solution to provide a cost-effective packet processing platform with easy extensibility and programmability Multi-core platforms significantly promote SDRs’ parallel computing capacities, enabling them to adopt artificial intelligent techniques, ie, deep learning, to manage routing paths In this paper, we explore new opportunities in packet processing with deep learning to inexpensively shift the computing needs from rule-based route computation to deep learning based route estimation for high-throughput packet processing Even though deep learning techniques have been extensively exploited in various computing areas, researchers have, to date, not been able to effectively utilize deep learning based route computation for high-speed core networks We envision a supervised deep learning system to construct the routing tables and show how the proposed method can be integrated with programmable routers using both Central Processing Units (CPUs) and Graphics Processing Units (GPUs) We demonstrate how our uniquely characterized input and output traffic patterns can enhance the route computation of the deep learning based SDRs through both analysis and extensive computer simulations In particular, the simulation results demonstrate that our proposal outperforms the benchmark method in terms of delay, throughput, and signaling overhead

Adaptive Quality-of-Service-Based Routing for Vehicular Ad Hoc Networks With Ant Colony Optimization

Abstract: Developing highly efficient routing protocols for vehicular ad hoc networks (VANETs) is a challenging task, mainly due to the special characters of such networks: large-scale sizes, frequent link disconnections, and rapid topology changes. In this paper, we propose an adaptive quality-of-service (QoS)-based routing for VANETs called AQRV. This new routing protocol adaptively chooses the intersections through which data packets pass to reach the destination, and the selected route should satisfy the QoS constraints and fulfil the best QoS in terms of three metrics, namely connectivity probability, packet delivery ratio (PDR), and delay. To achieve the given objectives, we mathematically formulate the routing selection issue as a constrained optimization problem and propose an ant colony optimization (ACO)-based algorithm to solve this problem. In addition, a terminal intersection (TI) concept is presented to decrease routing exploration time and alleviate network congestion. Moreover, to decrease network overhead, we propose local QoS models (LQMs) to estimate real time and complete QoS of urban road segments. Simulation results validate our derived LQM models and show the effectiveness of AQRV.

A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

Abstract: Introducing mobility to Wireless Sensor Networks (WSNs) puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs). Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

Routing in Vehicular Ad-hoc Networks: A Survey on Single- and Cross-Layer Design Techniques, and Perspectives

Abstract: Vehicular ad-hoc networks (VANETs) play an important role in intelligent transportation systems for improving security and efficiency. However, due to dynamic characteristics of the vehicular environment, routing remains a significant challenge in the VANETs. While single-layer routing protocols based on the traditional layered open systems interconnection (OSI) model are readily available, they often do not make use of important parameters at the lower three layers of the OSI model when making routing decision. Hence, for making optimal routing decision to gain superior network performance, there is a need to design cross-layer routing that allows information exchange between layers. In this article, a survey of the existing single-layer and cross-layer routing techniques in VANETs is presented, emphasizing on cross-layer routing protocols that utilize information at the physical, medium access control and network layers as routing parameters. An overview and challenges of routing are given, followed by a brief discussion of single-layer routing with more focus on geographic routing. Cross-layer routing protocols are then discussed in detail. The article then elaborates on some advantages and disadvantages of the existing routing approaches, cross-layer routing parameter selection and cross-layer design issues. Finally, some open research challenges in developing efficient routing protocols in the VANETs are highlighted.

EECOR: An Energy-Efficient Cooperative Opportunistic Routing Protocol for Underwater Acoustic Sensor Networks

Abstract: Underwater acoustic sensor networks (UW-ASNs) have recently been proposed for exploring the underwater resources and gathering the scientific data from the aquatic environments. UW-ASNs are faced with different challenges, such as high propagation delay, low bandwidth, and high energy consumption. However, the most notable challenge is perhaps how to efficiently forward the packets to the surface sink by considering the energy constrained sensor devices. The opportunistic routing concept may provide an effective solution for the UW-ASNs by the cooperation of the relay nodes to forward the packets to the surface sink. In this paper, the energy consumption problem is addressed and an energy-efficient cooperative opportunistic routing (EECOR) protocol is proposed to forward the packets toward the surface sink. In the EECOR protocol, a forwarding relay set is firstly determined by the source node based on the local information of the forwarder and then, a fuzzy logic-based relay selection scheme is applied to select the best relay based on considering the energy consumption ratio and the packet delivery probability of the forwarder. In the UW-ASNs, most of the energy is wasted due to the collisions amongst sensor nodes during the packet transmission. To alleviate the packet collisions problem, we have designed a holding timer for each of the forwarder to schedule the packets transmission toward the surface sink. We have performed our extensive simulations of the EECOR protocol on the Aqua-sim platform and compared with existing routing protocols in terms of average packet delivery ratio, average end-to-end delay, average energy consumption, and average network lifetime.

A Graph Theory Based Energy Routing Algorithm in Energy Local Area Network

Abstract: The energy Internet concept has been considered as a new development stage of the smart grid, which aims to increase the energy transmission efficiency and optimize the energy dispatching in time and space. Energy router is a core device in the energy Internet and it connects all the devices together into a net structure and manages power flows among them. The research work presented in this paper described the energy router's structure and function expectations from the network perspective, and improved the existing energy router design. Open shortest path first (OSPF) protocol and virtual circuit switching mode are referenced from the Internet in the energy local area network (e-LAN) design. This paper proposed a design of an energy routing algorithm based on graph theory in an e-LAN. A lowest cost routing selection algorithm is designed according to the features of power transmission, and a source selection and routing design algorithm is proposed for very heavy load conditions. Both algorithms have been verified by case analyses.

Including artificial intelligence in a routing protocol using Software Defined Networks

Abstract: Software defined network (SDN) is one of the most interesting research topic that is currently being investigated. The inclusion of artificial intelligence (AI) can improve the performance of routing protocols. Nowadays the application of AI over routing protocols is only applied to real devices, especially in wireless sensor nodes. In this paper, we present a new proposal to implement an intelligent routing protocol in a SDN topology. The intelligent routing protocol is based on the reinforcement learning process that allows choosing the best data transmission paths according to the best criteria and based on the network status.

PSO-based approach for energy-efficient and energy-balanced routing and clustering in wireless sensor networks

Abstract: Many schemes have been proposed for energy-efficient routing in wireless sensor networks (WSNs). However, most of these algorithms focus only on energy efficiency in which each node finds a shortest path to the base station (BS), but remain silent about energy balancing which is equally important to prolong the network lifetime. In this paper, we propose particle swarm optimization-based routing and clustering algorithms for WSNs. The routing algorithm builds a trade-off between energy efficiency and energy balancing, whereas the clustering algorithm takes care of the energy consumption of gateways as well as sensor nodes. We develop an efficient particle-encoding scheme and derive a multi-objective fitness function for each of the proposed routing and clustering algorithms. The algorithms are also capable of tolerating the failure of cluster heads. We perform extensive simulations on the proposed schemes and the results are compared with the existing algorithms to demonstrate their superiority in terms of various performance metrics.

SCOTRES: Secure Routing for IoT and CPS

Abstract: Wireless ad-hoc networks are becoming popular due to the emergence of the Internet of Things and cyber-physical systems (CPSs). Due to the open wireless medium, secure routing functionality becomes important. However, the current solutions focus on a constrain set of network vulnerabilities and do not provide protection against newer attacks. In this paper, we propose SCOTRES—a trust-based system for secure routing in ad-hoc networks which advances the intelligence of network entities by applying five novel metrics. The energy metric considers the resource consumption of each node, imposing similar amount of collaboration, and increasing the lifetime of the network. The topology metric is aware of the nodes’ positions and enhances load-balancing. The channel-health metric provides tolerance in periodic malfunctioning due to bad channel conditions and protects the network against jamming attacks. The reputation metric evaluates the cooperation of each participant for a specific network operation, detecting specialized attacks, while the trust metric estimates the overall compliance, safeguarding against combinatorial attacks. Theoretic analysis validates the security properties of the system. Performance and effectiveness are evaluated in the network simulator 2, integrating SCOTRES with the DSR routing protocol. Similar schemes are implemented using the same platform in order to provide a fair comparison. Moreover, SCOTRES is deployed on two typical embedded system platforms and applied on real CPSs for monitoring environmental parameters of a rural application on olive groves. As is evident from the above evaluations, the system provides the highest level of protection while retaining efficiency for real application deployments.

E2HRC: An Energy-Efficient Heterogeneous Ring Clustering Routing Protocol for Wireless Sensor Networks

Abstract: A heterogeneous ring domain communication topology with equal area in each ring is presented in this paper in an effort to solve the energy balance problem in original IPv6 routing protocol for low power and lossy networks (RPL). A new clustering algorithm and event-driven cluster head rotation mechanism are also proposed based on this topology. The clustering information announcement message and clustering acknowledgment message were designed according to RFC and original RPL message structure. An energy-efficient heterogeneous ring clustering (E2HRC) routing protocol for wireless sensor networks is then proposed and the corresponding routing algorithms and maintenance methods are established. Related messages are analyzed in detail. Experimental results show that in comparison against the original RPL, the E2HRC routing protocol more effectively balances wireless sensor network energy consumption, thus decreasing both node energy consumption and the number of control messages.

Load-Balanced Opportunistic Routing for Duty-Cycled Wireless Sensor Networks

Abstract: In duty-cycled wireless sensor networks running asynchronous MAC protocols, the time when a sender waits for its receiver to wake up and receive the packet is the major source of energy consumption. Opportunistic routing can reduce the sender wait time by allowing multiple candidate receivers, but by doing that it suffers from redundant packet forwarding due to multiple receivers waking up at the same time. Thus, the number of forwarders should be controlled in a way that overall forwarding cost is minimized considering both sender wait time and cost of redundant packet forwarding. Also, in order to prolong network lifetime, candidate forwarders should be selected so that load is balanced among nodes. We propose ORR, an opportunistic routing protocol that addresses the two issues. First, the optimal number of forwarders is calculated based on forwarding cost estimation, which is derived from duty cycle and network topology. Second, the metric used for selecting forwarders considers residual energy so that more traffic is guided through nodes with larger remaining energy. The resulting routing protocol is proven to avoid loops and shown to achieve longer network lifetime compared to other protocols regardless of duty cycle and network topology.

Research on Trust Sensing Based Secure Routing Mechanism for Wireless Sensor Network

Abstract: Aiming at the serious impact of the typical network attacks caused by the limited energy and the poor deployment environment of wireless sensor network (WSN) on data transmission, a trust sensing-based secure routing mechanism (TSSRM) with the lightweight characteristics and the ability to resist many common attacks simultaneously is proposed in this paper, at the same time the security route selection algorithm is also optimized by taking trust degree and QoS metrics into account. Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.

Adaptive energy aware cluster-based routing protocol for wireless sensor networks

Abstract: Wireless sensor networks (WSNs) have grown excessively due to their various applications and low installation cost. In WSN, the main concern is to reduce energy consumption among nodes while maintaining timely and reliable data forwarding. However, most of the existing energy aware routing protocols incur unbalanced energy consumption, which results in inefficient load balancing and compromised network lifetime. Therefore, the main target of this research paper is to present adaptive energy aware cluster-based routing (AECR) protocol for improving energy conservation and data delivery performance. Our proposed AECR protocol differs from other energy efficient routing schemes in some aspects. Firstly, it generates balance sized clusters based on nodes distribution and avoids random clusters formation. Secondly, it optimizes both intra-cluster and inter-cluster routing paths for improving data delivery performance while balancing data traffic on constructed forwarding routes and at the end, in order to reduce the excessive energy consumption and improving load distribution, the role of Cluster Head (CH) is shifted dynamically among nodes by exploit of network conditions. Simulation results demonstrate that AECR protocol outperforms state of the art in terms of various performance metrics.

SAF: Stochastic Adaptive Forwarding in Named Data Networking

Abstract: Forwarding decisions in classical IP-based networks are predetermined by routing. This is necessary to avoid loops, inhibiting opportunities to implement an adaptive and intelligent forwarding plane. Consequently, content distribution efficiency is reduced due to a lack of inherent multi-path transmission. In Named Data Networking (NDN) instead, routing shall hold a supporting role to forwarding, providing sufficient potential to enhance content dissemination at the forwarding plane. In this paper, we design, implement, and evaluate a novel probability-based forwarding strategy, called Stochastic Adaptive Forwarding (SAF) for NDN. SAF imitates a self-adjusting water pipe system, intelligently guiding and distributing interests through network crossings circumventing link failures and bottlenecks. Just as real pipe systems, SAF employs overpressure valves enabling congested nodes to lower pressure autonomously. Through an implicit feedback mechanism, it is ensured that the fraction of the traffic forwarded via congested nodes decreases. By conducting simulations, we show that our approach outperforms existing forwarding strategies in terms of the interest satisfaction ratio in the majority of the evaluated scenarios. This is achieved by extensive utilization of NDN’s multipath and content-lookup capabilities without relying on the routing plane. SAF explores the local environment by redirecting requests that are likely to be dropped anyway. This enables SAF to identify new paths to the content origin or to cached replicas, circumventing link failures, and resource shortages without relying on routing updates.

Fault-tolerant topology and routing synthesis for IEEE time-sensitive networking

Abstract: Time-Sensitive Networking (TSN) is a set of IEEE standards that extend Ethernet for safety-critical and real-time applications. TSN is envisioned to be widely used in several applications areas, from industrial automation to in-vehicle networking. A TSN network is composed of end systems interconnected by physical links and bridges (switches). The data in TSN is exchanged via streams. We address safety-critical real-time systems, and we consider that the streams use the Urgency-Based Scheduler (UBS) traffic-type, suitable for hard real-time traffic. We are interested in determining a fault-tolerant network topology, consisting of redundant physical links and bridges, the routing of each stream in the applications, such that the architecture cost is minimized, the applications are fault-tolerant (i.e., the critical streams have redundant disjoint routes), and the timing constraints of the applications are satisfied. We propose three approaches to solve this optimization problem: (1) a heuristic solution, (2) a Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic, and (3) a Constraint Programming-based model. The approaches are evaluated on several test cases, including a test case from General Motors Company.

DIO Suppression Attack Against Routing in the Internet of Things

Abstract: Recent standardization efforts are consolidating the role of routing protocol for low-power and lossy networks (RPL) as the standard routing protocol for IPv6-based wireless sensor and actuator networks. Investigating possible attacks against RPL is a top priority to improve the security of the future Internet of Things systems. In this letter, we present the DIO suppression attack , a novel degradation-of-service attack against RPL. Unlike other attacks in the literature, the DIO suppression attack does not require to steal cryptographic keys from some legitimate node. We show that the attack severely degrades the routing service, and it is far less energy-expensive than a jamming attack.

A distributed multi-path routing algorithm to balance energy consumption in wireless sensor networks

Abstract: A large use of applications of Wireless Sensor Networks (WSNs) pushes researchers to design and improve protocols and algorithms against the encountered challenges. One of the main goals is data gathering and routing to the base station (through the sink nodes) with lack of acknowledgement and where each node has no information about the network. Unbalanced energy consumption during the data routing process is an inherent problem in WSNs due to the limited energy capacity of the sensor nodes. In fact, WSNs require load balancing algorithms that make judicious use of the limited energy resource to route the gathered data to the sink node. In this paper, we propose a balanced multi-path routing algorithm by focusing on the residual energy and the hop count of each node to discover the best routes and to insert them into the routing table. The main idea of this algorithm comes from Ant Colony Optimization (ACO) and automata network modelization. Hence, the potential performance of the proposed algorithm relies on the best route to be selected which should have the minimum number of hops, the maximum energy and weighted energy between participating nodes to extend the lifetime of the network.

Path-Diversity-Aware Fault-Tolerant Routing Algorithm for Network-on-Chip Systems

Abstract: Network-on-Chip (NoC) is the regular and scalable design architecture for chip multiprocessor (CMP) systems. With the increasing number of cores and the scaling of network in deep submicron (DSM) technology, the NoC systems become subject to manufacturing defects and have low production yield. Due to the fault issues, the reduction in the number of available routing paths for packet delivery may cause severe traffic congestion and even to a system crash. Therefore, the fault-tolerant routing algorithm is desired to maintain the correctness of system functionality. To overcome fault problems, conventional fault-tolerant routing algorithms employ fault information and buffer occupancy information of the local regions. However, the information only provides a limited view of traffic in the network, which still results in heavy traffic congestion. To achieve fault-resilient packet delivery and traffic balancing, this work proposes a Path-Diversity-Aware Fault-Tolerant Routing ( PDA-FTR ) algorithm, which simultaneously considers path diversity information and buffer information. Compared with other fault-tolerant routing algorithms, the proposed work can improve average saturation throughput by 175 percent with only 8.9 percent average area overhead and 7.1 percent average power overhead.

A survey and analysis of multipath routing protocols in wireless multimedia sensor networks

Abstract: The main objective of this research is to conduct a performance analysis of various multipath routing protocols in wireless multimedia sensor networks for the efficient transmission of the image, audio and video data. To provide efficient routing for the large sized multimedia content, various multipath routing protocols such as energy-aware routing, QoS based routing and geographical routing methods are analyzed. In this analysis, the efficient routing techniques including geographical routing techniques such as GPSR, DGR, PW-DGR presented for wireless multimedia sensor networks are studied and the performance of each technique is evaluated to determine the efficient multipath routing technique. Comparisons are made for evaluated protocols and it is proved that the PW-DGR provides better routing performance for the multimedia data. The findings of the research also show that the PW-DGR method efficiently overcomes the routing problems such as energy bottleneck problem, energy-hole, reduced network lifetime and high delay in packet transmission.

Expect the unexpected: Sub-second optimization for segment routing

Abstract: In this paper, we study how to perform traffic engineering at an extremely-small time scale with segment routing, addressing a critical need for modern wide area networks. Prior work has shown that segment routing enables to better engineer traffic, thanks to its ability to program detours in forwarding paths, at scale. Two main approaches have been explored for traffic engineering with segment routing, respectively based on integer linear programming and constraint programming. However, no previous work deeply investigated how quickly those approaches can react to unexpected traffic changes and failures. We highlight limitations of existing algorithms, both in terms of required execution time and amount of path changes to be applied. Thus, we propose a new approach, based on local search and focused on the quick re-arrangement of (few) forwarding paths. We describe heuristics for sub-second recomputation of segment-routing paths that comply with requirements on the maximum link load (e.g., for congestion avoidance). Our heuristics enable a prompt answer to sudden criticalities affecting network services and business agreements. Through extensive simulations, we indeed experimentally show that our proposal significantly outperforms previous algorithms in the context of time-constrained optimization, supporting radical traffic changes in few tens of milliseconds for realistic networks.

Topology Configuration and Multihop Routing Protocol for Bluetooth Low Energy Networks

Abstract: This paper proposes a new cluster-based on-demand routing protocol to support multihop communication in Bluetooth low energy ad hoc networks The proposed scheme includes the topology configuration procedure, topology recovery scheme, and on-demand routing protocol The topology configuration procedure consists of node discovery, piconet configuration, and scatternet formation in a randomly distributed environment The proposed on-demand routing protocol is designed to minimize the number of route request messages by forwarding them to a master and relay nodes in each cluster during the route request procedure The performance evaluation shows that our proposed scheme substantially reduces energy consumption, which is the most critical issue on energy constrained networks

Attack-pattern discovery based enhanced trust model for secure routing in mobile ad-hoc networks

Abstract: Summary Multi-hop routing in an open environment in the absence of well-established infrastructure and centralized authority strives for trustworthiness and cooperation of nodes in a Mobile Ad-hoc Network (MANET). There is no guarantee of secure and reliable delivery of packets when some internal nodes intentionally perform packet forwarding misbehavior by compromising the routing mechanism. In this paper, we address this issue with a trust-model integrated with an attack pattern discovery technique. Extended from the Ad-hoc On-demand Distance Vector (AODV) routing protocol, we propose a trust-based scheme founded on nodes' historical behaviors which adopts a pattern discovery mechanism in order to detect suspicious activities from the malevolent nodes before they start dropping data packets. We also present the detailed mode of operations of three distinct adversary models launching various kinds of packet forwarding misbehavior. Theoretical analysis and experimental results prove that the integration of a pattern discovery method with a trust-based model provides earlier detection of adversaries which follow specific attack patterns and weakens their damaging effects on the network in comparison to a solitary trust-based model. Copyright © 2016 John Wiley & Sons, Ltd.

Implementing IPv6 Segment Routing in the Linux Kernel

Abstract: IPv6 Segment Routing is a major IPv6 extension that provides a modern version of source routing that is currently being developed within the Internet Engineering Task Force (IETF). We propose the first open-source implementation of IPv6 Segment Routing in the Linux kernel. We first describe it in details and explain how it can be used on both endhosts and routers. We then evaluate and compare its performance with plain IPv6 packet forwarding in a lab environment. Our measurements indicate that the performance penalty of inserting IPv6 Segment Routing Headers or encapsulating packets is limited to less than 15%. On the other hand, the optional HMAC security feature of IPv6 Segment Routing is costly in a pure software implementation. Since our implementation has been included in the official Linux 4.10 kernel, we expect that it will be extended by other researchers for new use cases.