邓晓衡

教授 博士生导师 硕士生导师

入职时间:2006-01-05

所在单位:电子信息学院

职务:院长

学历:博士研究生毕业

性别:男

联系方式:Email:dxh@csu.edu.cn

学位:博士学位

在职信息:在职

主要任职:湖南省数据传感与交换设备工程中心 主任 IEEE RS Chapter长沙 主席CCF普适计算专委 委员 CCF长沙 执委

毕业院校:中南大学

学科:信息与通信工程
计算机科学与技术

当前位置: 邓晓衡 >> 论文成果

X. Deng, J. Luo, L. He, et al. Cooperative channel allocation and scheduling in multi-interface wireless mesh networks[J]. Peer-to-peer Networking and Applications, 2019, 12: 1-12.

发布时间:2024-03-13

点击次数:

发表刊物:Peer-to-peer Networking and Applications

摘要:Cooperative channel allocation and scheduling are key issues in wireless mesh networks with multiple interfaces and multiple channels. In this paper, we propose a load balance link layer protocol (LBLP) aiming to cooperatively manage the interfaces and channels to improve network throughput. In LBLP, an interface can work in a sending or receiving mode. For the receiving interfaces, the channel assignment is proposed considering the number, position and status of the interfaces, and a task allocation algorithm based on the Huffman tree is developed to minimize the mutual interference. A dynamic link scheduling algorithm is designed for the sending interfaces, making the tradeoff between the end-to-end delay and the interface utilization. A portion of the interfaces can adjust their modes for load balancing according to the link status and the interface load. Simulation results show that the proposed LBLP can work with the existing routing protocols to improve the network throughput substantially and balance the load even when the switching delay is large.

备注:http://faculty.csu.edu.cn/dengxiaoheng/zh_CN/lwcg/10445/content/49260.htm

是否译文:

附件:

  • 49-Cooperative channel allocation and scheduling in multi-interface wireless mesh networks.pdf

  • 上一条: J. Luo, X. Deng, H. Zhang, et al. QoE-driven computation offloading for edge computing[J]. Journal of Systems Architecture, 2019, 97: 34-39.

    下一条: F. Zeng, Y. Ren, X. Deng, et al. Cost-effective edge server placement in wireless metropolitan area networks[J]. Sensors, 2018, 19(1): 32.