Neighbour-disjoint multipath for low-power and lossy networks

In this article, we describe a neighbour disjoint multipath (NDM) scheme that is shown to be more resilient amidst node or link failures compared to the two well-known node disjoint and edge disjoint multipath techniques. A centralised NDM was first conceptualised in our initial published work utilising the spatial diversity among multiple paths to ensure robustness against localised poor channel quality or node failures. Here, we further introduce a distributed version of our NDM algorithm adapting to the low-power and lossy network (LLN) characteristics. We implement our distributed NDM algorithm in Contiki OS on top of LOADng—a lightweight On-demand Ad hoc Distance Vector Routing protocol. We compare this implementation's performance with a standard IPv6 Routing Protocol for Low power and Lossy Networks (RPL), and also with basic LOADng, running in the Cooja simulator. Standard performance metrics such as packet delivery ratio, end-to-end latency, overhead and average routing table size are identified for the comparison. The results and observations are provided considering a few different application traffic patterns, which serve to quantify the improvements in robustness arising from NDM. The results are confirmed by experiments using a public sensor network testbed with over 100 nodes

Reliable load-balancing routing for resource-constrained wireless sensor networks

Wireless sensor networks (WSNs) are energy and resource constrained. Energy limitations make it advantageous to balance radio transmissions across multiple sensor nodes. Thus, load balanced routing is highly desirable and has motivated a significant volume of research. Multihop sensor network architecture can also provide greater coverage, but requires a highly reliable and adaptive routing scheme to accommodate frequent topology changes. Current reliability-oriented protocols degrade energy efficiency and increase network latency. This thesis develops and evaluates a novel solution to provide energy-efficient routing while enhancing packet delivery reliability. This solution, a reliable load-balancing routing (RLBR), makes four contributions in the area of reliability, resiliency and load balancing in support of the primary objective of network lifetime maximisation. The results are captured using real world testbeds as well as simulations. The first contribution uses sensor node emulation, at the instruction cycle level, to characterise the additional processing and computation overhead required by the routing scheme. The second contribution is based on real world testbeds which comprises two different TinyOS-enabled senor platforms under different scenarios. The third contribution extends and evaluates RLBR using large-scale simulations. It is shown that RLBR consumes less energy while reducing topology repair latency and supports various aggregation weights by redistributing packet relaying loads. It also shows a balanced energy usage and a significant lifetime gain. Finally, the forth contribution is a novel variable transmission power control scheme which is created based on the experience gained from prior practical and simulated studies. This power control scheme operates at the data link layer to dynamically reduce unnecessarily high transmission power while maintaining acceptable link reliability

Power-benefit analysis of erasure encoding with redundant routing in sensor networks.

One of the problems sensor networks face is adversaries corrupting nodes along the path to the base station. One way to reduce the effect of these attacks is multipath routing. This introduces some intrusion-tolerance in the network by way of redundancy but at the cost of a higher power consumption by the sensor nodes. Erasure coding can be applied to this scenario in which the base station can receive a subset of the total data sent and reconstruct the entire message packet at its end. This thesis uses two commonly used encodings and compares their performance with respect to power consumed for unencoded data in multipath routing. It is found that using encoding with multipath routing reduces the power consumption and at the same time enables the user to send reasonably large data sizes. The experiments in this thesis were performed on the Tiny OS platform with the simulations done in TOSSIM and the power measurements were taken in PowerTOSSIM. They were performed on the simple radio model and the lossy radio model provided by Tiny OS. The lossy radio model was simulated with distances of 10 feet, 15 feet and 20 feet between nodes. It was found that by using erasure encoding, double or triple the data size can be sent at the same power consumption rate as unencoded data. All the experiments were performed with the radio set at a normal transmit power, and later a high transmit power

Lifetime and latency aware data collection in wireless sensor networks

A Wireless Sensor Network (WSN) consists of a set of sensor nodes deployed in the environment where we intend to collect physical information such as temperatures. All the senor nodes are connected wirelessly, and work cooperatively to fulfill some specified tasks. Sensor nodes are typically battery powered. As a result, the network lifetime becomes a major optimization objective in the design of a WSN. Another important optimisation objective is to minimize the maximum latency of data collection for time-critical applications. In this thesis, we study the problem of lifetime and latency aware data collection in a static WSN with only one base station. We propose two novel routing structures, namely, k-tree and k-DAG, to balance the loads of the neighbouring sensor nodes of the base station to prolong the lifetime of the network while providing the maximum latency guarantee. Firstly, we investigate the lifetime aware data collection problem by using ktree. A k-tree is a spanning tree with the base station as the root such that the path from each sensor node to the base station is at most k hops longer than the shortest path from this sensor node to the base station. We propose a distributed algorithm for constructing a k-tree such that the loads of the base station s children are balanced. Secondly, we study the lifetime aware data collection problem by using k-DAG. A k-DAG is a spanning Directed Acyclic Graph (DAG) with the base station as the only source node such that the path length of any path from each sensor node to the base station is not k hops longer than its shortest path length to the base station. We present a distributed algorithm for constructing a k-DAG such that the loads of the base station s children are balanced. In addition, we propose an efficient distributed naming scheme to assign a unique ID to each sensor node for efficient point-to-point communication. We have implemented all of our algorithms by Cooja simulator. The simulation results show that our approaches significantly increase the network lifetime by up to 82%

Multi-hop Route Discovery Using Opportunistic Routing for Wireless Sensor Networks

In wireless sensor networks multi-hop routing is often used because of the limited transmission range of sensor nodes. Opportunistic Routing is a multi-hop routing for wireless sensor networks. In this routing, the neighbors of sender node overhear the transmission and f``orm multiple hops from source to the destination for transfer of information. The neighbor nodes set participating in the routing are included in the forwarder list in the order of priority. The node with highest priority is allowed to forward the packet it hears. A new protocol by Energy Efficient Selective Opportunistic Routing (EESOR), is implemented in this paper that reduces the size of forwarder list by applying a condition that the forwarding node is nearer to the destination. The path followed by acknowledgment packet follows opportunistic routing, assuring reliability of transmission and energy balancing. NS2 is the simulator used to implement the algorithm and results of simulation show that proposed EESOR protocol performs better than existing Energy Efficient Opportunistic Routing (EEOR) protocol with respect to parameters End-to-End Delay, Throughput, Routing Overhead and Network Lifetime

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Contributions to provide a QoS-aware self-configured framework for video-streaming services over ad hoc networks

Aplicat embargament des del dia 27 d'octubre de 2021 fins 31 de juliol de 2022Ad hoc networks have attracted much attention from the research community over the last years and important technical advances have risen as a consequence. These networks are foreseen as an important kind of next generation access networks, where multimedia services will be demanded by end users from their wireless devices everywhere. In this thesis, we specially focus our research work on mobile ad hoc networks (MANETs) and on vehicular ad hoc networks (VANETs), two kind of ad hoc networks over which interesting multimedia services can be provided. The special haracteristics of MANETs/VANETs, such as mobility, dynamic network topology (specially in VANETs), energy constraints (in case of MANETs), infrastructureless and variable link capacity, make the QoS (Quality of Service) provision over these networks an important challenge for the research community. Due to that, there is a need to develop new routing protocols specially designed for MANETs and VANETs able to provide multimedia services. The main objective of this thesis is to contribute in the development of the communication framework for MANETs and VANETs to improve decisions to select paths or next hops in the moment of forwarding video-reporting messages. In this way, it would be possible to have a quick answer to manage daily problems in the city and help the emergency units (e.g., police, ambulances, health care units) in case of incidents (e.g., traffic accidents). Furthermore, in case of VANETs, a real scenario must be created and thus we have analysed the presence of obstacles in real maps. Also, in case of an obstacle found between the current forwarding node and the candidate next forwarding node, the packet is stored in a buffer, for a maximum time, until a forwarding neighbour node is found; otherwise, the packet is dropped. To improve the communication framework for MANETs, we propose a new routing protocol based on a game-theoretical scheme for N users specially designed to transmit video-reporting messages. Our proposal makes the network more efficient and provides a higher degree of satisfaction of the users by receiving much more packets with a lower average end-to-end delay, lower jitter and higher PSNR (Peak Signal-to-Noise Ratio). In addition, we propose a geographical routing protocol for VANETs that considers multiple metrics named 3MRP (Multimedia Multimetric Map-Aware Routing Protocol) [1]. 3MRP is a geographical protocol based on hop-by-hop forwarding. The metrics considered in 3MRP are the distance, the density of vehicles in transmission range, the available bandwidth, the future trajectory of the neighbouring nodes and the MAC layer losses. Those metrics are weighted to obtain a multimetric score. Thus, a node selects another node among its neighbours as the best forwarding node to increase the percentage of successful packet delivery, minimizing the average packet delay and offering a certain level of quality and service. Furthermore, a new algorithm named DSW (Dynamic Self-configured Weights) computes for each metric its corresponding weight depending on the current network conditions. As a consequence, nodes are classiffied in a better way.Les xarxes sense fils ad hoc han captat molt l'atenció per part de la comunitat científica en els últims anys, a més dels importants avenços tècnics que han sorgit. Aquestes xarxes es preveuen com un tipus important de xarxes d'accés de nova generació, a on els serveis multimèdia seran requerits pels usuaris a través dels seus dispositius sense fils desde tot arreu. En aquesta tesi, centrem el nostre treball especialment en les xarxes mòbils ad hoc (MANET, Mobile Ad hoc Network) i en les xarxes vehiculars ad hoc (VANET, Vehicular Ad hoc Network). Les característiques especials de les MANETs i les VANETs, com la mobilitat, la topologia dinàmica de la xarxa (especialment en VANETs), les restriccions de bateria (en cas de MANETs), l'absència d'infrastructura i la capacitat variable de l'enllaç sense fil fa que la provisió de la qualitat de servei en aquestes xarxes sigui un repte important per a la comunitat científica. A causa d'això, hi ha la necessitat de desenvolupar nous protocols d'encaminament especialment dissenyats per a MANETs i VANETs capaços de proporcionar els serveis de multimèdia requerits. L'objectiu principal d'aquesta tesi és proveir millores en la comunicació per a les xarxes ad hoc MANET i VANET per millorar les decisions a l'hora de seleccionar els propers camins o nodes, respectivament, en el moment de l'enviament de les trames del video. D'aquesta manera serà possible tenir una resposta ràpida per resoldre els problema diaris a la ciutat i ajudar a les unitats d'emergència (per exemple, policia, ambulàncies, unitats de salut) en cas d'incidents, com ara els accidents de trànsit. Per analitzar adequadament les nostres propostes sobre VANETs hem dissenyat un entorn de simulació realista que incorpora la presència d'edificis en mapes reals i en el cas que hi hagi un obstacle entre el node actual i el candidat per a ser el pròxim salt el paquet s'emmagatzema en un buffer, per un temps màxim, fins a trobar un nou candidat; en cas contrari, es descarta el paquet. Per millorar les comunicacions en les MANETs, proposem un nou protocol d'encaminament basat en teoria de jocs per a N usuaris especialment dissenyat per a enviar missatges de vídeo. Això fa que la xarxa sigui més eficient, i així s'aconsegueix un major grau de satisfacció dels usuaris en rebre molts més paquets amb un menor retard mig extrem a extrem, menor variació del retard (jitter ) i major PSNR (Relació Senyal Soroll de Pic) . A més, es proposa un protocol d'encaminament geogràfic basat en el reenviament hop-by-hop per a VANETs anomenat 3MRP (Multimedia Multimetric Map-Aware Routing Protocol ) [1] que prèn en consideració múltiples mètriques. Les mètriques considerades en 3MRP són la distància a destinació, la densitat de vehicles en el rang de transmissió, l'ample de banda disponible, la trajectòria futura dels nodes veíns i la perdua de paquets a la capa MAC. Aquestes mètriques es ponderen per a obtenir una puntuació multimètrica. Així, un node pot seleccionar el millor node de reenviament entre tots els seus veíns per augmentar la probabilitat d' èxit de lliurament de paquets, minimitzant el retard mitjà dels paquets i oferint un cert nivell de qualitat de servei.Las redes ad hoc han llamado mucho la atención por parte de la comunidad científica en los últimos años, además de los importantes avances técnicos que han surgido. Estas redes se prevén como un tipo importante de redes de acceso de nueva generación, donde los servicios multimedia sean requeridos por los usuarios a través de sus dispositivos inalámbricos desde todas partes. En esta tesis, centramos nuestro trabajo de investigación especialmente en las redes móviles ad hoc (MANET, Mobile Ad hoc Network) y las redes vehiculares ad hoc (VANET, Vehicular Ad hoc Network). Las características especiales de las MANETs y las VANETs, como la movilidad, la topología dinámica de la red (especialmente en VANETs), las restricciones de batería (en caso de MANETs), la ausencia de infraestructura y la capacidad variable del enlace inalámbrico hace que la provisión de la calidad de servicio en estas redes sea un reto importante para la comunidad científica. Debido a esto, existe la necesidad de desarrollar nuevos protocolos de encaminamiento especialmente diseñados para MANETs y VANETs capaces de proporcionar los servicios de multimedia requeridos. El objetivo principal de esta tesis es proveer mejoras en la comunicación para las redes ad hoc MANET y VANET para mejorar las decisiones a la hora de seleccionar los próximos caminos o nodos, respectivamente, en el momento del envío de las tramas del video y de esta manera sería posible tener una respuesta rápida para resolver los problema diarios en la ciudad y ayudar a las unidades de emergencia (por ejemplo, policía, ambulancias, unidades de salud) en caso de incidentes, como accidentes de tráfico. Para analizar adecuadamente nuestras propuestas sobre VANETs hemos diseñado un entorno de simulación realista que incorpora la presencia de edificios en mapas reales. En el caso de que haya un obstáculo entre el nodo actual y el candidato para ser el próximo salto el paquete se almacena en un buer, durante un tiempo máximo, hasta encontrar un nuevo candidato; en caso contrario, se descarta el paquete. Para mejorar las comunicaciones en las MANETs, proponemos un nuevo protocolo de encaminamiento basado en teoría de juegos para N usuarios especialmente diseñados para enviar mensajes de video. Esto hace que la red sea más eficiente, y así se consigue un mayor grado de satisfacción de los usuarios al recibir muchos más paquetes con un menor promedio de retardo de extremo a extremo, variación de retardo (jitter) y mayor PSNR (Relación Señal a Ruido de Pico). Además, se propone un protocolo de encaminamiento geográfico basado en el reenvío de salto-a-salto para VANETs llamado 3MRP (Multimedia multimetric Map-Aware Routing Protocol) [1] que incluye diversas métricas. Las métricas consideradas en 3MRP son la distancia al destino, la densidad de vehículos en el rango de transmisión, el ancho de banda disponible, la trayectoria futura de los nodos vecinos y la pérdida de paquetes en la capa MAC. Estas métricas se ponderan para obtener una puntuación multimetricanal. Así, un nodo puede seleccionar el mejor nodo de reenvío entre todos sus vecinos para aumentar la probabilidad de éxito de entrega de paquetes, minimizando el retardo medio de los paquetes y ofreciendo un cierto nivel de calidad de servicio. Por otra parte, se ha diseñado un nuevo algoritmo capaz de dar a cada métrica su correspondiente peso en función de las condiciones actuales de la red. De esta forma, los nodos se pueden clasificar de una mejor manera. Por último, se propone un nuevo protocolo de encaminamiento para VANETs llamado G-3MRP (Game Theoretical Multimedia Multimetric Map-aware Routing Protocol) [2] para enviar mensajes de video basado en teoría de juegos para N usuarios en escenarios urbanos. G-3MRP se basa en el protocolo de encaminamiento 3MRP. G-3MRP utiliza hasta tres nodos a través de los cuales los tres tipos de cuadros de video I, P y B serán enviados. Las métricas utilizadas son las mismas que en 3MRP. G-3MRP logra una mayor grado de satisfacción de los usuarios mediante la recepción de muchos más paquetes de video y con un mayor nivel de PSNR, que la anterior propuesta 3MRP+DSW. También hemos analizado el problema de detección de obstáculos en mapas reales para VANETs en escenarios urbanos. Para este propósito, hemos desarrollado nuestra herramienta REVsim [3] de tal forma que puede estar fácilmente integrada en nuestra propuesta de protocolo de encaminamiento para que las simulaciones sean más realistas.Postprint (published version

Transport mechanism for wireless micro sensor network

Wireless sensor network (WSN) is a wireless ad hoc network that consists of very large number of tiny sensor nodes communicating with each other with limited power and memory constrain. WSN demands real-time routing which requires messages to be delivered within their end-to-end deadlines (packet lifetime). This report proposes a novel real-time with load distribution (RTLD) routing protocol that provides real time data transfer and efficient distributed energy usage in WSN. The RTLD routing protocol ensures high packet throughput with minimized packet overhead and prolongs the lifetime of WSN. The routing depends on optimal forwarding (OF) decision that takes into account of the link quality, packet delay time and the remaining power of next hop sensor nodes. RTLD routing protocol possesses built-in security measure. The random selection of next hop node using location aided routing and multi-path forwarding contributes to built-in security measure. RTLD routing protocol in WSN has been successfully studied and verified through simulation and real test bed implementation. The performance of RTLD routing in WSN has been compared with the baseline real-time routing protocol. The simulation results show that RTLD experiences less than 150 ms packet delay to forward a packet through 10 hops. It increases the delivery ratio up to 7 % and decreases power consumption down to 15% in unicast forwarding when compared to the baseline routing protocol. However, multi-path forwarding in RTLD increases the delivery ratio up to 20%. In addition, RTLD routing spreads out and balances the forwarding load among sensor nodes towards the destination and thus prolongs the lifetime of WSN by 16% compared to the baseline protocol. The real test bed experiences only slight differences of about 7.5% lower delivery ratio compared to the simulation. The test bed confirms that RTLD routing protocol can be used in many WSN applications including disasters fighting, forest fire detection and volcanic eruption detection