arXiv subjects

Justin P. Coon

Publications and source records attributed to Justin P. Coon.

67 records · Page 4Linked to original sources

arXiv2016

Connectivity Scaling Laws in Wireless Networks

We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas exploited for diversity coding and/or beamforming at each node. We demonstrate that the local probability of connectivity scales like $\mathcal{O}(z^\mathcal C)$ in these parameters, where $\mathcal C$ is the ratio of the dimension of the network domain to the path loss exponent, thus enabling efficient boundary effect mitigation and network topology control.

cs.NI↗

arXiv2015

Directional antennas improve the link-connectivity of interference limited ad hoc networks

We study wireless ad hoc networks in the absence of any channel contention or transmit power control and ask how antenna directivity affects network connectivity in the interference limited regime. We answer this question by deriving closed-form expressions for the outage probability, capacity and mean node degree of the network using tools from stochastic geometry. These novel results provide valuable insights for the design of future ad hoc networks. Significantly, our results suggest that the more directional the interfering transmitters are, the less detrimental are the effects of interference to individual links. We validate our analytical results through computer simulations.

cs.NI↗

arXiv2015

More is less: Connectivity in fractal regions

Ad-hoc networks are often deployed in regions with complicated boundaries. We show that if the boundary is modeled as a fractal, a network requiring line of sight connections has the counterintuitive property that increasing the number of nodes decreases the full connection probability. We characterise this decay as a stretched exponential involving the fractal dimension of the boundary, and discuss mitigation strategies. Applications of this study include the analysis and design of sensor networks operating in rugged terrain (e.g. railway cuttings), mm-wave networks in industrial settings and vehicle-to-vehicle/vehicle-to-infrastructure networks in urban environments.

cs.NI↗

arXiv2015

Location, location, location: Border effects in interference limited ad hoc networks

Wireless networks are fundamentally limited by the intensity of the received signals and by their inherent interference. It is shown here that in finite ad hoc networks where node placement is modelled according to a Poisson point process and no carrier sensing is employed for medium access, the SINR received by nodes located at the border of the network deployment/operation region is on average greater than the rest. This is primarily due to the uneven interference landscape of such networks which is particularly kind to border nodes giving rise to all sorts of performance inhomogeneities and access unfairness. Using tools from stochastic geometry we quantify these spatial variations and provide closed form communication-theoretic results showing why the receiver's location is so important.

cs.NI↗

arXiv2014

Network connectivity in non-convex domains with reflections

Recent research has demonstrated the importance of boundary effects on the overall connection probability of wireless networks but has largely focused on convex deployment regions. We consider here a scenario of practical importance to wireless communications, in which one or more nodes are located outside the convex space where the remaining nodes reside. We call these `external nodes', and assume that they play some essential role in the macro network functionality e.g. a gateway to a dense self-contained mesh network cloud. Conventional approaches with the underlying assumption of only line-of-sight (LOS) or direct connections between nodes, fail to provide the correct analysis for such a network setup. To this end we present a novel analytical framework that accommodates for the non-convexity of the domain and explicitly considers the effects of non-LOS nodes through reflections from the domain boundaries. We obtain analytical expressions in 2D and 3D which are confirmed numerically for Rician channel fading statistics and discuss possible extensions and applications.

cs.NI↗

arXiv2014

A Theorem on the Asymptotic Outage Behavior of Fixed-Gain Amplify-and-Forward Relay Systems

A theorem that describes the high signal-to-noise ratio (SNR) outage behavior of fixed-gain amplify-and-forward (FGAF) relay systems is given. Qualitatively, the theorem states that the outage probability decays according to a power law, where the power is dictated by the poles of the moments of the underlying per-hop fading distributions. The power law decay is dampened by a logarithmic factor when the leading pole (furthest to the right in the plane) is of order two or more. The theorem is easy to apply and several examples are presented to this effect.

cs.IT↗

arXiv2014

Connectivity in Dense Networks Confined within Right Prisms

We consider the probability that a dense wireless network confined within a given convex geometry is fully connected. We exploit a recently reported theory to develop a systematic methodology for analytically characterizing the connectivity probability when the network resides within a convex right prism, a polyhedron that accurately models many geometries that can be found in practice. To maximize practicality and applicability, we adopt a general point-to-point link model based on outage probability, and present example analytical and numerical results for a network employing $2 \times 2$ multiple-input multiple-output (MIMO) maximum ratio combining (MRC) link level transmission confined within particular bounding geometries. Furthermore, we provide suggestions for extending the approach detailed herein to more general convex geometries.

cs.NI↗

arXiv2014

Keyhole and Reflection Effects in Network Connectivity Analysis

Recent research has demonstrated the importance of boundary effects on the overall connection probability of wireless networks, but has largely focused on convex domains. We consider two generic scenarios of practical importance to wireless communications, in which one or more nodes are located outside the convex space where the remaining nodes reside. Consequently, conventional approaches with the underlying assumption that only line-of-sight (LOS) or direct connections between nodes are possible, fail to provide the correct analysis for the connectivity. We present an analytical framework that explicitly considers the effects of reflections from the system boundaries on the full connection probability. This study provides a different strategy to ray tracing tools for predicting the wireless propagation environment. A simple two-dimensional geometry is first considered, followed by a more practical three-dimensional system. We investigate the effects of different system parameters on the connectivity of the network though analysis corroborated by numerical simulations, and highlight the potential of our approach for more general non-convex geometries.t system parameters on the connectivity of the network through simulation and analysis.

cs.IT↗

arXiv2014

Network Connectivity: Stochastic vs. Deterministic Wireless Channels

We study the effect of stochastic wireless channel models on the connectivity of ad hoc networks. Unlike in the deterministic geometric disk model where nodes connect if they are within a certain distance from each other, stochastic models attempt to capture small-scale fading effects due to shadowing and multipath received signals. Through analysis of local and global network observables, we present conclusive evidence suggesting that network behaviour is highly dependent upon whether a stochastic or deterministic connection model is employed. Specifically we show that the network mean degree is lower (higher) for stochastic wireless channels than for deterministic ones, if the path loss exponent is greater (lesser) than the spatial dimension. Similarly, the probability of forming isolated pairs of nodes in an otherwise dense random network is much less for stochastic wireless channels than for deterministic ones. The latter realisation explains why the upper bound of $k$-connectivity is tighter for stochastic wireless channels. We obtain closed form analytic results and compare to extensive numerical simulations.

cs.NI↗

arXiv2013

Connectivity of confined 3D Networks with Anisotropically Radiating Nodes

Nodes in ad hoc networks with randomly oriented directional antenna patterns typically have fewer short links and more long links which can bridge together otherwise isolated subnetworks. This network feature is known to improve overall connectivity in 2D random networks operating at low channel path loss. To this end, we advance recently established results to obtain analytic expressions for the mean degree of 3D networks for simple but practical anisotropic gain profiles, including those of patch, dipole and end-fire array antennas. Our analysis reveals that for homogeneous systems (i.e. neglecting boundary effects) directional radiation patterns are superior to the isotropic case only when the path loss exponent is less than the spatial dimension. Moreover, we establish that ad hoc networks utilizing directional transmit and isotropic receive antennas (or vice versa) are always sub-optimally connected regardless of the environment path loss. We extend our analysis to investigate boundary effects in inhomogeneous systems, and study the geometrical reasons why directional radiating nodes are at a disadvantage to isotropic ones. Finally, we discuss multi-directional gain patterns consisting of many equally spaced lobes which could be used to mitigate boundary effects and improve overall network connectivity.

cs.IT↗

arXiv2012

Asymptotic Outage Probability Analysis for General Fixed-Gain Amplify-and-Forward Multihop Relay Systems

In this paper, we present an analysis of the outage probability for fixed-gain amplify-and-forward (AF) multihop relay links operating in the high SNR regime. Our analysis exploits properties of Mellin transforms to derive an asymptotic approximation that is accurate even when the per-hop channel gains adhere to completely different fading models. The main result contained in the paper is a general expression for the outage probability, which is a functional of the Mellin transforms of the per-hop channel gains. Furthermore, we explicitly calculate the asymptotic outage probability for four different systems, whereby in each system the per-hop channels adhere to either a Nakagami-m, Weibull, Rician, or Hoyt fading profile, but where the distributional parameters may differ from hop to hop. This analysis leads to our second main result, which is a semi-general closed-form formula for the outage probability of general fixed-gain AF multihop systems. We exploit this formula to analyze an example scenario for a four-hop system where the per-hop channels follow the four aforementioned fading models, i.e., the first channel is Nakagami-m fading, the second is Weibull fading, and so on. Finally, we provide simulation results to corroborate our analysis.

cs.IT↗

arXiv2012

Connectivity of Confined Dense Networks: Boundary Effects and Scaling Laws

In this paper, we study the probability that a dense network confined within a given geometry is fully connected. We employ a cluster expansion approach often used in statistical physics to analyze the effects that the boundaries of the geometry have on connectivity. To maximize practicality and applicability, we adopt four important point-to-point link models based on outage probability in our analysis: single-input single-output (SISO), single-input multiple-output (SIMO), multiple-input single-output (MISO), and multiple-input multiple-output (MIMO). Furthermore, we derive diversity and power scaling laws that dictate how boundary effects can be mitigated (to leading order) in confined dense networks for each of these models. Finally, in order to demonstrate the versatility of our theory, we analyze boundary effects for dense networks comprising MIMO point-to-point links confined within a right prism, a polyhedron that accurately models many geometries that can be found in practice. We provide numerical results for this example, which verify our analytical results.

cs.NI↗

arXiv2010

Difference Antenna Selection and Power Allocation for Wireless Cognitive Systems

In this paper, we propose an antenna selection method in a wireless cognitive radio (CR) system, namely difference selection, whereby a single transmit antenna is selected at the secondary transmitter out of $M$ possible antennas such that the weighted difference between the channel gains of the data link and the interference link is maximized. We analyze mutual information and outage probability of the secondary transmission in a CR system with difference antenna selection, and propose a method of optimizing these performance metrics of the secondary data link subject to practical constraints on the peak secondary transmit power and the average interference power as seen by the primary receiver. The optimization is performed over two parameters: the peak secondary transmit power and the difference selection weight $δ\in [0, 1]$. We show that, difference selection using the optimized parameters determined by the proposed method can be, in many cases of interest, superior to a so called ratio selection method disclosed in the literature, although ratio selection has been shown to be optimal, when impractically, the secondary transmission power constraint is not applied. We address the effects that the constraints have on mutual information and outage probability, and discuss the practical implications of the results.

cs.IT↗