arXiv subjects

Kaushlendra Pandey

Publications and source records attributed to Kaushlendra Pandey.

9 recordsLinked to original sources

arXiv2026

On the Analysis of Platooned Vehicular Networks on Highways

Vehicular platooning refers to coordinated and close movement of vehicular users (VUs) traveling together along a common route segment, offering strategic benefits such as reduced fuel costs, lower emissions, and improved traffic flow. {Highways offer a natural setting for platooning due to extended travel distances, yet their potential remains underexplored, particularly in terms of communication and connectivity. Given that effective platooning relies on robust vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) links, understanding connectivity dynamics on highways is essential.} In this paper, we analyze the dynamics of vehicular platooning on a highway and its impact on the performance of two forms of vehicular communications -- namely V2V and V2I communication -- compared to independent vehicle movement on a highway. The vehicular networks consists of road-side units (RSUs), modeled as a 1D Poisson point process (PPP), to provide the vehicular connectivity to the VUs. VUs are modeled as 1D PPP under the non-platooned traffic scenario (N-PTS) and as a 1D Matern cluster process (MCP) under the platooned traffic scenario (PTS). We evaluate the distribution on the per-RSU load, representing the number of VUs served, for the typical and tagged RSU. Additionally, we derive coverage probability (CP) and rate coverage (RC), which measures the probability of the signal-to-interference-plus-noise ratio (SINR) and achievable rate above a specified threshold at the typical VU along with their meta distribution (MD), providing a deeper understanding of the reliability and variability of these metrics across different spatial distributions of VUs and RSUs. Finally, we validate our theoretical findings through simulations and provide numerical insights into the impact of different traffic patterns on RSU load distribution, CP, and RC performance.

cs.IT↗

arXiv2026

Modeling and Analysis of Sensing Assisted UAV Networks for Urban Vehicular Communications

Urban vehicular networks (VNs) demand seamless connectivity and situational awareness within road-constrained environments, motivating the deployment of unmanned aerial vehicles (UAVs) platforms capable of simultaneously sensing vehicles and establishing communication with them. In this paper, we present a sensing-assisted UAV network that provides connectivity to the vehicles in an urban area. The road network of the urban area is modeled as Manhattan Poisson line process (MPLP), and the random location of vehicles on each road is modeled as one dimensional Poisson point processes (PPPs). UAVs are distributed in the urban area at a fixed altitude and provide connectivity after sensing the vehicles. Their locations are modeled as a two-dimensional homogeneous PPP. Combined with the fixed altitude, this results in a three-dimensional spatial configuration. We incorporate an elevation dependent blockage model and define the sensing radius based on detection probability (DP), showing that it is jointly limited by signal strength and blockage effects. We derive the DP and characterize the typical UAV's sensing region within the reliability requirements. We also derive the Laplace transform (LT) of aggregate interference accounting for directional patterns and sensing-driven activity, and analyze the resulting coverage probability (CP). Finally, we obtain the rate coverage (RC) of sensed vehicles falling within the UAV's sensing zone. Numerical results shows that increasing altitude degrades sensing and coverage performance, whereas RC exhibits a non-monotonic trend, first decreasing and then increasing with altitude.

cs.IT↗

arXiv2025

Target Detection in Clustered Mobile Nanomachine Networks

This work focuses on the development of an analytical framework to study a diffusion-assisted molecular communication-based network of nano-machines (NMs) with a clustered initial deployment to detect a target in a three-dimensional (3D) medium. Leveraging the Poisson cluster process to model the initial locations of clustered NMs, we derive the analytical expression for the target detection probability with respect to time along with relevant bounds. We also investigate a single-cluster scenario. All the derived expressions are validated through extensive particle-based simulations. Furthermore, we analyze the impact of key parameters, such as the mean number of NMs per cluster, the density of the cluster, and the spatial spread, on the detection performance. Our results show that detection probability is greatly influenced by clustering, and different spatial arrangements produce varying performances. The results offer a better understanding of how molecular communication systems should be designed for optimal target detection in nanoscale and biological environments.

cs.IT↗

arXiv2022

Fundamentals of Vehicular Communication Networks with Vehicle Platoons

Vehicular platooning is a promising way to facilitate efficient movement of vehicles with a shared route. Despite its relevance, the interplay of platooning and the communication performance in the resulting vehicular network (VN) is largely unexplored. Inspired by this, we develop a comprehensive approach to statistical modeling and system-level analysis of VNs with platooned traffic. Modeling the network of roads using the by-now well-accepted Poisson line process (PLP), we place vehicles on each road according to an independent Matern cluster process (MCP) that jointly captures randomness in the locations of platoons on the roads and vehicles within each platoon. The resulting triply-stochastic point process is a PLP-driven-Cox process, which we term the PLP-MCP. We first present this new point process's distribution and derive several fundamental properties essential for the resulting VN's analysis. Assuming that the cellular base-stations (BSs) are distributed as a Poisson point process (PPP), we derive the distribution of the loads served by the typical BS and the BS associated with the typical user. In deriving the latter, we also present a new approach to deriving the length distribution of a tagged chord in a Poisson Voronoi tessellation. Using the derived results, we present the rate coverage of the typical user while considering partial loading of the BSs. We also provide a comparative analysis of VNs with and without platooning of traffic.

cs.IT↗

arXiv2020

kth Distance Distributions of n-Dimensional Matérn Cluster Process

In this letter, we derive the CDF (cumulative distribution function) of $k$th contact distance (CD) and nearest neighbor distance (NND) of the $n$-dimensional ($n$-D) Matérn cluster process (MCP). We present a new approach based on the probability generating function (PGF) of the random variable (RV) denoting the number of points in a ball of arbitrary radius to derive its probability mass function (PMF). The proposed method is general and can be used for any point process with known probability generating functional (PGFL). We also validate our analysis via numerical simulations and provide insights using the presented analysis. We also discuss two applications, namely: macro-diversity in cellular networks and caching in D2D networks, to study the impact of clustering on the performance.

cs.IT↗

arXiv2020

Coverage Improvement of Wireless Sensor Networks via Spatial Profile Information

This paper considers a wireless sensor network deployed to sense an environment variable with a known spatial statistical profile. We propose to use the additional information of the spatial profile to improve the sensing range of sensors while allowing some tolerance in their sensing accuracy. We show that the use of this information improves the sensing performance of the total WSN. For this, we first derive analytical expressions for various performance metrics to measure the improvement in the sensing performance of WSN. We then discuss the sensing gains quantitatively using numerical results.

cs.IT↗

arXiv2020

On the Coverage Performance of Boolean-Poisson Cluster Models for Wireless Sensor Networks

In this paper, we consider wireless sensor networks (WSNs) with sensor nodes exhibiting clustering in their deployment. We model the coverage region of such WSNs by Boolean Poisson cluster models (BPCM) where sensors nodes' location is according to a Poisson cluster process (PCP) and each sensor has an independent sensing range around it. We consider two variants of PCP, in particular \matern and Thomas cluster process to form Boolean \matern and Thomas cluster models. We first derive the capacity functional of these models. Using the derived expressions, we compute the sensing probability of an event and compare it with sensing probability of a WSN modeled by a Boolean Poisson model where sensors are deployed according to a Poisson point process. We also derive the power required for each cluster to collect data from all of its sensors for the three considered WSNs. We show that a BPCM WSN has less power requirement in comparison to the Boolean Poisson WSN, but it suffers from lower coverage, leading to a trade-off between per-cluster power requirement and the sensing performance. A cluster process with desired clustering may provide better coverage while maintaining low power requirements.

cs.IT↗

arXiv2019

On the Contact and Nearest-Neighbor Distance Distributions for the n-Dimensional Matern Cluster Process

This letter provides exact characterization of the contact and nearest-neighbor distance distributions for the n dimensional (n-D) Matern cluster process (MCP). We also provide novel upper and lower bounds to these distributions in order to gain useful insights about their behavior. The two and three dimensional versions of these results are directly applicable to the performance analyses of wireless networks modeled as MCP.

cs.IT↗

arXiv2018

Modeling and Analysis of Wildfire Detection using Wireless Sensor Network with Poisson Deployment

In many forest fire incidences, late detection of the fire has lead to severe damages to the forest and human property requiring more resources to gain control over the fire. An early warning and immediate response system can be a promising solution to avoid such massive losses. This paper considers a network consisting of multiple wireless sensors randomly deployed throughout the forest for early prompt detection of fire. We present a framework to model fire propagation in a forest and analyze the performance of considered wireless sensor network in terms of fire detection probability. In particular, this paper models sensor deployment as a Poisson point process (PPP) and models the forest fire as a dynamic event which expands with time. We also present various insights to the system including required sensor density and impact of wind velocity on the detection performance. We show that larger wind velocity may not necessarily imply bad sensing performance or the requirement of a denser deployment.

eess.SP↗