Premium
IEEE 802.11s and the Philosophers’ problem
Author(s) -
Denteneer Dee,
Borst Sem,
Ven Peter van de,
Hiertz Guido
Publication year - 2008
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.2008.00396.x
Subject(s) - carrier sense multiple access with collision avoidance , dijkstra's algorithm , computer science , network allocation vector , task (project management) , standardization , ieee 802.11s , connection (principal bundle) , computer network , process (computing) , wireless network , wireless , ieee 802.11 , theoretical computer science , mathematics , wireless mesh network , engineering , throughput , telecommunications , graph , shortest path problem , programming language , geometry , systems engineering , operating system
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.