总线网络的动态关联控制机制

Luobei Kuang, Ming Xu, Yingwen Chen, Bo Xie, Xiaoqiang Xiao
{"title":"总线网络的动态关联控制机制","authors":"Luobei Kuang, Ming Xu, Yingwen Chen, Bo Xie, Xiaoqiang Xiao","doi":"10.1109/ISCIT.2011.6089742","DOIUrl":null,"url":null,"abstract":"With multiple Access Points (APs) deployed around a bus stop, association control for bus networks is important since bus networks have their own characteristics of mobility and dynamic diversity (dynamic bus transmission rate, dynamic bus arrival and dynamic user arrival/departure). Combined with the predicted mobility, this paper investigates the association control mechanism for bus networks. We firstly construct a dynamic AP-Bus graph to describe the dynamics. Then the association problem is formulized to a linear integer programming problem based on the AP-Bus graph. As the problem is NP-Hard, two approximation integral solutions are proposed further. Through the simulation experiments, the dynamic solutions outperform traditional methods.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic association control mechanism for bus networks\",\"authors\":\"Luobei Kuang, Ming Xu, Yingwen Chen, Bo Xie, Xiaoqiang Xiao\",\"doi\":\"10.1109/ISCIT.2011.6089742\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With multiple Access Points (APs) deployed around a bus stop, association control for bus networks is important since bus networks have their own characteristics of mobility and dynamic diversity (dynamic bus transmission rate, dynamic bus arrival and dynamic user arrival/departure). Combined with the predicted mobility, this paper investigates the association control mechanism for bus networks. We firstly construct a dynamic AP-Bus graph to describe the dynamics. Then the association problem is formulized to a linear integer programming problem based on the AP-Bus graph. As the problem is NP-Hard, two approximation integral solutions are proposed further. Through the simulation experiments, the dynamic solutions outperform traditional methods.\",\"PeriodicalId\":226552,\"journal\":{\"name\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2011.6089742\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2011.6089742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于公交站点周围部署了多个接入点(ap),因此公交网络的关联控制非常重要,因为公交网络具有自己的移动性和动态多样性特征(动态公交传输速率、动态公交到达和动态用户到达/离开)。结合预测的出行情况,研究了公交网络的关联控制机制。我们首先构造一个动态AP-Bus图来描述动态。然后将关联问题形式化为基于AP-Bus图的线性整数规划问题。由于问题是NP-Hard,进一步提出了两种近似积分解。通过仿真实验,动态解优于传统方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A dynamic association control mechanism for bus networks
With multiple Access Points (APs) deployed around a bus stop, association control for bus networks is important since bus networks have their own characteristics of mobility and dynamic diversity (dynamic bus transmission rate, dynamic bus arrival and dynamic user arrival/departure). Combined with the predicted mobility, this paper investigates the association control mechanism for bus networks. We firstly construct a dynamic AP-Bus graph to describe the dynamics. Then the association problem is formulized to a linear integer programming problem based on the AP-Bus graph. As the problem is NP-Hard, two approximation integral solutions are proposed further. Through the simulation experiments, the dynamic solutions outperform traditional methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信