Throughput and delay analysis of wireless random access networks

Lin Dai; Tony T. Lee

doi:10.1109/CISS.2008.4558632

Throughput and delay analysis of wireless random access networks

Lin Dai
, Tony T. Lee

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

2 Citations (Scopus)

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. © 2008 IEEE.

Original language	English
Title of host publication	CISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages	815-820
DOIs	https://doi.org/10.1109/CISS.2008.4558632
Publication status	Published - 2008
Event	CISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States Duration: 19 Mar 2008 → 21 Mar 2008

Conference

Conference	CISS 2008, 42nd Annual Conference on Information Sciences and Systems
Place	United States
City	Princeton, NJ
Period	19/03/08 → 21/03/08

Access Output

10.1109/CISS.2008.4558632

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{d752a2c1884a4b4ca2498bef5108c8ef,

title = "Throughput and delay analysis of wireless random access networks",

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. {\textcopyright} 2008 IEEE.",

author = "Lin Dai and Lee, \{Tony T.\}",

year = "2008",

doi = "10.1109/CISS.2008.4558632",

language = "English",

isbn = "9781424422470",

pages = "815--820",

booktitle = "CISS 2008, The 42nd Annual Conference on Information Sciences and Systems",

note = "CISS 2008, 42nd Annual Conference on Information Sciences and Systems ; Conference date: 19-03-2008 Through 21-03-2008",

}

TY - GEN

T1 - Throughput and delay analysis of wireless random access networks

AU - Dai, Lin

AU - Lee, Tony T.

PY - 2008

Y1 - 2008

N2 - 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. © 2008 IEEE.

AB - 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. © 2008 IEEE.

UR - https://www.scopus.com/pages/publications/51849142851

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-51849142851&origin=recordpage

U2 - 10.1109/CISS.2008.4558632

DO - 10.1109/CISS.2008.4558632

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781424422470

SP - 815

EP - 820

BT - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

T2 - CISS 2008, 42nd Annual Conference on Information Sciences and Systems

Y2 - 19 March 2008 through 21 March 2008

ER -

Throughput and delay analysis of wireless random access networks

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this