Evaluation of 6LoWPAN Generic Header Compression in the Context of a RPL Network.

The Internet of Things (IoT) facilitates the integration of diverse devices, leading to the formation of networks such as Low-power Wireless Personal Area Networks (LoWPANs). These networks have inherent constraints that make header and payload compression an attractive solution to optimise communication. In this work, we evaluate the performance of Generic Header Compression (6LoWPAN-GHC), defined in RFC 7400, for IEEE 802.15.4-based networks running the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL). Through simulation and real-device experiments, we study the impact of 6LoWPAN-GHC on energy consumption and delays and investigate for which scenarios 6LoWPAN-GHC is beneficial. We show that all RPL control packets are compressible by 6LoWPAN-GHC, which reduces their transmission delay and as such their vulnerability to interference. However, for the devices under study transmitting at 250 kbit/s, the energy gain obtained from sending a compressed packet is outweighed by the energy needed to compress it. The use of 6LoWPAN-GHC causes an energy increase of between 2% and 26%, depending on the RPL packet type. When the range is more important than the bandwidth and a sub-GHz band is used at 10 kbit/s, an energy gain of 11% to 29% can be obtained, depending on the type of RPL control packet.

Flexible and Efficient Security Framework for Many-to-Many Communication in a Publish/Subscribe Architecture.

Message Queuing Telemetry Transport (MQTT) is a lightweight publish/subscribe protocol, which is currently one of the most popular application protocols in Internet of Things (IoT) thanks to its simplicity in use and its scalability. The secured version, MQTTS, which combines MQTT with the Transport Layer Security (TLS) protocol, has several shortcomings. It only offers one-to-one security, supports a limited number of security features and has high computation and communication costs. In this paper, we propose a flexible and lightweight security solution to be integrated in MQTT, addressing many-to-many communication, which reduces the communication overhead by 80% and the computational overhead by 40% for the setup of a secure connection on the client side.

Traffic Aware Scheduler for Time-Slotted Channel-Hopping-Based IPv6 Wireless Sensor Networks.

Wireless sensor networks (WSNs) are becoming increasingly prevalent in numerous fields. Industrial applications and natural-disaster-detection systems need fast and reliable data transmission, and in several cases, they need to be able to cope with changing traffic conditions. Thus, time-slotted channel hopping (TSCH) offers high reliability and efficient power management at the medium access control (MAC) level; TSCH considers two dimensions, time and frequency when allocating communication resources. However, the scheduler, which decides where in time and frequency these communication resources are allotted, is not part of the standard. Orchestra has been proposed as a scheduler which allocates the communication resources based on information collected through the IPv6 routing protocol for low-power and lossy networks (RPL). Orchestra is a very elegant solution, but does not adapt to high traffic. This research aims to build an Orchestra-based scheduler for applications with unpredictable traffic bursts. The implemented scheduler allocates resources based on traffic congestion measured for the children of the root and RPL subtree size of the same nodes. The performance analysis of the proposed scheduler shows lower latency and higher packet delivery ratio (PDR) compared to Orchestra during bursts, with negligible impact outside them.

Time-Slotted Spreading Factor Hopping for Mitigating Blind Spots in LoRa-Based Networks.

It has been demonstrated that LoRa-based wide area networks (WANs) can cover extended areas under harsh propagation conditions. Traditional LoRaWAN solutions based on single-hop access face important drawbacks related to the presence of blind spots. This paper aims to tackle blind spots and performance issues by using a relaying approach. Many researchers investigating multi-hop solutions consider a fixed spreading factor (SF). This simplifies synchronization and association processes, but does not take advantage of the orthogonality between the virtual channels (i.e., frequency, SF) that help to mitigate blind spots. This paper proposes a time-slotted spreading factor hopping (TSSFH) mechanism that combines virtual channels and time slots into a frame structure. Pseudo-random scheduling is used inside blind spots, which simplifies the end-devices' communication process and network organization. The results show how collisions decrease inside blind spots when more communication opportunities become available as more relaying nodes can be listening in different cells (i.e., frequency, SF-offset, time-offset). This has a direct impact on the collision-free packet delivery ratio (PDR) metric, which improves when more listening windows are opened, at the expense of faster battery depletion.