Bounds on the information propagation delay in interference-limited ALOHA networks

Ganti, Radha Krishna; Haenggi, Martin

doi:10.1109/wiopt.2009.5291569

Cited by 21 publications

(13 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us now discuss the relation of our results to those obtained in [11] and [14]. In these papers the so-called delay-tolerant networks are considered and modeled by a spatial SINR or SNR graph with no time dimension.…”

Section: Sinr Space-time Graph and Routeingmentioning

confidence: 70%

Optimal paths on the space-time SINR random graph

2011

View full text Add to dashboard Cite

We analyze a class of signal-to-interference-and-noise-ratio (SINR) random graphs. These random graphs arise in the modeling packet transmissions in wireless networks. In contrast to previous studies on SINR graphs, we consider both a space and a time dimension. The spatial aspect originates from the random locations of the network nodes in the Euclidean plane. The time aspect stems from the random transmission policy followed by each network node and from the time variations of the wireless channel characteristics. The combination of these random space and time aspects leads to fluctuations of the SINR experienced by the wireless channels, which in turn determine the progression of packets in space and time in such a network. In this paper we study optimal paths in such wireless networks in terms of first passage percolation on this random graph. We establish both 'positive' and 'negative' results on the associated time constant. The latter determines the asymptotics of the minimum delay required by a packet to progress from a source node to a destination node when the Euclidean distance between the two tends to ∞. The main negative result states that this time constant is infinite on the random graph associated with a Poisson point process under natural assumptions on the wireless channels. The main positive result states that, when adding a periodic node infrastructure of arbitrarily small intensity to the Poisson point process, the time constant is positive and finite.

show abstract

Section: Sinr Space-time Graph and Routeingmentioning

confidence: 70%

Optimal paths on the space-time SINR random graph

2011

View full text Add to dashboard Cite

show abstract

“…Poisson models also allow one to discover some theoretical limitations of macroscopic properties of MANETs, e.g. the scaling of the capacity of dense and/or extended networks [13,14], or the speed of packet progression on long routes [3,15].…”

Section: Related Workmentioning

confidence: 99%

Random Linear Multihop Relaying in a General Field of Interferers Using Spatial Aloha

Błaszczyszyn

Mühlethaler

2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

In our basic model, we study a stationary Poisson pattern of nodes on a line embedded in an independent planar Poisson field of interfering nodes. Assuming slotted Aloha and the signal-to-interference-and-noise ratio capture condition, with the usual power-law path loss model and Rayleigh fading, we explicitly evaluate several local and end-to-end performance characteristics related to the nearest-neighbor packet relaying on this line, and study their dependence on the model parameters (the density of relaying and interfering nodes, Aloha tuning and the external noise power). Our model can be applied in two cases: the first use is for vehicular ad-hoc networks, where vehicles are randomly located on a straight road. The second use is to study a "typical" route traced in a (general) planar ad-hoc network by some routing mechanism. The approach we have chosen allows us to quantify the non-efficiency of long-distance routing in "pure ad-hoc" networks and evaluate a possible remedy for it in the form of additional "fixed" relaying nodes, called road-side units in a vehicular network. It also allows us to consider a more general field of interfering nodes and study the impact of the clustering of its nodes on the routing performance. As a special case of a field with more clustering than the Poison field, we consider a Poisson-line field of interfering nodes, in which all the nodes are randomly located on random straight lines. In this case our analysis rigorously (in the sense of Palm theory) corresponds to the typical route of this network. The comparison to our basic model reveals a paradox: clustering of interfering nodes decreases the outage probability of a single (typical) transmission on the route, but increases the mean end-to-end delay.

show abstract

“…This model adds directionality to the network where the possible edge set varies with time. By considering a connection function where two nodes connect if they form a receiver-transmitter pair, a noise condition is met and there is no intermediary node that is transmitting, [Gan09a] showed that the time for a path to form between a source and destination scales linearly with their Euclidean separation. Moreover, [Bac10a] highlighted that for the SIR model there is a phase transition for a critical transmit probability ℘ where the mean delay becomes infinite.…”

Section: Temporal Networkmentioning

confidence: 99%

Spatial networks with wireless applications

Dettmann

Georgiou

Pratt

2018

Comptes Rendus. Physique

View full text Add to dashboard Cite

Many networks have nodes located in physical space, with links more common between closely spaced pairs of nodes. For example, the nodes could be wireless devices and links communication channels in a wireless mesh network. We describe recent work involving such networks, considering effects due to the geometry (convex, non-convex, and fractal), node distribution, distance-dependent link probability, mobility, directivity and interference.

show abstract

Bounds on the information propagation delay in interference-limited ALOHA networks

Cited by 21 publications

References 22 publications

Optimal paths on the space-time SINR random graph

Optimal paths on the space-time SINR random graph

Random Linear Multihop Relaying in a General Field of Interferers Using Spatial Aloha

Spatial networks with wireless applications

Contact Info

Product

Resources

About