Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad-hoc Networks

In dynamic wireless ad-hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high predictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our proposal can enable quicker adoption by practitioners and faster deployment of DynWANs that are subject changes in the network topology

On the Trade-off Between Accuracy and Delay in Cooperative UWB Navigation

In ultra-wide bandwidth (UWB) cooperative navigation, nodes estimate their position by means of shared information. Such sharing has a direct impact on the position accuracy and medium access control (MAC) delay, which needs to be considered when designing UWB navigation systems. We investigate the interplay between UWB position accuracy and MAC delay for cooperative scenarios. We quantify this relation through fundamental lower bounds on position accuracy and MAC delay for arbitrary finite networks. Results show that the traditional ways to increase accuracy (e.g., increasing the number of anchors or the transmission power) as well as inter-node cooperation may lead to large MAC delays. We evaluate one method to mitigate these delays

Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, $\xi$, and then combine them into frames of uniform size, $\tau$. We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, $\delta$, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size. We demonstrate that this problem has no solution when the frame size is $\tau < \max\{2\delta,\chi_2\}$, where $\chi_2$ is the chromatic number for distance-$2$ vertex coloring. As a complement to this lower bound, we focus on proving the existence of collision-free self-stabilizing TDMA algorithms that use constant frame size of $\tau$. We consider basic settings (no hardware support for collision detection and no prior clock synchronization), and the collision of concurrent transmissions from transmitters that are at most two hops apart. In the context of self-stabilizing systems that have no external reference, we are the first to study this problem (to the best of our knowledge), and use simulations to show convergence even with computation time uncertainties

On the Trade-Off Between Accuracy and Delay in Cooperative UWB Localization: Performance Bounds and Scaling Laws

Ultra-wide bandwidth (UWB) systems allow for accurate positioning in environments where global navigation satellite systems may fail, especially when complemented with cooperative processing. While cooperative UWB has led to centimeter-level accuracies, the communication overhead is often neglected. We quantify how accuracy and delay trade off in a wide variety of operation conditions. We also derive the asymptotic scaling of accuracy and delay, indicating that, in some conditions, standard cooperation offers the worst possible tradeoff. Both avenues lead to the same conclusion: indiscriminately targeting increased accuracy incurs a significant delay penalty. Simple countermeasures can be taken to reduce this penalty and obtain a meaningful accuracy/delay trade-off