scispace - formally typeset
Search or ask a question

Showing papers on "Multipath routing published in 2018"


Journal ArticleDOI
TL;DR: A novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the 4D correspond to the type of topology, two forms of scalability of aTopology, and the tightness of the delay constraint, which identifies two algorithms, namely Lagrange relaxation-based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the4D evaluation space
Abstract: A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the 4D correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation-based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.

126 citations


Journal ArticleDOI
TL;DR: The current design and implementation of NLSR is described, with emphasis on those features that differentiate it from an IP-based link state routing protocol: naming: a hierarchical naming scheme for routers, keys, and routing updates; and multipath routing: a simple way to calculate and rank multiple forwarding options.
Abstract: The Named-data Link State Routing protocol (NLSR) is a protocol for intra-domain routing in Named Data Networking (NDN). It is an application level protocol similar to many IP routing protocols, but NLSR uses NDN’s interest/data packets to disseminate routing updates, directly benefiting from NDN’s built-in data authenticity. The NLSR design, which was first developed in 2013 and deployed on the NDN test bed in August 2014, has undergone significant changes. Following an application-driven design approach, NLSR’s development helped drive the development of the trust/security functionality of NDN libraries as well as a number of features in NDN’s forwarding daemon and ChronoSync. In this paper, we describe the current design and implementation of NLSR, with emphasis on those features that differentiate it from an IP-based link state routing protocol: 1) naming: a hierarchical naming scheme for routers, keys, and routing updates; 2) security: a hierarchical trust model for routing within a single administrative domain; 3) routing information dissemination: using ChronoSync to disseminate routing updates; and 4) multipath routing: a simple way to calculate and rank multiple forwarding options. Although NLSR is designed in the context of a single domain, its design patterns may offer a useful reference for future development of inter-domain routing protocols.

108 citations


Journal ArticleDOI
TL;DR: A new clustering-based reliable low-latency multipath routing (CRLLR) scheme is proposed by employing Ant Colony Optimization (ACO) technique, which outperforms the AQRV and T-AOMDV in terms of overall latency and reliability at the expenses of slightly higher energy consumption.

73 citations


Journal ArticleDOI
TL;DR: Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes.
Abstract: Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.

73 citations


Journal ArticleDOI
Cong Pu1
TL;DR: Simulation results show that the JarmRout can not only improve packet delivery ratio and packet delivery latency but also can reduce end-to-end communication outage rate without introducing extra communication overhead, indicating a viable approach to improve network resiliency in the presence of malicious jammers in FANETs.
Abstract: As a result of the rapid technological advances on electronic, sensors and communication technologies, and increasingly popular multi-sized unmanned aerial vehicles, also referred to as drones, flying ad hoc networks (FANETs) are rapidly proliferating and leading the emergence of Internet of Drones and its applications. Because of the versatility, flexibility, easy installation, and relatively small operating expenses of drones, FANETs have enormous potential in the public and civil domains. However, due to unique characteristics of FANETs, routing demands of FANETs go beyond the needs of mobile ad hoc networks and vehicular ad hoc networks. In this paper, we propose a jamming-resilient multipath routing protocol, also called JarmRout , so that intentional jamming and disruption or isolated and localized failures do not interrupt the overall network performance of FANETs. To achieve this goal, the JarmRout relies on a combination of three major schemes that are link quality scheme, traffic load scheme, and spatial distance scheme. We present a simple analytical model and its numerical result in terms of RREP packet reception rate of source node. We also evaluate the proposed routing protocol through extensive simulation experiments using the OMNeT++ and compare its performance with three representative routing protocols that are dynamic source routing, optimized link state routing, and split multipath routing. Simulation results show that the JarmRout can not only improve packet delivery ratio and packet delivery latency but also can reduce end-to-end communication outage rate without introducing extra communication overhead, indicating a viable approach to improve network resiliency in the presence of malicious jammers in FANETs.

69 citations


Journal ArticleDOI
TL;DR: Simulations and analytical results demonstrate that LFC significantly outperforms the single-path retransmission-based approach of RPL $+$ TSCH and the state-of-the-art LinkPeek solution.
Abstract: Wireless industrial networks require reliable and deterministic communication. Determinism implies that there must be a guarantee that each data packet will be delivered within a bounded delay. Moreover, it must ensure that the potential congestion or interference will not impact the predictable properties of the network. In 2016, IEEE 802.15.4 time-slotted channel hopping (TSCH) emerged as an alternative medium access control to the industrial standards such as WirelessHART and ISA100.11a. However, TSCH is based on traditional collision detection and retransmission, and cannot guarantee reliable delivery within a given time. This paper proposes LeapFrog Collaboration (LFC) to provide deterministic and reliable communication over a routing protocol (RPL) based network. LFC is a novel multipath routing algorithm that takes advantage of route diversity by duplicating the data flow onto an alternate path. Simulations and analytical results demonstrate that LFC significantly outperforms the single-path retransmission-based approach of RPL $+$ TSCH and the state-of-the-art LinkPeek solution.

62 citations


Journal ArticleDOI
TL;DR: A novel QoS aware evolutionary cluster based routing protocol (QERP) has been proposed for UWSN-based applications that improves packet delivery ratio, and reduces average end-to-end delay and overall network energy consumption.
Abstract: Quality-of-service (QoS) aware reliable data delivery is a challenging issue in underwater wireless sensor networks (UWSNs). This is due to impairments of the acoustic transmission caused by excessive noise, extremely long propagation delays, high bit error rate, low bandwidth capacity, multipath effects, and interference. To address these challenges, meet the commonly used UWSN performance indicators, and overcome the inefficiencies of the existing clustering-based routing schemes, a novel QoS aware evolutionary cluster based routing protocol (QERP) has been proposed for UWSN-based applications. The proposed protocol improves packet delivery ratio, and reduces average end-to-end delay and overall network energy consumption. Our comparative performance evaluations demonstrate that QERP is successful in achieving low network delay, high packet delivery ratio, and low energy consumption.

59 citations


Journal ArticleDOI
TL;DR: Three novel algorithms are introduced to resolve fragmentation problem and improve blocking probability in EON-SDM; called Fragmentation Measure Metric Aware with Routing and Spectrum and Core Assignment (FMMA-RSCA), Most Fragmented Path per Core (MFPC), and Spectrum Block Multipathing perCore (SBMC).

57 citations


Journal ArticleDOI
TL;DR: This paper classify, survey, model and compare the most relevant and recent QoS-based routing protocols proposed in the framework of WBAN, and provides a study of adaptability of the surveyed protocols related to the healthcare sector.
Abstract: Wireless Body Area Network (WBAN) constitutes a set of sensor nodes responsible for monitoring human physiological activities and actions. The increasing demand for real time applications in such networks stimulates many research activities in quality-of-service (QoS) based routing for data delivery. Designing such scheme of critical events while preserving the energy efficiency is a challenging task due to the dynamic of the network topology, severe constraints on power supply and limited in computation power and communication bandwidth. The design of QoS-based routing protocols becomes an essential part of WBANs and plays an important role in the communication stacks and has significant impact on the network performance. In this paper, we classify, survey, model and compare the most relevant and recent QoS-based routing protocols proposed in the framework of WBAN. A novel taxonomy of solutions is proposed, in which the comparison is performed with respect to relevant criteria. An analytical model is proposed in order to compare the performances of all the solutions. Furthermore, we provide a study of adaptability of the surveyed protocols related to the healthcare sector.

55 citations


Journal ArticleDOI
TL;DR: Large-scale simulation results demonstrate that PRD performs better than the widely used ETX metric as well as other two metrics devised recently in terms of energy consumption and end-to-end delay, while guaranteeing packet delivery ratio.
Abstract: This paper investigates the problem of energy consumption in wireless sensor networks. Wireless sensor nodes deployed in harsh environment where the conditions change drastically suffer from sudden changes in link quality and node status. The end-to-end delay of each sensor node varies due to the variation of link quality and node status. On the other hand, the sensor nodes are supplied with limited energy and it is a great concern to extend the network lifetime. To cope with those problems, this paper proposes a novel and simple routing metric, predicted remaining deliveries (PRD), combining parameters, including the residual energy, link quality, end-to-end delay, and distance together to achieve better network performance. PRD assigns weights to individual links as well as end-to-end delay, so as to reflect the node status in the long run of the network. Large-scale simulation results demonstrate that PRD performs better than the widely used ETX metric as well as other two metrics devised recently in terms of energy consumption and end-to-end delay, while guaranteeing packet delivery ratio.

50 citations


Proceedings ArticleDOI
20 May 2018
TL;DR: Preliminary results show that, the QoE-aware SDN- based MPTCP/SR scheme performs better compared to the conventional TCP approach in terms of throughput, link utilization and the end-user's QOE.
Abstract: The explosion of enhanced applications such as live video streaming, video gaming and Virtual Reality calls for efforts to optimize transport protocols to manage the increasing amount of data traffic on future 5G networks. Through bandwidth aggregation over multiple paths, the Multi-Path Transmission Control Protocol (MPTCP) can enhance the performance of network applications. MPTCP can split a large multimedia flow into subflows and apply a congestion control mechanism on each subflow. Segment Routing (SR), a promising source routing approach, has emerged to provide advanced packet forwarding over 5G networks. In this paper, we explore the utilization of MPTCP and SR in SDN-based networks to improve network resources utilization and end- user's QoE for delivering multimedia services over 5G networks. We propose a novel QoE-aware, SDN- based MPTCP/SR approach for service delivery. In order to demonstrate the feasibility of our approach, we implemented an intelligent QoE- centric Multipath Routing Algorithm (QoMRA) on an SDN source routing platform using Mininet and POX controller. We carried out experiments on Dynamic Adaptive video Steaming over HTTP (DASH) applications over various network conditions. The preliminary results show that, our QoE-aware SDN- based MPTCP/SR scheme performs better compared to the conventional TCP approach in terms of throughput, link utilization and the end-user's QoE.

Journal ArticleDOI
01 Mar 2018
TL;DR: A biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics.
Abstract: Biogeography-based optimization (BBO) is a relatively new paradigm for optimization which is yet to be explored to solve complex optimization problems to prove its full potential. In wireless sensor networks (WSNs), optimal cluster head selection and routing are two well-known optimization problems. Researchers often use hierarchal cluster-based routing, in which power consumption of cluster heads (CHs) is very high due to its extra functionalities such as receiving and aggregating the data from its member sensor nodes and transmitting the aggregated data to the base station (BS). Therefore, proper care should be taken while selecting the CHs to enhance the life of the network. After formation of the clusters, data to be routed to the BS in inter-cluster fashion for further enhancing the life of WSNs. In this paper, a biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing. The biogeography-based CH selection algorithm is proposed with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics. The BBO-based routing algorithm is also proposed. The efficient encoding scheme of a habitat is developed, and its fitness function considers the node degree in addition to residual energy and distance. To exhibit the performance of BERA, it is extensively tested with some existing routing algorithms such as DHCR, Hybrid routing, EADC and some bio-inspired algorithms, namely GA and PSO. Simulation results confirm the superiority/competitiveness of the proposed algorithm over existing techniques.

Proceedings ArticleDOI
01 Jul 2018
TL;DR: The contributions of this work are a new, more general, way for nodes to apply fees for forwarding payments which allows to keep the network balanced and improve its performance in the long term, and a new multipath routing payment scheme, based on the atomic multipath payment method, which is able to significantly reduce the fees paid by users, while being fast and also able to keepThe network balanced.
Abstract: Bitcoin is a new digital currency created with the aim of being decentralized, peer-to-peer, censorship-resistant, borderless, scarce, fast and cheap to use. Since Bitcoin main way of operating is based on broadcast communications, e.g. all transactions of the currency reach all network peers, how to achieve scalability is one of the most important concerns for it to achieve wide usage. One of the proposals to improve its scalability takes the form of the Lightning Network (LN) which consists of an overlay network on top of the base Bitcoin layer. Such an overlay allows to perform a new kind of off-blockchain transactions, i.e. transactions not broadcast to the entire network, that, differently from previous off-blockchain solutions, do not require to put trust in any third entity. Important open problems of the LN are i) defining how payments should be routed and ii) establishing which fee policies intermediate nodes should apply for forwarding payments. The contributions of this work are twofold: we first propose a new, more general, way for nodes to apply fees for forwarding payments which allows to keep the network balanced and improve its performance in the long term. Secondly, we propose a new multipath routing payment scheme, based on the atomic multipath payment method, which is able to significantly reduce the fees paid by users, while being fast and also able to keep the network balanced.

Proceedings ArticleDOI
01 Dec 2018
TL;DR: A joint traffic routing and virtual network function (VNF) placement problem is studied for a multicast service request accommodated over a physical substrate network, where the multipath traffic routing is considered between embedded VNFs.
Abstract: The software defined networking (SDN) enabled network function virtualization (NFV) architecture emerges as a cost-effective solution for service customization in fifth generation (5G) networks. In this paper, a joint traffic routing and virtual network function (VNF) placement problem is studied for a multicast service request accommodated over a physical substrate network, where the multipath traffic routing is considered between embedded VNFs. The joint problem is formulated as a mixed integer linear programming (MILP) problem to minimize the provisioning cost of both VNFs and links, under the physical network resource constraints, flow conservation constraints, and VNF placement rules. Since the problem is NP-hard, low complexity heuristic algorithms, with the consideration of both the single-path and multipath routing cases, are proposed to determine an efficient solution. Simulation results are presented to demonstrate the effectiveness and accuracy of the proposed heuristic algorithms especially for a large-size network.

Journal ArticleDOI
TL;DR: The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets, and employs a multiattribute decision-making strategy to reduce the number of redundant candidates for next-hop selection.
Abstract: We present a bio-inspired unicast routing protocol for vehicular ad hoc networks which uses the cellular attractor selection mechanism to select next hops. The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets. We further employ a multiattribute decision-making strategy, the technique for order preference by similarity to an ideal solution, to reduce the number of redundant candidates for next-hop selection, so as to enhance the performance of attractor selection mechanism. Once the routing path is found, URAS maintains the current path or finds another better path adaptively based on the performance of current path, that is, it can self-evolution until the best routing path is found. Our simulation study compares the proposed solution with the state-of-the-art schemes, and shows the robustness and effectiveness of the proposed routing protocol and the significant performance improvement, in terms of packet delivery, end-to-end delay, and congestion, over the conventional method.

Journal ArticleDOI
TL;DR: Results show that secret splitting along with multipath routing helps to attain privacy preservation in WSN based healthcare system.

Journal ArticleDOI
TL;DR: A review of four common and applicable variants of the vehicle routing problem, namely, capacitated vehicle routingProblem, vehicle routing problems with time windows, periodic vehicles routing problem and the dynamic vehicle routingproblem, are considered based on formulation techniques, methods of solution and areas of application.
Abstract: A vehicle routing problem involves finding a set of optimal route for a fleet of capacitated vehicles which are available at a location to service the demands of a set of customers. In its simplest form, a customer is required to be visited once and the capacity of a vehicle must not be exceeded. In this paper, a review of four common and applicable variants of the vehicle routing problem, namely, capacitated vehicle routing problem, vehicle routing problem with time windows, periodic vehicle routing problem and the dynamic vehicle routing problem, are considered based on formulation techniques, methods of solution and areas of application. A summary table is presented for each variant to emphasis some key features that represent direction of current research.

Journal ArticleDOI
TL;DR: A small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another, and demonstrates that it is hard to pick a winner among existing policies.
Abstract: With the exponential growth of content in recent years, users are primarily interested in obtaining particular content and are not concerned with the host housing the content. By treating content as a first class citizen, information- centric networks (ICN) seek to transform the Internet from a host-to-host communication model to a content-centric model. A key component of ICN is to cache content at storage-enabled routers. By caching content at in-network routers, network performance can be improved by delivering content from routers closer to the user and not from the origin servers (content custodians). In this article, we provide an overview of the state-of-the-art cache management and routing policies in ICN. We present a small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another. Our simulation results demonstrate that it is hard to pick a winner among existing policies. We conclude the article with a discussion of open research questions.

Journal ArticleDOI
01 Jan 2018
TL;DR: A Balanced and Energy Efficient MH (BEEMH) algorithm that is developed based on Dijkstra algorithm, which gives great interest to the residual energy of nodes is proposed and higher energy nodes are exclusively elected to work as relays.
Abstract: In Wireless Sensor Networks, the power resources of the nodes are significantly restricted. Hence, a special treatment for their available energy is deeply required. In long distance transmission, Multi-Hop (MH) techniques are preferred. Although MH minimizes the amount of energy cost consumed by each node along the path but finding the optimal routing path between nodes is still very interesting issues. This paper proposes a Balanced and Energy Efficient MH (BEEMH) algorithm that is developed based on Dijkstra algorithm. It gives great interest to the residual energy of nodes; hence higher energy nodes are exclusively elected to work as relays. Moreover, the total energy consumption at both TX and RX has been merged to model the weight of links between nodes. Finally, Dijkstra algorithm is employed to efficiently search for the minimum cost path. Furthermore, two proposed MH protocols are introduced. Both are mainly based on the BEEMH algorithm. MATLAB simulator has been used to evaluate BEEMH in comparison with other conventional algorithms such as; minimum transmission energy (MTE), energy saving oriented least-hop routing algorithm (ESLHA), and energy saving-oriented routing algorithm based on Dijkstra (ESRAD) under various scenarios of network models. Then the performance of our proposed protocols is compared with the related MH protocols.

Journal ArticleDOI
TL;DR: The proposed energy-efficient data sensing and routing scheme (EEDSRS) in unreliable energy-harvesting wireless sensor network is developed and the experimental results demonstrate that the proposed EEDSRS is very promising and efficient.
Abstract: Energy-harvesting wireless sensor network (WSN) is composed of unreliable wireless channels and resource-constrained nodes which are powered by solar panels and solar cells. Energy-harvesting WSNs can provide perpetual data service by harvesting energy from surrounding environments. Due to the random characteristics of harvested energy and unreliability of wireless channel, energy efficiency is one of the main challenging issues. In this paper, we are concerned with how to decide the energy used for data sensing and transmission adaptively to maximize network utility, and how to route all the collected data to the sink along energy-efficient paths to maximize the residual battery energy of nodes. To solve this problem, we first formulate a heuristic energy-efficient data sensing and routing problem. Then, unlike the most existing work that focuses on energy-efficient data sensing and energy-efficient routing respectively, energy-efficient data sensing and routing scheme (EEDSRS) in unreliable energy-harvesting wireless sensor network is developed. EEDSRS takes account of not only the energy-efficient data sensing but also the energy-efficient routing. EEDSRS is divided into three steps: (1) an adaptive exponentially weighted moving average algorithm to estimate link quality. (2) an distributed energetic-sustainable data sensing rate allocation algorithm to allocate the energy for data sensing and routing. According to the allocated energy, the optimal data sensing rate to maximize the network utility is obtained. (3) a geographic routing with unreliable link protocol to route all the collected data to the sink along energy-efficient paths. Finally, extensive simulations to evaluate the performance of the proposed EEDSRS are performed. The experimental results demonstrate that the proposed EEDSRS is very promising and efficient.

Journal ArticleDOI
Chuan Lin1, Yuanguo Bi1, Hai Zhao1, Zheng Liu1, Siyuan Jia1, Jian Zhu1 
TL;DR: This paper proposes a TE engine DTE-SDN by utilizing the software defined networking (SDN) technology, aiming to schedule the transfer of delay-sensitive traffic, and proposes a probabilistic-matching approach that aims to distribute the traffic among multiple end-to-end paths according to the computed flow distribution policy.
Abstract: With ever-rapid development of information and communication technologies, e.g., smart city, industrial Internet, Internet of Things, etc., enormous amounts of data are explosively generated and delivered to the computing center for further processing, which brings additional burden to both transfer components (e.g., the Internet) and data processing units. To efficiently schedule data transfer especially for delay-sensitive traffic, a scalable network architecture with intelligent traffic engineering (TE) policy is indispensable. In this paper, we propose a TE engine DTE-SDN by utilizing the software defined networking (SDN) technology, aiming to schedule the transfer of delay-sensitive traffic. Particularly, with OpenFlow, DTE-SDN captures an overall view of the network in real-time and can monitor the quality of service (QoS) metrics (e.g., throughput and delay) of each network link. In order to schedule the delay-sensitive transfer, a dynamic-scheduling scheme capable of multipath routing is proposed, which allows DTE-SDN to compute the near-optimal scheduling (e.g., path selection and flow distribution), based on the instantaneous QoS metrics. Especially, in the scheduling scheme, we propose a probabilistic-matching approach that aims to distribute the traffic among multiple end-to-end paths according to the computed flow distribution policy and can be deployed in SDN-enabled switches (e.g., Open vSwitch). The simulation results demonstrate that DTE-SDN is able to measure the throughput and delay with acceptable error range and can dramatically enhance the transfer efficiency than the traditional scheduling algorithms.

Proceedings ArticleDOI
31 Oct 2018
TL;DR: MDA-Lite as mentioned in this paper is an alternative to the MDA that significantly cuts overhead while maintaining a low failure probability, and Fakeroute is a simulator that enables validation of a multipath route tracing tool's adherence to its claimed failure probability bounds.
Abstract: Since its introduction in 2006--2007, Paris Traceroute and its Multipath Detection Algorithm (MDA) have been used to conduct well over a billion IP level multipath route traces from platforms such as M-Lab. Unfortunately, the MDA requires a large number of packets in order to trace an entire topology of load balanced paths between a source and a destination, which makes it undesirable for platforms that otherwise deploy Paris Traceroute, such as RIPE Atlas. In this paper we present a major update to the Paris Traceroute tool. Our contributions are: (1) MDA-Lite, an alternative to the MDA that significantly cuts overhead while maintaining a low failure probability; (2) Fakeroute, a simulator that enables validation of a multipath route tracing tool's adherence to its claimed failure probability bounds; (3) multilevel multipath route tracing, with, for the first time, a Traceroute tool that provides a router-level view of multipath routes; and (4) surveys at both the IP and router levels of multipath routing in the Internet, showing, among other things, that load balancing topologies have increased in size well beyond what has been previously reported as recently as 2016. The data and the software underlying these results are publicly available.

Journal ArticleDOI
TL;DR: In this paper, the addressing process relies on virtual coordinates from multiple, alternative anchor point sets that act as viewports, and each viewport offers different address granularity within the network space, and its selection is optimized by a packet sending node using a novel heuristic.
Abstract: Packet routing in nanonetworks requires novel approaches, which can cope with the extreme limitations posed by the nano-scale. Highly lossy wireless channels, extremely limited hardware capabilities and non-unique node identifiers are among the restrictions. The present work offers an addressing and routing solution for static 3D nanonetworks that find applications in material monitoring and programmatic property tuning. The addressing process relies on virtual coordinates from multiple, alternative anchor point sets that act as \emph{viewports}. Each viewport offers different address granularity within the network space, and its selection is optimized by a packet sending node using a novel heuristic. Regarding routing, each node can deduce whether it is located on the linear segment connecting the sender to the recipient node. This deduction is made using integer calculations, node-local information and in a stateless manner, minimizing the computational and storage overhead of the proposed scheme. Most importantly, the nodes can regulate the width of the linear path, thus trading energy efficiency (redundant transmissions) for increased path diversity. This trait can enable future adaptive routing schemes. Extensive evaluation via simulations highlights the advantages of the novel scheme over related approaches.

Journal ArticleDOI
TL;DR: The timing-constrained global routing algorithm is shown how to incorporate global static timing constraints into global routing and is demonstrated by experimental results on industrial chips.
Abstract: We show how to incorporate global static timing constraints into global routing. Our approach is based on the min–max resource sharing model that proved successful for global routing in theory and practice. Static timing constraints are modeled by a linear number of additional resources and customers. The algorithm dynamically adjusts delay budgets and can, thus, tradeoff wiring congestion for delay. As a subroutine, the algorithm routes a single net. If this subroutine is near-optimal, we will find near-optimal solutions for the overall problem very efficiently. The approach works for many delay models; here we discuss a linear delay model (before buffering) and the Elmore delay model (after buffering). We demonstrate the benefit of our timing-constrained global routing algorithm by experimental results on industrial chips.

Journal ArticleDOI
TL;DR: This paper proposes trust enhanced cluster based multipath routing (TECM) algorithm, which is very effective in terms of loss and delivery rate, delay, routing overhead and network lifetime compare to FPNT-OLSR.
Abstract: The dynamic nature of mobile nodes of ad hoc network is mostly affected by security problems which reduce data forwarding rate in multimedia sources Due to the rapid growth of wireless applications, the different multitalented routing protocols are proposed in recent years But the recent protocols are not efficient for multimedia applications, till now, specific security aware routing protocols are not proposed for multimedia data transfers In this paper, we proposed trust enhanced cluster based multipath routing (TECM) algorithm We use energy efficient PSO algorithm used to create cluster formation and cluster head, super cluster head are selected from trust values, which compute form proposed TECM algorithm The multi trust factors are used for trust computation, such as frame/packet loss ratio, frame/packet forward energy, frame/packet receiving energy, routing overhead, received signal strength, frame/packet forward rate, average forward delay and protocol deviation flag We then combine proposed TECM algorithm with standard multipath OLSR protocol (TECM-OLSR) to analyze the performance of proposed algorithm The simulated results show that proposed TECM-OLSR protocol is very effective in terms of loss and delivery rate, delay, routing overhead and network lifetime compare to FPNT-OLSR

Journal ArticleDOI
TL;DR: Two multi paths routing protocols (M-AODV and MDSDV) have been evaluated in order to improve QoS for real-time multimedia applications and results show that none of these two protocols is better than the other.
Abstract: Providing quality of service (QoS) for real-time multimedia applications such as video streaming in mobile ad hoc networks (MANETs) is an important challenge. MANETs are characterized by lack of fixed infrastructure, dynamic topology, and limited resources that make more difficult multimedia applications transport and run on this networks. To overcome this challenge, video coding techniques combined to multiple routing paths (multipath) is a promising technique for supporting transmission of multiple video streams with appropriate QoS over mobile ad hoc networks. In this paper, firstly, many issues and different techniques for video streaming over MANET have been reviewed and secondly two multi paths routing protocols (M-AODV and MDSDV) have been evaluated in order to improve QoS for real-time multimedia applications. Results show that none of these two protocols is better than the other. In certain situations (throughput and load network with high mobility) is M-AODV but in others (network load and reliability for large-scale network) is MDSDV protocol which displays good performance. It is also noted that these two protocols provide between acceptable and good quality and a small jitter regardless of nodes number in medium mobility.

Journal ArticleDOI
TL;DR: An adaptive distributed routing method with cooperative transmission to effectively solve the problem presented above, in which the transmitters only use local information to transmit packets with help from their cooperative nodes, and can improve network performance in terms of energy efficiency, throughput and end-to-end delay.

Journal ArticleDOI
TL;DR: A new routing scheme for EON is proposed, namely, k -distance adaptive paths (KDAP) that efficiently utilizes the benefit of distance-adaptive modulation, and bit rate- Adaptive superchannel capability inherited by EON to improve spectrum utilization.

Journal ArticleDOI
TL;DR: This paper studies the problem of spectrum-aware routing in a multi-hop, multi-channel cognitive radio network when malicious nodes in the secondary network attempt to block the path with mixed attacks, and decomposes the stochastic routing game into a series of stage games.
Abstract: This paper studies the problem of spectrum-aware routing in a multi-hop, multi-channel cognitive radio network when malicious nodes in the secondary network attempt to block the path with mixed attacks. Based on the location and time-variant path delay information, we model the path discovery process as a non-cooperative stochastic game. By exploiting the structure of the underlying Markov Decision Process, we decompose the stochastic routing game into a series of stage games. For each stage game, we propose a distributed strategy learning mechanism based on stochastic fictitious play to learn the equilibrium strategies of joint relay-channel selection in the condition of both limited information exchange and potential routing-toward-primary attacks. We also introduce a trustworthiness evaluation mechanism based on a multi-arm bandit process for normal users to avoid relaying to the sink-hole attackers. Simulation results show that without the need of information flooding, the proposed algorithm is efficient in bypassing the malicious nodes with mixed attacks.

Journal ArticleDOI
TL;DR: In this article, a DTN based geographic routing scheme in heterogeneous scenario is proposed, which considers individual nodal visiting preference (referred to nonidentical nodal mobility).
Abstract: Previous geographic routing schemes in delay/disruption tolerant networks (DTNs) only consider the homogeneous scenario where nodal mobility is identical. Motivated by this gap, we turn to design a DTN based geographic routing scheme in heterogeneous scenario. Systematically, our target is achieved via two steps: 1) We first propose, “The-best-geographic-relay (TBGR)” routing scheme to relay messages via a limited number of copies, under the homogeneous scenario. We further overcome the local maximum problem of TBGR given a sparse network density, different from those efforts in dense networks like clustered wireless sensor networks. 2) We next extend TBGR for heterogeneous scenario, and propose “the-best-heterogeneity-geographic-relay (TBHGR)” routing scheme considering individual nodal visiting preference (referred to nonidentical nodal mobility). Extensive results under a realistic heterogeneous scenario show the advantage of TBHGR over literature works in terms of reliable message delivery, while with low routing overhead.