{IEEE} 802.11s and the {P}hilosophers' problem
Authors: Denteneer, Dee and Borst, Sem and van de Ven, Peter and Hiertz, Guido R.
Department of Communication Networks (ComNets), Faculty 6, RWTH Aachen University
: Guido Hiertz
In Statistica Neerlandica, Vol. 62, No. 3, p.p. 283--298, Barendrecht, The Netherlands,Wiley InterScience, 2008.
Publication Date: Jul, 2008
On page(s):283--298
ISBN:
Abstract
IEEE 802.11s is the task group in the IEEE that is in the process of standardizing wireless mesh networks. A hot topic in this standardization effort concerns the need for additional medium access functionality beyond the basic IEEE 802.11 carrier sense multiple access with collision avoidance (CSMA/CA). In this paper, we discuss the connection between CSMA/CA and Dijkstra's classical Philosophers' problem, and its implications for the debate inside IEEE 802.11s. In an alternative view of this paper, we state some new mathematical models, theorems and conjectures related to the Philosophers' problem.
Author Keywords
mesh networks, Markov process, throughput, bounds
Bibtex
@ARTICLE{DeBoVeHi-80211s-philosophs,
AUTHOR = {Denteneer, D. and Borst, S. and van de Ven, P. and Hiertz, G.},
TITLE = {{IEEE} 802.11s and the {P}hilosophers' problem},
JOURNAL = {Statistica Neerlandica},
YEAR = {2008},
MONTH = {Jul},
VOLUME = {62},
PAGES = {283--298},
PUBLISHER = {Wiley InterScience},
ADDRESS = {Barendrecht, The Netherlands},
HOWPUBLISHED = {http://www3.interscience.wiley.com/journal/120841176/abstract},
NUMBER = {3},
AFFILIATION = {Department of Communication Networks (ComNets), Faculty 6, RWTH Aachen University},
ISSN = {0039-0402},
KEYWORDS = {mesh networks, Markov process, throughput, bounds},
LANGUAGE = {English},
URL = {https://www.comnets.rwth-aachen.de}
}