一种新颖的4G MAC协议,通过连续分组和资源重新分配来保证CBR通信网络的高QoS和高容量,从而大大减少争用小时隙冲突

A. Kamal
{"title":"一种新颖的4G MAC协议,通过连续分组和资源重新分配来保证CBR通信网络的高QoS和高容量,从而大大减少争用小时隙冲突","authors":"A. Kamal","doi":"10.1109/SECON.2007.342867","DOIUrl":null,"url":null,"abstract":"The authors previously showed that high QoS and capacity in CBR communications networks can be achieved by the user-group-division method. The novel MAC protocol based on this method and fundamental theories and postulates (supported by the CBR network environment) required to develop the protocol are presented here. No change in hardware or standards is required to implement this protocol and the protocol can be executed on the mobile stations (ms) or cable modems (cm) from the base station (BS) or head-end (HE). Initially, the protocol divides up the network into groups formed by one contention mini-slot (cms) per region and a group of users (with the group size equals the avg. number of users per cms in the network) allocated to that particular cms. Afterwards, the cms bandwidth is re-allocated inter-regionally (regrouped) and the total channel bandwidth is re-distributed between the cms and ds (data slot) based on the feedback received on the collision and available resource (bandwidth) conditions of the network during the previous round-trip time (rtt). The protocol is executed in the network at each rtt by running the feedback mechanism, regrouping, and re-distributing the bandwidth. The advanced network simulator (ANS-1) written in MATLAB using my novel abstractions and the novel Nasrin traffic generation and distribution model are used to evaluate the protocol in a flexible and reliable network simulation environment. The results showed high fair utilization and low waste of the required cms and data bandwidth with high collision reduction. The proposed approach accomplishes a record 80% cms collision reduction and 85% cms and 100% data bandwidth utilization (guaranteeing high QoS and capacity) while providing high controllability to the BS/HE for reducing the probability of collisions. The protocol achieves these improvements by distributing the cms to small groups of users (reducing the probabilities of uncontrollable and high collisions), repeating its execution (thinning the accumulation and repetitions of collisions), and managing the ds and cms resource requirements with feedback to allocate the resources to the needy regions (reducing the probabilities of buildup and recurrences of collisions).","PeriodicalId":423683,"journal":{"name":"Proceedings 2007 IEEE SoutheastCon","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel 4G MAC protocol guaranteeing high QoS and capacity in CBR communications networks by continuous group divisions and resource re-allocations to considerably reduce contention mini-slot collisions\",\"authors\":\"A. Kamal\",\"doi\":\"10.1109/SECON.2007.342867\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors previously showed that high QoS and capacity in CBR communications networks can be achieved by the user-group-division method. The novel MAC protocol based on this method and fundamental theories and postulates (supported by the CBR network environment) required to develop the protocol are presented here. No change in hardware or standards is required to implement this protocol and the protocol can be executed on the mobile stations (ms) or cable modems (cm) from the base station (BS) or head-end (HE). Initially, the protocol divides up the network into groups formed by one contention mini-slot (cms) per region and a group of users (with the group size equals the avg. number of users per cms in the network) allocated to that particular cms. Afterwards, the cms bandwidth is re-allocated inter-regionally (regrouped) and the total channel bandwidth is re-distributed between the cms and ds (data slot) based on the feedback received on the collision and available resource (bandwidth) conditions of the network during the previous round-trip time (rtt). The protocol is executed in the network at each rtt by running the feedback mechanism, regrouping, and re-distributing the bandwidth. The advanced network simulator (ANS-1) written in MATLAB using my novel abstractions and the novel Nasrin traffic generation and distribution model are used to evaluate the protocol in a flexible and reliable network simulation environment. The results showed high fair utilization and low waste of the required cms and data bandwidth with high collision reduction. The proposed approach accomplishes a record 80% cms collision reduction and 85% cms and 100% data bandwidth utilization (guaranteeing high QoS and capacity) while providing high controllability to the BS/HE for reducing the probability of collisions. The protocol achieves these improvements by distributing the cms to small groups of users (reducing the probabilities of uncontrollable and high collisions), repeating its execution (thinning the accumulation and repetitions of collisions), and managing the ds and cms resource requirements with feedback to allocate the resources to the needy regions (reducing the probabilities of buildup and recurrences of collisions).\",\"PeriodicalId\":423683,\"journal\":{\"name\":\"Proceedings 2007 IEEE SoutheastCon\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2007 IEEE SoutheastCon\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECON.2007.342867\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2007 IEEE SoutheastCon","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2007.342867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

作者先前已经证明,在CBR通信网络中,通过用户组划分方法可以实现高QoS和高容量。本文介绍了基于该方法的新型MAC协议,以及开发该协议所需的基本理论和假设(在CBR网络环境的支持下)。实现该协议不需要改变硬件或标准,并且该协议可以在距离基站(BS)或前端(HE)的移动站(ms)或电缆调制解调器(cm)上执行。最初,该协议将网络划分为组,每个区域有一个竞争迷你槽(cms)和分配给该特定cms的一组用户(组的大小等于网络中每个cms的平均用户数)。然后,根据接收到的前一次往返时间(rtt)内网络的碰撞和可用资源(带宽)情况的反馈,在cms和ds(数据槽)之间重新分配cms带宽(regrouped)和信道总带宽(ds)。该协议通过运行反馈机制、重新分组和重新分配带宽在网络中每次rtt执行。使用MATLAB编写的先进网络模拟器(ANS-1)和新颖的Nasrin流量生成和分布模型,在灵活可靠的网络仿真环境中对协议进行了评估。结果表明,该算法对所需的cms和数据带宽的合理利用率高,浪费少,碰撞减少率高。提出的方法实现了创纪录的80% cms的碰撞减少,85% cms和100%的数据带宽利用率(保证高QoS和容量),同时为BS/HE提供了高可控性,以降低碰撞概率。该协议通过将cms分发给一小群用户(减少不可控和高冲突的概率)、重复执行(减少冲突的积累和重复)以及通过反馈管理ds和cms资源需求来将资源分配给需要的区域(减少冲突的积累和重复的概率)来实现这些改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A novel 4G MAC protocol guaranteeing high QoS and capacity in CBR communications networks by continuous group divisions and resource re-allocations to considerably reduce contention mini-slot collisions
The authors previously showed that high QoS and capacity in CBR communications networks can be achieved by the user-group-division method. The novel MAC protocol based on this method and fundamental theories and postulates (supported by the CBR network environment) required to develop the protocol are presented here. No change in hardware or standards is required to implement this protocol and the protocol can be executed on the mobile stations (ms) or cable modems (cm) from the base station (BS) or head-end (HE). Initially, the protocol divides up the network into groups formed by one contention mini-slot (cms) per region and a group of users (with the group size equals the avg. number of users per cms in the network) allocated to that particular cms. Afterwards, the cms bandwidth is re-allocated inter-regionally (regrouped) and the total channel bandwidth is re-distributed between the cms and ds (data slot) based on the feedback received on the collision and available resource (bandwidth) conditions of the network during the previous round-trip time (rtt). The protocol is executed in the network at each rtt by running the feedback mechanism, regrouping, and re-distributing the bandwidth. The advanced network simulator (ANS-1) written in MATLAB using my novel abstractions and the novel Nasrin traffic generation and distribution model are used to evaluate the protocol in a flexible and reliable network simulation environment. The results showed high fair utilization and low waste of the required cms and data bandwidth with high collision reduction. The proposed approach accomplishes a record 80% cms collision reduction and 85% cms and 100% data bandwidth utilization (guaranteeing high QoS and capacity) while providing high controllability to the BS/HE for reducing the probability of collisions. The protocol achieves these improvements by distributing the cms to small groups of users (reducing the probabilities of uncontrollable and high collisions), repeating its execution (thinning the accumulation and repetitions of collisions), and managing the ds and cms resource requirements with feedback to allocate the resources to the needy regions (reducing the probabilities of buildup and recurrences of collisions).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Gaussian particle filtering for tracking maneuvering targets Three level back-to-back HVDC based on H-bridge converter Demonstration of a high-resolution optical interrogation method for sampled fiber Bragg sensor Reduced current class AB radio receiver stages using novel superlinear transistors with parallel NMOS and PMOS transistors at one GHz Development and evaluation of an educational computer network software
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1