A Cross-Layer Modification to the DSR Routing Protocol in Wireless Mesh Networks

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance comparisons between max_min_AEF, Metric Path (MP), and the well known ETT metrics are also carried out in this work. The results of this modification suggest that employing the max_min_AEF as a routing metric outperforms the Hc, ETT, and MP within the DSR protocol in WMNs in terms of throughput. This is because the max_min_AEF is based upon avoiding directing traffic through congested nodes where significant packet loss is likely to occur. This throughput improvement is associated with an increment in the delay time due to the long paths taken to avoid congested regions. To overcome this drawback, a further modification to the routing discovery mechanism has been made by imposing a hop count limit (HCL) on the discovered paths. Tuning the HCL allows the network manager to tradeoff throughput against delay. The choice of congestion avoidance metric exhibits another shortcoming owing to its dependency on the packet size. It penalises the smaller packets over large ones in terms of path lengths. This has been corrected for by introducing a ModAEF metric that explicitly considers the size of the packet. The ModAEF metric includes a tuning factor that allows the operator determine the level of the weighting that should be applied to the packet size to correct for this dependence

IETF standardization in the field of the Internet of Things (IoT): a survey

Smart embedded objects will become an important part of what is called the Internet of Things. However, the integration of embedded devices into the Internet introduces several challenges, since many of the existing Internet technologies and protocols were not designed for this class of devices. In the past few years, there have been many efforts to enable the extension of Internet technologies to constrained devices. Initially, this resulted in proprietary protocols and architectures. Later, the integration of constrained devices into the Internet was embraced by IETF, moving towards standardized IP-based protocols. In this paper, we will briefly review the history of integrating constrained devices into the Internet, followed by an extensive overview of IETF standardization work in the 6LoWPAN, ROLL and CoRE working groups. This is complemented with a broad overview of related research results that illustrate how this work can be extended or used to tackle other problems and with a discussion on open issues and challenges. As such the aim of this paper is twofold: apart from giving readers solid insights in IETF standardization work on the Internet of Things, it also aims to encourage readers to further explore the world of Internet-connected objects, pointing to future research opportunities

PERFORMANCE STUDY FOR CAPILLARY MACHINE-TO-MACHINE NETWORKS

Communication technologies witness a wide and rapid pervasiveness of wireless machine-to-machine (M2M) communications. It is emerging to apply for data transfer among devices without human intervention. Capillary M2M networks represent a candidate for providing reliable M2M connectivity. In this thesis, we propose a wireless network architecture that aims at supporting a wide range of M2M applications (either real-time or non-real-time) with an acceptable QoS level. The architecture uses capillary gateways to reduce the number of devices communicating directly with a cellular network such as LTE. Moreover, the proposed architecture reduces the traffic load on the cellular network by providing capillary gateways with dual wireless interfaces. One interface is connected to the cellular network, whereas the other is proposed to communicate to the intended destination via a WiFi-based mesh backbone for cost-effectiveness. We study the performance of our proposed architecture with the aid of the ns-2 simulator. An M2M capillary network is simulated in different scenarios by varying multiple factors that affect the system performance. The simulation results measure average packet delay and packet loss to evaluate the quality-of-service (QoS) of the proposed architecture. Our results reveal that the proposed architecture can satisfy the required level of QoS with low traffic load on the cellular network. It also outperforms a cellular-based capillary M2M network and WiFi-based capillary M2M network. This implies a low cost of operation for the service provider while meeting a high-bandwidth service level agreement. In addition, we investigate how the proposed architecture behaves with different factors like the number of capillary gateways, different application traffic rates, the number of backbone routers with different routing protocols, the number of destination servers, and the data rates provided by the LTE and Wi-Fi technologies. Furthermore, the simulation results show that the proposed architecture continues to be reliable in terms of packet delay and packet loss even under a large number of nodes and high application traffic rates

A critical analysis of research potential, challenges and future directives in industrial wireless sensor networks

In recent years, Industrial Wireless Sensor Networks (IWSNs) have emerged as an important research theme with applications spanning a wide range of industries including automation, monitoring, process control, feedback systems and automotive. Wide scope of IWSNs applications ranging from small production units, large oil and gas industries to nuclear fission control, enables a fast-paced research in this field. Though IWSNs offer advantages of low cost, flexibility, scalability, self-healing, easy deployment and reformation, yet they pose certain limitations on available potential and introduce challenges on multiple fronts due to their susceptibility to highly complex and uncertain industrial environments. In this paper a detailed discussion on design objectives, challenges and solutions, for IWSNs, are presented. A careful evaluation of industrial systems, deadlines and possible hazards in industrial atmosphere are discussed. The paper also presents a thorough review of the existing standards and industrial protocols and gives a critical evaluation of potential of these standards and protocols along with a detailed discussion on available hardware platforms, specific industrial energy harvesting techniques and their capabilities. The paper lists main service providers for IWSNs solutions and gives insight of future trends and research gaps in the field of IWSNs

A study into prolonging Wireless Sensor Network lifetime during disaster scenarios

A Wireless Sensor Network (WSN) has wide potential for many applications. It can be employed for normal monitoring applications, for example, the monitoring of environmental conditions such as temperature, humidity, light intensity and pressure. A WSN is deployed in an area to sense these environmental conditions and send information about them to a sink. In certain locations, disasters such as forest fires, floods, volcanic eruptions and earth-quakes can happen in the monitoring area. During the disaster, the events being monitored have the potential to destroy the sensing devices; for example, they can be sunk in a flood, burnt in a fire, damaged in harmful chemicals, and burnt in volcano lava etc. There is an opportunity to exploit the energy of these nodes before they are totally destroyed to save the energy of the other nodes in the safe area. This can prolong WSN lifetime during the critical phase. In order to investigate this idea, this research proposes a new routing protocol called Maximise Unsafe Path (MUP) routing using Ipv6 over Low power Wireless Personal Area Networks (6LoWPAN). The routing protocol aims to exploit the energy of the nodes that are going to be destroyed soon due to the environment, by concentrating packets through these nodes. MUP adapts with the environmental conditions. This is achieved by classifying four different levels of threat based on the sensor reading information and neighbour node condition, and represents this as the node health status, which is included as one parameter in the routing decision. High priority is given to a node in an unsafe condition compared to another node in a safer condition. MUP does not allow packet routing through a node that is almost failed in order to avoid packet loss when the node fails. To avoid the energy wastage caused by selecting a route that requires a higher energy cost to deliver a packet to the sink, MUP always forwards packets through a node that has the minimum total path cost. MUP is designed as an extension of RPL, an Internet Engineering Task Force (IETF) standard routing protocol in a WSN, and is implemented in the Contiki Operating System (OS). The performance of MUP is evaluated using simulations and test-bed experiments. The results demonstrate that MUP provides a longer network lifetime during a critical phase of typically about 20\% when compared to RPL, but with a trade-off lower packet delivery ratio and end-to-end delay performances. This network lifetime improvement is crucial for the WSN to operate for as long as possible to detect and monitor the environment during a critical phase in order to save human life, minimise loss of property and save wildlife

Quality of service aware data dissemination in vehicular Ad Hoc networks

Des systèmes de transport intelligents (STI) seront éventuellement fournis dans un proche avenir pour la sécurité et le confort des personnes lors de leurs déplacements sur les routes. Les réseaux ad-hoc véhiculaires (VANETs) représentent l'élément clé des STI. Les VANETs sont formés par des véhicules qui communiquent entre eux et avec l'infrastructure. En effet, les véhicules pourront échanger des messages qui comprennent, par exemple, des informations sur la circulation routière, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusés par des véhicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de réagir à temps (p.ex., ralentir), les messages d'urgence doivent être diffusés de manière fiable dans un délai très court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal à pertes, les terminaux cachés, les interférences et la bande passante limitée, qui compliquent énormément la satisfaction des exigences de fiabilité et de délai des messages d'urgence. Dans cette thèse, en guise de première contribution, nous proposons un schéma de diffusion efficace à plusieurs sauts, appelé Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; à l'intérieur de la zone arrière de l'expéditeur, les partitions sont calculées de sorte qu'en moyenne chaque partition contient au moins un seul véhicule; l'objectif est de s'assurer que seul un véhicule dans la partition la plus éloignée (de l'expéditeur) est utilisé pour diffuser le message, jusqu'au saut suivant; ceci donne lieu à un délai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mécanisme d'établissement de liaison, qui utilise des tonalités occupées, est proposé pour résoudre le problème du problème de terminal caché. Dans les VANETs, la Multidiffusion, c'est-à-dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est très importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problème majeur. Comme deuxième contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la première approche considère le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considère le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route. Comme troisième contribution, nous étudions le problème de la congestion causée par le routage du trafic de données dans les VANETs. Nous proposons (1) une approche de routage basée sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient déjà les données dans les VANETs. Les nouvelles demandes de routage sont traitées de sorte qu'aucun segment de route ne soit surchargé par plusieurs chemins de routage croisés. Au lieu d'acheminer les données en utilisant des chemins de routage sur un nombre limité de segments de route, notre approche équilibre la charge des données en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empêcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basée sur le réseau défini par logiciel (SDN) pour surveiller la connectivité VANET en temps réel et les délais de transmission sur chaque segment de route. Les données de surveillance sont utilisées en entrée de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach