基于等待时间和信道状态的轮询多址协议

doi:10.13190/jbupt.200804.126.023

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (4): 126-129.doi: 10.13190/jbupt.200804.126.023

基于等待时间和信道状态的轮询多址协议

张宇眉1，张欣1，杨大成1，赵东风2

1. 北京邮电大学电信工程学院, 北京 100876; 2. 云南大学通信工程系，昆明 650091)

收稿日期:2007-08-30 修回日期:1900-01-01 出版日期:2008-08-30 发布日期:2008-08-30
通讯作者: 张宇眉

Polling Multiple Access Protocol Based on the Waiting Time and Channel State

ZHANG Yu-mei1, ZHANG Xin1，YANG Da-cheng1，ZHAO Dong-feng2

1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. Department of Communication Engineering, Yunnan University, Kunming 650091, China)

Received:2007-08-30 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
Contact: ZHANG Yu-mei

摘要/Abstract

摘要：

提出了基于分组等待时间和信道状态的动态限定轮询多址协议。该协议根据各节点内分组的当前等待时间及信道状态动态的控制轮询过程，每个轮询周期对具有分组最长等待时间和好的信道状态的节点进行服务。在假设信道为两状态马尔可夫模型的基础上，通过采用嵌入马尔可夫链理论和休假排队模型，给出该协议的理论模型和性能分析，并且通过与基本轮询系统对比分析，可以看出所提出系统缩短了分组的平均等待时间，提高了系统吞吐量。
关键词: 中图分类号: 文献标识码: A
(Abstract: Key words:

关键词: 等待时间和信道状态, 轮询多址, Gillbert-Elliott信道模型, 休假排队模型, 平均时延, 吞吐量

Abstract:

Dynamic limited polling multiple access protocol based on waiting time of packets and channel state is proposed. This protocol adaptively controls the polling process according to the instantaneous waiting time of packets and the channel state for each node, and serves the one with the longest packet waiting time and good channel state first in each polling cycle. By means of imbedded Markov chain theory and vacation queue model, the model and its performance analysis of that protocol are given assuming that channel is modeled as a two-state Markov chain. By comparing with the basic polling system, it is shown that the proposed system can reduce the mean waiting time of packets and increase system throughput.

Key words: waiting time and channel state, polling multiple access, Gillbert-Elliott channel model, vacation queue model, mean waiting time, throughput

中图分类号:

TN929.53

张宇眉1，张欣1，杨大成1，赵东风2. 基于等待时间和信道状态的轮询多址协议[J]. 北京邮电大学学报, 2008, 31(4): 126-129.

ZHANG Yu-mei1, ZHANG Xin1，YANG Da-cheng1，ZHAO Dong-feng2
. Polling Multiple Access Protocol Based on the Waiting Time and Channel State[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(4): 126-129.

参考文献

[1] Konheim A G. Descendent set: an efficient approach for analysis of polling systems[J]. IEEE Transaction on Communication, 1994, 42(8): 1245-1253.
[2] 刘强, 张中兆, 张乃通. 排队优先权站点轮询系统的平均周期时间[J]. 通信学报, 1999, 20(2): 86-91. Liu Qiang, Zhang Zhongzhao, Zhang Naitong. Mean cyclic time of queueing priority station polling system[J]. Journal on Communications, 1999, 20(2): 86-91.
[3] Zheng J, Mouftah H T. Adaptive scheduling algorithms for Ethernet passive optical networks communications[J]. IEEE Proceedings-Communications, 2005, 152(5): 643-647.
[4] Zhang Yumei, Zhao Dongfeng. Analysis on the dynamic length of queue polling protocol for IEEE802.11 wireless LANs//Proceedings of the Tenth Joint International Computer Conference, JICC '04. Kunming: International Academic Publishers/World Publishing Corporation, 2004: 220-224.
[5] 张宇眉, 杨大成, 赵东风, 等. 基于队长参数的动态限定轮询多址协议分析[J]. 北京邮电大学学报, 2007, 30(3): 54-57. Zhang Yumei, Yang Dacheng, Zhao Dongfeng, et al. Analysis on the dynamic limited polling protocol based on parameter of queue length[J]. Journal of Beijing University of Posts and Telecommunications, 2007, 30(3): 54-57.
[6] Liu Qingwen, Wang Xin, Giannakis G B. A cross-layer scheduling algorithm with QoS support in wireless networks[J]. IEEE Transactions on Vehicular Technology, 2006, 55(3): 839-847.
[7] Fumio I, Gang U H. Delay performance under the joint scheduling over Gilbert-Elliot channel//Proceedings of Wireless Telecommunications Symposium. Pomona: IEEE, 2006: 1-7.
[8] Mowcheng L. Discrete-time limited 1-customer G/G/1 vacation queueing systems and asymmetric polling systems//Proceedings of the Global Telecommunications Conference. Singapore: IEEE, 1995: 92-96.

[1]	杨华, 耿烜, 孔宁. 一种采用dueling-DDQN算法的无线网络MAC协议[J]. 北京邮电大学学报, 2023, 46(3): 25-30.
[2]	王明伟, 李慧贞. Nakagami-m信道衰落下的多时隙能量收集无线通信[J]. 北京邮电大学学报, 2020, 43(4): 54-60.
[3]	郭少雄, 刘玉涛, 吕玉静, 张中兆. 多载波认知无线电无线携能通信资源分配算法[J]. 北京邮电大学学报, 2020, 43(3): 19-23.
[4]	程超, 滕俊杰, 赵艳领, 宋梅. 一种基于多智能体强化学习的流量分配算法[J]. 北京邮电大学学报, 2019, 42(6): 43-48,57.
[5]	李民政, 李艳峰. 多小区大规模分布式天线系统中下行链路能效研究[J]. 北京邮电大学学报, 2018, 41(6): 26-33.
[6]	赵季红, 张艳平, 曲桦, 徐西光. 多目标联合优化的移动中继选择策略[J]. 北京邮电大学学报, 2016, 39(3): 120-125.
[7]	赵季红, 闫飞宇, 曲桦, 宋亚兰, 徐西光. 整体优化的吞吐量预测中继选择策略[J]. 北京邮电大学学报, 2016, 39(2): 35-38,62.
[8]	李旭, 董猛, 刘颖, 刘天骄, 李司. 集中式多跳调度系统性能建模与协议参数优化[J]. 北京邮电大学学报, 2016, 39(2): 108-112.
[9]	金小敏, 刘元安, 范文浩, 吴帆, 张洪光. 面向多路径并行数据传输的动态路径选择方法[J]. 北京邮电大学学报, 2015, 38(5): 99-103.
[10]	王健, 黄韬, 谢人超. 启发式构建软件定义网络的控制消息路由树算法[J]. 北京邮电大学学报, 2015, 38(3): 82-87.
[11]	曲桦, 庄雄, 赵季红, 唐睿. 蜂窝网络下设备到设备通信中的联合资源优化[J]. 北京邮电大学学报, 2015, 38(3): 112-116.
[12]	李文, 王文博, 景晓军, 郑相全. 活跃路径选择对多径并行传输吞吐量影响分析[J]. 北京邮电大学学报, 2014, 37(6): 54-58.
[13]	段美霞, 张蕊. 透子网网络吞吐量测试设计[J]. 北京邮电大学学报, 2014, 37(4): 79-82,92.
[14]	曲桦, 徐西光, 赵季红, 李熠伟. 随机化竞争的LTE-A中继蜂窝小区边缘协作调度策略[J]. 北京邮电大学学报, 2014, 37(3): 73-77.
[15]	温景容武穆清吕博汪东洋. 非均匀多信道Ad Hoc网络信道选择方法[J]. 北京邮电大学学报, 2013, 36(2): 10-14.

基于等待时间和信道状态的轮询多址协议

Polling Multiple Access Protocol Based on the Waiting Time and Channel State

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价