{"title":"A Statistical Priority-Based Scheduling Metric for M2M Communications in LTE Networks","authors":"Ahmed Elhamy Mostafa;Yasser Gadallah","doi":"10.1109/ACCESS.2017.2700409","DOIUrl":null,"url":null,"abstract":"Resource allocation, or scheduling, is one of the main challenges that face supporting machine-to-machine (M2M) communications on long term evolution networks. M2M traffic has unique characteristics. It generally consists of a large number of small data packets, with specific deadlines, generated by a potentially massive number of devices contending over the scarce radio resources. In this paper, we introduce a novel M2M scheduling metric that we term the “statistical priority”. Statistical priority is a term that indicates the uniqueness of the information carried by certain data packets sent by machine-type communications devices (MTCDs). If an MTCD data unit is significantly dissimilar to the previously sent data, it is considered to carry non-redundant information. Consequently, it would be assigned higher statistical priority, and this MTCD should then be given higher priority in the scheduling process. Using this proposed metric in scheduling, the scarce radio resources would be used for transmitting statistically important information rather than repetitive data, which is a common situation in M2M communications. Simulation results show that our proposed statistical priority-based scheduler outperforms the other baseline schedulers in terms of having the least number of deadline misses (less than 4%) for critical data packets. In addition, our scheduler outperforms the other baseline schedulers in non-redundant data transmission as it achieves a success ratio of at least 70%.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"5 ","pages":"8106-8117"},"PeriodicalIF":3.6000,"publicationDate":"2017-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ACCESS.2017.2700409","citationCount":"40","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/7916903/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 40
Abstract
Resource allocation, or scheduling, is one of the main challenges that face supporting machine-to-machine (M2M) communications on long term evolution networks. M2M traffic has unique characteristics. It generally consists of a large number of small data packets, with specific deadlines, generated by a potentially massive number of devices contending over the scarce radio resources. In this paper, we introduce a novel M2M scheduling metric that we term the “statistical priority”. Statistical priority is a term that indicates the uniqueness of the information carried by certain data packets sent by machine-type communications devices (MTCDs). If an MTCD data unit is significantly dissimilar to the previously sent data, it is considered to carry non-redundant information. Consequently, it would be assigned higher statistical priority, and this MTCD should then be given higher priority in the scheduling process. Using this proposed metric in scheduling, the scarce radio resources would be used for transmitting statistically important information rather than repetitive data, which is a common situation in M2M communications. Simulation results show that our proposed statistical priority-based scheduler outperforms the other baseline schedulers in terms of having the least number of deadline misses (less than 4%) for critical data packets. In addition, our scheduler outperforms the other baseline schedulers in non-redundant data transmission as it achieves a success ratio of at least 70%.
IEEE AccessCOMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍:
IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest.
IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on:
Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals.
Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering.
Development of new or improved fabrication or manufacturing techniques.
Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.