服务优先级依赖车辆对热点通信的机会调度

Riya Bansal, A. Shrivastava, A. Yadav
{"title":"服务优先级依赖车辆对热点通信的机会调度","authors":"Riya Bansal, A. Shrivastava, A. Yadav","doi":"10.1109/ICIINFS.2016.8262909","DOIUrl":null,"url":null,"abstract":"Vehicular communication system is highly dynamic system. The scheduling algorithm plays an important role in providing the maximum service to the vehicular users. Various types of services may be provided to the vehicle on request like audio/ video entertainment, map information (Hotels, shops etc.), routing information and emergency information like Hospital, Police and Traffic congestion etc. Due to limited number of channels and limited time for data transmission, service priority is required for transmission. Further the service time optimization is required depending upon the maximum possible speed of a vehicle. In this paper, an opportunistic scheduling algorithm with service priority and holding users are proposed. The concept of holding users enhances the service fairness and maximum services provided by hotspot. The simulation results show the clear advantage of proposed opportunistic scheduling algorithm over existing priority based NDS algorithm.","PeriodicalId":234609,"journal":{"name":"2016 11th International Conference on Industrial and Information Systems (ICIIS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Service priority dependent vehicle to hotspot communication opportunistic scheduling\",\"authors\":\"Riya Bansal, A. Shrivastava, A. Yadav\",\"doi\":\"10.1109/ICIINFS.2016.8262909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular communication system is highly dynamic system. The scheduling algorithm plays an important role in providing the maximum service to the vehicular users. Various types of services may be provided to the vehicle on request like audio/ video entertainment, map information (Hotels, shops etc.), routing information and emergency information like Hospital, Police and Traffic congestion etc. Due to limited number of channels and limited time for data transmission, service priority is required for transmission. Further the service time optimization is required depending upon the maximum possible speed of a vehicle. In this paper, an opportunistic scheduling algorithm with service priority and holding users are proposed. The concept of holding users enhances the service fairness and maximum services provided by hotspot. The simulation results show the clear advantage of proposed opportunistic scheduling algorithm over existing priority based NDS algorithm.\",\"PeriodicalId\":234609,\"journal\":{\"name\":\"2016 11th International Conference on Industrial and Information Systems (ICIIS)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 11th International Conference on Industrial and Information Systems (ICIIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIINFS.2016.8262909\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 11th International Conference on Industrial and Information Systems (ICIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIINFS.2016.8262909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

车载通信系统是一个高度动态的系统。调度算法对向车辆用户提供最大限度的服务起着重要作用。可应要求向车辆提供各种服务,如音频/视频娱乐、地图信息(酒店、商店等)、路线信息和紧急信息,如医院、警察和交通拥堵等。由于信道数量有限,数据传输时间有限,传输需要业务优先。此外,根据车辆的最大可能速度,需要优化服务时间。提出了一种具有服务优先级和保留用户的机会调度算法。持有用户的概念增强了服务公平性和热点提供的服务最大化。仿真结果表明,与现有的基于优先级的NDS算法相比,该算法具有明显的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Service priority dependent vehicle to hotspot communication opportunistic scheduling
Vehicular communication system is highly dynamic system. The scheduling algorithm plays an important role in providing the maximum service to the vehicular users. Various types of services may be provided to the vehicle on request like audio/ video entertainment, map information (Hotels, shops etc.), routing information and emergency information like Hospital, Police and Traffic congestion etc. Due to limited number of channels and limited time for data transmission, service priority is required for transmission. Further the service time optimization is required depending upon the maximum possible speed of a vehicle. In this paper, an opportunistic scheduling algorithm with service priority and holding users are proposed. The concept of holding users enhances the service fairness and maximum services provided by hotspot. The simulation results show the clear advantage of proposed opportunistic scheduling algorithm over existing priority based NDS algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信