Highly reliable, low-latency communication in low-power wireless networks

Low-power wireless networks consist of spatially distributed, resource-constrained devices – also referred to as nodes – that are typically equipped with integrated or external sensors and actuators. Nodes communicate with each other using wireless transceivers, and thus, relay data – e. g., collected sensor values or commands for actuators – cooperatively through the network. This way, low-power wireless networks can support a plethora of different applications, including, e. g., monitoring the air quality in urban areas or controlling the heating, ventilation and cooling of large buildings. The use of wireless communication in such monitoring and actuating applications allows for a higher flexibility and ease of deployment – and thus, overall lower costs – compared to wired solutions. However, wireless communication is notoriously error-prone. Message losses happen often and unpredictably, making it challenging to support applications requiring both high reliability and low latency. Highly reliable, low-latency communication – along with high energy-efficiency – are, however, key requirements to support several important application scenarios and most notably the open-/closed-loop control functions found in e. g., industry and factory automation applications. Communication protocols that rely on synchronous transmissions have been shown to be able to overcome this limitation. These protocols depart from traditional single-link transmissions and do not attempt to avoid concurrent transmissions from different nodes to prevent collisions. On the contrary, they make nodes send the same message at the same time over several paths. Phenomena like constructive interference and capture then ensure that messages are received correctly with high probability. While many approaches relying on synchronous transmissions have been presented in the literature, two important aspects received only little consideration: (i) reliable operation in harsh environments and (ii) support for event-based data traffic. This thesis addresses these two open challenges and proposes novel communication protocols to overcome them

WHYPE: A Scale-Out Architecture with Wireless Over-the-Air Majority for Scalable In-memory Hyperdimensional Computing

Hyperdimensional computing (HDC) is an emerging computing paradigm that represents, manipulates, and communicates data using long random vectors known as hypervectors. Among different hardware platforms capable of executing HDC algorithms, in-memory computing (IMC) has shown promise as it is very efficient in performing matrix-vector multiplications, which are common in the HDC algebra. Although HDC architectures based on IMC already exist, how to scale them remains a key challenge due to collective communication patterns that these architectures required and that traditional chip-scale networks were not designed for. To cope with this difficulty, we propose a scale-out HDC architecture called WHYPE, which uses wireless in-package communication technology to interconnect a large number of physically distributed IMC cores that either encode hypervectors or perform multiple similarity searches in parallel. In this context, the key enabler of WHYPE is the opportunistic use of the wireless network as a medium for over-the-air computation. WHYPE implements an optimized source coding that allows receivers to calculate the bit-wise majority of multiple hypervectors (a useful operation in HDC) being transmitted concurrently over the wireless channel. By doing so, we achieve a joint broadcast distribution and computation with a performance and efficiency unattainable with wired interconnects, which in turn enables massive parallelization of the architecture. Through evaluations at the on-chip network and complete architecture levels, we demonstrate that WHYPE can bundle and distribute hypervectors faster and more efficiently than a hypothetical wired implementation, and that it scales well to tens of receivers. We show that the average error rate of the majority computation is low, such that it has negligible impact on the accuracy of HDC classification tasks.Comment: Accepted at IEEE Journal on Emerging and Selected Topics in Circuits and Systems (JETCAS). arXiv admin note: text overlap with arXiv:2205.1088

Predictable Reliability In Inter-Vehicle Communications

Predictably reliable communication in wireless networked sensing and control systems (WSC) is a basic enabler for performance guarantee. Yet current research efforts are either focus on maximizing throughput or based on inaccurate interference modelling methods, which yield unsatisfactory results in terms of communication reliability. In this dissertation, we discuss techniques that enable reliable communication in both traditional wireless sensor networks and highly mobile inter-vehicle communication networks. We focus our discussion on traditional wireless sensor networks in Chapter 2 where we discuss mechanisms that enable predictable and reliable communications with no centralized infrastructures. With the promising results in Chapter 2, we extend our methods to inter-vehicle communication networks in Chapter 3. We focus on the broadcast communication paradigm and the unique challenges in applying the PRK interference model into broadcast problems in highly mobile inter-vehicle communication networks. While Chapter 2 and Chapter 3 focus on average reliability, we switch our problem to a more challenging aspect: guaranteeing short-term per-packet reception probability in Chapter 4. Specifically, we describe the PRKS protocol in Chapter 2 which considers unicast transmission paradigm in traditional static wireless sensor networks. PRKS uses the PRK interference model as a basis for interference relation identification that captures characteristics of wireless communications. For communication reliability control, we design a controller that runs at each link receiver and is able to control the average link reliability to be no lower than an application requirement as well as minimizing reliability variation. We further evaluate PRKS with extensive ns-3 simulations. The CPS protocol described in Chapter 3 considers an one-hop broadcast problem in multi-hop inter-vehicle communication networks. We analyze the challenges of applying the PRK model in this particular setting and propose an approximated PRK model, i.e., gPRK model, that addresses the challenges. We further design principles that CPS uses to instantiate the gPRK model in inter-vehicle communications. We implement the CPS scheduling framework in an integrated platform with SUMO and ns-3 to evaluate our design. In Chapter 4, we conservatively estimate the background interference plus noise while nodes are receiving packets. In the meantime, receivers decide minimum power levels their sender should use and feedback their decisions to their senders. Senders fuse feedbacks and choose a power level that guarantees expected packet reception probability at each receivers’ side. We notice in our evaluation that guaranteeing short-term reliability causes extra concurrency loss