Distributed-queueing request update multiple access (DQRUMA) for wireless packet (ATM) networks

M. Karol, Zhao Liu, K. Eng
{"title":"Distributed-queueing request update multiple access (DQRUMA) for wireless packet (ATM) networks","authors":"M. Karol, Zhao Liu, K. Eng","doi":"10.1109/ICC.1995.524295","DOIUrl":null,"url":null,"abstract":"In a wireless packet (ATM) network that supports an integrated mix of multimedia traffic, the channel access protocol needs to be designed such that mobiles share the limited communications bandwidth in an efficient manner: maximizing the utilization of the frequency spectrum and minimizing the delay experienced by mobiles. In this paper, we propose and study an efficient demand assignment channel access protocol, which we call distributed-queueing request update multiple access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer transmission requests are placed collision-free by piggybacking the requests with packet transmissions. The simulation results show that even with the \"worst possible\" traffic characteristics, the delay-throughput performance of DQRUMA is close to the best possible with any access protocol. In addition, explicit slot-by-slot announcement of the \"transmit permissions\" gives the base station a lot of control over the order in which mobiles transmit their packets.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"242","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Communications ICC '95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1995.524295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 242

Abstract

In a wireless packet (ATM) network that supports an integrated mix of multimedia traffic, the channel access protocol needs to be designed such that mobiles share the limited communications bandwidth in an efficient manner: maximizing the utilization of the frequency spectrum and minimizing the delay experienced by mobiles. In this paper, we propose and study an efficient demand assignment channel access protocol, which we call distributed-queueing request update multiple access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer transmission requests are placed collision-free by piggybacking the requests with packet transmissions. The simulation results show that even with the "worst possible" traffic characteristics, the delay-throughput performance of DQRUMA is close to the best possible with any access protocol. In addition, explicit slot-by-slot announcement of the "transmit permissions" gives the base station a lot of control over the order in which mobiles transmit their packets.
无线分组(ATM)网络中的分布式排队请求更新多址(DQRUMA)
在支持多媒体业务综合混合的无线分组(ATM)网络中,需要设计信道访问协议,使移动设备以有效的方式共享有限的通信带宽:最大限度地利用频谱,最大限度地减少移动设备所经历的延迟。本文提出并研究了一种高效的需求分配通道访问协议,我们称之为分布式排队请求更新多址(DQRUMA)。该协议可用于广泛的应用和地理距离。移动设备只需要为到达空缓冲区的数据包向基站发送请求。对于到达非空缓冲区的数据包,通过将请求与数据包传输一起承载,请求被放置在无冲突的位置。仿真结果表明,即使在“最坏”的流量特性下,DQRUMA的延迟吞吐量性能也接近于任何接入协议的最佳性能。此外,对“传输权限”的显式逐槽公告使基站能够对移动设备传输数据包的顺序进行大量控制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信