Over the coming decades, high-definition situationally aware networks have the potential to create revolutionary applications in the social, scientific, commercial, and military sectors. Ultrawide bandwidth (UWB) technology is a viable candidate for enabling accurate localization capabilities through time-of-arrival (TOA)-based ranging techniques. These techniques exploit the fine delay resolution property of UWB signals by estimating the TOA of the first signal path. Exploiting the full capabilities of UWB TOA estimation can be challenging, especially when operating in harsh propagation environments, since the direct path may not exist or it may not be the strongest. In this paper, we first give an overview of ranging \ud techniques together with the primary sources of TOA error \ud (including propagation effects, clock drift, and interference). \ud We then describe fundamental TOA bounds (such as the \ud Cramér–Rao bound and the tighter Ziv–Zakai bound) in both \ud ideal and multipath environments. These bounds serve as useful benchmarks in assessing the performance of TOA estimation techniques. We also explore practical low-complexity TOA \ud estimation techniques and analyze their performance in the \ud presence of multipath and interference using IEEE 802.15.4a \ud channel models as well as experimental data measured in \ud indoor residential environments

Location awareness is a key enabling feature and fundamental challenge in present and future wireless networks. Most existing localization methods rely on existing infrastructure and thus lack the flexibility and robustness necessary for large ad hoc networks. In this paper, we build upon SPAWN (sum-product algorithm over a wireless network), which determines node locations through iterative message passing, but does so at a high computational cost. We compare different message representations for SPAWN in terms of performance and complexity and investigate several types of cooperation based on censoring. Our results, based on experimental data with ultra-wideband (UWB) nodes, indicate that parametric message representation combined with simple censoring can give excellent performance at relatively low complexity.

Abstract-This manuscript provides a model to characterize the energy savings of network coded storage (NCS) in storage area networks (SANs). We consider blocking probability of drives as our measure of performance. A mapping technique to analyze SANs as independent M/G/K/K queues is presented, and blocking probabilities for uncoded storage schemes and NCS are derived and compared. We show that coding operates differently than the amalgamation of file chunks and energy savings are shown to scale well with striping number. We illustrate that for enterprise-level SANs energy savings of 20-50% can be realized.

No abstract