327 research outputs found

    Spatial networks with wireless applications

    Get PDF
    Many networks have nodes located in physical space, with links more common between closely spaced pairs of nodes. For example, the nodes could be wireless devices and links communication channels in a wireless mesh network. We describe recent work involving such networks, considering effects due to the geometry (convex,non-convex, and fractal), node distribution, distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina

    Connectivity vs Capacity in Dense Ad Hoc Networks

    Get PDF
    We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales, and the available rate per node is known to decrease like 1/sqrt(n). On the contrary, if the attenuation function does not have a singularity at the origin and is uniformly bounded, we obtain bounds on the percolation domain for large node densities, which show that either the network becomes disconnected, or the available rate per node decreases like 1/n

    Cooperative Communications: Network Design and Incremental Relaying

    Get PDF

    Energy Efficient Massive MIMO and Beamforming for 5G Communications

    Get PDF
    Massive multiple-input multiple-output (MIMO) has been a key technique in the next generation of wireless communications for its potential to achieve higher capacity and data rates. However, the exponential growth of data traffic has led to a significant increase in the power consumption and system complexity. Therefore, we propose and study wireless technologies to improve the trade-off between system performance and power consumption of wireless communications. This Thesis firstly proposes a strategy with partial channel state information (CSI) acquisition to reduce the power consumption and hardware complexity of massive MIMO base stations. In this context, the employment of partial CSI is proposed in correlated communication channels with user mobility. By exploiting both the spatial correlation and temporal correlation of the channel, our analytical results demonstrate significant gains in the energy efficiency of the massive MIMO base station. Moreover, relay-aided communications have experienced raising interest; especially, two-way relaying systems can improve spectral efficiency with short required operating time. Therefore, this Thesis focuses on an uncorrelated massive MIMO two-way relaying system and studies power scaling laws to investigate how the transmit powers can be scaled to improve the energy efficiency up to several times the energy efficiency without power scaling while approximately maintaining the system performance. In a similar line, large antenna arrays deployed at the space-constrained relay would give rise to the spatial correlation. For this reason, this Thesis presents an incomplete CSI scheme to evaluate the trade-off between the spatial correlation and system performance. In addition, the advantages of linear processing methods and the effects of channel aging are investigated to further improve the relay-aided system performance. Similarly, large antenna arrays are required in millimeter-wave communications to achieve narrow beams with higher power gain. This poses the problem that locating the best beam direction requires high power and complexity consumption. Therefore, this Thesis presents several low-complexity beam alignment methods with respect to the state-of-the-art to evaluate the trade-off between complexity and system performance. Overall, extensive analytical and numerical results show an improved performance and validate the effectiveness of the proposed techniques

    Asymptotic properties of wireless multi-hop networks

    Get PDF
    In this dissertation, we consider wireless multi-hop networks, where the nodes are randomly placed. We are particularly interested in their asymptotic properties when the number of nodes tends to infinity. We use percolation theory as our main tool of analysis. As a first model, we assume that nodes have a fixed connectivity range, and can establish wireless links to all nodes within this range, but no other (Boolean model). We compute for one-dimensional networks the probability that two nodes are connected, given the distance between them. We show that this probability tends exponentially to zero when the distance increases, proving that pure multi-hopping does not work in large networks. In two dimensions however, an unbounded cluster of connected nodes forms if the node density is above a critical threshold (super-critical phase). This is known as the percolation phenomenon. This cluster contains a positive fraction of the nodes that depends on the node density, and remains constant as the network size increases. Furthermore, the fraction of connected nodes tends rapidly to one when the node density is above the threshold. We compare this partial connectivity to full connectivity, and show that the requirement for full connectivity leads to vanishing throughput when the network size increases. In contrast, partial connectivity is perfectly scalable, at the cost of a tiny fraction of the nodes being disconnected. We consider two other connectivity models. The first one is a signal-to-interference- plus-noise-ratio based connectivity graph (STIRG). In this model, we assume deterministic attenuation of the signals as a function of distance. We prove that percolation occurs in this model in a similar way as in the previous model, and study in detail the domain of parameters where it occurs. We show in particular that the assumptions on the attenuation function dramatically impact the results: the commonly used power-law attenuation leads to particular symmetry properties. However, physics imposes that the received signal cannot be stronger than the emitted signal, implying a bounded attenuation function. We observe that percolation is harder to achieve in most cases with such an attenuation function. The second model is an information theoretic view on connectivity, where two arbitrary nodes are considered connected if it is possible to transmit data from one to the other at a given rate. We show that in this model the same partial connectivity can be achieved in a scalable way as in the Boolean model. This result is however a pure connectivity result in the sense that there is no competition and interferences between data flows. We also look at the other extreme, the Gupta and Kumar scenario, where all nodes want to transmit data simultaneously. We show first that under point-to-point communication and bounded attenuation function the total transport capacity of a fixed area network is bounded from above by a constant, whatever the number of nodes may be. However, if the network area increases linearly with the number of nodes (constant density), or if we assume power-law attenuation function, a throughput per node of order 1/√n can be achieved. This latter result improves the existing results about random networks by a factor (log n)1/2. In the last part of this dissertation, we address two problems related to latency. The first one is an intruder detection scenario, where a static sensor network has to detect an intruder that moves with constant speed along a straight line. We compute an upper bound to the time needed to detect the intruder, under the assumption that detection by disconnected sensors does not count. In the second scenario, sensors switch off their radio device for random periods, in order to save energy. This affects the delivery of alert messages, since they may have to wait for relays to turn on their radio to move further. We show that asymptotically, alert messages propagate with constant, deterministic speed in such networks

    Nuts and Bolts of a Realistic Stochastic Geometric Analysis of mmWave HetNets: Hardware Impairments and Channel Aging

    Get PDF
    © 2019 IEEE.Motivated by heterogeneous network (HetNet) design in improving coverage and by millimeter-wave (mmWave) transmission offering an abundance of extra spectrum, we present a general analytical framework shedding light on the downlink of realistic mmWave HetNets consisting of K tiers of randomly located base stations. Specifically, we model, by virtue of stochastic geometry tools, the multi-Tier multi-user (MU) multiple-input multiple-output (MIMO) mmWave network degraded by the inevitable residual additive transceiver hardware impairments (RATHIs) and channel aging. Given this setting, we derive the coverage probability and the area spectral efficiency (ASE), and we subsequently evaluate the impact of residual transceiver hardware impairments and channel aging on these metrics. Different path-loss laws for line-of-sight and non-line-of-sight are accounted for the analysis, which are among the distinguishing features of mmWave systems. Among the findings, we show that the RATHIs have a meaningful impact at the high-signal-To-noise-ratio regime, while the transmit additive distortion degrades further than the receive distortion the system performance. Moreover, serving fewer users proves to be preferable, and the more directive the mmWaves are, the higher the ASE becomes.Peer reviewedFinal Accepted Versio
    • …
    corecore