Thursday, December 12, 2013

DOMINO: Relative Scheduling in Enterprise Wireless LANs

Presenter: Wenjie Zhou
Authors: Wenjie Zhou (Ohio State University), Dong Li (Ohio State University), Kannan Srinivasan (Ohio State University), Prasun Sinha (Ohio State University)

This work mainly focus on solving the channel access challenges in enterprise networks. Although current Wifi Distributed Channel Access (DCF) is simple and robust, it suffers from the hidden terminal problem as well as efficiency issues. Other work in the literature tried to solve such issues but unfortunately they have major problems such as inefficiency, being not robust or being unable to leverage the channel to its maximum. Therefor, the authors developed DOMINO as a centralized channel access mechanism. DOMINO is able to detect the hidden terminals and avoid the hidden terminal problem efficiently. In addition, DOMINO achieve relatively high throughput while avoiding high accurate time synchronization. To achieve this, DOMINO used relative scheduling approach to avoid requiring high accurate clock synchronization. The authors implemented their scheme on USRPs in order to evaluate its performance. In addition, we made further evaluation using simulation. 

Q: Is this is Wireless g or n compatible ?
A: Wireless g

Q: What is the overhead of relative scheduling ?
A: Sending the signature at the end of the transmission