{"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}
引用次数: 0
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.