版权说明 操作指南
首页 > 成果 > 详情

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

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Fei Ge;Liansheng Tan;Wei Zhang;Ming Liu;Xun Gao;...
作者机构:
[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
语种:
英文
关键词:
Wireless networks;Best paths;Bit maps;End-to-end throughput;Full-duplex radios;Link scheduling;Scheduling schemes;State-sets;Throughput optimization;Time complexity;Wireless multi-hop network;Scheduling
期刊:
IEEE Open Journal of the Computer Society
ISSN:
2644-1268
年:
2021
卷:
2
页码:
393-406
基金类别:
10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61672258, 61741204 and 62173157) Fundamental Research Funds for the Central Universities of CCNU
机构署名:
本校为第一机构
院系归属:
计算机学院
摘要:
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, an...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com