Outage Probability of General Ad Hoc Networks in the High-Reliability Regime

Giacomelli, Riccardo; Ganti, Radha Krishna; Haenggi, Martin

doi:10.1109/tnet.2010.2100099

Cited by 58 publications

(55 citation statements)

References 20 publications

(41 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, characterizing the exact interference statistics is still very hard and has remained an open problem. As a response to this, subsequent work in [20] and [21] suggested an alternative approximation for the performance of CSMA nodes which is accurate for asymptotically sparse networks. Models capturing carrier sense mechanism have also been successfully used to study cognitive radio networking scenarios in [22]- [24].…”

Section: B Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols

Kim

Baccelli

Veciana

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We investigate the benefits of channel-aware (opportunistic) scheduling of transmissions in ad hoc networks. The key challenge in optimizing the performance of such systems is finding a good compromise among three interdependent quantities: 1) the density of scheduled transmitters; 2) the quality of transmissions; and 3) the long term fairness among nodes. We propose two new channel-aware slotted CSMA protocols opportunistic CSMA and quantile-based CSMA (QT-CSMA) and develop new stochastic geometric models to quantify their performance in terms of spatial reuse and spatial fairness. When properly optimized, these protocols offer substantial improvements in performance relative to CSMA-particularly, when the density of nodes is moderate to high. In addition, we show that a simple version of QT-CSMA can achieve robust performance gains without requiring careful parameter optimization. The quantitative results in this paper suggest that channel-aware scheduling in ad hoc networks can provide substantial benefits which might far outweigh the associated implementation overheads.Index Terms-Ad hoc networks, ALOHA, CSMA, O-CSMA, opportunistic scheduling, quantile scheduling, QT-CSMA, spatial fairness, spatial reuse.

show abstract

Section: B Related Workmentioning

confidence: 99%

“…Then by applying the Plancherel-Parseval Theorem in [26,Ch. 3.3,p.157] to (20) followed by a change of variables, (20) becomes…”

Section: O-csma 1) Access Probability Of a Typical Transmittermentioning

confidence: 99%

Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols

Kim

Baccelli

Veciana

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…This condition is violated when the average nearest-interferer distance remains constant with decreasing density η. See Figure 1 and [31] for examples that violate Condition B.1. If B.1 is violated, P s is not equal to 1 when η → 0. unit density parent process and cluster density 15.…”

Section: Theorem 1 If the Transmitting Set φ T Of Density η Is Such mentioning

confidence: 99%

High-SIR Transmission Capacity of Wireless Networks With General Fading and Node Distribution

Ganti

Andrews²,

Haenggi³

2011

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson point process for analytical tractability. While analytically convenient, the PPP only accurately models networks whose nodes are placed independently and use ALOHA as the channel access protocol, which preserves the independence. Correlations between transmitter locations in non-Poisson networks, which model intelligent access protocols, makes the outage analysis extremely difficult. In this paper, we take an alternative approach and focus on an asymptotic regime where the density of interferers η goes to 0. We prove for general node distributions and fading statistics that the success probability P s ∼ 1 − γη κ for η → 0, and provide values of γ and κ for a number of important special cases. We show that κ is lower bounded by 1 and upper bounded by a value that depends on the path loss exponent and the fading. This new analytical framework is then used to characterize the transmission capacity of a very general class of networks, defined as the maximum spatial density of active links given an outage constraint.

show abstract

“…However, the outage probability can be analyzed in the highreliability regime for any d . As the underlying MAC protocol, we assume highly clustered ALOHA [8], i.e. each cluster either transmits or remains muted with a fixed medium access probability η.…”

Section: Outage Probability and High Reliability Analysismentioning

confidence: 99%

Interference alignment in clustered ad hoc networks: High reliability regime and per-cluster aloha

Tresch

Alfano

Guillaud

2011

2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

Wireless networks are fundamentally limited by the intensity of the received signals and the mutual interference caused by many concurrent transmissions. We consider large wireless ad hoc networks whose underlying node distribution is a Poisson cluster process. Under the assumption that multiple antennas are available at each node, we evaluate the performance of interference alignment (IA) inside each cluster. We extend our previous analysis of the outage probability achieved by this technique by generalizing it to IA with receive diversity. Furthermore, we provide a simplified expression applicable at high Signal-to-Interference Ratio, along the lines of the analysis recently proposed by Ganti, Andrews and Haenggi.

show abstract

Outage Probability of General Ad Hoc Networks in the High-Reliability Regime

Cited by 58 publications

References 20 publications

Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols

Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols

High-SIR Transmission Capacity of Wireless Networks With General Fading and Node Distribution

Interference alignment in clustered ad hoc networks: High reliability regime and per-cluster aloha

Contact Info

Product

Resources

About