Wireless multi-hop networks with stealing : large buffer asymptotics

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-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 languageEnglish
Title of host publicationProceedings of the 22nd International Teletraffic Congress (ITC 22, Amsterdam, The Netherlands, September 7-9, 2010)
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers
Pages1-8
ISBN (Print)978-142448836-0
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Wireless multi-hop networks with stealing : large buffer asymptotics'. Together they form a unique fingerprint.

Cite this