Wireless multi-hop networks with stealing : large buffer asymptotics

F. Guillemin; C. Knessl; J.S.H. Leeuwaarden, van

doi:10.1109/ITC.2010.5608735

Wireless multi-hop networks with stealing : large buffer asymptotics

F. Guillemin, C. Knessl, J.S.H. Leeuwaarden, van

Stochastic Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

Abstract

Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multi-hop networks is the hidden node problem that causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability p. Aziz, Starobinski and Thiran have recently shown that the N-hop model with stealing is stable only in the case N = 3 and p ¿ (0, 1]. This 3-hop model can be modeled as a random walk in the quarter plane. We derive various asymptotic expressions for the stationary large buffer probabilities of the 3-hop model that capture the effect of p.

Original language	English
Title of host publication	Proceedings of the 22nd International Teletraffic Congress (ITC 22, Amsterdam, The Netherlands, September 7-9, 2010)
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers
Pages	1-8
ISBN (Print)	978-142448836-0
DOIs	https://doi.org/10.1109/ITC.2010.5608735
Publication status	Published - 2010

Access to Document

10.1109/ITC.2010.5608735

Cite this

@inproceedings{f7d9c07b80c449db9529b5397c799715,

title = "Wireless multi-hop networks with stealing : large buffer asymptotics",

abstract = "Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multi-hop networks is the hidden node problem that causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability p. Aziz, Starobinski and Thiran have recently shown that the N-hop model with stealing is stable only in the case N = 3 and p ¿ (0, 1]. This 3-hop model can be modeled as a random walk in the quarter plane. We derive various asymptotic expressions for the stationary large buffer probabilities of the 3-hop model that capture the effect of p.",

author = "F. Guillemin and C. Knessl and {Leeuwaarden, van}, J.S.H.",

year = "2010",

doi = "10.1109/ITC.2010.5608735",

language = "English",

isbn = "978-142448836-0",

pages = "1--8",

booktitle = "Proceedings of the 22nd International Teletraffic Congress (ITC 22, Amsterdam, The Netherlands, September 7-9, 2010)",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

Wireless multi-hop networks with stealing : large buffer asymptotics. / Guillemin, F.; Knessl, C.; Leeuwaarden, van, J.S.H.
Proceedings of the 22nd International Teletraffic Congress (ITC 22, Amsterdam, The Netherlands, September 7-9, 2010). Piscataway, NJ: Institute of Electrical and Electronics Engineers, 2010. p. 1-8.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Wireless multi-hop networks with stealing : large buffer asymptotics

AU - Guillemin, F.

AU - Knessl, C.

AU - Leeuwaarden, van, J.S.H.

PY - 2010

Y1 - 2010

N2 - Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multi-hop networks is the hidden node problem that causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability p. Aziz, Starobinski and Thiran have recently shown that the N-hop model with stealing is stable only in the case N = 3 and p ¿ (0, 1]. This 3-hop model can be modeled as a random walk in the quarter plane. We derive various asymptotic expressions for the stationary large buffer probabilities of the 3-hop model that capture the effect of p.

AB - Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multi-hop networks is the hidden node problem that causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability p. Aziz, Starobinski and Thiran have recently shown that the N-hop model with stealing is stable only in the case N = 3 and p ¿ (0, 1]. This 3-hop model can be modeled as a random walk in the quarter plane. We derive various asymptotic expressions for the stationary large buffer probabilities of the 3-hop model that capture the effect of p.

U2 - 10.1109/ITC.2010.5608735

DO - 10.1109/ITC.2010.5608735

M3 - Conference contribution

SN - 978-142448836-0

SP - 1

EP - 8

BT - Proceedings of the 22nd International Teletraffic Congress (ITC 22, Amsterdam, The Netherlands, September 7-9, 2010)

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway, NJ

ER -

Wireless multi-hop networks with stealing : large buffer asymptotics

Abstract

Access to Document

Fingerprint

Cite this