一种基于分组保留多址(PRMA)的多媒体无线系统算法

S. Elnoubi, A. Alsayh
{"title":"一种基于分组保留多址(PRMA)的多媒体无线系统算法","authors":"S. Elnoubi, A. Alsayh","doi":"10.1109/PIMRC.2001.965464","DOIUrl":null,"url":null,"abstract":"A medium access control (MAC) protocol to serve different kinds of traffic, namely voice, data, and, real time variable bit rate (rt-VBR) video is proposed. The transmission time scale is divided into frames. Each frame is subdivided into N time slots. A fixed number of slots M out of 150 time slots are reserved at the beginning of every frame to transmit some of the video packets arriving during the frame interval. The rest of the video packets contend with the voice and data packets for the remaining time slots of this frame as in normal packet reservation multiple access (PRMA). One objective of this paper is to find the optimum value of M allowing the maximum number of voice and data users to share the RF channel with one video user. Another objective is to find the optimum permission probabilities of sending contending voice, data, and video packets allowing the maximum number of users sharing the RF channel. The 0.00001 dropping probability requirement for video is examined.","PeriodicalId":318292,"journal":{"name":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A packet reservation multiple access (PRMA) based algorithm for multimedia wireless system\",\"authors\":\"S. Elnoubi, A. Alsayh\",\"doi\":\"10.1109/PIMRC.2001.965464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A medium access control (MAC) protocol to serve different kinds of traffic, namely voice, data, and, real time variable bit rate (rt-VBR) video is proposed. The transmission time scale is divided into frames. Each frame is subdivided into N time slots. A fixed number of slots M out of 150 time slots are reserved at the beginning of every frame to transmit some of the video packets arriving during the frame interval. The rest of the video packets contend with the voice and data packets for the remaining time slots of this frame as in normal packet reservation multiple access (PRMA). One objective of this paper is to find the optimum value of M allowing the maximum number of voice and data users to share the RF channel with one video user. Another objective is to find the optimum permission probabilities of sending contending voice, data, and video packets allowing the maximum number of users sharing the RF channel. The 0.00001 dropping probability requirement for video is examined.\",\"PeriodicalId\":318292,\"journal\":{\"name\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2001.965464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2001.965464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种适用于语音、数据和实时可变比特率(rt-VBR)视频等不同业务的介质访问控制协议。传输时间尺度被分成若干帧。每一帧被细分为N个时隙。在每帧开始时,150个时隙中预留固定的M个时隙,用于传输帧间隔内到达的部分视频数据包。其余的视频包与语音和数据包争夺这个帧的剩余时隙,就像普通的包保留多址访问(PRMA)一样。本文的一个目标是找到M的最优值,使最大数量的语音和数据用户与一个视频用户共享射频信道。另一个目标是找到发送竞争语音、数据和视频数据包的最佳许可概率,允许最大数量的用户共享射频信道。对视频的0.00001掉落概率要求进行了检验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A packet reservation multiple access (PRMA) based algorithm for multimedia wireless system
A medium access control (MAC) protocol to serve different kinds of traffic, namely voice, data, and, real time variable bit rate (rt-VBR) video is proposed. The transmission time scale is divided into frames. Each frame is subdivided into N time slots. A fixed number of slots M out of 150 time slots are reserved at the beginning of every frame to transmit some of the video packets arriving during the frame interval. The rest of the video packets contend with the voice and data packets for the remaining time slots of this frame as in normal packet reservation multiple access (PRMA). One objective of this paper is to find the optimum value of M allowing the maximum number of voice and data users to share the RF channel with one video user. Another objective is to find the optimum permission probabilities of sending contending voice, data, and video packets allowing the maximum number of users sharing the RF channel. The 0.00001 dropping probability requirement for video is examined.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信