The area of detection and estimation in a distributed wireless sensor network (WSN) has several applications, including military surveillance, sustainability, health monitoring, and Internet of Things (IoT). Compared with a wired centralized sensor network, a distributed WSN has many advantages including scalability and robustness to sensor node failures. In this book, we address the problem of estimating the structure of distributed WSNs. First, we provide a literature review in: (a) graph theory; (b) network area estimation; and (c) existing consensus algorithms, including average consensus and max consensus. Second, a distributed algorithm for counting the total number of nodes in a wireless sensor network with noisy communication channels is introduced. Then, a distributed network degree distribution estimation (DNDD) algorithm is described. The DNDD algorithm is based on average consensus and in-network empirical mass function estimation. Finally, a fully distributed algorithm for estimating the center and the coverage region of a wireless sensor network is described. The algorithms introduced are appropriate for most connected distributed networks. The performance of the algorithms is analyzed theoretically, and simulations are performed and presented to validate the theoretical results. In this book, we also describe how the introduced algorithms can be used to learn global data information and the global data region.

In sensor network applications, measured data are often meaningful only when the location is accurately known. In this booklet, we study research problems associated with node localization in wireless sensor networks. We describe sensor network localization problems in terms of a detection and estimation framework and we emphasize specifically a cooperative process where sensors with known locations are used to localize nodes at unknown locations. In this class of problems, even if the location of a node is known, the wireless links and transmission modalities between two nodes may be unknown. In this case, sensor nodes are used to detect the location and estimate pertinent data transmission activities between nodes. In addition to the broader problem of sensor localization, this booklet studies also specific localization measurements such as time of arrival (TOA), received signal strength (RSS), and direction of arrival (DOA). The sequential localization algorithm, which uses a subset of sensor nodes to estimate nearby sensor nodes' locations is discussed in detail. Extensive bibliography is given for those readers who want to delve further into specific topics.

The Kalman filter is the Bayesian optimum solution to the problem of sequentially estimating the states of a dynamical system in which the state evolution and measurement processes are both linear and Gaussian. Given the ubiquity of such systems, the Kalman filter finds use in a variety of applications, e.g., target tracking, guidance and navigation, and communications systems. The purpose of this book is to present a brief introduction to Kalman filtering. The theoretical framework of the Kalman filter is first presented, followed by examples showing its use in practical applications. Extensions of the method to nonlinear problems and distributed applications are discussed. A software implementation of the algorithm in the MATLAB programming language is provided, as well as MATLAB code for several example applications discussed in the manuscript.

Orthogonal Frequency Division Multiplexing (OFDM) systems are widely used in the standards for digital audio/video broadcasting, WiFi and WiMax. Being a frequency-domain approach to communications, OFDM has important advantages in dealing with the frequency-selective nature of high data rate wireless communication channels. As the needs for operating with higher data rates become more pressing, OFDM systems have emerged as an effective physical-layer solution. This short monograph is intended as a tutorial which highlights the deleterious aspects of the wireless channel and presents why OFDM is a good choice as a modulation that can transmit at high data rates. The system-level approach we shall pursue will also point out the disadvantages of OFDM systems especially in the context of peak to average ratio, and carrier frequency synchronization. Finally, simulation of OFDM systems will be given due prominence. Simple MATLAB programs are provided for bit error rate simulation using a discrete-time OFDM representation. Software is also provided to simulate the effects of inter-block-interference, inter-carrier-interference and signal clipping on the error rate performance. Different components of the OFDM system are described, and detailed implementation notes are provided for the programs. The program can be downloaded here. Table of Contents: Introduction / Modeling Wireless Channels / Baseband OFDM System / Carrier Frequency Offset / Peak to Average Power Ratio / Simulation of the Performance of OFDM Systems / Conclusions

This book provides an introduction to narrowband array signal processing, classical and subspace-based direction of arrival (DOA) estimation with an extensive discussion on adaptive direction of arrival algorithms. The book begins with a presentation of the basic theory, equations, and data models of narrowband arrays. It then discusses basic beamforming methods and describes how they relate to DOA estimation. Several of the most common classical and subspace-based direction of arrival methods are discussed. The book concludes with an introduction to subspace tracking and shows how subspace tracking algorithms can be used to form an adaptive DOA estimator. Simulation software and additional bibliography are given at the end of the book. Table of Contents: Introduction / Background on Array Processing / Nonadaptive Direction of Arrival Estimation / Adaptive Direction of Arrival Estimation / Appendix