Throughput-delay trade-off in wireless networks

Gamal, Abbas El; Mammen, J.; Prabhakar, Balaji; Shah, Devavrat

doi:10.1109/infcom.2004.1354518

Cited by 462 publications

(551 citation statements)

References 9 publications

Supporting

Mentioning

540

Contrasting

Unclassified

Order By: Relevance

“…These results conclude that the network throughput will approach zero with an increasing n. This conclusion was further elaborated and verified in a series of follow-up papers [8][9][10][11]. More sophisticated models were also developed to incorporate node mobility or fading [12][13][14][15][16][17] --they were obviously inspired by this rather pessimistic result and aimed at improving the network throughput. As mentioned earlier, the input rate λ and the SD distance L are intrinsic elements affecting the network throughput.…”

Section: Introductionmentioning

confidence: 73%

Throughput and delay analysis of wireless random access networks

Dai

Lee

2008

2008 42nd Annual Conference on Information Sciences and Systems

View full text Add to dashboard Cite

Abstract-The network throughput and transport delay of a wireless random access network are studied in this paper based on a Markov renewal model of packet transportation. We show that the distribution of the source-to-destination (SD) distance plays a crucial role in characterizing the network performances. The necessary and sufficient condition on the SD-distance is established for scalable network throughput. The optimal rate allocation issue is also addressed with fairness taken into consideration. In order to achieve the network scalability, several traffic scaling laws are delineated by localizing the traffic pattern, and a leaky bucket scheme at the network access is proposed for traffic shaping and flow control.

show abstract

Section: Introductionmentioning

confidence: 73%

Throughput and delay analysis of wireless random access networks

Dai

Lee

2008

2008 42nd Annual Conference on Information Sciences and Systems

View full text Add to dashboard Cite

show abstract

“…Gamal et al [32] did great work in characterizing the delay and determining the throughput-delay trade-off in fixed and mobile ad hoc networks. They use cell area to parameterize the trade-off and figure out the optimal throughput-delay tradeoff.…”

Section: Downloaded Frommentioning

confidence: 99%

The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing in Wireless Ad Hoc and Sensor Networks

Yi¹,

Wan²,

Su³

et al. 2010

The Computer Journal

View full text Add to dashboard Cite

In grid routing, the plane is tessellated into equal-sized square cells. Two cells are called neighbor cells if they share a common edge, and two nodes are called routing neighbors if they are in neighbor cells and within each other's transmission range. If communication parties are in the same cell, packets can be transmitted directly; otherwise, packets are forwarded to routing neighbors that are in cells closer to destination cells. As a greedy strategy, grid routing suffers the existence of local minima at which no neighbor nodes exist for relaying packets. To guarantee deliverability, in this paper, we investigate two vital parameters of grid routing, called the grid size and the transmission radius. Assume that nodes are represented by a Poisson point process with rate n over a unit-area square, and let l denote the grid size and r the transmission radius. First, we show that if l = β ln n/n for some constant β and r = √ 5l, then β = 1 is the threshold for deliverability. In other words, there almost surely do not exist local minima if β > 1 and there almost surely exist local minima if β < 1. Next, for any given β > 1, we give sufficient and necessary conditions to determine the critical transmission radius (CTR) for deliverability. Then, we show that as β ∼ = 1.092, the CTR r ∼ = 2.09 √ ln n/n is the minimum over all β > 1. Simulation results are given to validate this theoretical work.

show abstract

“…A sharp transition is presented by the uniform distribution, which annihilates the node isolation probability for λ > 2 m −1 . The 6 Node isolation probability vs. average node density, R = 1 m for various node placement statistics Springer normal distribution (which corresponds to the case of nodes placed one after the other, the distance being deterministic in principle but affected by a Gaussian placement error), on the other hand, behaves poorly in the medium density regime, while showing very good performance in a very dense network. In order to better understand the performance in very dense networks, let us consider the following heuristic.…”

Section: Coverage and Isolation Probabilitymentioning

confidence: 99%

“…The growing interest in the field of self-organizing wireless networks, often referred to as ad hoc, has led to a considerable amount of literature dealing with the characterization of the limiting performance of such networks, in terms of both connectivity [1][2][3][4] and capacity [5][6][7][8][9][10], two intimately related issues [11]. In this paper, we focus on one-dimensional ad hoc networks, in which nodes are randomly deployed over an infinite line, and present novel results on connectivity and coverage.…”

Section: Introductionmentioning

confidence: 99%

Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach

2006

View full text Add to dashboard Cite

In this paper we analyze connectivity issues in one-dimensional ad hoc networks. Starting with a deterministic channel model, we show how an equivalent G I |D|∞ queueing model may be used to address network connectivity. In this way, we obtain exact results for the coverage probability, the node isolation probability and the connectivity distance for various node placement statistics. We then show how a G I |G|∞ model may be used to study broadcast percolation problems in ad hoc networks with general node placement in the presence of fading channels. In particular, we obtain explicit results for the case of nodes distributed according to a Poisson distribution operating in a fading/ shadowing environment. In the latter case, heavy traffic theorems are applied to derive the critical transmission power for connectivity and broadcast percolation distance in highly dense networks. The impact of signal processing schemes able to exploit the diversity provided by smallscale fading by means of multiple antennas is considered. The analysis is then extended to the case of unreliable ad hoc networks, with an in-depth discussion of asymptotic results.

show abstract

Throughput-delay trade-off in wireless networks

Cited by 462 publications

References 9 publications

Throughput and delay analysis of wireless random access networks

Throughput and delay analysis of wireless random access networks

The Critical Grid Size and Transmission Radius for Local-Minimum-Free Grid Routing in Wireless Ad Hoc and Sensor Networks

Connectivity in one-dimensional ad hoc networks: A queueing theoretical approach

Contact Info

Product

Resources

About