Fundamentals of Large Sensor Networks: Connectivity, Capacity, Clocks and Computation

Sensor networks potentially feature large numbers of nodes that can sense their environment over time, communicate with each other over a wireless network, and process information. They differ from data networks in that the network as a whole may be designed for a specific application. We study the theoretical foundations of such large scale sensor networks, addressing four fundamental issues- connectivity, capacity, clocks and function computation. To begin with, a sensor network must be connected so that information can indeed be exchanged between nodes. The connectivity graph of an ad-hoc network is modeled as a random graph and the critical range for asymptotic connectivity is determined, as well as the critical number of neighbors that a node needs to connect to. Next, given connectivity, we address the issue of how much data can be transported over the sensor network. We present fundamental bounds on capacity under several models, as well as architectural implications for how wireless communication should be organized. Temporal information is important both for the applications of sensor networks as well as their operation.We present fundamental bounds on the synchronizability of clocks in networks, and also present and analyze algorithms for clock synchronization. Finally we turn to the issue of gathering relevant information, that sensor networks are designed to do. One needs to study optimal strategies for in-network aggregation of data, in order to reliably compute a composite function of sensor measurements, as well as the complexity of doing so. We address the issue of how such computation can be performed efficiently in a sensor network and the algorithms for doing so, for some classes of functions.Comment: 10 pages, 3 figures, Submitted to the Proceedings of the IEE

Ergodic Randomized Algorithms and Dynamics over Networks

Algorithms and dynamics over networks often involve randomization, and randomization may result in oscillating dynamics which fail to converge in a deterministic sense. In this paper, we observe this undesired feature in three applications, in which the dynamics is the randomized asynchronous counterpart of a well-behaved synchronous one. These three applications are network localization, PageRank computation, and opinion dynamics. Motivated by their formal similarity, we show the following general fact, under the assumptions of independence across time and linearities of the updates: if the expected dynamics is stable and converges to the same limit of the original synchronous dynamics, then the oscillations are ergodic and the desired limit can be locally recovered via time-averaging.Comment: 11 pages; submitted for publication. revised version with fixed technical flaw and updated reference

Space-based Aperture Array For Ultra-Long Wavelength Radio Astronomy

The past decade has seen the rise of various radio astronomy arrays, particularly for low-frequency observations below 100MHz. These developments have been primarily driven by interesting and fundamental scientific questions, such as studying the dark ages and epoch of re-ionization, by detecting the highly red-shifted 21cm line emission. However, Earth-based radio astronomy below frequencies of 30MHz is severely restricted due to man-made interference, ionospheric distortion and almost complete non-transparency of the ionosphere below 10MHz. Therefore, this narrow spectral band remains possibly the last unexplored frequency range in radio astronomy. A straightforward solution to study the universe at these frequencies is to deploy a space-based antenna array far away from Earths' ionosphere. Various studies in the past were principally limited by technology and computing resources, however current processing and communication trends indicate otherwise. We briefly present the achievable science cases, and discuss the system design for selected scenarios, such as extra-galactic surveys. An extensive discussion is presented on various sub-systems of the potential satellite array, such as radio astronomical antenna design, the on-board signal processing, communication architectures and joint space-time estimation of the satellite network. In light of a scalable array and to avert single point of failure, we propose both centralized and distributed solutions for the ULW space-based array. We highlight the benefits of various deployment locations and summarize the technological challenges for future space-based radio arrays.Comment: Submitte

TDOA based positioning in the presence of unknown clock skew

Cataloged from PDF version of article.This paper studies the positioning problem of a single target node based on time-difference-of-arrival (TDOA) measurements in the presence of clock imperfections. Employing an affine model for the behaviour of a local clock, it is observed that TDOA based approaches suffer from a parameter of the model, called the clock skew. Modeling the clock skew as a nuisance parameter, this paper investigates joint clock skew and position estimation. The maximum likelihood estimator (MLE) is derived for this problem, which is highly nonconvex and difficult to solve. To avoid the difficulty in solving the MLE, we employ suitable approximations and relaxations and propose two suboptimal estimators based on semidefinite programming and linear estimation. To further improve the estimation accuracy, we also propose a refining step. In addition, the Cramer-Rao ´ lower bound (CRLB) is derived for this problem as a benchmark. Simulation results show that the proposed suboptimal estimators can attain the CRLB for sufficiently high signal-to-noise ratios