2026-04-21T23:31:01Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00194369 2025-01-19T23:30:40Z 581:9633:9635

A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay Takahiro, Noi Takuya, Yoshihiro Takahiro, Noi Takuya, Yoshihiro [特集：ネットワークサービスと分散処理] wireless mesh networks, scheduling, slotted CSMA, routing In this paper, we propose a new scheduling problem for WMNs based on slotted-CSMA. Slotted CSMA is a mechanism that divides a single frequency channel into several time slots where CSMA functions. With a schedule that matches links and slots, each node transmits frames in the assigned slot to avoid collision of frames. CATBS (CSMA-Aware Time-Boundable Scheduling) is a slotted-CSMA-based WMN architecture with a scheduling algorithm. However, it suffers from large end-to-end delay due to its long slot time that allows transmitting several frames within a single slot. This paper extends the scheduling problem of CATBS to consider inter-slot collision to reduce the overhead of collision at slot boundaries even if using short slot time. Evaluation results shows that the proposed scheduling problem reduces the overhead that arises at slot boundaries, and improves communication performance when using short time slots. ------------------------------ 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.27(2019) (online) DOI　http://dx.doi.org/10.2197/ipsjjip.27.117 ------------------------------ In this paper, we propose a new scheduling problem for WMNs based on slotted-CSMA. Slotted CSMA is a mechanism that divides a single frequency channel into several time slots where CSMA functions. With a schedule that matches links and slots, each node transmits frames in the assigned slot to avoid collision of frames. CATBS (CSMA-Aware Time-Boundable Scheduling) is a slotted-CSMA-based WMN architecture with a scheduling algorithm. However, it suffers from large end-to-end delay due to its long slot time that allows transmitting several frames within a single slot. This paper extends the scheduling problem of CATBS to consider inter-slot collision to reduce the overhead of collision at slot boundaries even if using short slot time. Evaluation results shows that the proposed scheduling problem reduces the overhead that arises at slot boundaries, and improves communication performance when using short time slots. ------------------------------ 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.27(2019) (online) DOI　http://dx.doi.org/10.2197/ipsjjip.27.117 ------------------------------ journal article 2019-02-15 application/pdf 情報処理学会論文誌 2 60 1882-7764 AN00116647 https://ipsj.ixsq.nii.ac.jp/record/194369/files/IPSJ-JNL6002022.pdf eng