Data Dissemination Performance in Large-Scale Sensor Networks

As the use of wireless sensor networks increases, the need for (energy-)efficient and reliable broadcasting algorithms grows. Ideally, a broadcasting algorithm should have the ability to quickly disseminate data, while keeping the number of transmissions low. In this paper we develop a model describing the message count in large-scale wireless sensor networks. We focus our attention on the popular Trickle algorithm, which has been proposed as a suitable communication protocol for code maintenance and propagation in wireless sensor networks. Besides providing a mathematical analysis of the algorithm, we propose a generalized version of Trickle, with an additional parameter defining the length of a listen-only period. This generalization proves to be useful for optimizing the design and usage of the algorithm. For single-cell networks we show how the message count increases with the size of the network and how this depends on the Trickle parameters. Furthermore, we derive distributions of inter-broadcasting times and investigate their asymptotic behavior. Our results prove conjectures made in the literature concerning the effect of a listen-only period. Additionally, we develop an approximation for the expected number of transmissions in multi-cell networks. All results are validated by simulations

A Novel Adaptive and Efficient Routing Update Scheme for Low-Power Lossy Networks in IoT

In this paper, we introduce Drizzle, a new algorithm for maintaining routing information in the Low-power and Lossy Networks (LLNs). The aim is to address the limitations of the currently standardized routing maintenance (i.e. Trickle algorithm) in such networks. Unlike Trickle, Drizzle has an adaptive suppression mechanism that assigns the nodes different transmission probabilities based on their transmission history so to boost the fairness in the network. In addition, Drizzle removes the listen-only period presented in Trickle intervals leading to faster convergence time. Furthermore, a new scheme for setting the redundancy counter has been introduced with the goal to mitigate the negative side effect of the short-listen problem presented when removing the listen-only period and boost further the fairness in the network. The performance of the proposed algorithm is validated through extensive simulation experiments under different scenarios and operation conditions. In particular, Drizzle is compared to four routing maintenance algorithms in terms of control-plane overhead, power consumption, convergence time and packet delivery ratio (PDR) under uniform and random distributions and with lossless and lossy links. The results indicated that Drizzle reduces the control-plane overhead, power consumption and the convergence time by up to 76%, 20% and 34% respectively while maintaining approximately the same PDR rates

Pervasive service discovery in low-power and lossy networks

Pervasive Service Discovery (SD) in Low-power and Lossy Networks (LLNs) is expected to play a major role in realising the Internet of Things (IoT) vision. Such a vision aims to expand the current Internet to interconnect billions of miniature smart objects that sense and act on our surroundings in a way that will revolutionise the future. The pervasiveness and heterogeneity of such low-power devices requires robust, automatic, interoperable and scalable deployment and operability solutions. At the same time, the limitations of such constrained devices impose strict challenges regarding complexity, energy consumption, time-efficiency and mobility. This research contributes new lightweight solutions to facilitate automatic deployment and operability of LLNs. It mainly tackles the aforementioned challenges through the proposition of novel component-based, automatic and efficient SD solutions that ensure extensibility and adaptability to various LLN environments. Building upon such architecture, a first fully-distributed, hybrid pushpull SD solution dubbed EADP (Extensible Adaptable Discovery Protocol) is proposed based on the well-known Trickle algorithm. Motivated by EADPs’ achievements, new methods to optimise Trickle are introduced. Such methods allow Trickle to encompass a wide range of algorithms and extend its usage to new application domains. One of the new applications is concretized in the TrickleSD protocol aiming to build automatic, reliable, scalable, and time-efficient SD. To optimise the energy efficiency of TrickleSD, two mechanisms improving broadcast communication in LLNs are proposed. Finally, interoperable standards-based SD in the IoT is demonstrated, and methods combining zero-configuration operations with infrastructure-based solutions are proposed. Experimental evaluations of the above contributions reveal that it is possible to achieve automatic, cost-effective, time-efficient, lightweight, and interoperable SD in LLNs. These achievements open novel perspectives for zero-configuration capabilities in the IoT and promise to bring the ‘things’ to all people everywhere

Contributions to the performance evaluation and improvement of the IPv6 routing protocol for low-power and lossy networks

Wireless Sensor Networks (WSNs) have become increasingly important. These networks comprise sensor and actuator nodes that enable intelligent monitoring and control applications in a wide spectrum of environments including smart cities, home automation, remote health and precision agriculture to mention a few. In certain IETF circles, networks of these characteristics are called Low Power and Lossy Networks (LLNs). Whereas most LLN protocol architectures were born without native IP support, there exists a tendency in the market towards IP convergence, since IP-based LLNs offer an open and tandardized way of connecting LLNs to the Internet, thus nabling the Internet of Things (IoT). Since most LLN configurations are multihop, and thus a routing protocol is required, the IETF created the Routing Over Low power and Lossy networks (ROLL) working group, which decided to develop a new routing protocol called IPv6 Routing Protocol for LLNs (RPL). RPL was specifically designed to meet the requirements of LLNs and is a central component of the IETF protocol suite for the IoT. Since RPL has already been deployed in millions of nodes, it is fundamental to characterize its properties, evaluate the influence of its main parameters and options on network performance, and analyze performance improvement possibilities. This PhD thesis presents the following original contributions in this field: 1. Evaluation of the influence of the main RPL parameters on the network convergence process over IEEE 802.15.4 multihop networks, in terms of network characteristics such as size and density. In addition, a mechanism that leverages an option available in RPL for accelerating network convergence has been proposed and evaluated. This study provides a guideline for configuring and selecting adequately crucial RPL parameters and mechanisms for achieving high network convergence performance, as well as a characterization of the related performance trade-offs. 2. Development of an analytical model for estimating the network convergence time of RPL in a static chain topology network of IEEE 802.15.4 nodes, in the presence of bit errors. Results show the scenarii in terms of BER and chain topology length that may dramatically degrade performance experienced by a user. The model provides a lower bound on the network convergence time for a random topology network. 3. Development of an analytical tool to estimate the number of control messages transmitted in a random topology static network which uses the Trickle algorithm (a transmission scheduling algorithm used in RPL) under steady state conditions. Results show the accuracy of the model, which can be used for both synchronous and asynchronous networks. The slight difference in performance between these two network configurations is discussed and illustrated. 4. Theoretical evaluation of the route change latency incurred by RPL when 6LoWPAN Neighbor Discovery (ND) is used. On this basis, a study on the impact of the relevant 6LoWPAN ND and RPL parameters on path availability and the trade-off between path availability and message overhead, has been carried out. 5. Development of a RPL simulator for OMNeT++ using the MiXiM framework.La importància de les Wireless Sensor Networks (WSNs) ha estat creixent significativament en els darrers anys. Aquestes xarxes comprenen node sensors i actuadors que possibiliten aplicacions de control i monitorització en un ampli ventall d'entorns, incloent les ciutats intel·ligents, automatització residencial, etc. En alguns cercles de l'IETF, aquestes xarxes són anomenades Low Power and Lossy Networks (LLNs). La majoria d'arquitectures de protocols van néixer sense suport natiu per a IP, per ha existit recentment una tendència en el mercat envers la convergència IP, ja que les LLN basades en IP ofereixen una manera oberta i estandaritzada de connectar LLNs a Internet, tot creant la Internet de les Coses. Atès que moltes configuracions de LLNsn multisalt, i per tant es requereix un protocol d'encaminament, l'IETF va crear el Routing Over Low power and Lossy networks (ROLL) working group, que va decidir dissenyar un nou protocol anomenat IPv6 Routing Protocol for LLNs (RPL). RPL va ser específicament dissenyat per complir amb els requeriments de les LLNs i és un component central de la pila de protocols de l'IETF per a la Internet de les Coses. Atès que RPL ha estat desplegat en milions de nodes, és fonamental caracteritzar les seves propietats, avaluar la influència dels seus paràmetres principals i opcions en el rendiment, i analitzar les possibilitats de millora del protocol. Aquesta tesi presenta les següents contribucions originals en aquest camp: 1. Avaluació de la influència dels principals paràmetres de RPL en el procés de convergència de la xarxa en xarxes IEEE 802.15.4, en termes de característiques com la mida i la densitat de la xarxa. A més a més, s'ha proposat i avaluat un mecanisme que utilitza una opci disponible en el RPL per a accelerar la convergència de xarxa. Aquest estudi proporciona una guia per configurar i escollir adequadament paràmetres crucials del protocol RPL per tal d'assolir una ràpida convergència de xarxa, això com una caracteritzaci dels compromisos relacionats. 2. Desenvolupament d'un model analátic per estimar el temps de convergència de xarxa de RPL en una topologia de xarxaestàtica en cadena de nodes IEEE 802.15.4, en presència d'errors. Els resultats mostren els escenaris en termes de BER i mida de la cadena que poden degradar les prestacions percebudes per l'usuari. El model proporciona una fita inferior del temps de convergència de xarxa per a una topologia aleatòria. 3. Desenvolupament d'una eina analítica per estimar el nombre de missatges de control transmesos en una xarxa de topologia aleat ria i estàtica on s'usa l'algoritme Trickle (algoritme de planificació i control de les transmissions emprat en RPL), en condicions de règim permanent. Els resultats mostren la precisió del model, que pot ser emprat en xarxes síncrones i asíncrones. La lleugera diferència de prestacions entre un escenari i l'altre és discutida i il·lustrada. 4. Avaluació teòrica del temps de canvi de ruta de RPL quan s'usa 6LoWPAN Neighbor Discovery (ND). En base a aixó , es realitza un estudi de l'impacte dels paràmetres rellevants de RPL i 6LoWPAN ND en la disponibilitat de cambi el compromís amb l'overhead de missatges. 5. Desenvolupament d'un simulador de RPL per a OMNeT++ usant el MiXiM framewor