一种新的城市密集部署无线基站调度算法

H. Yamaguchi, Akihito Hiromori, T. Higashino, Shigeki Umehara, Hirofumi Urayama, M. Yamada, T. Maeno, S. Kaneda, M. Takai
{"title":"一种新的城市密集部署无线基站调度算法","authors":"H. Yamaguchi, Akihito Hiromori, T. Higashino, Shigeki Umehara, Hirofumi Urayama, M. Yamada, T. Maeno, S. Kaneda, M. Takai","doi":"10.1145/2507924.2507939","DOIUrl":null,"url":null,"abstract":"This paper presents a scheduling algorithm for a set of wireless stations such as road-side access points for vehicular networks and outdoor WiFi stations, which are deployed in wide urban areas and may compete with each other for limited wireless resources. Different from a number of conventional approaches most of which consider detailed information on individual stations and signal interference among them, we focus more on geography of the areas of interest, and provide a novel algorithm that pursues the best balance among (i) optimality of resource utilization, (ii) robustness to new station installation and traffic demand changes, and (iii) scalability to the population of stations and area size. We have confirmed the performance by experimental simulations with several scenarios, and the applicability of approach has been testified by a case study on a scheduling problem for roadside access points of vehicular networks in cooperation with a manufacturing corporation.","PeriodicalId":445138,"journal":{"name":"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel scheduling algorithm for densely-deployed wireless stations in urban areas\",\"authors\":\"H. Yamaguchi, Akihito Hiromori, T. Higashino, Shigeki Umehara, Hirofumi Urayama, M. Yamada, T. Maeno, S. Kaneda, M. Takai\",\"doi\":\"10.1145/2507924.2507939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a scheduling algorithm for a set of wireless stations such as road-side access points for vehicular networks and outdoor WiFi stations, which are deployed in wide urban areas and may compete with each other for limited wireless resources. Different from a number of conventional approaches most of which consider detailed information on individual stations and signal interference among them, we focus more on geography of the areas of interest, and provide a novel algorithm that pursues the best balance among (i) optimality of resource utilization, (ii) robustness to new station installation and traffic demand changes, and (iii) scalability to the population of stations and area size. We have confirmed the performance by experimental simulations with several scenarios, and the applicability of approach has been testified by a case study on a scheduling problem for roadside access points of vehicular networks in cooperation with a manufacturing corporation.\",\"PeriodicalId\":445138,\"journal\":{\"name\":\"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2507924.2507939\",\"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 of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2507924.2507939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种针对一组无线站的调度算法,这些无线站如车辆网络的路边接入点和室外WiFi站,部署在广阔的城市区域,可能会相互竞争有限的无线资源。与许多传统方法不同,大多数方法考虑单个站点和信号干扰的详细信息,我们更关注感兴趣区域的地理位置,并提供一种新的算法,追求(i)资源利用的最优性,(ii)对新站点安装和交通需求变化的鲁棒性,以及(iii)站点数量和区域大小的可扩展性之间的最佳平衡。通过多个场景的仿真实验验证了该方法的有效性,并通过与某制造企业合作的汽车网络路边接入点调度问题验证了该方法的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel scheduling algorithm for densely-deployed wireless stations in urban areas
This paper presents a scheduling algorithm for a set of wireless stations such as road-side access points for vehicular networks and outdoor WiFi stations, which are deployed in wide urban areas and may compete with each other for limited wireless resources. Different from a number of conventional approaches most of which consider detailed information on individual stations and signal interference among them, we focus more on geography of the areas of interest, and provide a novel algorithm that pursues the best balance among (i) optimality of resource utilization, (ii) robustness to new station installation and traffic demand changes, and (iii) scalability to the population of stations and area size. We have confirmed the performance by experimental simulations with several scenarios, and the applicability of approach has been testified by a case study on a scheduling problem for roadside access points of vehicular networks in cooperation with a manufacturing corporation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信