Analytical study of the outage probability of ALOHA and CSMA in bounded ad hoc networks

Kaynia, Mariam; Fabbri, Flavio; Verdone, Roberto; Oien, G.E.

doi:10.1109/ew.2010.5483479

Cited by 9 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Contrary to these (and many other related) approaches, we do not employ classical information theory to quantify the capacity, but rather work with the directly known performances of each link in the network. Similar to our work, network outage probabilities are as well discussed in [10], [11], [12] and [13], where most research effort, as it seems, has been put on wireless networks. So far, the problem appears hardly considered in (hard-wired) networks or quantum networks.…”

supporting

confidence: 56%

On the transmission capacity of quantum networks

König¹,

Raß²

2011

IJACSA

View full text Add to dashboard Cite

Abstract-We provide various results about the transmission capacity of quantum networks. Our primary focus is on algorithmic methods to efficiently compute upper-bounds to the traffic that the network can handle at most, and to compute lower-bounds on the likelihood that a customer has to wait for service due to network congestion. This establishes analogous assertions as derived from Erlang B or Erlang C models for standard telecommunications. Our proposed methods, while specifically designed for quantum networks, do neither hinge on a particular quantum key distribution technology nor on any particular routing scheme. We demonstrate the feasibility of our approach using a worked example. Moreover, we explicitly consider two different architectures for quantum key management, one of which employs individual key-buffers for each relay connection, the other using a shared key-buffer for every transmission. We devise specific methods for analyzing the network performance depending on the chosen key-buffer architecture, and our experiments led to quite different results for the two variants.

show abstract

supporting

confidence: 56%

On the transmission capacity of quantum networks

König¹,

Raß²

2011

IJACSA

View full text Add to dashboard Cite

show abstract

“…The outage probability Pout is the probability that the received signal's average SNR γs falls below the minimum required SNR for the pre-defined acceptable communication performance γ0 [5,7]. Mathematically,…”

Section: Estimating Vehicles In the Sender's Rangementioning

confidence: 99%

Exploiting beacons for scalable broadcast data dissemination in VANETs

Schwartz

Das

Scholten

et al. 2012

Proceedings of the Ninth ACM International Workshop on Vehicular Inter-Networking, Systems, and Applications

View full text Add to dashboard Cite

Vehicular Ad-hoc Networks (VANETs) enable the timely broadcast dissemination of event-driven messages to interested vehicles. However, when dealing with broadcast communication, suppression techniques must be designed to prevent the so-called broadcast storm problem. Numerous suppression schemes aim to reduce broadcast redundancy by assigning vehicles to different delay values, i.e., time slots, that are inversely proportional to their distance to the sender. In this way, only the farthest vehicles would rebroadcast, thereby allowing for quick data dissemination. Despite many efforts, current delay-based schemes still suffer from high levels of contention and collision when the number of vehicles rebroadcasting nearly simultaneously is high in dense networks. Even choosing appropriate values for the total number of time slots does not prevent situations where simply no vehicle is assigned to the earliest time slot, what may result in high end-to-end delay. In this paper, we tackle such scalability issues with a scheme that controls with precision the density of vehicles within each time slot. To reach this goal, we exploit the presence of beacons, periodic messages meant to provide cooperative awareness in safety applications. Simulations results show that our protocol outperforms existing delay-based schemes and is able to disseminate data messages in a scalable, timely, and robust manner.

show abstract