Search

Low Earth Orbit (LEO) satellite networks connect millions of devices on Earth and offer various services, such as data communications, remote sensing, and data harvesting. As the number of services increases, LEO satellite networks will continue to grow, and many LEO satellite network operators will share the same spectrum resources. We aim to examine the coexistence of such a future heterogeneous LEO satellite network by proposing a tractable spatial model and analyzing the basic performance of downlink communications. We model a heterogeneous LEO satellite network as Cox point processes, ensuring satellites are located on various orbits. Then, we analyze two different access technologies for such a heterogeneous satellite network: closed access and open access. For both cases, we derive the coverage probability and prove that the coverage probability of the open access scenario outperforms that of the closed access, and this coverage enhancement applies to all users. By providing essential network performance statistics as key distributional parameters and by presenting the fact that the Cox point process approximates a forthcoming future constellation with slight variation, the developed framework and analysis will serve as a tractable instrument to design, evaluate, and optimize heterogeneous LEO satellite networks with numerous constellations., Comment: IEEE Trans. Wireless Communications

Reaching all regions of Earth, low Earth orbit (LEO) satellites can harvest delay-tolerant data from remotely located users on Earth without ground infrastructure. This work aims to assess a data harvest network architecture where users generate data and LEO satellites harvest data from users when passing by. By developing a novel stochastic geometry Cox point process model that simultaneously generates orbits and the motion of LEO satellite harvesters on them, we analyze key performance indices of such a network by deriving the following: (i) the average fraction of time that the typical user is served by LEO satellite harvesters, (ii) the average amount of data uploaded per each satellite pass, (iii) the maximum harvesting capacity of the proposed network model, and (iv) the delay distribution in the proposed network. These key metrics are given as functions of key network variables such as $\lambda$ the mean number of orbits and $\mu$ the mean number of satellites per orbit. Providing rich comprehensive analytical results and practical interpretations of these results, this work assesses the potential of the delay-tolerant use of LEO satellites and also serves as a versatile framework to analyze, design, and optimize delay-tolerant LEO satellite networks., Comment: IEEE Journal on Selected Areas in Communications ( Volume: 42, Issue: 5, May 2024)

Reconfigurable intelligent surfaces (RISs) provide alternative routes for reflected signals to network users, offering numerous applications. This paper explores an innovative approach of strategically deploying RISs along road areas to leverage various propagation and blockage conditions present in cellular networks with roads. To address the local network geometries shown by such networks, we use a stochastic geometry framework, specifically the Cox point processes, to model the locations of RISs and vehicle users. Then, we define the coverage probability as the chance that either a base station or an RIS is in line of sight (LOS) of the typical user and that the LOS signal has a signal-to-noise ratio (SNR) greater than a threshold. We derive the coverage probability as a function of key parameters such as RIS density and path loss exponent. We observe that the network geometry highly affects the coverage and that the proposed RIS deployment effectively leverages the underlying difference of attenuation and blockage, significantly increasing the coverage of vehicle users in the network. With experimental results addressing the impact of key variables to network performance, this work serves as a versatile tool for designing, analyzing, and optimizing RIS-assisted cellular networks with many vehicles., Comment: accepted to IEEE Transactions on Communications

To model existing or future low Earth orbit (LEO) satellite networks leveraging multiple constellations, we propose a simple analytical approach to represent the clustering of satellites on orbits. More precisely, we develop a variable-altitude Poisson orbit process that effectively captures the geometric fact that satellites are always positioned on orbits, and these orbits may vary in altitude. Conditionally on the orbit process, satellites situated on these orbits are modeled as linear Poisson point processes, thereby forming a Cox point process. For this model, we derive useful statistics, including the distribution of the distance from the typical user to its nearest visible satellite, the outage probability, the Laplace functional of the proposed Cox satellite point process, and the Laplace transform of the interference power from the Cox-distributed satellites under general fading. The derived statistics enable the evaluation of the performance of such LEO satellite communication systems as functions of network parameters., Comment: accepted to IEEE Trans. Veh. Technol

This work develops an analytical framework for downlink low Earth orbit (LEO) or medium Earth orbit (MEO) satellite communications, leveraging tools from stochastic geometry. We propose a tractable approach to the analysis of such satellite communication systems, accounting for the fact that satellites are located on circular orbits. We accurately incorporate this geometric property of LEO or MEO satellite constellations by developing a Cox point process model that jointly produces orbits and satellites on these orbits. Our work contrasts with previous modeling studies that presumed satellite locations to be entirely random, thereby overlooking the fundamental fact that satellites are jointly positioned on orbits. Employing this Cox model, we analyze the network performance experienced by users located on Earth. Specifically, we evaluate the no-satellite probability of the proposed network and the Laplace transform of the interference created by such a network. Using it, we compute its SIR (signal-to-interference) distribution, namely its coverage probability. By presenting fundamental network performance as functions of key parameters, this model allows one to assess the statistical properties of downlink LEO or MEO satellite communications and can thus be used as a system-level design tool to operate and optimize forthcoming complex LEO or MEO satellite networks., Comment: Submitted to IEEE Journal

In vehicle-to-all (V2X) communications, roadside units (RSUs) play an essential role in connecting various network devices. In some cases, users may not be well-served by RSUs due to congestion, attenuation, or interference. In these cases, vehicular relays associated with RSUs can be used to serve those users. This paper uses stochastic geometry to model and analyze a spatially correlated heterogeneous vehicular network where both RSUs and vehicular relays serve network users such as pedestrians or other vehicles. We present an analytical model where the spatial correlation between roads, RSUs, relays, and users is systematically modeled via Cox point processes. Assuming users are associated with either RSUs or relays, we derive the association probability and the coverage probability of the typical user. Then, we derive the user throughput by considering interactions of links unique to the proposed network. This paper gives practical insights into designing spatially correlated vehicular networks assisted by vehicle relays. For instance, we express the network performance such as the user association, SIR coverage probability, and the network throughput as the functions of network key geometric variables. In practice, this helps one to optimize the network so as to achieve ultra reliability or maximum user throughput of a spatially correlated vehicular networks by varying key aspects such as the relay density or the bandwidth for relays., Comment: submitted to IEEE Journal

We develop an analytical framework to examine the line-of-sight (LOS) coverage area in vehicular networks with roadside units (RSU) and vehicle relays. In practical deployment scenarios, RSUs and vehicle relays are spatially correlated and we characterize this by employing Cox point processes to model the locations of RSUs and vehicle relays simultaneously. Leveraging the random blockage model, we model the LOS coverage area as Boolean models on these Cox point processes. The LOS coverage area is then evaluated by its area fraction. We show that relays can increase the area fraction of LOS coverage by nearly 50\% even when RSUs and relays are spatially correlated. By presenting a stochastic geometry model for a vehicular network with RSUs and relays and then by providing a tool to capture its LOS coverage, our work assesses the viability of vehicle relays for modern vehicular networks exploiting LOS coverage., Comment: accepted IEEE Trans. Veh. Technol

This paper presents a novel spatially consistent approach for modeling line-of-sight (LOS) paths in vehicular networks. We use stochastic geometry to model transmitters, obstacles, and receivers located in three parallel lines, respectively. Their geometric interactions are leveraged to characterize the existence of LOS paths. Specifically, the proposed approach focuses on the role of obstacles in blocking one or more LOS paths, which has been overlooked in most statistical models for blockage. Under the proposed framework, we derive the probability that a typical vehicle is in LOS with respect to transmitters with received signal-to-noise ratios greater than a threshold. The proposed framework and LOS coverage analysis are instrumental to the analysis of LOS-critical applications such as positioning or mmWave communications in vehicular networks., Comment: Submitted to IEEE Journal

This paper concerns the performance of vehicle-to-everything (V2X) communications. More precisely, we analyze the broadcast of safety-related V2X communications in cellular networks where base stations and vehicles are assumed to share the same spectrum and vehicles broadcast their safety messages to neighboring users. We model the locations of vehicles as a Poisson line Cox point process and the locations of users as a planar Poisson point process. We assume that users are associated with their closest base stations when there is no vehicle within a certain distance $ \rho $. On the other hand, users located within a distance $ \rho $ from vehicles are associated with the vehicles to receive their safety messages. We quantify the properties of this vehicle-prioritized association using the stochastic geometry framework. We derive the fractions of users that receive safety messages from vehicles. Then, we obtain the expression for the signal-to-interference ratio of the typical user evaluated on each association type. To address the impact of vehicular broadcast on the cellular network, the paper also derives the effective rate offered to the typical user in this setting., Comment: Submitted to IEEE Trans. Wireless Commun

This paper explores an emerging wireless Internet-of-things (IoT) architecture based on unmanned aerial vehicles (UAVs). We consider a network where a fleet of UAVs at a fixed altitude flies on planned trajectories and IoT devices on the ground are scheduled to transmit their data to the UAVs when the latter are nearby. In such a system, the UAVs' motion triggers the uplink transmissions of the IoT devices. As a result, network performance is determined by the geometric and dynamic characteristics of the system. We propose a joint stationary model for UAVs and IoT devices and then evaluate the interference, the coverage probability, and the data rate of the typical UAV. To assess the harvesting capability of the proposed architecture, we derive a formula for the amount of data uploaded from each IoT device to a UAV. We also establish a linear relationship between the UAV coverage and the harvesting capability of the network, which provides insights into the design of the proposed harvesting scheme. In addition, we use our analytical results to numerically show that there exists a trade-off between the uploaded data and the size of the IoT scheduling window. Specifically, for a given UAV and IoT geometry, there exists an optimal scheduling window that maximizes the harvesting capability of the proposed network., Comment: IEEE Trans. Wireless Commun. (short version in Proc. IEEE ISIT)

This paper proposes a framework to analyze an emerging wireless architecture where vehicles collect data from devices. Using stochastic geometry, the devices are modeled by a planar Poisson point process. Independently, roads and vehicles are modeled by a Poisson line process and a Cox point process, respectively. For any given time, a vehicle is assumed to communicate with a roadside device in a disk of radius $ \nu $ centered at the vehicle, which is referred to as the coverage disk. We study the proposed network by analyzing its short-term and long-term behaviors based on its space and time performance metrics, respectively. As short-term analysis, we explicitly derive the signal-to-interference ratio distribution of the typical vehicle and the area spectral efficiency of the proposed network. As long-term analysis, we derive the area fraction of the coverage disks and then compute the latency of the network by deriving the distribution of the minimum waiting time of a typical device to be covered by a disk. Leveraging these properties, we analyze various trade-off relationships and optimize the network utility. We further investigate these trade-offs using comparison with existing cellular networks., Comment: Submitted to IEEE Trans. Wireless Commun

This paper analyzes statistical properties of the Poisson line Cox point process useful in the modeling of vehicular networks. The point process is created by a two-stage construction: a Poisson line process to model road infrastructure and independent Poisson point processes, conditionally on the Poisson lines, to model vehicles on the roads. We derive basic properties of the point process, including the general quadratic position of the points, the nearest distance distribution, the Laplace functional, the densities of facets of the Cox-Voronoi tessellation, and the asymptotic behavior of the typical Voronoi cell under vehicular densification. These properties are closely linked to features that are important in vehicular networks., Comment: accepted to IEEE Transactions on Vehicular Technology

This paper analyzes an emerging architecture of cellular network utilizing both planar base stations uniformly distributed in Euclidean plane and base stations located on roads. An example of this architecture is that where, in addition to conventional planar cellular base stations and users, vehicles also play the role of both base stations and users. A Poisson line process is used to model the road network and, conditionally on the lines, linear Poisson point processes are used to model the vehicles on the roads. The conventional planar base stations and users are modeled by independent planar Poisson point processes. The joint stationarity of the elements in this model allows one to use Palm calculus to investigate statistical properties of such a network. Specifically, this paper discusses two different Palm distributions, with respect to the user point processes depending on its type: planar or vehicular. We derive the distance to the nearest base station, the association of the typical users, and the coverage probability of the typical user in terms of integral formulas. Furthermore, this paper provides a comprehensive characterization of the performance of all possible cellular transmissions in this setting, namely vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I), infrastructure-to-vehicle (I2V), and infrastructure-to-infrastructure (I2I) communications., Comment: Submitted to IEEE Transactions on Communications

We propose a new cellular network model that captures both deterministic and random aspects of base station deployments. Namely, the base station locations are modeled as the superposition of two independent stationary point processes: a random shifted grid with intensity $\lambda_g$ and a Poisson point process (PPP) with intensity $\lambda_p$. Grid and PPP deployments are special cases with $\lambda_p \to 0$ and $\lambda_g \to 0$, with actual deployments in between these two extremes, as we demonstrate with deployment data. Assuming that each user is associated with the base station that provides the strongest average received signal power, we obtain the probability that a typical user is associated with either a grid or PPP base station. Assuming Rayleigh fading channels, we derive the expression for the coverage probability of the typical user, resulting in the following observations. First, the association and the coverage probability of the typical user are fully characterized as functions of intensity ratio $\rho_\lambda = \lambda_p/\lambda_g$. Second, the user association is biased towards the base stations located on a grid. Finally, the proposed model predicts the coverage probability of the actual deployment with great accuracy., Comment: Submitted to IEEE Transactions on Communications