arXiv subjects

Abhishek K. Gupta

Publications and source records attributed to Abhishek K. Gupta.

36 records · Page 2Linked to original sources

arXiv2020

3-D Diffusive Molecular Communication with Two Fully-Absorbing Receivers: Hitting Probability and Performance Analysis

Exact analytical channel models for molecular communication via diffusion (MCvD) systems involving multiple fully absorbing receivers (FARs) in a three-dimensional (3- D) medium are hard to obtain due to the mathematical intractability of corresponding diffusion equations. This work, therefore, consider an MCvD system with two spherical FARs in a 3-D diffusion-limited medium and develop several insights using an approximate analytical expression for the hitting probability of information molecule (IM). Further, based on the hitting probability, a novel approximate closed-form analytical expression for the area under the receiver operating characteristic curve (AUC) is derived to analyze the detection performance at each FAR in the presence of other FAR. Finally, simulation results are presented to validate the analytical results using the particle-based and Monte-Carlo simulations and to yield important insights into the MCvD system performance with two FARs

cs.IT↗

arXiv2020

Detection Probability in a Molecular Communication via Diffusion System with Multiple Fully-absorbing Receivers

In this letter, we consider a 3D molecular communication via diffusion system (MCvDS) with a single point transmitter and multiple fully-absorbing spherical receivers whose centers are distributed as a Poisson point process (PPP) in the medium. We derive the probability that a transmitted molecule hits any of the receivers within time t. We consider both degradable and non-degradable molecules. We verify the analysis using particle-based simulation. The framework can be used for various applications, e.g., to derive event detection probability for systems where the IMs are transmitted to convey the occurrence of a particular event to trigger reactions at receivers or can be used as channel models for such systems.

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

Analysis of Diffusion Based Molecular Communication System with Multiple Transmitters

Due to the limited capabilities of a single bio-nanomachine, complicated tasks can be performed only with the co-operation of multiple bio-nanomachines. In this work, we consider a diffusion-based molecular communication system with a transmitter bio-nanomachine (TBN) communicating with a fully-absorbing spherical receiver bio-nanomachine (RBN) in the presence of other TBNs. The bits transmitted by each of the TBNs are considered as random in each time slot and different for each TBNs in contrary to the past works in literature with deterministic bits, which are the same to all TBNs. The TBNs are modeled using a marked Poisson point process (PPP) with the location of TBNs as points of PPP, and the transmit bits as marks. In this paper, we derive the expected number of molecules observed at the RBN and the bit error probability of the system. We validate our analysis using numerical results and provide various design insights about the system.

cs.IT↗

arXiv2020

Analysis of Diffusion Based Molecular Communication with Multiple Transmitters having Individual Random Information Bits

In this paper, we present an analytical framework to derive the performance of a molecular communication system where a transmitter bio-nano-machine (TBN) is communicating with a fully-absorbing spherical receiver bio-nano-machine (RBN) in a diffusive propagation medium in the presence of other TBNs. We assume that transmit bits at each TBN is random and different than transmit bits at other TBNs. We model the TBNs using a marked Poisson point process (PPP) with their locations as points of PPP and transmit symbols as marks. We consider both inter-symbol interference (ISI) and co-channel interference (CCI). ISI is caused by molecules transmitted in the previous slots while CCI is due to the molecules emitted from other TBNs. We derive the bit error probability of this system by averaging over the distribution of the transmit bits as opposed to the past approaches consisting of conditioning on previous transmit bits and/or assuming the transmit bits of every TBN are the same. Using numerical results, we validate our analysis and provide various design insights about the system, for example, the impact of detection threshold on the system performance. We also show the importance of accurately incorporating the randomness of transmit bits in the analysis.

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↗

arXiv2019

On Hybrid MoSK-CSK Modulation based Molecular Communication: Error Rate Performance Analysis using Stochastic Geometry

Data transmission rate in molecular communication systems can be improved by using multiple transmitters and receivers. In molecular multiple-input multiple-output (MIMO) systems which use only single type of molecules, the performance at the destination is limited by inter-symbol interference (ISI), inter-link interference (ILI) and multi-user interference (MUI). This work proposes a new hybrid modulation for a system with multiple transmitters and receivers which uses different types of molecules to eliminate ILI. Further, to enhance the data rate of the proposed system under ISI and MUI, Mary CSK modulation scheme is used between each transmitter-receiver pair. In this paper, the random locations of transmitters present in the three dimensional (3-D) space are modeled as homogeneous Poisson point process (HPPP). Using stochastic geometry tools, analytical expression is derived for the probability of symbol error for the aforementioned scenario. Finally, the performance of the proposed system is compared using the different existing modulation schemes such as on-off keying (OOK), binary concentration shift keying (BCSK) and quadruple concentration shift keying (QCSK) to develop several important insights.

cs.IT↗

arXiv2019

On Detection of Critical Events in a Finite Forest using Randomly Deployed Wireless Sensors

Ecosystem of a forest suffers from many adverse events such as wild-fire which can occur randomly anywhere in the forest and grows in size with time. This paper aims to analyze performance of a network of randomly deployed wireless sensors for the early detection of these time-critical and time-evolving events in a forest. We consider that the forest lies in a confined space (e.g. a circular region) and the wireless sensors, with fixed sensing range, are deployed within the boundary of forest itself. The sensing area of the network is modeled as a finite Boolean-Poisson model. In this model, the locations of sensors are modeled as a finite homogeneous Poisson Point Process (PPP) and the sensing area of each sensor is assumed to be a finite set. This paper aims to answer questions about the proximity of a typical sensor from a randomly occurred event and the total sensing area covered by sensors. We first derive the distribution of contact distance of a FHPPP and the expression of the capacity functional of a finite Boolean-Poisson model. Using these, we then derive the probability of sensing the event at time t, termed event-sensing probability.

cs.IT↗

arXiv2018

On Socially Optimal Traffic Flow in the Presence of Random Users

Traffic assignment is an integral part of urban city planning. Roads and freeways are constructed to cater to the expected demands of the commuters between different origin-destination pairs with the overall objective of minimising the travel cost. As compared to static traffic assignment problems where the traffic network is fixed over time, a dynamic traffic network is more realistic where the network's cost parameters change over time due to the presence of random congestion. In this paper, we consider a stochastic version of the traffic assignment problem where the central planner is interested in finding an optimal social flow in the presence of random users. These users are random and cannot be controlled by any central directives. We propose a Frank-Wolfe algorithm based stochastic algorithm to determine the socially optimal flow for the stochastic setting in an online manner. Further, simulation results corroborate the efficacy of the proposed algorithm.

eess.SY↗

arXiv2018

On the Spatial Performance of Users in Indoor VLC Networks with Multiple Reflections

In this paper, we present a stochastic geometry based framework to analyze the performance of downlink indoor visible light communication (VLC) networks at a typical receiver while considering reflections from the walls. A typical receiver is a arbitrarily located user in the room and may not necessarily be at the center and hence sees an asymmetric transmitter location process and interference at itself. We first derive the signal-to-interference-plus-noise ratio (SINR) and rate coverage probability for a typical user. We then present a framework to model the impact of wall reflections and extend the analysis to study the performance of VLC network in the presence of wall reflections. We show that the impact of user's location and reflections is significant on the performance of the user.

cs.IT↗

arXiv2018

Modeling Infrastructure Sharing in mmWave Networks with Shared Spectrum Licenses

Competing cellular operators aggressively share infrastructure in many major US markets. If operators also were to share spectrum in next-generation millimeter-wave (mmWave) networks, intra-cellular interference will become correlated with inter-cellular interference. We propose a mathematical framework to model a multi-operator mmWave cellular network with co-located base-stations (BSs). We then characterize the signal-to-interference-plus-noise ratio (SINR) distribution for an arbitrary network and derive its coverage probability. To understand how varying the spatial correlation between different networks affects coverage probability, we derive special results for the two-operator scenario, where we construct the operators' individual networks from a single network via probabilistic coupling. For external validation, we devise a method to quantify and estimate spatial correlation from actual base-station deployments. We compare our two-operator model against an actual macro-cell-dominated network and an actual network primarily comprising distributed-antenna-system (DAS) nodes. Using the actual deployment data to set the parameters of our model, we observe that coverage probabilities for the model and actual deployments not only compare very well to each other, but also match nearly perfectly for the case of the DAS-node-dominated deployment. Another interesting observation is that a network that shares spectrum and infrastructure has a lower rate coverage probability than a network of the same number of BSs that shares neither spectrum nor infrastructure, suggesting that the latter is more suitable for low-rate applications.

cs.IT↗

arXiv2017

Macro diversity in Cellular Networks with Random Blockages

Blocking objects (blockages) between a transmitter and receiver cause wireless communication links to transition from line-of-sight (LOS) to non-line-of-sight (NLOS) propagation, which can greatly reduce the received power, particularly at higher frequencies such as millimeter wave (mmWave). We consider a cellular network in which a mobile user attempts to connect to two or more base stations (BSs) simultaneously, to increase the probability of at least one LOS link, which is a form of macrodiversity. We develop a framework for determining the LOS probability as a function of the number of BSs, when taking into account the correlation between blockages: for example, a single blockage close to the device -- including the user's own body -- could block multiple BSs. We consider the impact of the size of blocking objects on the system reliability probability and show that macrodiversity gains are higher when the blocking objects are small. We also show that the BS density must scale as the square of the blockage density to maintain a given level of reliability.

cs.IT↗

arXiv2016

A Primer on Cellular Network Analysis Using Stochastic Geometry

This tutorial is intended as an accessible but rigorous first reference for someone interested in learning how to model and analyze cellular network performance using stochastic geometry. In particular, we focus on computing the signal-to-interference-plus-noise ratio (SINR) distribution, which can be characterized by the coverage probability (the SINR CCDF) or the outage probability (its CDF). We model base stations (BSs) in the network as a realization of a homogeneous Poisson point process of density $λ$, and compute the SINR for three main cases: the downlink, uplink, and finally the multi-tier downlink, which is characterized by having $k$ tiers of BSs each with a unique density $λ_i$ and transmit power $p_i$. These three baseline results have been extensively extended to many different scenarios, and we conclude with a brief summary of some of those extensions.

cs.IT↗

arXiv2016

Are We Approaching the Fundamental Limits of Wireless Network Densification?

The single most important factor behind the data rate increases experienced by users of wireless networks over the past few decades has been densification, namely adding more base stations and access points and thus getting more spatial reuse of the spectrum. This trend is set to continue into 5G and presumably beyond. However, at some point further densification will no longer be able to provide exponentially increasing data rates. Like the end of Moore's Law, this would have massive implications on the entire technology landscape, which depends ever more heavily on wireless connectivity. When and why will this happen? How might we prolong this from occurring for as long as possible? These are the questions explored in this paper.

cs.IT↗

arXiv2016

On the Feasibility of Sharing Spectrum Licenses in mmWave Cellular Systems

The highly directional and adaptive antennas used in mmWave communication open up the possibility of uncoordinated sharing of spectrum licenses between commercial cellular operators. There are several advantages to sharing including a reduction in license costs and an increase in spectrum utilization. In this paper, we establish the theoretical feasibility of spectrum license sharing among mmWave cellular operators. We consider a heterogeneous multi-operator system containing multiple independent cellular networks, each owned by an operator. We then compute the SINR and rate distribution for downlink mobile users of each network. Using the analysis, we compare systems with fully shared licenses and exclusive licenses for different access rules and explore the trade-offs between system performance and spectrum cost. We show that sharing spectrum licenses increases the per-user rate when antennas have narrow beams and is also favored when there is a low density of users. We also consider a multi-operator system where BSs of all the networks are co-located to show that the simultaneous sharing of spectrum and infrastructure is also feasible. We show that all networks can share licenses with less bandwidth and still achieve the same per-user median rate as if they each had an exclusive license to spectrum with more bandwidth.

cs.IT↗

arXiv2016

Gains of Restricted Secondary Licensing in Millimeter Wave Cellular Systems

Sharing the spectrum among multiple operators seems promising in millimeter wave (mmWave) systems. One explanation is the highly directional transmission in mmWave, which reduces the interference caused by one network on the other networks sharing the same resources. In this paper, we model a mmWave cellular system where an operator that primarily owns an exclusive-use license of a certain band can sell a restricted secondary license of the same band to another operator. This secondary network has a restriction on the maximum interference it can cause to the original network. Using stochastic geometry, we derive expressions for the coverage and rate of both networks, and establish the feasibility of secondary licensing in licensed mmWave bands. To explain economic trade-offs, we consider a revenue-pricing model for both operators in the presence of a central licensing authority. Our results show that the original operator and central network authority can benefit from secondary licensing when the maximum interference threshold is properly adjusted. This means that the original operator and central licensing authority have an incentive to permit a secondary network to restrictively share the spectrum. Our results also illustrate that the spectrum sharing gains increase with narrow beams and when the network densifies.

cs.IT↗

arXiv2015

SINR and Throughput Scaling in Ultradense Urban Cellular Networks

We consider a dense urban cellular network where the base stations (BSs) are stacked vertically as well as extending infinitely in the horizontal plane, resulting in a greater than two dimensional (2D) deployment. Using a dual-slope path loss model that is well supported empirically, we extend recent 2D coverage probability and potential throughput results to 3 dimensions. We prove that the "critical close-in path loss exponent" $α_0$ where SINR eventually decays to zero is equal to the dimensionality $d$, i.e. $α_0 \leq 3$ results in an eventual SINR of 0 in a 3D network. We also show that the potential (i.e. best case) aggregate throughput decays to zero for $α_0 < d/2$. Both of these scaling results also hold for the more realistic case that we term ${3\rm{D}^{+}}$, where there are no BSs below the user, as in a dense urban network with the user on or near the ground.

cs.IT↗

arXiv2014

Downlink Multi-Antenna Heterogeneous Cellular Network with Load Balancing

We model and analyze heterogeneous cellular networks with multiple antenna BSs (multi-antenna HetNets) with K classes or tiers of base stations (BSs), which may differ in terms of transmit power, deployment density, number of transmit antennas, number of users served, transmission scheme, and path loss exponent. We show that the cell selection rules in multi-antenna HetNets may differ significantly from the single-antenna HetNets due to the possible differences in multi-antenna transmission schemes across tiers. While it is challenging to derive exact cell selection rules even for maximizing signal-to-interferenceplus-noise-ratio (SINR) at the receiver, we show that adding an appropriately chosen tier-dependent cell selection bias in the received power yields a close approximation. Assuming arbitrary selection bias for each tier, simple expressions for downlink coverage and rate are derived. For coverage maximization, the required selection bias for each tier is given in closed form. Due to this connection with biasing, multi-antenna HetNets may balance load more naturally across tiers in certain regimes compared to single-antenna HetNets, where a large cell selection bias is often needed to offload traffic to small cells.

cs.IT↗