1,032 research outputs found

    The support of multipath routing in IPv6-based internet of things

    Get PDF
    The development of IPv6-based network architectures for Internet of Things (IoT) systems is a feasible approach to widen the horizon for more effective applications, but remains a challenge. Network routing needs to be effectively addressed in such environments of scarce computational and energy resources. The Internet Engineering Task Force (IETF) specified the IPv6 Routing Protocol for Low Power and Lossy Network (RPL) to provide a basic IPv6-based routing framework for IoT networks. However, the RPL design has the potential of extending its functionality to a further limit and incorporating the support of advanced routing mechanisms. These include multipath routing which has opened the doors for great improvements towards efficient energy balancing, load distribution, and even more. This paper fulfilled a need for an effective review of recent advancements in Internet of Things (IoT) networking. In particular, it presented an effective review and provided a taxonomy of the different multipath routing solutions enhancing the RPL protocol. The aim was to discover its current state and outline the importance of integrating such a mechanism into RPL to revive its potentiality to a wider range of IoT applications. This paper also discussed the latest research findings and provided some insights into plausible follow-up researches

    OF-ECF ::a new optimization of the objective function for parent selection in RPL

    Get PDF
    The RPL routing protocol is designed to respond to the requirements of a large range of Low-power and Lossy Networks (LLNs). RPL uses an objective function (OF) to build the route toward a destination based on routing metrics. Considering only a single metric, some network performances can be improved while others may be degraded. In this paper, we present a flexible Objective Function based on Expected Transmission Count (ETX), Consumed Energy and Forwarding Delay (OF-ECF) built on a combination of metrics using an additive method. The main goal of this proposed solution is to balance energy consumption and minimize the average delay. To improve the reliability of the network, a flexible routing scheme that provides the diversity of paths and a higher availability is presented. Simulations results show that the new objective function OF-ECF outperforms the OF-FUZZY, and the standards OF0 and MRHOF. In terms of network lifetime and reliability

    Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

    Get PDF
    We consider a transmission of a delay-sensitive data stream from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet. An effective and well studied solution to this problem is to protect the data by a Forward Error Correction (FEC) code and send the FEC packets over multiple paths. In this paper we show that the performance of such a multipath FEC scheme can often be further improved. Our key observation is that the propagation times on the available paths often significantly differ, typically by 10-100ms. We propose to exploit these differences by appropriate packet scheduling that we call `Spread'. We evaluate our solution with a precise, analytical formulation and trace-driven simulations. Our studies show that Spread substantially outperforms the state-of-the-art solutions. It typically achieves two- to five-fold improvement (reduction) in the effective loss rate. Or conversely, keeping the same level of effective loss rate, Spread significantly decreases the observed delays and helps fighting the delay jitter.Comment: 12 page

    An Energy-Efficient Forwarding Scheme for Wireless Sensor Networks

    Get PDF
    Energy-efficient forwarding becomes important if resources and battery lifetime are limited such as in Wireless Sensor Networks. Although widely used, simple hop-based forwarding along a path from one node towards a sink can be very inefficient in terms of delivery rate as well as energy efficiency, especially in lossy environments. We will show that just minimizing the expected number of transmissions within the network is not always the most efficient forwarding strategy. Using a realistic link loss model, we derive two new forwarding schemes named Single-Link and Multi-Link Energy-Efficient Forwarding that trade off delivery rate and energy costs best by maximizing energy efficiency. Multi-Link Forwarding further benefits from addressing multiple receivers during packet forwarding, instead of a single one. By mathematical analyses, extensive simulations, and experimental experiments we contrast the performance of our approaches against a comprehensive framework of different forwarding strategies

    Let the Tree Bloom: Scalable Opportunistic Routing with ORPL

    Get PDF
    Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low-latency data collection in duty-cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating traffic with arbitrary patterns. We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmaps and Bloom filters to represent and propagate this information in a space-efficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state-of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task
    • …
    corecore