蜂窝网络中的脂肪时间优化协议

Shiven Chawla, Sakshi Agarwal
{"title":"蜂窝网络中的脂肪时间优化协议","authors":"Shiven Chawla, Sakshi Agarwal","doi":"10.1109/IC3.2014.6897150","DOIUrl":null,"url":null,"abstract":"As the widespread of cellular networks is broadening, the volumes of end-users also keep on increasing exponentially. Amongst the primeval issues, the concern of providing high throughput along with a decent fairness, surfaces with the ever expanding reign of cellular networks. The present-day algorithms such as Max-Rate, Round-Robin and Proportional-Fair algorithm are getting cast-out in the sprint for providing a dependable solution to this problem in effect with such vast volume of users. We have developed a scheduling algorithm for the receiving stations based upon the fat-time scheduling criteria. The algorithm aims at providing fairness and an increased throughput between mobile stations (having constantly changing channel conditions) by exponentially decreasing or increasing the differential factor of the rate of transmission of data under consistent condition of no noise, or Doppler shift, reflection, diffraction or scattering.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fat time optimization protocol in cellular networks\",\"authors\":\"Shiven Chawla, Sakshi Agarwal\",\"doi\":\"10.1109/IC3.2014.6897150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the widespread of cellular networks is broadening, the volumes of end-users also keep on increasing exponentially. Amongst the primeval issues, the concern of providing high throughput along with a decent fairness, surfaces with the ever expanding reign of cellular networks. The present-day algorithms such as Max-Rate, Round-Robin and Proportional-Fair algorithm are getting cast-out in the sprint for providing a dependable solution to this problem in effect with such vast volume of users. We have developed a scheduling algorithm for the receiving stations based upon the fat-time scheduling criteria. The algorithm aims at providing fairness and an increased throughput between mobile stations (having constantly changing channel conditions) by exponentially decreasing or increasing the differential factor of the rate of transmission of data under consistent condition of no noise, or Doppler shift, reflection, diffraction or scattering.\",\"PeriodicalId\":444918,\"journal\":{\"name\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2014.6897150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2014.6897150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着蜂窝网络的普及,终端用户的数量也呈指数级增长。在这些原始问题中,提供高吞吐量和良好公平性的问题随着蜂窝网络的不断扩大而浮出水面。目前的算法,如Max-Rate、Round-Robin和Proportional-Fair算法,在为如此庞大的用户提供可靠的解决方案的冲刺中被淘汰。本文提出了一种基于实时调度准则的接收站调度算法。该算法的目的是通过在无噪声、无多普勒频移、反射、衍射或散射等一致条件下,指数降低或增加数据传输速率的差分因子,以提供公平性和增加移动站(信道条件不断变化)之间的吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fat time optimization protocol in cellular networks
As the widespread of cellular networks is broadening, the volumes of end-users also keep on increasing exponentially. Amongst the primeval issues, the concern of providing high throughput along with a decent fairness, surfaces with the ever expanding reign of cellular networks. The present-day algorithms such as Max-Rate, Round-Robin and Proportional-Fair algorithm are getting cast-out in the sprint for providing a dependable solution to this problem in effect with such vast volume of users. We have developed a scheduling algorithm for the receiving stations based upon the fat-time scheduling criteria. The algorithm aims at providing fairness and an increased throughput between mobile stations (having constantly changing channel conditions) by exponentially decreasing or increasing the differential factor of the rate of transmission of data under consistent condition of no noise, or Doppler shift, reflection, diffraction or scattering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信