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...
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
IEEE
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/deb1357c13ff4853b2cc8dabb19d7270 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|