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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Fei Ge, Liansheng Tan, Wei Zhang, Ming Liu, Xun Gao, Juan Luo
Formato:	article
Lenguaje:	EN
Publicado:	IEEE 2021
Materias:	End-to-end throughput full-duplex radios scheduling wireless multi-hop networks Electronic computers. Computer science QA75.5-76.95 Information technology T58.5-58.64
Acceso en línea:	https://doaj.org/article/deb1357c13ff4853b2cc8dabb19d7270
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:deb1357c13ff4853b2cc8dabb19d7270
record_format	dspace
spelling	oai:doaj.org-article:deb1357c13ff4853b2cc8dabb19d72702021-11-09T00:03:44ZLink Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks2644-126810.1109/OJCS.2021.3121185https://doaj.org/article/deb1357c13ff4853b2cc8dabb19d72702021-01-01T00:00:00Zhttps://ieeexplore.ieee.org/document/9580671/https://doaj.org/toc/2644-1268The 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.Fei GeLiansheng TanWei ZhangMing LiuXun GaoJuan LuoIEEEarticleEnd-to-end throughputfull-duplex radiosschedulingwireless multi-hop networksElectronic computers. Computer scienceQA75.5-76.95Information technologyT58.5-58.64ENIEEE Open Journal of the Computer Society, Vol 2, Pp 393-406 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	End-to-end throughput full-duplex radios scheduling wireless multi-hop networks Electronic computers. Computer science QA75.5-76.95 Information technology T58.5-58.64
spellingShingle	End-to-end throughput full-duplex radios scheduling wireless multi-hop networks Electronic computers. Computer science QA75.5-76.95 Information technology T58.5-58.64 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
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
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
title	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_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_sort	link scheduling and end-to-end throughput optimization in wireless multi-hop networks
publisher	IEEE
publishDate	2021
url	https://doaj.org/article/deb1357c13ff4853b2cc8dabb19d7270
work_keys_str_mv	AT feige linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT lianshengtan linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT weizhang linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT mingliu linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT xungao linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks AT juanluo linkschedulingandendtoendthroughputoptimizationinwirelessmultihopnetworks
_version_	1718441430742990848

Link Scheduling and End-to-End Throughput Optimization in Wireless Multi-Hop Networks

Ejemplares similares