6.1.1 OpenWSN

• Name: OpenWSN
• Keywords: Internet of things, 6TiSCH, 6LoWPAN, CoAP
• Functional Description: OpenWSN is an open-source implementation of a fully standards-based protocol stack for the Internet of Things. It has become the de-facto implementation of the IEEE802.15.4e TSCH standard, has a vibrant community of academic and industrial users, and is the reference implementation of the work we do in the IETF 6TiSCH standardization working group.
• URL: http://www.openwsn.org/
• Contacts: Thomas Watteyne, Tengfei Chang
• Partner: University of California Berkeley

6.1.2 6TiSCH Simulator

• Name: High-level simulator of a 6TiSCH network
• Keywords: Network simulator, 6TiSCH
• Functional Description: The simulator is written in Python. While it doesn't provide a cycle-accurate emulation, it does implement the functional behavior of a node running the full 6TiSCH protocol stack. This includes RPL, 6LoWPAN, CoAP and 6P. The implementation work tracks the progress of the standardization process at the IETF.
• Contacts: Malisa Vucinic, Thomas Watteyne

6.1.3 Argus

• Name: Argus
• Keywords: Cloud, Low-Power WIreless, Sniffer
• Functional Description:

  There are three piece to the Argus:

  The Argus Probe is the program which attaches to your low-power wireless sniffer and forwards its traffic to the Argus Broker.

  The Argus Broker sits somewhere in the cloud. Based on MQTT, it connect Argus Probes with Argus Clients based on a pub-sub architecture.

  Several Argus Clients can the started at the same time. It is a program which subscribes to the Argus Broker and displays the frames in Wireshark.

• Contacts: Remy Leone, Thomas Watteyne

6.1.4 SolSystem

• Name: Sensor Object Library System
• Keywords: Low-Power WIreless, Back-End System, SmartMesh IP
• Functional Description: The source code is composed of the definition of the SOL structure (https://github.com/realms-team/sol), the code that runs on the manager (https://github.com/realms-team/solmanager, written in Python) and the code that runs on the server receiving the data (https://github.com/realms-team/solserver, written in Python)
• URL: http://www.solsystem.io/
• Contacts: Keoma Brun-Laguna, Thomas Watteyne

6.1.5 6TiSCH Wireshark Dissector

• Name: 6TiSCH Wireshark Dissector
• Keywords: 6TiSCH, Wireshark
• Functional Description: Implementation on the dissectors is done through an open-source repository, stable code is regularly contributed back to the main Wireshark code base.
• Contacts: Jonathan Muñoz, Thomas Watteyne

6.1.6 F-Interop

• Name: Remote Conformance and Interoperability Tests for the Internet of Thing
• Keywords: Interoperability, Iot, Conformance testing, Standardization
• Contacts: Remy Leone, Thomas Watteyne
• Partners: UPMC, IMEC, ETSI, EANTC, Mandat International, Digital Catapult, University of Luxembourg, Device Gateway

6.1.7 Mercator

• Name: Mercator
• Keywords: Deployment, Low-Power WIreless, Testbeds, Connectivity
• Functional Description: The firmware is written as part of the OpenWSN project. Scripts and analysis tools are written in Python.
• Contacts: Keoma Brun-Laguna, Thomas Watteyne

6.1.8 py-edhoc

• Keywords: Internet of things, 6TiSCH, EDHOC, Python, Security
• Functional Description: EDHOC is an authenticated key exchange protocol targeting constrained environments and Internet of Things use cases. This is a Python implementation of the protocol, adapted for use on microcontrollers.
• URL: https://github.com/openwsn-berkeley/py-edhoc
• Contacts: Timothy Claeys, Malisa Vucinic

6.1.9 EDHOC-C

• Keywords: 6TiSCH, EDHOC, Security, Internet of things
• Functional Description: EDHOC is an authenticated key exchange protocol targeting constrained environments and Internet of Things use cases. This is a C implementation of the protocol, adapted for use on microcontrollers.
• URL: http://github.com/openwsn-berkeley/EDHOC-C
• Contacts: Timothy Claeys, Malisa Vucinic

7.11.1 Machine Learning for energy-efficient and QoS-aware Data Centers

Participants: Ruben Milocco (Comahue University, Argentina, invited professor), Pascale Minet, Eric Renault (Telecom Sud-Paris), Selma Boumerdassi (Cnam).

To limit global warming, all industrial sectors must try to reduce their carbon footprint. Information and Communication Technologies (ICTs) alone generate 2% of global CO2 emissions every year. Due to the rapid growth in Internet services, data centers have the largest carbon footprint of all ICTs. According to ARCEP (the French telecommunications regulator), Internet data traffic multiplied by 4.5 between 2011 and 2016. In order to support such a growth and maintain this traffic, data centers'energy consumption needs to be optimized.

We determine whether resource allocation in DCs can satisfy the three following requirements: 1) meet user requirements (e.g. short response times), 2) keep the data center efficient, and 3) reduce the carbon footprint.

An efficient way to reduce the energy consumption in a DC is to turn off servers that are not used for a minimum duration. The high dynamicity of the jobs submitted to the DC requires periodically adjusting the number of active servers to meet job requests. This is called Dynamic Capacity Provisioning. This provisioning can be based on prediction. In such a case, a proactive management of the DC is performed. The goal of this study is to provide a methodology to evaluate the energy cost reduction brought by proactive management, while keeping a high level of user satisfaction.

The state-of-the art shows that appropriate proactive management improves the cost, either by improving QoS or saving energy. As a consequence, there is great interest in studying different proactive strategies based on predictions of either the energy or the resources needed to serve CPU and memory requests. The cost depends on 1) the proactive strategy used, 2) the workload requested by jobs and 3) the prediction used. The problem complexity explains why, despite its importance, the maximum cost savings have not been evaluated in theoretical studies.

Evaluating the upper bound of energy cost saving by proactive data center management

In 20, we evaluate evaluate the energy cost savings that can be achieved by a proactive DC management. Such a management consists in periodically configuring the DC by turning some servers on or off to provide an amount of energy equal to the sum of i) the predicted energy to serve the user requests that will arrive in the next period, and ii) the energy needed to correct the error on the prediction made for the previous period. The predicted energy has a proactive cost, whereas the corrective energy has a reactive cost. Two predictors are proposed: a linear one based on the ARMA model and a nonlinear one using the conditional probability density function. These predictors maximize the relative energy cost saving.

We determine the tight upper bound of the relative energy cost savings valid in all cases. Knowing the upper bound makes it possible to decide on the suitability or not of using proactive action. If a choice must be made between different possible proactive strategies, both costs and savings change. Therefore, this paper proposes a methodology that helps to choose the best strategy (i.e. that maximizes the savings) between possible proactive strategies.

The methodology proposed is generic and can be applied to any DC that meets the assumptions made in this paper. These assumptions are realistic and can be met by many data centers. As an example, we have used the data set collected over 29 days in an operational data center of Google. By applying this methodology on the Google data, an improvement up to 85% can be obtained, leaving room for multiple optimizations. The relative energy cost saving that depends on the DC considered have been computed. Using the predictors analyzed with this data set, we find that the relative saving of the proactive action increases when the proactive cost of one Joule becomes negligible compared to the reactive cost. This would make it possible to decide between possible proactive action strategies in this Google DC.

Proactive Data Center Management Using Predictive Approaches

Data Center (DC) management aims at promptly serving user requests while minimizing the energy consumed. This is achieved by periodically turning off unnecessary servers to save energy and adapting the number of servers that are on to the time-varying and heterogeneous user requests. A great change in the number of servers on leads to a considerable management effort, also called control effort in the literature, which should be reduced as much as possible. Since feedback control can improve the performance of computing systems and networks, we propose to use it in 21 to achieve this dynamic capacity provisioning of the DC. In order to design this feedback control, first, we develop a dynamic model of the DC. The purpose is to design a feedback control strategy based on the DC model, able to optimize i) the Quality of Service, ii) the energy consumed and iii) the management effort.

Second, we compare three DC control strategies. The first one, Reactive Control (RC), is an open-loop control which provides the energy requested in the previous period. Consequently, it provides the exact amount of energy requested, which makes it energy efficient, but with a big large latency, leading to a significant scheduling delay. The second one, Reactive Feedback Control (RFC), is a closed-loop strategy; it needs to measure the service on-line. It uses the accumulated error from the previous period to decide the provisioning period allowing the requests to be served in less than two time periods, but is not energy efficient. The third one is Model Predictive Control (MPC) which is a feedback control and is also proactive, since it uses prediction of the demand. MPC is an optimal solution between weighted error and control effort.

From the comparison of these three control strategies applied to the traces of a real DC, three conclusions can be drawn:

1. The proposed optimal proactive MPC, that simultaneously minimizes the waste of energy with maximum possible QoS by managing the control effort, significantly improves reactive open-loop control. This scheme achieves scheduling times of the order of 10% of those used by reactive control while only increasing the energy used by 10%. It is important to note that this reduction is the maximum possible with this type of proactive scheme since the design is optimal.
2. DC dispatch time is shown to affect Quality of Service in all three control settings, but not energy savings, which remain almost the same as RC energy efficiency.
3. It is shown that when the control effort is not taken into account, the same optimal performance as in MPC is obtained using RFC.

7.12.1 Connection-less IoT - Protocol and models

Participants: Iman Hemdoush, Cédric Adjih, Paul Mühlethaler.

The goal is to construct some next-generation access protocols, for the IoT (or alternately for vehicular networks). One starting point are methods from the family of Non-Orthogonal Multiple Access (NOMA), where multiple transmissions can "collide" but can still be recovered - with sophisticated multiple access protocols (MAC) that take the physical layer/channel into account. One such example is the family of the Coded Slotted Aloha methods. Another direction is represented by some vehicular communications where vehicles communicate directly with each other without necessarily going through the infrastructure. This is also true more generally in any wireless network where the control is relaxed (such as in unlicensed IoT networks like LoRa). One observation is that in such distributed scenarios, explicit or implicit forms of signaling (with sensing, messaging, etc.), can be used for designing sophisticated protocols - including using machine learning techniques.

Irregular Repetition Slotted Aloha (IRSA) with multi-power

Irregular Repetition Slotted Aloha (IRSA) is one candidate member of a family of random access protocols to provide solutions for massive parallel connections in the Internet of Things (IoT) networks. The key features of this protocol are repeating the transmitted packets several times and using Successive Interference Cancellation (SIC) at the decoder to re-solve the collisions, which dramatically increases the performance of Slotted ALOHA. Motivated by multiple previous studies of IRSA performance in different settings, we focus on the scenario of an IoT network where the packets of different nodes are received with different powers at the base station, either per design due to different transmission powers, or induced by the fact that the nodes are at different distances from the base station. In such a scenario, the capture effect emerges at the receiver, which in turn enhances the protocol performance. We analyze the protocol behavior using a new density evolution which is based on dividing nodes into classes with different powers. By computing the probability to decode a packet in the presence of the interference, we explore the achievable throughput and its associated gain and show the excellent performance of Multi-Power IRSA.

In 38, we formally introduced multi-power IRSA (MP-IRSA), as a random access method, when the replicas of different users are transmitted/received with different powers. We introduced a new density evolution variant based on group-ing users into classes: it allows analyzing the performance of MP-IRSA. Multi-power IRSA proves to be a better choice than CRDSA and classical IRSA and confirms the benefits of effects of the capture effect at the receiver. The impact of different system factors on the achieved throughput and the associated load was extensively studied. First, the power difference between the classes and the number of classes plays a huge role in the decoding process, and we observe the best results when the power difference is large: decoding is cascading (one class after the other), instead of cycling (switching between different classes). The receiver sensitivity and the density of each class are other important factors that we studied. Another key factor that we did not explore is the repetition degree distribution: we used the same soliton distribution for all classes. Finding methods to optimize a common degree distribution for all classes or multiple degree distributions for multiple classes, and studying its impact, is apossible future work.

A Regret Minimization Approach to Frameless Irregular Repetition Slotted Aloha: IRSA-RM

In 43 we studied one of the modern random access protocols: Irregular Repetition Slotted Aloha (IRSA) in its frameless version. We adapted a reinforcement learning approach based on Regret Minimization to optimize the transmission strategy of this protocol, and thus proposed the protocol “IRSARM”. RM is well suited to IRSA, as in both cases, one uses a set of probabilities of selecting a given number of repetition. The learning is performed offline: it learns the main protocol parameters (the user degree distribution) for a set of predefined network loads. After the learning phase, the parameters can be later used in a network: assuming that the estimate of the load is broadcast by the base station, each device will select the set of parameters that were learned with the closest load. We detailed precisely the mapping between our problem, optimizing IRSA, and the centralized learning approach with RM, including delayed updates, reward computation, and alternate simulations, the introduction of priority classes, etc. Simulation results show a very high level of performance of IRSA when it is optimized with Regret Minimization, and how IRSA-RM behaves for different types of actions (degrees) sets. Future work will include considering richer actions, more sophisticated RM techniques such as CFR, and applying Deep Reinforcement Learning techniques.

The first result we have obtained concerns Irregular Repetition Slotted Aloha (IRSA) which is a modern method of random access for packet networks that is based on repeating transmitted packets, and on successive interference cancellation at the receiver. In classical idealized settings of slotted random access protocols (where slotted ALOHA achieves $1/e$), it has been shown that IRSA could asymptotically achieve the maximal throughput of 1 packet per slot. Additionally, IRSA had previously been studied for many different variants and settings, including the case where the receiver is equipped with “multiple-packet reception” (MPR) capability. We extensively revisit the case of IRSA with MPR. We present a method to compute optimal IRSA degree distributions with a given maximum degree n. A tighter bound for the load threshold ($G/K$) was proven, showing that plain K-IRSA cannot reach the asymptotic known bound $G/K=1$ for $K>1$, and we prove a new, lower bound for its performance. Numerical results illustrate that optimal degree distributions can approach this bound. Second, we analyze the error floor behavior of K-IRSA and provide an insightful approximation of the packet loss rate at low loads, and show its excellent performance. Third, we show how to formulate the search for the appropriate parameters of IRSA as an optimization problem, and how to solve it efficiently. By doing that for a comprehensive set of parameters, and by providing this work with simulations, we give numerical results that shed light on the performance of IRSA with MPR. A final open question is: what is the impact of introducing more structure in the slot selection (like Spatially Coupled Coded Slotted Aloha) and how best to do so.

7.12.2 Indoor positionning using Channel State Information (CSI) from a MIMO antenna

Participants: Abdallah Sobehy, Paul Muhlethaler, Eric Renault (Telecom Sud-Paris).

Indoor Localization has attracted interest in both academia and industry for its wide range of applications. In 41 we propose an indoor localization solution based on Channel State Information (CSI). CSI is a fine-grain measure of the effect of the channel on the transmitted signal. It is computed for each subcarrier and each antenna in the Multiple-Input Multiple-Output (MIMO) antenna case. It is also becoming a trend for indoor position fingerprinting. By using a K-nearest neighbor learning method a highly accurate indoor positioning is achieved. The input feature is the magnitude component of CSI which is preprocessed to reduce noise and allows for a quicker search. The euclidean distance between CSI is the criteria chosen for measuring the closeness between samples. The method is applied to a CSI dataset estimated at an 8 × 2 MIMO antenna that is published by the organizers of the Communication Theory Workshop Indoor Positioning Competition. The first step consisted of choosing the input feature from the CSI components: real, imaginary, magnitude, or phase. We used a statistical analysis to show that the magnitude is the most stable component, therefore, we selected it as the input feature. Magnitude values are then reduced using a polynomial line of degree 6 and least-squares optimization. Out of the 924 magnitude points, 33 equidistant points were chosen to represent the magnitude component. The Euclidean distance has then been used to represent the closeness between magnitude samples. With a k value equal to one, a k-nearest neighbor search was conducted over the training set for each test sample. The proposed method is compared with three other methods all based on deep learning approaches and tested with the same dataset. The K-Nearest Neighbor method presented in 41 achieves a Mean Square Error (MSE) of 2.4 cm which outperforms its counterparts.

7.12.3 Energy efficient forwarding in sensors networks

Participants: Ruben Milocco ( Comahue University, Argentina, invited professor), Paul Muhlethaler, Selma Boumerdassi ( Cnam ).

In 22 we have presented three designs for energy efficient transmission in a sensor network under shadow fading channels based on minimal energy consumption. The first is when both the transmission rate and power can be tuned. In the second and third, only the transmission power or the transmission rate is tuned. The criterion is based on computing the outage probability of the information to reach the next hop. The two sub-optimal controlled strategies perform similarly to the optimal, but we have analytically demonstrated that the rate-control is closer to the optimal than the power control. In the optimal case, PR-control, the minimization is performed for a fixed period of time. This implies that for a given amount of information that needs to be sent it is possible to fix the interval delay time with minimum energy. However, in both sub-optimal designs, the time interval time is not fixed but varies very close around the value of the optimal design. In order to evaluate the improvements, simulations were performed using two fading distributions, the Log-normal and the Nakagami and comparing with the case in which the rate and power are fixed. The results shows that even in the case with best possible fixed values of P and R, performances can be improved by up to ten times. Finally, we leave for future work a robust energy efficient design that does not require knowledge of the probability distribution of fading.

7.12.4 Deployment of Named Data Networking in the Internet of Things

Participants: Amar Abane, Samia Bouzefrane, Soumya Banerjee, Paul Mühlethaler.

In 8 we have investigated how to take advantage of NDN for the IoT in a simple and feasible solution. To that purpose, a realistic NDN-IoT architecture has been designed and realized considering the IEEE 802.15.4 wireless technology. After identifying the integration of NDN in the low-end IoT as the most realistic approach, the main integration issues have been discussed, and some mechanisms have been proposed. The proposed mechanisms show the flexibility of NDN to support low rate lossy technologies such as the IEEE 802.15.4. The NDN-IoT architecture proposed aims to shape a novel and strong NDN-IoT duo. Moreover, lightweight NDN forwarding in wireless networks with broadcast has been investigated. The objective through the forwarding approach proposed is to show that broadcast can be used successfully in constrained networks, while ensuring reduced overhead and accurate forwarding decisions. For that, we have designed R-LF; a forwarding strategy based only on content names and broadcast without any host identification. R-LF is a reactive forwarding strategy that does not require additional communication to maintain forwarding information. Results obtained show that R-LF is able to provide efficient data retrieval using exclusively the content-centric paradigm of NDN, without any host identification such as logical or link-layer addresses. The deployment evaluation provides some preliminary measurements and empirical comparison with IP-based solutions. For example, the deployment may show the lightweight and simplicity of NDN implementations for IoT. Overall, the main limitation we may identify in this work is the lack of direct performance comparisons between NDN and IP. Although it could be useful, this can be explained by several reasons. First, we greatly rely on the discussions about IP limitations and NDN native features to show the superiority of NDN, which is indisputable in many aspects such as security, native caching and simplicity. Second, when comparing IP and NDN in a given scenario, the fairness of the configurations is frequently questioning, for example when enabling caching.

7.12.5 Design and Evaluation of a Flooding-Based Location Service in Vehicular Ad Hoc Networks

Participants: Paul Mühlethaler, Eric Renault, Selma Boumerdassi.

SFLS, the semiflooding location service, an efficient and yet simple solution for the dissemination of location information in VANETs, is described in 23. We have analyzed the performance of this protocol with a uniform Poisson point process of nodes in 1D, 2D, and 3D networks. Even though the basis of this protocol is a broadcast scheme, we have shown that the number of messages per update remains very low. For different cases, we built an analytical model to upper bound the number of messages per update, and carried out simulations to verify our computations. The matching of the analytical model and the simulations was very good. We have also compared SFLS with the broadcast optimization scheme of OLSR: the multipoint-relay technique. We have presented two case studies where SFLS and the multipoint-relay technique performed differently. In dense or very dense networks, the MPR scheme was better, but SLFS outperformed the MPR flooding of OSLR in sparse or moderately dense networks, and in any case, when the number of hops was large. It would be interesting to combine SFLS with a location-prediction technique based on node kinematics to refine their positions between the reception of two consecutive SFLS updates. This idea could be the starting point for further studies.

7.12.6 LoRA Models

Participants: Rahim Haiahem, Pascale Minet, Selma Boumerdassi (Cnam), Leila Azouz Saidane (invited professors).

High accuracy air pollution monitoring in a smart city requires the deployment of a huge number of sensors in this city. One of the most appropriate wireless technologies expected to support high density deployment is LoRaWAN which belongs to the Low Power Wide Area Network (LPWAN) family and offers long communication range, multi-year battery lifetime and low cost end devices. It has been designed for End Devices (EDs) and applications that need to send small amounts of data a few times per hour. However, a high number of end devices breaks the orthogonality of LoRaWAN transmissions, which was one of the main advantages of LoRaWAN. Hence, network performances are strongly impacted.

An Orthogonal Air Pollution Monitoring Method (OAPM) Based on LoRaWAN

To solve this problem, we propose a solution called OAPM (Orthogonal Air Pollution Monitoring) which ensures the orthogonality of LoRaWAN transmissions and provides accurate air pollution monitoring. In 16, we show how to organize EDs into clusters and sub-clusters, assign transmission times to EDs, configurate and synchronize them, taking into account the specificities of LoRaWAN and the features of the air pollution monitoring application. OAPM is a LoRaWAN-based architecture for monitoring air pollution. The system behavior includes four phases after the deployment: (1) the Joining phase where the ED joins the LoRaWAN network, (2) the Configuration phase where the ED is assigned its configuration parameters (e.g., Synchronization Period, Monitoring Period, number of Monitoring Periods per Synchronization Period, Transmission Window, Transmission Time), (3) the Synchronization phase where the ED is synchronized to the clock of the gateway, which is the reference time in LoRaWAN, and (4) the Monitoring phase where the EDs send their pollutant report to the gateway and sleep until their next transmission period or the next Synchronization Period, when they repeat the transmission process.

Potential applications are various including air pollution monitoring, smart farming, environment monitoring. They would benefit from OAPM advantages which are the following:

• It supports of a high number of EDs while maintaining a PDR close to 1, provided a number of receive paths $>6$.
• It has a low energy consumption, because all transmissions are scheduled by the network server.
• It provides a high network lifetime.
• It is fully compliant with the requirements expressed by the World Health Organization and the US Environmental Agency for air pollution monitoring.
• It is a simple solution based on an implicit clustering of EDs according to their geographic coordinates and the computation of their transmission times by the Network Server.

OAPM has been implemented and simulations were conducted using the NS3 simulator. By comparing OAPM with other proposed strategies in the literature, we found that OAPM ensures orthogonality between transmissions while supporting large-scale networks. However, the non-deterministic selection of the frequency channels introduces a slight drop in the performances. This happens when several EDs belonging to the same sub-cluster share the same frequency channel. As a further work, we intend to introduce a new solution enabling a collision-free sharing of frequencies between EDs. This amendment will be combined with the proposed OAPM to ensure high-level performances and create a scalable air pollution monitoring solution.

Collision-Free Transmissions in an IoT Monitoring Application Based on LoRaWAN

With the Internet of Things (IoT), the number of monitoring applications deployed is considerably increasing, whatever the field considered: smart city, smart agriculture, environment monitoring, air pollution monitoring, to name a few. The LoRaWAN (Long Range Wide Area Network) architecture with its long range communication, its robustness to interference and its reduced energy consumption is an excellent candidate to support such applications. However, if the number of end devices is high, the reliability of LoRaWAN, measured by the Packet Delivery Ratio (PDR), becomes unacceptable due to an excessive number of collisions. In 17, we propose two different families of solutions ensuring collision-free transmissions.

The first family, called OAPM, is TDMA (Time-Division Multiple Access)-based. All clusters transmit in sequence and up to six end devices with different spreading factors belonging to the same cluster are allowed to transmit in parallel. OAPM_O is an optimized variant of OAPM_D using several frequency channels per cluster to allow several Eds with the same spreading factor to transmit in parallel.

The second family, called FAPM, is FDMA (Frequency Divsion Multiple Access)-based. All clusters transmit in parallel, each cluster on its own frequency. Within each cluster, all end devices transmit in sequence. FAPM_O is an optimized variant of FAPM allowing several EDs of the same cluster to transmit in parallel.

These solutions have been evaluated theoretically and by simulation with NS3 in various configurations, uniform or not, with some or all spreading factors present in the monitoring area, different numbers of frequency channels, and different sizes of the monitoring period. Their performance are compared in terms of PDR, energy consumption by end device and maximum number of end devices supported. The simulation results show that all these solutions ensure that no messages are lost due to collisions. They corroborate the theoretical results of the maximum number of EDs supported by each solution: FAPM_O supports the highest number of EDs, because of its better use of the frequency channels available. FAPM outperforms OAPM_D, whereas OAPM_O improves OAPM_D when all SFs are not present. Finally, a hybrid solution, FAPM_H, is proposed. It combines FAPM and OAPM to achieve both inter-channel parallelism and intra-channel parallelism while minimizing the data gathering duration. This is done by maximizing the parallelism of transmissions under the constraints given by the maximum number of available frequency channels and the maximum number of messages the gateway is able to demodulate simultaneously. The complexity of solving this optimization problem is left to the Network Server.

As a further work, the evaluation of FAPM_H and its comparison with other schemes will be carried on. The proposed solutions will be implemented on real testbeds. They will also be tested in different use case applications to confirm their effectiveness. More generally, the coexistence of several IoT applications with heterogeneous requirements in the same LoRaWAN gateway is a challenging study.

7.13.1 Combining random access and TDMA scheduling strategies for vehicular ad hoc networks

Participants: Fouzi Boukhalfa, Mohamed Hadded ( Vedecom ), Paul Mühlethaler, Oyunchimeg Shagdar ( Vedecom ).

AS-DTMAC : Active Signaling-Distributed Time Division Multiple ACcess

This work is based on Fouzi Boukhalfa's PhD which started in October 2018. The idea is to combine TDMA protocols with random access techniques to benefit from the advantages of both techniques. Fouzi Boukhalfa proposes to combine the DTMAC protocol introduced by Mohamed Hadded with a generalization of CSMA. This generalized CSMA uses active signaling; the idea is to send signaling bursts in order to select a unique transmitter. The protocol that Fouzi Boukhalfa obtains reduces the access and merging collisions of DTMAC but can also propose access with low latency for emergency traffic. The idea is that vehicles access their slots reserved with DTMAC but the transmission slots encompass a special section at the beginning with active signaling. The transmission of the signaling burst, during a mini-slot, is organized according to a random binary key. A '1' in the key means that a signaling burst will be transmitted, while a '0' means that the vehicle senses the channel on this mini-slot to potentially find the transmission of a signaling burst by another vehicle. We show that if we use a random key to transmit the signaling burst it very significantly decreases the collision rate (both merging and access collisions) and that emergency traffic can have a very small access delay.

In 11 we present an analytical model for studying the performance of the AS-DTMAC protocol. We use recursive equation on generating functions to obtain the probability of collision. Two cases of the arrival process in AS-DTMAC have been investigated and modeled. In the first case, the packets from the vehicles arrive in each time slot according to a homogeneous Poisson process, whereas in the second case there is a burst of arrivals for very urgent messages. To make our analytical model as complete as possible, we introduce error into the model during the selection process. We define two kinds of error that can occur in the detection process: vehicles can either miss a transmission or sense a false transmission. With the first kind of error, the performance remains very good, even with up to 5whereas with the second kind of error, the selection may end up with no transmission on the payload slot, which is much more detrimental to the whole performance. The simulation results confirm the validity of the analytical model and show that AS-DTMAC very significantly outperforms the DTMAC protocol in terms of collision probability. The transmission of urgent packets is also very efficient in AS-DTMAC. In future work, we plan to precisely evaluate the probability of the error in the detection of bursts in order to optimize the active signaling process. Furthermore, we plan to investigate the idea of no longer considering that the CSMA-based MAC protocols and TDMA based MAC protocols are competitors. By combining the two techniques, the drawbacks of contention based-access in the former and resource reservation in the latter can be overcome. Such an application could be the future Wi-Fi standard for vehicles (IEEE 802.11bd ), which requires ensuring a backward compatibility mode (to make communication possible between vehicles using IEEE 802.11p and vehicles using the new communication technologies (IEEE 802.11bd). Proposing this kind of protocol will be beneficial: the CSMA/CA will keep communication with older nodes (IEEE 802.11p) possible, while AS-DTMAC will enable low latency access.

Coexistence AS-DTMAC - IEEE 802.11

In 33 we have shown that the contention-based IEEE 802.11p protocol can coexist with the contention-free AS-DTMAC protocol. We have studied the probability that an IEEE 802.11p transmission can interfere with the AS-DTMAC selection process and to preempt an AS-DTMAC transmission. This probability is very small, indicating, on the one hand, that an AS-DTMAC transmission is very unlikely to be preempted by an IEEE 802.11p transmission. On the other hand, when IEEE 802.11p transmissions are established, the AS-DTMAC, being a TDMA system, can not in principle preempt the transmission. We have studied the distribution of the waiting time for an AS-DTMAC user to be able to access to the channel. We have shown that, if needed, AS-DTMAC can possibly preempt the flow of IEEE 802.11p transmissions if AS-DTMAC operates asynchronously. In this case, the AS-DTMAC user has only to transmit just after the IEEE 802.11p transmission. If we use this operating mode, AS-DTMAC has priority over IEEE 802.11p transmissions. Moreover, the first bit of the transmission key in AS-DTMAC allows one to prioritize access for AS-DTMAC users. A fairness index showing the ability of IEEE 802.11p devices to have the same opportunities as NGV devices to access the channel will be the subject of another contribution. Also, the model assumes a perfectly symmetric transmission (reception) range situation. Therefore, it would be interesting to show how an asymmetric scenario would affect the coexistence of the two protocols. Moreover, we plan to continue to investigate the other specifications required for the design of the IEEE 802.11bd, such as the ability of NGV devices to run in a mode in which they can interoperate with IEEE 802.11p devices, a property that is defined in the literature such as the Backward compatibility.

Study of the signaling bursts of AS-DTMAC

In 32 the exact definition of the signaling burst of AS-DTMAC was proposed with the computation of miss detection in the selection process, by using a detection model based on GLRT. We estimate that the minimum length of preamble required for the active signaling process is 3 OFDM symbols. We show that the active signaling part of the slot in AS-DTMAC must encompass 8 mini-slots and thus the signaling burst will last 4.8µs. This proposed configuration will optimize the time left for the payload part of the packet, resulting in increased throughput compared to that proposed in [1]. This study takes into account the structure of the physical layer of the current IEEE 802.11p standard. Therefore, this is makes it well-suited to the next generation of IEEE 802.11bd proposal. The good performance of GLRT shown in 32, motivates us to further investigate the robustness of this algorithm in real implementations, using GNU Radio Software and USRP units. Implementing this kind of detector in the receiver will significantly enhance the reliability of the communication.

7.13.2 Cross-layer routing in VANETs

Survey of MAC-aware Routing Protocols for Vehicular Ad Hoc Networks

Participants: Abir Rebei (Hatem Bettahar IResCoMath Research Unit, Tunisia), Mohamed Hadded (Vedecom), Haifa Touati (Hatem Bettahar IResCoMath Research Unit, Tunisia), Fouzi Boukhalfa (Vedecom), Paul Mühlethaler.

The constantly growing number of vehicles on our roads has become an increasing major cause of serious injury and death. Efficient data dissemination in Vehicular Ad hoc Networks (VANETs) inevitably requires an efficient and robust routing protocol. In this context, several categories of routing protocols have been proposed in the literature to meet VANETs application requirements in terms of delay, packet loss and throughput. In 40, we focus on cross layer routing protocols. We present a survey of state-of-the-art MAC aware routing protocols designed for VANETs. These solutions can broadly be divided into two categories: contention-free and contention-based MAC-aware routing. In this paper we carryout a comprehensive comparison of these approaches. Finally, we identify open research issues that should be addressed in order to improve MAC aware routing techniques in VANETs. Given emphasis on road safety in VANETs, designing a reliable and robust MAC routing protocol seems essential for ensuring efficient communications and reliable message dissemination. A major challenge lies in combining functionalities of different layers in order to enhance network performances. This paper, which presents an overview of MAC aware routing protocols based on contention-free, contentionbased or hybrid scheme, also shows the performance of these protocols in meeting VANET requirements. In this paper, we have discussed the cross-layer concept and its role in designing routing protocols and investigating goals in terms of QoS, road safety and mobility management by considering the benefits of mixing different functionalities of different layers. Then, we have focused on some proposed MAC routing protocols based on the TDMA and CSMA/CA technique. Furthermore, we have examined these protocols through a classification and comparison conducted according to certain features and metrics performances. This comparison is intended to provide a better understanding of these protocols. Finally, we have presented some challenges for VANETs that should be addressed in design of new Mac routing protocols. To the best of our knowledge, the paper represents the first attempt that gives an overview on the MAC aware routing protocols proposed for VANET.

Trust aware cross-layer routing in VANETs

Participants: Sihem Baccari (Hatem Bettahar IResCoMath Research Unit, Tunisia), Mohamed Hadded (Vedecom)), Haifa Touati (Hatem Bettahar IResCoMath Research Unit, Tunisia) , Paul Mühlethaler.

In 9, we have proposed a trust model for securing VANETs against Black-hole, Gray-hole and MAC attacks within the TRPM cross-layer routing protocol. The proposed solution, called Trust-based TRPM, has proven to have considerable capacity in detecting and eliminating malicious nodes that attempt to disrupt normal network operation. Moreover, Trust-based TRPM is a very fast technique which does not require much computing time as each node is responsible for its safety, thereby avoiding the need to load the network. Simulation results illustrate the effectiveness of the proposed trust-based approach to detect and isolate misbehaving nodes. In summary, we have demonstrated that our solution improves the PDR and channel access rate when different ratios of malicious nodes are present in the network. Our present solution is intended for detecting some sets of malicious behavior. In future work we aim to improve and expand our mechanism to include other types of attacks and malicious activities. In particular we will focus on the detection of packet transfer delay attacks, which threaten the reception delays and represent one of the major constraints for real-time security applications.

Performance Impact Analysis of Security Attacks on Cross-Layer Routing Protocols in VANETs

Participants: Sihem Baccari (Hatem Bettahar IResCoMath Research Unit, Tunisia ), Mohamed Hadded (Vedecom)), Haifa Touati (Hatem Bettahar IResCoMath Research Unit, Tunisia) , Paul Mühlethaler.

The highly dynamic nature of vehicular networks not only makes their configuration and set up difficult, but also makes them very vulnerable to attack, especially with the absence of a central control. Therefore, in order to make VANETs more secure, it is essential to study and assess the impact that attacks can have on data dissemination in these networks. In 30 we have identified the most serious attack models and have used simulation to assess their impact on the TRPM cross-layer protocol. We have identified several previously undocumented vulnerabilities which threaten the time slots scheduling process of TRPM. In addition, we have demonstrated through different attack models, the extent of the damage that these vulnerabilities can lead on the performance of the TRPM protocol. The simulation results show the severity of these attacks, on the performance of TRPM in terms of Packet Delivery Ratio, which drastically decreases to 13under the effect of Black-hole attack. The End-to-End Delay evaluation reveals the presence of Black-hole and Gray-hole attackers in the network increases the transmission delay up to 1.8s which exceeds the acceptable threshold for a number of delay-sensitive VANET applications. Finally, exploiting the slot scheduling vulnerability that we identified reveals that up to $47\%$ of free slots could not be reserved due to MAC attack which means that 1/2 of channel capacity is wasted. In future work, we will exploit the results of this investigation, to develop a solution for detecting and preventing attacks threatening the TRPM protocol. Mainly we will focus on the new identified MAC level attacks to provide a solution against these types of malicious behavior.

7.13.3 Forecasting traffic accidents in VANETs

Participants: Samia Bouzefrane (Cnam), Soumya Banerjee (Birla Institute of Technology, Mesra), Paul Mühlethaler, Mamoudou Sangare.

Road traffic accidents have become a major cause of death. With increasing urbanization and populations, the volume of vehicles has increased exponentially. As a result, traffic accident forecasting and the identification of the accident prone areas can help reduce the risk of traffic accidents and improve the overall life expectancy.

Conventional traffic forecasting techniques use either a Gaussian Mixture Model (GMM) or a Support Vector Classifier (SVC) to model accident features. A GMM on the one hand requires large amount of data and is computationally inexpensive, SVC on the other hand performs well with less data but is computationally expensive. We present a prediction model that combines the two approaches for the purpose of forecasting traffic accidents. In https://doi.org/10.1016/j.eswa.2020.113855 a hybrid approach is proposed, which incorporates the advantages of both the generative (GMM) and the discriminant model (SVC). Raw feature samples are divided into three categories: those representing accidents with no injuries, accidents with non incapacitating injuries and those with incapacitating injuries. The output or the accident severity class was divided into three major categories namely: no injury in the accident, non-incapacitating injury in the accident and an incapacitating injury in the accident. A hybrid classifier is proposed which combines the descriptive strength of the baseline Gaussian mixture model (GMM) with the high performance classification capabilities of the support vector classifier (SVC). A new approach is introduced using the mean vectors obtained from the GMM model as input to the SVC. The model was supported with data pre-processing and re-sampling to convert the data points into suitable form and avoid any kind of biasing in the results. Feature importance ranking was also performed to choose relevant attributes with respect to accident severity. This hybrid model successfully takes advantage of both models and obtained a better accuracy than the baseline GMM model. The radial basis kernel outperforms the linear kernel by achieving an accuracy of 85.53%. Data analytics performed including the area under the receiver operating characteristics curve (AUC-ROC) and area under the precision/recall curve(AUC-PR) indicate the successful application of this model in traffic accident forecasting. Experimental results show that the proposed model can significantly improve the performance of accident prediction. Improvements of up to 24% are reported in the accuracy as compared to the baseline statistical model (GMM). The data about circumstances of personal injury in road accidents, the types of vehicles involved and the consequential casualties were obtained from data.govt.uk.

Although a significant improvement in accuracy has been observed, this study has several limitations. The first concerns the dataset used. This research is based on a road traffic accident dataset from the year of 2017 which contains very few data samples for the no injury and non-incapacitating injury types of accident. The data was unbalanced not just with respect to the output class but also with respect to the sub features of various attributes. Moreover, aggregating the accident severity into just three categories limits the scope of the study and the results obtained. The greater the number of severity classes, the less is the amount of extra training data required to feed in the SVC to avoid overfitting. Thus, datasets with sufficient records corresponding to each class are desirable and must be used for further study.

The second limitation concerns the dependence of the SVC model on parameters and attribute selection. In this study, the performance of SVC relies heavily on the feature selection results and the mean vectors obtained from the GMM. In order to improve the accuracy of the support vector classifier, other approaches like particle swarm optimization (PSO), ant colony optimization, genetic algorithms etc. could be used for effective parameter selection. In addition to this, more kernels like the polynomial kernel and the sigmoid kernel could be tested to improve future model performances.

9.1.1 Inria International Labs

9.1.2 Inria international partners

The EVA team has been building up a very strong partnership with Inria Chile, through the FrostForecast project.

9.2.1 FP7 & H2020 Projects

• H2020 SPARTA, Jan 2019 - Jan 2022. A cyber-security excellence network throughout Europe. Mališa Vučinić leads Inria-EVA participation.

9.3.1 Inria Project Labs, Exploratory Research Actions and Technological Development Actions

• RIOT-fp IPL, 2019-2022. RIOT-fp is an Inria Project Lab on cyber-security targeting low-end, microcontroller-based IoT devices, which run operating systems such as RIOT and a low-power network stack such as OpenWSN. Mališa Vučinić is lead.
• ATT FrostForecast, 2020-2021. Deploy a frost forecast system in orchards in Chile, with Inria Chile. Said Alvarado is lead.
• ADT 6TiSCH, 2018-2020. Benchmark the performance of 6TiSCH under realistic scenarios, through experimentaion using the OpenTestbed. Tengfei Chang is lead.

9.3.2 ANR

• The GeoBot FUI project (https://geobot.fr/) is one of the most innovative, challenging and fun projects around wireless localization in the world today. It applies true innovation to a real-world problem, with a clear target application (and customer) in mind. The GeoBot partners are building a small robot (think of a matchbox-sized RC car) that will be inserted into a gas pipe, and move around it to map the location of the different underground pipes. Such mapping is necessary to prevent gas-related accidents, for example during construction. At the end of the project, this solution will be commercialized and used to map the network of gas pipe in France, before being used in worldwide. Each partner is in charge of a different aspect of the problem: robotics, analysis of the inertial data, visualization, etc. Inria is in charge of the wireless part. We will be equipping the robot with a wireless chip(set) in order to (1) communicate with the robot as it moves about in the pipes while standing on the surface, and (2) discover the relative location of the robot w.r.t. a person on the surface. Inria is evaluating different wireless technologies, benchmarking around ranging accuracy and capabilities to communicate. We start from off-the-shelf kits from different vendors and build a custom board, benchmark it, and integrate it with the other partners of the project.

9.3.3 Other collaborations

• EVA has a collaboration with Orange Labs. Thomas Watteyne supervises the PhD of Mina Rady, which happens under a CIFRE agreement with Orange Labs.
• EVA has a collaboration with Vedecom. Paul Muhlethaler supervises Fouzi Boukhalfa's PhD funded by Vedecom. This PhD aims at studying low latency and high reliability vehicle-to-vehicle communication to improve roads safety.

10.1.1 Scientific events: organisation

10.2.1 Teaching

• Thomas Watteyne teaches 6-week course on IoT, with associated hands-on labs. Undergraduate level. ENSTA ParisTech. Together with Dominique Barthel. Spring 2020.
• Thomas Watteyne teaches 1/2-day crash course on the Industrial IoT, Telecom ParisTech. Graduate level. 24 September 2020.
• Mališa Vučinić teaches 6-week course on IoT, with associated hands-on labs. Graduate level. ESME Sudria. Dec 2019 - Jan 2020.

10.2.2 Supervision

• PhD : Fouzi Boukhalfa, Low and high reliability access in Vehicular Ad-hoc NETworks. Sorbonne University. Paul Muhlethaler.
• PhD (ongoing) Trifun Savic, Indoor localization, Sorbonne University. Thomas Watteyne, under a CIFRE agreement with Wattson Elements, France.
• PhD (ongoing) Razanne Abu Aisheh, Robotics, Sorbonne University. Thomas Watteyne, under a CIFRE agreement with Nokia Bell Labs, France.
• PhD (ongoing) Mina Rady, Heterogeneous architectures for the IoT, Sorbonne University. Thomas Watteyne and Paul Muhlethaler, under a CIFRE agreement with Orange Labs, Meylan, France.
• PhD (Defense in November 2020) Abdallah Soheby, Localisation basée sur l’apprentissage artificielle en 5G. Eric Renault and Paul Muhlethaler.
• PhD (in progress) Mamoudou Sangara, Utilisation de techniques de Machine Learning dans les reseaux VANETs. Samia Bouzefrane and Paul Muhlethaler.
• PhD (in progress) Iman Hmedoush, Connection protocols for the 5G IoT. Cedric Adjih and Paul Muhlethaler.

10.2.3 Juries

• PhD:
  • Thomas Watteyne member of the examination board PhD thesis of Vasileios Kotsiou. Doctoral work on “Reliable Communications for the Industrial Internet of Things” done at the University of Strasbourg, France, under the supervision of Georgios Z. Papadopoulos, Periklis Chatzimisios and Fabrice Theoleyre. Viva on 25 September 2020.
  • Thomas Watteyne member of the examination board PhD thesis of Jan Bauwens. Doctoral work on “Sustainable and Interoperable MAC Protocol Design for Heterogeneous Internet of Things Systems” done at the University of Ghent, Belgium, under the supervision of Eli De Poorter and Ingrid Moerman. Viva on 17 November 2020.
  • Thomas Watteyne member of the examination board PhD thesis of Abdulkadir Karaağaç. Doctoral work on “Advanced IoT: Achieving Improved Interoperability and Dependable Connectivity for Complex IoT Systems” done at the University of Ghent, Belgium, under the supervision of Jeroen Hoebeke and Eli De Poorter. Viva on 15 May 2020.
  • Adallah Sobehy. “Localisation basée sur l’apprentissage artificielle en 5G.” Institut Polytechnique de Paris, Nov. 6, 2020 Paul Muhlethaler examiner

International journals

• 8 article AmarA. Abane, MehammedM. Daoui, SamiaS. Bouzefrane, SoumyaS. Banerjee and PaulP. Muhlethaler. A Realistic Deployment of Named Data Networking in the Internet of Things Journal of Cyber Security and Mobility 9 1 2020
  HAL DOI back to text
• 9 article SihemS. Baccari, MohamedM. Hadded, HaifaH. Touati and PaulP. Muhlethaler. A secure trust-aware cross-layer routing protocol for Vehicular Ad hoc Networks Journal of Cyber Security and Mobility 2020
  HAL back to text
• 10 article GuillemG. Boquet, PereP. Tuset-Peiró, FerranF. Adelantado, ThomasT. Watteyne and XavierX. Vilajosana. LoRa-E: Overview and Performance Analysis IEEE Communications Magazine December 2020
  HAL
• 11 article FouziF. Boukhalfa, MohamedM. Hadded, PaulP. Muhlethaler and OyunchimegO. Shagdar. Performance Evaluation of an Active Signaling based Time-Slot Scheduling Scheme for connected vehicles Annals of Telecommunications - annales des télécommunications 2020
  HAL back to text
• 12 article TengfeiT. Chang, MališaM. Vučinić, XaviX. Vilajosana Guillén, DiegoD. Dujovne and ThomasT. Watteyne. 6TiSCH Minimal Scheduling Function: Performance Evaluation Internet Technology Letters 2020
  HAL DOI
• 13 article TengfeiT. Chang, ThomasT. Watteyne, FilipF. Maksimovic, BradB. Wheeler, DavidD. Burnett, TitanT. Yuan, XavierX. Vilajosana and KrisK. Pister. QuickCal: Assisted Calibration for Crystal-Free Micro-Motes IEEE internet of things journal August 2020
  HAL DOI
• 14 article TengfeiT. Chang, ThomasT. Watteyne, BradB. Wheeler, FilipF. Maksimovic, DavidD. Burnett, OsamaO. Khan, SaharS. Mesri, LydiaL. Lee, IoanaI. Suciu, XavierX. Vilajosana and KrisK. Pister. 6TiSCH on SCµM: Running a Synchronized Protocol Stack without Crystals Sensors March 2020
  HAL DOI
• 15 articleVivianeV. Gal, SoumyaS. Banerjee and Dana V.D. Rad. Investigation of Emotion Instances and Class Analysis from Physiological Sensors by Unsupervised Hybrid EMDeep ModelJournal of Intelligent and Fuzzy Systems3852020, 5999-6017
  HAL
• 16 articleRahimR. Haiahem, PascaleP. Minet, SelmaS. Boumerdassi and LeilaL. Azouz Saidane. An Orthogonal Air Pollution Monitoring Method (OAPM) Based on LoRaWANJournal of sensor and actuator networks932020, 42
  HALDOIback to text
• 17 article RahimR. Haiahem, PascaleP. Minet, SelmaS. Boumerdassi and LeilaL. Azouz Saidane. Collision-Free Transmissions in an IoT Monitoring Application Based on LoRaWAN Sensors July 2020
  HAL DOI back to text
• 18 article BrianB. Kilberg, Felipe M RF. Campos, FilipF. Maksimovic, ThomasT. Watteyne and Kristofer S JK. Pister. Accurate 3D Lighthouse Localization of a Low-Power Crystal-Free Single-Chip Mote Journal of Microelectromechanical Systems 29 5 August 2020
  HAL DOI
• 19 articleSarraS. Mehamel, SamiaS. Bouzefrane, SoumyaS. Banerjee, MehammedM. Daoui and ValentinaV. Balas. Modified reinforcement learning based- caching system for mobile edge computingIntelligent decision technologies1442020, 537-552
  HALDOI
• 20 articleRubenR. Milocco, PascaleP. Minet, EricE. Renault and SelmaS. Boumerdassi. Evaluating the upper bound of energy cost saving by proactive data center managementIEEE Transactions on Network and Service Management173September 2020, 1527 - 1541
  HALDOIback to text
• 21 articleRubenR. Milocco, PascaleP. Minet, EricE. Renault and SelmaS. Boumerdassi. Proactive Data Center Management Using Predictive ApproachesIEEE Access82020, 161776-161786
  HALDOIback to text
• 22 article Ruben HR. Milocco, PaulP. Muhlethaler and SelmaS. Boumerdassi. Energy-efficient forwarding strategies for Wireless Sensor Networks in fading channels Annals of Telecommunications - annales des télécommunications October 2020
  HAL DOI back to text
• 23 articlePaulP. Muhlethaler, EricE. Renault and SelmaS. Boumerdassi. Design and Evaluation of Flooding-Based Location Service in Vehicular Ad Hoc NetworksSensors208April 2020, 2389
  HALDOIback to text
• 24 article MinaM. Rady, QuentinQ. Lampin, DominiqueD. Barthel and ThomasT. Watteyne. No Free Lunch - Characterizing the Performance of 6TiSCH When Using Different Physical Layers Sensors September 2020
  HAL DOI
• 25 articleMamoudouM. Sangare, SharutS. Gupta, SamiaS. Bouzefrane, SoumyaS. Banerjee and PaulP. Muhlethaler. Exploring the forecasting approach for road accidents: Analytical measures with hybrid machine learningExpert Systems with ApplicationsAugust 2020, 113855
  HALDOI
• 26 article YasuyukiY. Tanaka, KeomaK. Brun-Laguna and ThomasT. Watteyne. Trace-Based Simulation for 6TiSCH Internet Technology Letters 2020
  HAL DOI
• 27 articleMališaM. Vučinić, TengfeiT. Chang, BožidarB. Škrbić, EnisE. Kočan, MilicaM. Pejanović-Djurišić and ThomasT. Watteyne. Key Performance Indicators of the Reference 6TiSCH Implementation in Internet-of-Things ScenariosIEEE Access8December 2020, 79147 - 79157
  HALDOI
• 28 article ZiranZ. Zhang, Steven D.S. Glaser, ThomasT. Watteyne and SamiS. Malek. Long-term Monitoring of the Sierra Nevada Snowpack Using Wireless Sensor Networks IEEE internet of things journal June 2020
  HAL DOI

International peer-reviewed conferences

• 29 inproceedings RazanneR. Abu-Aisheh, FrancescoF. Bronzino, MyrianaM. Rifai, BrianB. Kilberg, KrisK. Pister and ThomasT. Watteyne. Atlas: Exploration and Mapping with a Sparse Swarm of Networked IoT Robots Wi-DroIT 2020 - Workshop on Wireless Sensors and Drones in Internet of Things Los Angeles, CA / Virtual, United States June 2020
  HAL
• 30 inproceedings SihemS. Baccari, HaifaH. Touati, MohamedM. Hadded and PaulP. Muhlethaler. Performance Impact Analysis of Security Attacks on Cross-Layer Routing Protocols in Vehicular Ad hoc Networks SoftCom 2020 -International Conference on Software, Telecommunications and Computer Networks, SoftCom 2020 - International Conference on Software, Telecommunications and Computer Networks Hvar / Virtual, Croatia September 2020
  HAL back to text
• 31 inproceedings SoumyaS. Banerjee, SohamS. Chakraborty and PaulP. Muhlethaler. Developing Customized & Secure Blockchains with Deep Federation Learning to Prevent Successive Attacks MSPN 2020 - 6th International Conference on Mobile, Secure and Programmable Networking Paris / Virtual, France October 2020
  HAL back to text
• 32 inproceedings FouziF. Boukhalfa, CédricC. Adjih, PaulP. Muhlethaler, MohamedM. Hadded and OyunchimegO. Shagdar. Physical and MAC Layer Design for Active Signaling Schemes in Vehicular Networks STWiMob 2020 - 16th International Workshop on Selected Topics in Wireless and Mobile computing Thessaloniki / Virtual, Greece October 2020
  HAL back to text back to text
• 33 inproceedings FouziF. Boukhalfa, MohamedM. Hadded, PaulP. Muhlethaler and OyunchimegO. Shagdar. Coexistence of IEEE 802.11p and the TDMA-based AS-DTMAC Protocol SoftCOM 2020: International Conference on Software, Telecommunications and Computer Networks 2020 Hvar / Virtual, Croatia September 2020
  HAL back to text
• 34 inproceedings TengfeiT. Chang, TimothyT. Claeys, MališaM. Vučinić, XaviX. Vilajosana, TitanT. Yuan, BradB. Wheeler, FilipF. Maksimovic, DavidD. Burnett, BrianB. Kilberg, KrisK. Pister and ThomasT. Watteyne. Industrial IoT with Crystal-Free Mote-on-Chip IEEE Symposia on VLSI Technology and Circuits (VLSI) Honolulu, HI / Virtual, United States June 2020
  HAL
• 35 inproceedings TengfeiT. Chang, ThomasT. Watteyne, BradB. Wheeler, FilipF. Maksimovic, OsamaO. Khan, SaharS. Mesri, LydiaL. Lee, KrisK. Pister, IoanaI. Suciu and XavierX. Vilajosana. Demo: 6TiSCH on SC$\mu$M, Running a Synchronized Protocol Stack without Crystals' EWSN 2020 - ACM International Conference on Embedded Wireless Systems and Networks Lyon, France February 2020
  HAL
• 36 inproceedings TimothyT. Claeys, Francois-XavierF.-X. Molina, MalisaM. Vucinic, ThomasT. Watteyne and EmmanuelE. Baccelli. RIOT and OpenWSN 6TiSCH: Happy Together PEMWN 2020 - 9th IFIP/IEEE International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks Berlin / Virtual, Germany December 2020
  HAL
• 37 inproceedingsImanI. Hmedoush, CédricC. Adjih, PaulP. Muhlethaler and VinodV. Kumar. On the Performance of Irregular Repetition Slotted Aloha with Multiple Packet ReceptionIWCMC 2020 - 16th International Wireless Communications and Mobile Computing ConferenceLimassol / Virtual, Cyprushttps://iwcmc.org/2020/June 2020, 557-564
  HALDOI
• 38 inproceedings ImanI. Hmedoush, CédricC. Adjih, PaulP. Muhlethaler and LouL. Salaun. Multi-Power Irregular Repetition Slotted ALOHA in Heterogeneous IoT networks PEMWN 2020 - 9th IFIP/IEEE International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks PEMWN 2020 - 9th IFIP/IEEE International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks, Berlin / Virtual, Germany December 2020
  HAL back to text
• 39 inproceedings JelenaJ. Kovač, JovanJ. Crnogorac, EnisE. Kočan and MalisaM. Vucinic. Sniffing Multi-hop Multi-channel Wireless Sensor Networks TELFOR 2020 - 28th Telecommunications Forum Belgrade / Virtual, Serbia November 2020
  HAL
• 40 inproceedings AbirA. Rebei, MohamedM. Hadded, HaifaH. Touati, FouziF. Boukhalfa and PaulP. Muhlethaler. MAC-aware Routing Protocols for Vehicular Ad Hoc Networks: A Survey SoftCOM 2020: International Conference on Software, Telecommunications and Computer Networks 2020 Hvar / Virtual, Croatia September 2020
  HAL DOI back to text
• 41 inproceedingsAbdallahA. Sobehy, EricE. Renault and PaulP. Muhlethaler. CSI-MIMO: K-nearest neighbor applied to indoor localizationICC 2020: IEEE International Conference on CommunicationsDublin / Virtual, Ireland2020, 1-6
  HALback to textback to text
• 42 inproceedings YasuyukiY. Tanaka, HaiH. Le, VictorV. Kobayashi, CamiloC. Lopez, ThomasT. Watteyne and MinaM. Rady. Demo: Blink - Room-Level Localization Using SmartMesh IP EWSN 2020 - ACM International Conference on Embedded Wireless Systems and Networks Lyon, France February 2020
  HAL

Conferences without proceedings

• 43 inproceedings ImanI. Hmedoush, CédricC. Adjih and PaulP. Muhlethaler. A Regret Minimization Approach to Frameless Irregular Repetition Slotted Aloha: IRSA-RM MLN 2020 - International Conference on Machine Learning for Networking MLN 2020 - International Conference on Machine Learning for Networking Paris / Virtual, France November 2020
  HAL back to text
• 44 inproceedings MamoudouM. Sangaré, SoumyaS. Banerjee, PaulP. Muhlethaler and ThinhT. Le Vinh. Graph-Based Subjective Matching of Trusted Strings and Blockchain-Based Filtering for Connected Vehicles MSPN 2020 - 6th International Conference on Mobile, Secure and Programmable Networking LNCS - Lecture Notes in Computer Science MSPN 2020 - 6thInternational Conference on Mobile, Secure and Programmable Networking 12605 Paris / Virtual, France October 2020
  HAL DOI back to text

Edition (books, proceedings, special issue of a journal)

• 45 proceedings S. Boumerdassi E. Renault P. Muhlethaler Machine Learning for Networking. Second IFIP TC 6 International Conference, MLN 2019, Paris, France, December 3–5, 2019, Revised Selected Papers MLN 2019 - Second IFIP TC 6 International Conference Machine Learning for Networking Paris, France April 2020
  HAL DOI back to text

Doctoral dissertations and habilitation theses

• 46 thesis AbdallahA. Sobehy. Machine learning based localization in 5G Institut Polytechnique de Paris November 2020
  HAL

Reports & preprints

• 47 reportRazanneR. Abu-Aisheh, FrancescoF. Bronzino, MyrianaM. Rifai, BrianB. Kilberg, KrisK. Pister and ThomasT. Watteyne. Exploration and Mapping using a Sparse Robot Swarm: Simulation ResultsInriaJune 2020, 17
  HAL
• 48 report MinaM. Rady, QuentinQ. Lampin, DominiqueD. Barthel and ThomasT. Watteyne. Initial Design of a Generalization of the 6TiSCH Standard to Support Multiple PHY Layers Inria February 2021
  HAL

Other scientific publications

• 49 misc GöranG. Selander, JohnJ. Mattsson, MališaM. Vučinić, MichaelM. Richardson and AurelioA. Schellenbaum. Lightweight Authorization for Authenticated Key Exchange: IETF Internet Draft November 2020
  HAL back to text
• 50 misc GöranG. Selander, ShahidS. Raza, MartinM. Furuhed, MališaM. Vučinić and TimothyT. Claeys. Protecting EST Payloads with OSCORE: IETF Internet Draft November 2020
  HAL back to text
• 51 misc MališaM. Vučinić, GöranG. Selander, JohnJ. Mattsson and DanD. Garcia-Carrillo. Requirements for a Lightweight AKE for OSCORE: IETF Internet Draft June 2020
  HAL back to text
• 52 misc ThomasT. Watteyne, PascalP. Thubert and CarstenC. Bormann. RFC 8930: On Forwarding 6LoWPAN Fragments over a Multi-Hop IPv6 Network: IETF Standard November 2020
  HAL