期刊：
Information Processing & Management,2023年60(2):103207 ISSN：0306-4573
通讯作者：
Chen Qiu
作者机构：
[Gu, Jinguang; Qiu, Chen; Xu, Zhaoyang; Liu, Maofu; Fu, Haidong] Wuhan Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430081, Peoples R China.;[Gu, Jinguang; Qiu, Chen; Xu, Zhaoyang; Liu, Maofu; Fu, Haidong] Wuhan Univ Sci & Technol, Inst Big Data Sci & Engn, Wuhan 430081, Peoples R China.;[Zhou, Guangyou] Cent China Normal Univ, Sch Comp Sci, Wuhan 430079, Peoples R China.
通讯机构：
[Chen Qiu] S;School of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan, 430081, China<&wdkj&>Institute of Big Data Science and Engineering, Wuhan University of Science and Technology, Wuhan, 430081, China
期刊：
IEEE Open Journal of the Computer Society,2021年2:393-406
作者机构：
[Fei Ge; Wei Zhang; Ming Liu] Computer Science Department, Central China Normal University, Wuhan, Hubei, P. R. China;Discipline of ICT, School of Technology, Environments and Design, University of Tasmania, Hobart, TAS, Australia;Computer Science Department, Huazhong Normal University, Wuhan, Hubei, P. R. China;[Xun Gao] Electronic Engineering Department, Wuhan University, Wuhan, Hubei, P. R. China;[Juan Luo] College of Computer Science and Electronic Engineering, Hunan University, Changsha, Hunan, P. R. China
摘要：
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.
