Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks
The goal of this work is to find appropriate link scheduling schemes to achieve satisfactory end-to-end throughput in wireless multi-hop networks. The algorithm of finding the best path status bitmap is proposed to solve the throughput problem. By analyzing path status, it is found that compressing...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Open Journal of the Computer Society |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9580671/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849317855019925504 |
|---|---|
| author | Fei Ge Liansheng Tan Wei Zhang Ming Liu Xun Gao Juan Luo |
| author_facet | Fei Ge Liansheng Tan Wei Zhang Ming Liu Xun Gao Juan Luo |
| author_sort | Fei Ge |
| collection | DOAJ |
| description | The goal of this work is to find appropriate link scheduling schemes to achieve satisfactory end-to-end throughput in wireless multi-hop networks. The algorithm of finding the best path status bitmap is proposed to solve the throughput problem. By analyzing path status, it is found that compressing the path state set can reduce the time complexity. According to this, we describe innovative methods to simplify scheduling of links for long path with large amount of data. Two typical link scheduling schemes with full-duplex radios are proposed, and end-to-end throughput boundary is worked out by analyzing the link capacity and the link active ratio in each scheme. Results illustrate that these schemes may improve end-to-end throughput in wireless multi-hop networks modestly. |
| format | Article |
| id | doaj-art-deb1357c13ff4853b2cc8dabb19d7270 |
| institution | Kabale University |
| issn | 2644-1268 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of the Computer Society |
| spelling | doaj-art-deb1357c13ff4853b2cc8dabb19d72702025-08-20T03:51:04ZengIEEEIEEE Open Journal of the Computer Society2644-12682021-01-01239340610.1109/OJCS.2021.31211859580671Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop NetworksFei Ge0https://orcid.org/0000-0002-9478-3696Liansheng Tan1https://orcid.org/0000-0001-6587-9923Wei Zhang2Ming Liu3Xun Gao4https://orcid.org/0000-0002-3344-1860Juan Luo5https://orcid.org/0000-0002-0858-427XComputer Science Department, Central China Normal University, Wuhan, Hubei, P. R. ChinaDiscipline of ICT, School of Technology, Environments and Design, University of Tasmania, Hobart, TAS, AustraliaComputer Science Department, Central China Normal University, Wuhan, Hubei, P. R. ChinaComputer Science Department, Central China Normal University, Wuhan, Hubei, P. R. ChinaElectronic Engineering Department, Wuhan University, Wuhan, Hubei, P. R. ChinaCollege of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, P. R. ChinaThe goal of this work is to find appropriate link scheduling schemes to achieve satisfactory end-to-end throughput in wireless multi-hop networks. The algorithm of finding the best path status bitmap is proposed to solve the throughput problem. By analyzing path status, it is found that compressing the path state set can reduce the time complexity. According to this, we describe innovative methods to simplify scheduling of links for long path with large amount of data. Two typical link scheduling schemes with full-duplex radios are proposed, and end-to-end throughput boundary is worked out by analyzing the link capacity and the link active ratio in each scheme. Results illustrate that these schemes may improve end-to-end throughput in wireless multi-hop networks modestly.https://ieeexplore.ieee.org/document/9580671/End-to-end throughputfull-duplex radiosschedulingwireless multi-hop networks |
| spellingShingle | Fei Ge Liansheng Tan Wei Zhang Ming Liu Xun Gao Juan Luo Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks IEEE Open Journal of the Computer Society End-to-end throughput full-duplex radios scheduling wireless multi-hop networks |
| title | Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks |
| title_full | Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks |
| title_fullStr | Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks |
| title_full_unstemmed | Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks |
| title_short | Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks |
| title_sort | link scheduling and end to end throughput optimization in wireless multi hop networks |
| topic | End-to-end throughput full-duplex radios scheduling wireless multi-hop networks |
| url | https://ieeexplore.ieee.org/document/9580671/ |
| work_keys_str_mv | AT feige linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT lianshengtan linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT weizhang linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT mingliu linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT xungao linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT juanluo linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks |