WEKO3
アイテム
A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay
https://ipsj.ixsq.nii.ac.jp/records/194369
https://ipsj.ixsq.nii.ac.jp/records/1943690451ddfd-8459-4eb1-9cce-643620fda368
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6002022.pdf (989.6 kB)
|
Copyright (c) 2019 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2019-02-15 | |||||||||
| タイトル | ||||||||||
| タイトル | A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：ネットワークサービスと分散処理] wireless mesh networks, scheduling, slotted CSMA, routing | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Graduate School of Systems Engineering, Wakayama University | ||||||||||
| 著者所属 | ||||||||||
| Faculty of Systems Engineering, Wakayama University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Systems Engineering, Wakayama University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Faculty of Systems Engineering, Wakayama University | ||||||||||
| 著者名 |
Takahiro, Noi
× Takahiro, Noi
× Takuya, Yoshihiro
|
|||||||||
| 著者名(英) |
Takahiro, Noi
× Takahiro, Noi
× Takuya, Yoshihiro
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | 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 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | 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 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 60, 号 2, 発行日 2019-02-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
