The aggregate throughput of wireless mesh networks (WMNs) can be significantly improved by equipping the mesh routers with multiple radios tuned to orthogonal channels. Not only the links using orthogonal channels can be activated at a time, but some links in the same channel also can be activated concurrently if the Signal-to-Interference-and-Noise Ratio (SINR) at their receivers is not lower than the threshold, which is the spatial-reuse characteristic. STDMA is considered as one of the medium access schemes that can exploit spatial reuse to improve network throughput. Past studies have shown that optimizing the performance of STDMA is NP-Hard. Therefore, we propose a STDMA-based scheduling algorithm that operates in a greedy fashion for WMNs. We show that the proposed algorithm enhances not only the throughput but also the fairness by capturing the essence of spatial-reuse approach of STDMA and giving medium access opportunities to each network element based on its priority. We furthermore validate our algorithm through theoretical analysis and extensive simulations and the results show that our algorithm can outperform state-of-the-art alternatives.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Nguyen H. TRAN, Choong Seon HONG, Sungwon LEE, "Priority-Based STDMA Scheduling Algorithm to Enhance Throughput and Fairness in Wireless Mesh Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 5, pp. 1355-1365, May 2011, doi: 10.1587/transcom.E94.B.1355.
Abstract: The aggregate throughput of wireless mesh networks (WMNs) can be significantly improved by equipping the mesh routers with multiple radios tuned to orthogonal channels. Not only the links using orthogonal channels can be activated at a time, but some links in the same channel also can be activated concurrently if the Signal-to-Interference-and-Noise Ratio (SINR) at their receivers is not lower than the threshold, which is the spatial-reuse characteristic. STDMA is considered as one of the medium access schemes that can exploit spatial reuse to improve network throughput. Past studies have shown that optimizing the performance of STDMA is NP-Hard. Therefore, we propose a STDMA-based scheduling algorithm that operates in a greedy fashion for WMNs. We show that the proposed algorithm enhances not only the throughput but also the fairness by capturing the essence of spatial-reuse approach of STDMA and giving medium access opportunities to each network element based on its priority. We furthermore validate our algorithm through theoretical analysis and extensive simulations and the results show that our algorithm can outperform state-of-the-art alternatives.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.1355/_p
Copy
@ARTICLE{e94-b_5_1355,
author={Nguyen H. TRAN, Choong Seon HONG, Sungwon LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Priority-Based STDMA Scheduling Algorithm to Enhance Throughput and Fairness in Wireless Mesh Networks},
year={2011},
volume={E94-B},
number={5},
pages={1355-1365},
abstract={The aggregate throughput of wireless mesh networks (WMNs) can be significantly improved by equipping the mesh routers with multiple radios tuned to orthogonal channels. Not only the links using orthogonal channels can be activated at a time, but some links in the same channel also can be activated concurrently if the Signal-to-Interference-and-Noise Ratio (SINR) at their receivers is not lower than the threshold, which is the spatial-reuse characteristic. STDMA is considered as one of the medium access schemes that can exploit spatial reuse to improve network throughput. Past studies have shown that optimizing the performance of STDMA is NP-Hard. Therefore, we propose a STDMA-based scheduling algorithm that operates in a greedy fashion for WMNs. We show that the proposed algorithm enhances not only the throughput but also the fairness by capturing the essence of spatial-reuse approach of STDMA and giving medium access opportunities to each network element based on its priority. We furthermore validate our algorithm through theoretical analysis and extensive simulations and the results show that our algorithm can outperform state-of-the-art alternatives.},
keywords={},
doi={10.1587/transcom.E94.B.1355},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Priority-Based STDMA Scheduling Algorithm to Enhance Throughput and Fairness in Wireless Mesh Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1355
EP - 1365
AU - Nguyen H. TRAN
AU - Choong Seon HONG
AU - Sungwon LEE
PY - 2011
DO - 10.1587/transcom.E94.B.1355
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2011
AB - The aggregate throughput of wireless mesh networks (WMNs) can be significantly improved by equipping the mesh routers with multiple radios tuned to orthogonal channels. Not only the links using orthogonal channels can be activated at a time, but some links in the same channel also can be activated concurrently if the Signal-to-Interference-and-Noise Ratio (SINR) at their receivers is not lower than the threshold, which is the spatial-reuse characteristic. STDMA is considered as one of the medium access schemes that can exploit spatial reuse to improve network throughput. Past studies have shown that optimizing the performance of STDMA is NP-Hard. Therefore, we propose a STDMA-based scheduling algorithm that operates in a greedy fashion for WMNs. We show that the proposed algorithm enhances not only the throughput but also the fairness by capturing the essence of spatial-reuse approach of STDMA and giving medium access opportunities to each network element based on its priority. We furthermore validate our algorithm through theoretical analysis and extensive simulations and the results show that our algorithm can outperform state-of-the-art alternatives.
ER -