A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds

Motivated by the benefits of small world networks, we propose a self-organization framework for wireless ad hoc networks. We investigate the use of directional beamforming for creating long-range short cuts between nodes. Using simulation results for randomized beamforming as a guideline, we identify crucial design issues for algorithm design. Our results show that, while significant path length reduction is achievable, this is accompanied by the problem of asymmetric paths between nodes. Subsequently, we propose a distributed algorithm for small world creation that achieves path length reduction while maintaining connectivity. We define a new centrality measure that estimates the structural importance of nodes based on traffic flow in the network, which is used to identify the optimum nodes for beamforming. We show, using simulations, that this leads to significant reduction in path length while maintaining connectivity.Comment: Submitted to IEEE Transactions on Vehicular Technolog

Semi-local scaling exponent estimation with box-penalty constraints and total-variation regularisation

We here establish and exploit the result that 2-D isotropic self-similar fields beget quasi-decorrelated wavelet coefficients and that the resulting localised log sample second moment statistic is asymptotically normal. This leads to the development of a semi-local scaling exponent estimation framework with optimally modified weights. Furthermore, recent interest in penalty methods for least squares problems and generalised Lasso for scaling exponent estimation inspires the simultaneous incorporation of both bounding box constraints and total variation smoothing into an iteratively reweighted least-squares estimator framework. Numerical results on fractional Brownian fields with global and piecewise constant, semi-local Hurst parameters illustrate the benefits of the new estimators

Coverage, capacity and energy efficiency analysis in the uplink of mmWave cellular networks

In this paper, using the concept of stochastic geometry, we present an analytical framework to evaluate the signal-to-interference-and-noise-ratio (SINR) coverage in the uplink of millimeter wave cellular networks. By using a distance-dependent line-of-sight (LOS) probability function, the location of LOS and non-LOS users are modeled as two independent non-homogeneous Poisson point processes, with each having a different pathloss exponent. The analysis takes account of per-user fractional power control (FPC), which couples the transmission of users based on location-dependent channel inversion. We consider the following scenarios in our analysis: 1) Pathloss-based FPC (PL-FPC) which is performed using the measured pathloss and 2) Distance-based FPC (D-FPC) which is performed using the measured distance. Using the developed framework, we derive expressions for the area spectral efficiency and energy efficiency. Results suggest that in terms of SINR coverage, D-FPC outperforms PL-FPC scheme at high SINR where the future networks are expected to operate. It achieves equal or better area spectral efficiency and energy efficiency compared with the PL-FPC scheme. Contrary to the conventional ultra-high frequency cellular networks, in both FPC schemes, the SINR coverage decreases as the cell density becomes greater than a threshold, while the area spectral efficiency experiences a slow growth region

Optimal Information-Theoretic Wireless Location Verification

We develop a new Location Verification System (LVS) focussed on network-based Intelligent Transport Systems and vehicular ad hoc networks. The algorithm we develop is based on an information-theoretic framework which uses the received signal strength (RSS) from a network of base-stations and the claimed position. Based on this information we derive the optimal decision regarding the verification of the user's location. Our algorithm is optimal in the sense of maximizing the mutual information between its input and output data. Our approach is based on the practical scenario in which a non-colluding malicious user some distance from a highway optimally boosts his transmit power in an attempt to fool the LVS that he is on the highway. We develop a practical threat model for this attack scenario, and investigate in detail the performance of the LVS in terms of its input/output mutual information. We show how our LVS decision rule can be implemented straightforwardly with a performance that delivers near-optimality under realistic threat conditions, with information-theoretic optimality approached as the malicious user moves further from the highway. The practical advantages our new information-theoretic scheme delivers relative to more traditional Bayesian verification frameworks are discussed.Comment: Corrected typos and introduced new threat model

Cramer-Rao Bounds for Joint RSS/DoA-Based Primary-User Localization in Cognitive Radio Networks

Knowledge about the location of licensed primary-users (PU) could enable several key features in cognitive radio (CR) networks including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy enforcement. In this paper we consider the achievable accuracy of PU localization algorithms that jointly utilize received-signal-strength (RSS) and direction-of-arrival (DoA) measurements by evaluating the Cramer-Rao Bound (CRB). Previous works evaluate the CRB for RSS-only and DoA-only localization algorithms separately and assume DoA estimation error variance is a fixed constant or rather independent of RSS. We derive the CRB for joint RSS/DoA-based PU localization algorithms based on the mathematical model of DoA estimation error variance as a function of RSS, for a given CR placement. The bound is compared with practical localization algorithms and the impact of several key parameters, such as number of nodes, number of antennas and samples, channel shadowing variance and correlation distance, on the achievable accuracy are thoroughly analyzed and discussed. We also derive the closed-form asymptotic CRB for uniform random CR placement, and perform theoretical and numerical studies on the required number of CRs such that the asymptotic CRB tightly approximates the numerical integration of the CRB for a given placement.Comment: 20 pages, 11 figures, 1 table, submitted to IEEE Transactions on Wireless Communication