@article{oai:ipsj.ixsq.nii.ac.jp:00177502,
 author = {Toshiki, Takeda and Takuya, Yoshihiro and Toshiki, Takeda and Takuya, Yoshihiro},
 issue = {2},
 journal = {情報処理学会論文誌},
 month = {Feb},
 note = {Wireless Mesh Networks (WMNs) over CSMA MAC (especially IEEE 802.11) are an attractive solution to widen the coverage area of the Internet in unlicensed frequency bands. Although such CSMA-based WMNs have been deeply investigated for a long time, they still suffer from heavy interference due to hidden terminals. In this paper, we accelerate the performance of CSMA-based WMNs by introducing a distributed scheduling scheme that exchanges the transmission-queue length information in real-time among neighbor nodes. In our scheduling scheme, we exchange the information of transmission queue-lengths among neighbor nodes in real-time, and allow transmitting frames to the node that has the longest queue length among its 2-hop distance. The proposed scheduling scheme can be regarded as a distributed design of so called ‘Max-weight' scheduling. By combining CSMA with the queue-length based scheduling, we significantly reduce collisions due to hidden terminals and improve the performance with a small overhead of queue-length fields in MAC frames. 
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.25(2017) (online)
DOI　http://dx.doi.org/10.2197/ipsjjip.25.174
------------------------------, Wireless Mesh Networks (WMNs) over CSMA MAC (especially IEEE 802.11) are an attractive solution to widen the coverage area of the Internet in unlicensed frequency bands. Although such CSMA-based WMNs have been deeply investigated for a long time, they still suffer from heavy interference due to hidden terminals. In this paper, we accelerate the performance of CSMA-based WMNs by introducing a distributed scheduling scheme that exchanges the transmission-queue length information in real-time among neighbor nodes. In our scheduling scheme, we exchange the information of transmission queue-lengths among neighbor nodes in real-time, and allow transmitting frames to the node that has the longest queue length among its 2-hop distance. The proposed scheduling scheme can be regarded as a distributed design of so called ‘Max-weight' scheduling. By combining CSMA with the queue-length based scheduling, we significantly reduce collisions due to hidden terminals and improve the performance with a small overhead of queue-length fields in MAC frames. 
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.25(2017) (online)
DOI　http://dx.doi.org/10.2197/ipsjjip.25.174
------------------------------},
 title = {A Distributed Scheduling through Queue-length Exchange in CSMA-based Wireless Mesh Networks},
 volume = {58},
 year = {2017}
}