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":"81 1","pages":"0"},"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\":\"81 1\",\"pages\":\"0\"},\"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}
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.