Interference in Poisson Networks with Isotropically Distributed Nodes

Interference in Poisson Networks with Isotropically Distributed Nodes


Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in network modeling. In this work, interference in networks with nodes distributed according to an isotropic but not necessarily stationary Poisson point process (PPP) are studied. The resulting link performance is precisely characterized as a function of (i) an arbitrary receiver location and of (ii) an arbitrary isotropic shape of the spatial distribution. Closed-form expressions for the first moment and the Laplace transform of the interference are derived for the path loss exponents and , and simple bounds are derived for other cases. The developed model is applied to practical problems in network analysis: for instance, the accuracy loss due to neglecting border effects is shown to be undesirably high within transition regions of certain deployment scenarios. Using a throughput metric not relying on the stationarity of the spatial node distribution, the spatial throughput locally around a given node is characterized.


Stochastic geometry, in particular the theory of point processes, has recently attracted much attention in the field of interference modeling and performance analysis for wireless networks with many uncertainties such as mobile/dynamic user locations and channel fading. In a nutshell, the locations of the nodes are modeled as a realization of a stochastic point process rather than assuming a fixed spatial configuration. Since the emitted signals undergo a distant-dependent path loss, the interference experienced by a given node becomes random. Its statistical properties, moreover, depend on several factors including the law of the spatial distribution of nodes.

1.1Related Work and Motivation

Interference modeling and network analysis using tools from stochastic geometry have become a multi-faceted research field [1]. Early works on interference modeling assumed a stationary PPP for the interferer locations, cf. [1]. Using a similar model, the spatial throughput of decentralized networks with Aloha medium access control (MAC) was analyzed in [3]. Following these works, the node locations have mostly been modeled by stationary point processes which typically leads to location-independent statistical properties of the considered performance quantities, e.g., interference, outage probability or throughput. Among these advances, the transmission capacity framework [5] substantially contributed to a better understanding of the interactions between the basic system parameters of a wireless network. Besides, stationary models with non-homogeneous node deployments, e.g., Poisson-Cluster [10] and Matérn hard-core models [11], were also investigated as such models are well-suited for studying more sophisticated medium access control (MAC) schemes. Treated as general motion-invariant, these models were further analyzed in [15] in a unifying way.

Stationarity of the spatial distribution of nodes is a desirable property since it allows for analytic tractability and, even more important, it represents a key requirement for applying certain performance metrics such as the transmission capacity metric [5]. In practice though, wireless networks exhibit a non-stationary spatial node distribution; for instance, because of a finite network area with boundary regions. Consequently, performance-relevant quantities such as the experienced interference typically vary across the network area, thereby complicating modeling and system design. Besides this simple example, more complex deployments are often found in practice, e.g., wireless sensor networks created by airdrop [21] or spontaneous formation of hot spots [22]. The spatial configuration of such hotspots is typically dictated by user motion and by geometric constraints as illustrated in [23] for the example of a campus-wide Wi-Fi deployment. Furthermore, there is a growing need for cellular operators to better understand not only the temporal variations in user traffic demands but also its spatial dependence; for instance, the optimal interplay between small-cell deployments and Wi-Fi offloading–a promising approach to boost capacity in dense areas–requires carefully pinpointing areas of peak-traffic demands [24] and identifying locations for deployment so to reach the mobile users [25]. Hence, analytic tools for quantifying the network performance while taking into account user mobility as well as hard-to-predict spatial configurations are of eminent importance.

The need for non-stationary models for characterizing more complex node deployments was reported for instance in [26]. The authors discussed techniques that generate non-uniform node distributions for the purpose of efficient network simulations. In [16], a non-stationary and isotropic node distribution was assumed for analyzing multi-antenna receivers in the presence of interference. The analysis showed that the shape of the spatial distribution has a considerable impact on link performance. In [27], a first attempt was made towards analyzing the link performance at an arbitrary receiver location and for an arbitrary isotropic node distribution.

The shortcomings associated with the stationarity assumption are summarized below:

Infiniteness and boundary effects: Stationarity implies that the network consists of infinitely many nodes spread over an infinitely large region. However, the number of nodes as well as the network area is finite in practice. Boundary effects are ignored although they play a critical role in real-world networks because of unequal performance among the nodes in terms of, e.g., local topology, interference-/noise-limited performance, etc. Ensuring the quality-of-service (QoS) level targeted before deployment hence becomes difficult.

Model artifacts for path loss exponent : In the stationary case and with a path loss exponent of , the sum interference is almost surely (a.s.) infinite [5]. More specifically, stationary models lose their accuracy as the path loss exponent tends to since interference then becomes dominated by the infinite number of far nodes.

Lack of local throughput metric: Non-stationary models prevent the use of certain throughput metrics such as the transmission capacity. This is because it is no longer possible to infer the global performance from the local analysis as the local performance is location-dependent in non-stationary deployments.

1.2Contributions and Outcomes

We extend prior work by modeling the node locations by an isotropic PPP, with stationarity being a special case. The network model is explained in detail in Section 2. The contributions are summarized below.

Interference characterization: The first moment and distribution function are studied for both arbitrary and Rayleigh fading channels. In the case of arbitrary fading, we derive in closed-form the exact first moment as a function of the spatial shape of the node distribution and of the arbitrary receiver location for the path loss exponents and in Section 3.1. Using these results, an upper bound on the tail probability of the interference is derived. A corresponding lower bound that is not limited to the above values of is also presented for suitable spatial shapes. In Section 3.2, we derive the Laplace transform of the interference for the Rayleigh fading model. We also address the case , which eluded a meaningful analysis in the stationary model. One important insight is that for , one can find situations in which a.s. infinitely many nodes contribute to the interference while the interference remains finite a.s. This result sharpens prior statements about the nature of the interference for and suggests that there exists a transition between sparse and dense networks.

Outage probability and model accuracy: The location-dependent outage probability is characterized in Section 4.1 as a function of the spatial shape. We demonstrate the use of the developed model in Section 4.2 by comparing it to a stationary model that uses a local approximation capturing the non-homogeneity in the spatial nodes distribution. We show that, depending on the spatial shape in question, large approximation errors are avoided by the developed model, particularly in transition areas where boundary effects come into play.

Applications: We propose a metric that is capable of quantifying the local throughput in non-stationary networks in Section 5 and demonstrate through an example how this metric can be used. In this example, we refine an existing result on code division multiple access (CDMA) systems in decentralized networks for the case . We also show how the model accuracy for carrier-sense based MACs in decentralized networks can be significantly increased by means of the developed model.


Sans-serif-style letters () represent random variables while serif-style letters () represent deterministic variables or constants. The imaginary unit is given by and denotes the real part of a complex-valued number. We define by and a disc and a circle, respectively, centered at with radius . The origin is denoted by .

2Mathematical Model

We consider a packet-based wireless network with identically-equipped nodes isotropically distributed in . The nodes are assumed to be slot-synchronized. In a randomly chosen slot, some nodes wish to transmit a packet. We assume that the locations of these transmitters follow an isotropic PPP on with intensity (equivalently, density) being defined on . Throughout this work we will denote by to the random location of the -th node as well as to the -th node itself. Due to isotropy of , is rotation-invariant [28] and depends solely on the distance to the origin, i.e., for all .1 For notational convenience, we define . The next definition is a consequence of the fact that can be described as the resulting intensity after location-dependent thinning of a stationary PPP of some constant intensity [11].

We assume that each transmitter has an intended receiver located at fixed distance . The fixed distance assumption, which can be seen as a target transmission distance dictated by the network protocol, is commonly accepted, see for example [5]. In order to measure the (spatially-averaged) link performance in the network we define a reference link, cf. [7]; the reference link consists of a reference receiver placed at an arbitrary location and of an associated reference transmitter placed at , where lies somewhere on the circle . Note that neither the receiver nor the transmitter are part of the point process . By the Slivnyak-Mecke Theorem [28], the statistics of are not affected by the addition of the reference link.

We consider a path loss plus block-fading channel with independent and identically distributed (i.i.d.) fading coefficients. The power path loss between two locations is given by the path loss function with path loss exponent , where ensures boundedness of . The power fading coefficient between a transmitter at and the reference receiver is given by , where for all . When appropriate we will drop the index in .

Figure 1: System model: The reference receiver is located at y_{0} with distance \|y_{0}\| to the origin. The associated reference transmitter is located d units away from y_{0} at location x_{0}. Black dots represent interferers with random locations \mathsf{x}_{1},\mathsf{x}_{2},\ldots. Shape function F(r) characterizes density of interferer set \Phi over distance r to the origin.
Figure 1: System model: The reference receiver is located at with distance to the origin. The associated reference transmitter is located units away from at location . Black dots represent interferers with random locations . Shape function characterizes density of interferer set over distance to the origin.

We assume that all nodes transmit with the same fixed transmit power and at a common information rate. The sum interference power at the reference receiver is then given by

Treating interference as white noise, the instantaneous signal-to-interference-plus-noise ratio at the reference receiver is given by

where is the average signal-to-noise ratio. We assume that the nodes employ strong channel coding such that the outage event is a steep function of the . Focusing on the case where explicit transmitter coordination as well as CSI feedback is not possible, the outage probability is a useful metric for characterizing the link performance.

2.1Spatial shapes chosen for illustrations

We next introduce four exemplary spatial shapes used for illustrations and numerical evaluations. They are chosen such to roughly characterize typical scenarios in wireless networks and to help increasing the reader’s intuition about the results. An exact validation of the chosen spatial models through comparison with real-world deployments is outside the scope of this paper. The spatial shapes are depicted in Figure 2.

  • Scenario a), finite network: This scenario reflects the basic property all practical networks share: the network area is finite, or equivalently, the node density tends to zero for sufficiently large distances to the network center. It is assumed that the density first remains constant over a wide range as in the stationary case. At the network boundary the density then starts to decay rapidly until it becomes zero.

  • Scenario b), urban with hotspot: In urban scenarios there may sometimes exist small areas with very high data traffic, i.e., communications hotspots. They are typically found in commercial areas or other public places, comprising many densely–and sometimes dynamically–deployed wireless architectures [29]. We model such a hotspot scenario by “adding a plateau of density” around the origin on top of an already existing level of density corresponding to the urban deployment. This level then decays to zero with increasing distance to the origin to reflect finiteness of the network.

  • Scenario c), scattered decentralized network: There are certain types of applications that preclude a detailed network layout for the reason of hostile environments or limited geographic access. For instance, large sensor networks are sometimes created by airdrop which results in a highly scattered spatial distribution of devices. We model such a behavior by an exponentially decreasing density around the origin.

  • Scenario d), carrier sensing in decentralized networks: This scenario is found in decentralized networks with transmitters employing carrier sensing to avoid excessive interference; suppose a transmitter (here located in the origin) is granted access to the medium. Consequently, other potential transmitters directly surrounding this transmitter defer their transmission as they sense the medium as busy, while other potential transmitters farther away sense the medium as free and therefore start to transmit, cf. Section 5.2 for more details.

Figure 2: The four exemplary spatial shapes considered in this work. Scenario a) (finite network), Scenario b) (urban with hotspot), Scenario c) (scattered decentralized network) and Scenario d) (carrier sensing in decentralized networks).
Figure 2: The four exemplary spatial shapes considered in this work. Scenario a) (finite network), Scenario b) (urban with hotspot), Scenario c) (scattered decentralized network) and Scenario d) (carrier sensing in decentralized networks).

3Interference Analysis

We now study the interference statistics at the reference receiver . The analysis first focuses on the case of an arbitrary fading distribution. We derive the first moment of the interference and then use bounding techniques such as those used in [5] to characterize the interference distribution. For the Rayleigh model, we then derive the Laplace transform of the interference distribution.

3.1Arbitrary Fading Model

First Moment of the Interference

The first moment of the interference measured at the reference receiver can in general be obtained by

Obviously, one would have to know the distribution of , which unfortunately is known in closed-form only for a few cases of stationary point processes [13]. A remedy to this problem is given by the Campbell Theorem [28], which allows us to derive the first result:

A proof is given in Appendix Section 8. The condition ~ for some is necessary for to exist. The function in ( ?) has an interesting interpretation: it can be seen as the interference-driving function as it determines the interference up to a scaling factor. Additionally, the first term in ( ?) can be interpreted as the interference field associated with the origin , while the second term effectively adds up the interference according to .

Glancing at the second term in ( ?), we note:

Corollary ? states that the integral in ( ?) can be seen as an averaging of the interference with respect to a random distance . Such a representation may be appropriate when analyzing networks with a priori unknown or fast-varying spatial configurations, for which a CDF is then used to model their spatial shape.

The intuition behind Corollary ? is that, although the expected number of nodes contributing to the interference is unbounded, the network remains sufficiently sparse such that the first moment of the interference remains bounded. Note that for a PPP, if the expected number of interferers is unbounded, this implies that the number of interferers is a.s. infinite which can be verified by studying the Laplace transform of the PPP [28]. Applying the Markov Inequality [31], this in turn means that the number of nodes is a.s. infinite while the interference remains a.s. finite. This particular finding is somewhat remarkable since it rearranges the commonly-accepted perception, stating that whenever and the number of interferers is a.s. infinite, the interference is a.s. infinite as well [13]. This perception indeed holds for stationary point processes but does not hold in general for non-stationary point processes, as demonstrated by Corollary ?.

A proof is given in Appendix Section 8. Theorem ? shows that whenever decays at most logarithmically, the interference is a.s. infinite. In particular, this includes the stationary case (since ) which is consistent with the literature [13]. Combining Corollary ? and Theorem ?, we observe that for asymptotically decaying there exists a transition between sparse and dense networks. This transition determines whether or not the interference is a.s. finite in a non-stationary Poisson network with a.s. infinite number of interferers.

We now characterize the first moment of the interference for the case .

A proof is given in Appendix Section 8. The term in ( ?) can be again interpreted as the interference-driving function.

Bounds on the Interference Distribution

We next treat the problem of bounding the tail of . A simple upper bound can be obtained using Markov’s inequality in combination with Theorem ? and Theorem ?. For the construction of a lower bound, we first recall the definition of subharmonic functions.

If is convex in a certain (one-dimensional) region, then the intensity is subharmonic on the corresponding (two-dimensional) region. Such a behavior may be often found at the network boundary, e.g., Scenario a) and b), or when the shape function exhibits a tail, e.g., Scenario c) and d). In this case a lower bound on the tail probability can be derived:

A proof is given in Appendix Section 8. Note that subharmonicity includes the case of harmononicity. The construction of the lower bound in Theorem ? basically builds on the so-called “dominant interferer” phenomenon introduced in [7], where it was also reported that the resulting bound is fairly tight. However, in our case the tightness of ( ?) strongly depends on the second derivative of and may not be guaranteed.

The restriction is necessary to allow the closest interferer to be dominant, otherwise this bounding technique would yield the trivial lower bound .

Using the Markov Inequality [31], we obtain the simple upper bound

for the cases and , where and are given by ( ?) and ( ?), respectively.

3.2Rayleigh Fading Model

For the commonly-used Rayleigh fading model, it was demonstrated in [4] that the Laplace transform of the interference is useful for computing outage probabilities. We therefore derive the Laplace transform of , i.e., next for arbitrary and . Similar to Section 3.1, we focus again on and .

A proof is given in Appendix Section 8. Note that for and ~ for every , we have that for all . This in turn implies a.s. which is consistent with Theorem ?.

4Outage Probability and Model Accuracy

In this section, the outage probability is characterized for the underlying setting and the model accuracy is studied.

4.1Outage Probability

For arbitrary fading the bounds on the tail probability of can be used to bound the outage probability, see for example [7]. In the sequel, we will focus on the Rayleigh fading case and discuss the impact of the spatial shape on the resulting performance.

Figure 3: Outage probability \mathtt{P}_{\text{\textnormal{o}}}(y_{0}) vs. \|y_{0}\|. Parameters were d=10, \beta=0.5, c=1, \lambda=0.001. The spatial shape function F(r) was chosen according to scenario a). Marks represent simulation results.
Figure 3: Outage probability vs. . Parameters were , , , . The spatial shape function was chosen according to scenario a). Marks represent simulation results.

Corollary ? now allows for measuring the exact outage probability at an arbitrary location and for an arbitrary spatial shape function . Figure 3 shows vs. for and . The spatial shape function was chosen according to scenario a). In the noise-free case () the outage probability decreases monotonically with increasing distance to the origin. Furthermore, we observe that for the outage probability is higher and its slope is less steep than it is for . This is because for the individual interference contributions decay more slowly over distance than they do for . As a result, the interference is no longer dominated by only a few nearby interferers but it is determined by the large number of nodes nodes, including those relatively far away from . When receiver noise is considered ( dB) the behavior of changes considerably: while is on the same order as in the noise-free case around the center of the network, both curves converge to a constant outage probability level as the reference receiver eaves the center of the network. In fact, in this boundary region outage is primarily due to bad fades rather than to interference, thus rendering the performance noise-limited rather than interference-limited. This transition–from the interference-limited to the noise-limited regime–can be precisely tracked owing to the developed model; for instance, Figure 2 suggests that the noise-limited regime commences somewhere around , while Figure 3 reveals that this is not true at least for ( for the reason explained above.

4.2Exact vs. Approximate Model

Up to this point, it is not yet very clear how much can be gained by the interference model derived in this work. In order to quantify the gains, we compare our model to a simpler one that approximates the non-stationarity-property of the interference locally around the reference receiver . In this simpler model, the interference field at is assumed to originate from a stationary PPP having constant intensity ; in other words, the network-wide spatial distribution of interferers is approximated locally by the density at location .

[c][c] [c][c] [c][c] [c][c]a) [c][c]b) [c][c]c) [c][c]d)

(a) Log-divergence \gamma(y_{0}) vs. \|y_{0}\| for different shape functions. (b) Relative approximation error vs. \|y_{0}\| for different shape functions and \lambda=10^{-3}. Parameters are \alpha=4, c=0, d=10 and \beta=1.
(a) Log-divergence \gamma(y_{0}) vs. \|y_{0}\| for different shape functions. (b) Relative approximation error vs. \|y_{0}\| for different shape functions and \lambda=10^{-3}. Parameters are \alpha=4, c=0, d=10 and \beta=1.
(a) Log-divergence vs. for different shape functions. (b) Relative approximation error vs. for different shape functions and . Parameters are , , and .

For the stationary case the outage probability for Rayleigh fading is well-known [3]. With the above approximation the approximate outage probability at is then given by

The intuition behind (Equation 3) is that the exact outage probability is approximated by taking the outage probability expression corresponding to the stationary case and modulating the intensity by the spatial shape function at . To measure the difference between and we define the following metric.

The log-divergence quantifies the ratio of the exact and approximate success probability () on the logarithmic scale for arbitrary . The normalization by is necessary to remove the dependency on so to measure the divergence resulting from the spatial shape only. For large positive the approximation overestimates the true outage probability, while for large negative outage probability is underestimated. The approximation is accurate whenever is small. The log-divergence can be computed using Corollary ?.

Fig. ? shows the log-divergence vs. for the shape functions introduced in Section 2.1. It can be seen that the log-divergence exhibits an oscillatory behavior that depends on the degree of variability of . For example, in scenario a) and c) changes comparably slow, and thus the corresponding log-divergence shows only weak oscillations. The log-divergence for scenario a) remains low () over a wide range which suggests that the local approximation works well in this case. As for scenario c), however, the log-divergence is large around the origin which is due to the fact that the outage probability is highly overestimated as the (exponential) decay of to the right-hand side is neglected by the approximation. A similar effect can be observed for scenario d): the outage probability is highly underestimated around the origin because the increasing density to the right-hand side is neglected. The log-divergence for scenario b) exhibits rich oscillations due to a stronger varying shape function. As can be seen, these oscillations are high particularly in the transition region ().

To understand the impact of the log-divergence on outage probability, the relative error

is shown in Fig. ? for the example . Fig. ? underlines the observations made in Fig. ?: the approximation works well for scenario a) while for the other three scenarios the approximation is relatively loose. Especially for the scenarios b) and d), the relative error is considerably high over a wide range (between 1% and 10% around the network center for scenario c)). For scenario b) the relative error is approximately 10% around the density mid-level. In case of scenario d) the approximation completely fails around the origin.

5Applications and Examples

In this section, the developed model is applied to problems in network modeling with non-stationary spatial node distributions.

5.1Local Transmission Capacity

As argued in Section 1, the transmission capacity metric cannot be applied to networks with non-stationary spatial node distributions. Based on the developed model, the definition of the transmission capacity can however be extended to account for non-stationarity and location dependency.

Since the local transmission capacity accounts for the spatial shape, this metric allows throughput bottlenecks to be spatially tracked and properly engineered, e.g., by balancing QoS among nodes irrespective of their location. For isotropic node distributions, in particular, the local transmission capacity depends on and can be computed/bounded by algebraic manipulations of the outage probability expressions derived in the previous sections.

Example: FH-CDMA vs. DS-CDMA in decentralized networks: In [7] it was shown that in the stationary PPP model, the transmission capacity gain of frequency-hopping (FH)-CDMA compared to direct-sequence (DS)-CDMA scales as , where is the processing gain. For very small path loss exponents () this result suggests that the gains of FH-CDMA vanish irrespective of the processing gain . This observation, however, results from the stationarity assumption not being able to correctly capture the case . The next result rearranges this scaling result for the case for Rayleigh fading and the reference receiver located in the origin.

A proof is given in Appendix Section 8. Surprisingly, this result shows that the gains of FH-CDMA over DS-CDMA do not vanish for (as was predicted by [7]), but they scale with which re-enforces the superiority of FH-CDMA over DS-CDMA in terms of transmission capacity.

5.2Interference in Networks with Transmitter-Inhibition

In order to study decentralized networks with inhibition mechanisms such as carrier-sense medium access (CSMA) or local frequency division multiple access (FDMA) while ensuring analytic tractability, methods based on non-homogeneous Poisson approximation have been proposed for stationary models [18]. When such protocols are transmitter-initiated, e.g., transmitter sensing for CSMA, the resulting spatial distribution of interferers becomes non-homogeneous but remains isotropic around the inhibiting transmitter since potential transmitters around the inhibiting transmitter are kept silent while others located farther away are likely to transmit. In contrast, the interference field at the associated receiver is not isotropic. To overcome this intractability, the receiver is assumed to be co-located with the inhibiting transmitter, thereby virtually rendering the interference field around the receiver isotropic at the cost of losing model accuracy. This loss depends on the distance between the inhibiting transmitter and the associated receiver. Using the developed model, we can now evaluate the accuracy loss resulting from assuming that transmitter and receiver are co-located for this CSMA modeling technique. We briefly summarize the basic ideas of this modeling technique and refer to [18] for further details.

Non-homogenous Poisson approximation for CSMA networks: Let the potential interferers be initially distributed according to a stationary PPP of density . Assume the that the reference transmitter and the reference receiver are located at and , respectively, and separated by . The inhibition mechanism is modeled in three steps: 1) The large-scale density of active interferers is derived using a Matérn-type 2 model [28], which captures the inhibition effect on a “macroscopic” level. The large-scale density is then given by

where is the sensing threshold. We then condition on the fact that is granted access to the channel and we are now seeking the statistical characterization of the interferers around after this conditioning. 2) This is where the non-homogeneous Poisson approximation comes into play, yielding a “small-scale” density

modeling the density of interferers around the reference transmitter . The term can be seen as the probability that an interferer at distance to does not sense the ongoing transmission of . The behavior of can be described by the spatial shape function of scenario d), cf. Figure 2. 3) The density in (Equation 5) is then used to describe the interference around the reference receiver , although it reflects the interference experienced by the reference transmitter at . This simplification step increases analytic tractability at the cost of losing accuracy. The level of accuracy loss resulting from step 3) is next studied for the Rayleigh fading model with and . We use the same notion as in (Equation 4) to measure the relative accuracy loss as a function of , i.e.,

Figure 4: (a) Relative accuracy loss \delta(d) vs. transmission distance d for different \beta. Parameters are \alpha=4, c=0, \lambda=10^{-3} and \Delta=-50 dB.
Figure 4: (a) Relative accuracy loss vs. transmission distance for different . Parameters are , , and dB.

where the second argument in now highlights the dependence on . Figure 4 shows the accuracy loss vs. for different and dB. The density of potential transmitters is . It can be seen that depending on the value of , significant errors can occur. Interestingly, the relative accuracy loss decreases with which is due to an increased outage correlation at the locations and . The error remains small for small , i.e., short-range communications, for the same reason as above. For very large , tends to zero which results from both and tending to zero.


We extended prior work on interference modeling for wireless networks with isotropic but not necessarily stationary spatial distribution of nodes. The interference statistics and the outage probability were analyzed as a function of (i) an arbitrary receiver location inside the network and (ii) an arbitrary but isotropic node distribution. For the path loss exponents and closed-form expressions were obtained while bounds were derived for other cases. The developed model led to some interesting insights that could not have been revealed previously due to limiting the analysis to stationary models only. The usefulness of the results was discussed and demonstrated through examples in network analysis related to outage probability, local throughput characterization and carrier-sensing mechanisms. It was found that the developed model increases model accuracy significantly and provides an adequate tool to describe location-depended performance in networks with practical node distribution.

7Integral Identities


8.1Proof of Theorem

We want to compute the expectation

where the expectation is with respect to the interferer locations and the channel gains . Since the expectation operator linear, we can compute the expectation with respect to all first, i.e., . Applying the Campbell Theorem, yields

Changing to polar coordinates and exploiting the isotropy property, we can rewrite (Equation 7) as

We then apply Identity ? to the inner integral of (Equation 8) to obtain

Finally using product integration and applying Identity ? to (Equation 9) and verifying the convergence of the upper limit using the constraint ~ for some , yields the result.

8.2Proof of Theorem

To prove that is a.s. infinite, we analyze its Laplace transform and check if it is zero for all . In the PPP case, the Laplace transform of the interference field is given by [11]

For (Equation 10) to become zero, the integral must not converge. We write

where (a) follows from the inequality for [36]. Inserting the path loss function into the right-hand side of (Equation 11) yields

At the upper limit of the inner integral the integrand behaves as . So, the condition , where , is sufficient for the divergence of the integral. Because the Laplace transform of becomes zero in this case, this concludes the proof.

8.3Proof of Theorem

The proof is analogous to the proof of Theorem ?, except for the integration part. Here, the integral Identity ? is used instead. We further exploit the fact that to ensure convergence of the integrals.

Figure 5: Schematic illustration of the proof of Theorem . Shaded area around y_{0} represents the largest disc contained in the subharmonic region G.
Figure 5: Schematic illustration of the proof of Theorem . Shaded area around represents the largest disc contained in the subharmonic region .

8.4Proof of Theorem

We follow the idea of dominant interferers which was introduced in [7] to bound the tail probability : let denote the set of all interferers, where each one taken by itself already results in the event . Clearly,

where the set is denotes the elements outside on the same domain, i.e., . Note that both sums in (Equation 12) are non-negative. Hence, we can now write

where (a) follows from removing the “non-dominant” part in (Equation 12), (b) follows from the definition of and (c) is a consequence of being Poisson distributed with mean . Using [11], in (Equation 13) can be computed as

We now translate by the vector to obtain a -centric coordinate system, cf. Figure 5. After switching to polar coordinates we obtain

We now exploit the fact that is subharmonic around in a region . Let denote the maximal radius for which is contained in . Then, (Equation 14) can be bounded as

where (a) follows from limiting the upper integration limit to . Inequality (b) is a consequence of subharmonicity [37], and (c) follows from Definition 1. Inserting (Equation 15) in (Equation 13) yields the result.

8.5Proof of Theorem

We write

where (a) follows from algebraic manipulations and the i.i.d. property of the . (b) follows from the probability generating functional and the Laplace functional of a PPP [11]. After noting that for exponentially distributed , the integral is computed using Identity ? and Identity ? for and Identity ? for .

Note that (a) in the proof holds for general point processes and some approximation techniques for computing the right-hand side already exist [38]. The (b) part is for PPPs only.

8.6Proof of Corollary

Solving ( ?) for and multiplying by yields the local transmission capacity

after substituting . We are interested in the case . Using Identity 2 (case ) we find that

Assuming that nodes employ pseudo-noise sequences, FH effectively thins out the point process of interferers by (interference avoidance, ), while DS reduces the interference by a factor of (interference averaging, ), cf. [7]. Hence, using (Equation 16) and (Equation 17) the ratio can be written as

where (a) follows from ( ?) and Remark ? and (b) follows from algebraic manipulations. Now we show that the integral in (Equation 18) is finite. Assuming (which is reasonable in practical networks), we note that the integrand has no singular values. For the logarithm becomes zero and so does the integral. Since for all , we therefore analyze the convergence of the integral

Hence, the integral in (Equation 18) is finite.


  1. In a very few situations, we will switch between Cartesian coordinates () and the corresponding polar coordinates () when appropriate. We do not expect any confusion thereof.


  1. E. Sousa, “Performance of a spread spectrum packet radio network link in a Poisson field of interferers,” IEEE Trans. on Inf. Theory, vol. 38, no. 6, pp. 1743 –1754, Nov. 1992.
  2. J. Ilow and D. Hatzinakos, “Analytic alpha-stable noise modeling in a Poisson field of interferers or scatterers,” IEEE Trans. on Signal Process., vol. 46, no. 6, pp. 1601 –1611, Jun. 1998.
  3. F. Baccelli, B. Błaszczyszyn, and P. Mühlethaler, “A spatial reuse Aloha MAC protocol for multihop wireless mobile networks,” in Proc. of Annual Conf. on Communication, Allerton, September 2003.
  4. F. Baccelli, B. Blaszczyszyn, and P. Muhlethaler, “An aloha protocol for multihop mobile wireless networks,” IEEE Trans. on Inf. Theory, vol. 52, no. 2, pp. 421–436, 2006.
  5. S. Weber, J. Andrews, and N. Jindal, “An overview of the transmission capacity of wireless networks,” IEEE Trans. on Commun., vol. 58, no. 12, pp. 3593 –3604, Dec. 2010.
  6. J. Andrews et al., “A primer on spatial modeling and analysis in wireless networks,” IEEE Commun. Magazine, vol. 48, no. 11, pp. 156 –163, Nov. 2010.
  7. S. Weber, X. Yang, J. Andrews, and G. de Veciana, “Transmission capacity of wireless ad hoc networks with outage constraints,” IEEE Trans. on Inf. Theory, vol. 51, no. 12, pp. 4091 –4102, Aug. 2005.
  8. J. Andrews, S. Weber, and M. Haenggi, “Ad hoc networks: To spread or not to spread,” IEEE Commun. Magazine, vol. 45, no. 12, pp. 84 –91, Dec. 2007.
  9. S. Weber, J. Andrews, X. Yang, and G. de Veciana, “Transmission capacity of wireless ad hoc networks with successive interference cancellation,” IEEE Trans. on Inf. Theory, vol. 53, no. 8, pp. 2799 –2814, Aug. 2007.
  10. R. Ganti and M. Haenggi, “Interference and outage in clustered wireless ad hoc networks,” IEEE Trans. on Inf. Theory, vol. 55, no. 9, pp. 4067 –4086, Sep. 2009.
  11. F. Baccelli and B. Blaszczyszyn, “Stochastic geometry and wireless networks, volume 1: Theory,” Foundations and Trends in Networking, vol. 3, no. 3-4, pp. 249–449, 2009.
  12. ——, “Stochastic geometry and wireless networks, volume 2: Applications,” Foundations and Trends in Networking, vol. 4, no. 1-2, pp. 1–312, 2009.
  13. M. Haenggi and R. K. Ganti, “Interference in large wireless networks,” Found. Trends Netw., vol. 3, pp. 127–248, Feb. 2009.
  14. R. Giacomelli, R. Ganti, and M. Haenggi, “Outage probability of general ad hoc networks in the high-reliability regime,” IEEE/ACM Trans. on Networking, vol. 19, no. 4, pp. 1151 –1163, Aug. 2011.
  15. R. Ganti, J. Andrews, and M. Haenggi, “High-sir transmission capacity of wireless networks with general fading and node distribution,” IEEE Trans. on Inf. Theory, vol. 57, no. 5, pp. 3100 –3116, May 2011.
  16. S. Govindasamy and D. Bliss, “On the spectral efficiency of links with multi-antenna receivers in non-homogenous wireless networks,” in IEEE Int. Conf. Commun. (ICC), Jun. 2011.
  17. B. Błaszczyszyn and M. Karray, “Linear-regression estimation of the propagation-loss parameters using mobiles’ measurements in wireless cellular network,” in Proc. of IEEE WiOpt, Paderborn, 2012.
  18. A. Hunter, R. Ganti, and J. Andrews, “Transmission capacity of multi-antenna ad hoc networks with csma,” in Forty Fourth Asilomar Conf. on Signals, Systems and Computers (ASILOMAR), Nov. 2010.
  19. R. Tanbourgi, J. Elsner, H. Jäkel, and F. Jondral, “Adaptive frequency hopping in ad hoc networks with Rayleigh fading and imperfect sensing,” IEEE Wireless Commun. Lett., Jun. 2012.
  20. ——, “Lower bounds on the success probability for ad hoc networks with local FDMA scheduling,” in Workshop on Spatial Stochastic Models for Wireless Networks (SpaSWiN), May 2011.
  21. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,” IEEE Commun. Magazine, pp. 102–114, Aug. 2002.
  22. L. Feeney, B. Ahlgren, and A. Westerlund, “Spontaneous networking: an application oriented approach to ad hoc networking,” IEEE Commun. Magazine, vol. 39, no. 6, pp. 176 –181, Jun. 2001.
  23. D. Brehm, “Museum exhibit shows this wireless campus never sleeps,” MIT Tech talk, December 2005, available online at:
  24. “Understanding today’s smartphone user: Demystifying data usage trends on cellular & wi-fi networks,” Mobidia, Informa Telcoms & Media, white paper, 2012.
  25. “Dealing with density: The move to small-cell architectures,” Ruckus Wireless, white paper, 2012.
  26. =2plus 43minus 4 D. Avidor and S. Mukherjee, “Hidden issues in the simulation of fixed wireless systems,” Wirel. Netw., vol. 7, no. 2, pp. 187–200, Mar. 2001. [Online]. Available: =0pt
  27. R. Tanbourgi, H. Jäkel, L. Chaichenets, and F. Jondral, “Interference and throughput in aloha-based ad hoc networks with isotropic node distribution,” in IEEE Int. Symposium on Inf. Theory (ISIT), Jul. 2012, pp. 616 –620.
  28. D. Stoyan, W. Kendall, and J. Mecke, Stochastic geometry and its applications, 2nd ed.1em plus 0.5em minus 0.4emWiley, 1995.
  29. J. Andrews et al., “Femtocells: Past, present, and future,” IEEE J. Sel. Areas Commun., vol. 30, no. 3, pp. 497–508, Apr. 2012.
  30. M. Haenggi, Stochastic Geometry for Wireless Networks.1em plus 0.5em minus 0.4emCambridge University Press, 2012.
  31. A. Gut, Probability: a graduate course, ser. Springer Texts in Statistics.1em plus 0.5em minus 0.4emNew York, NY: Springer, 2005.
  32. S. G. Krantz, Function theory of several complex variables, 2nd ed., ser. the Wadsworth & Brooks/Cole mathematics series.1em plus 0.5em minus 0.4emPacific Grove, Calif.: Wadsworth & Brooks, 1992.
  33. D. Tse and P. Viswanath, Fundamentals of wireless communication. 1em plus 0.5em minus 0.4emNew York, NY, USA: Cambridge University Press, 2005.
  34. M. Feuerstein, K. Blackard, T. Rappaport, S. Seidel, and H. Xia, “Path loss, delay spread, and outage models as functions of antenna height for microcellular system design,” IEEE Trans. on Veh. Technol., vol. 43, no. 3, pp. 487 –498, Aug. 1994.
  35. I. S. Gradshteyn and I. M. Ryzhik, Table of integrals, series, and products, 7th ed.1em plus 0.5em minus 0.4emElsevier/Academic Press, Amsterdam, 2007.
  36. F. W. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, NIST Handbook of Mathematical Functions, 1st ed.1em plus 0.5em minus 0.4em New York, NY, USA: Cambridge University Press, 2010.
  37. J. B. Conway, Functions of one complex variable, 2nd ed., ser. Graduate texts in mathematics ; 11.1em plus 0.5em minus 0.4emHeidelberg: Springer, 1986, vol. 2, with 30 ill.
  38. R. Ganti and J. Andrews, “A new method for computing the transmission capacity of non-Poisson wireless networks,” in IEEE Int. Symposium on Inf. Theory (ISIT), Jul. 2010.
This is a comment super asjknd jkasnjk adsnkj
The feedback cannot be empty
Comments 0
The feedback cannot be empty
Add comment

You’re adding your first comment!
How to quickly get a good reply:
  • Offer a constructive comment on the author work.
  • Add helpful links to code implementation or project page.