{"title":"异构无线环境下多播组的网络选择","authors":"S. Boudko, W. Leister","doi":"10.1145/2536853.2536871","DOIUrl":null,"url":null,"abstract":"Coexistence of various wireless access networks and the ability of mobile terminals to switch between them make an optimal selection of serving networks for multicast groups a challenging problem. Since optimal network selection requires large dimensions of data to be collected from several network locations and sent between several network components, the scalability can easily become a bottleneck in large-scale systems. Therefore, reducing data exchange within heterogeneous wireless networks is important. We study the decision-making process and the data that needs to be sent between different network components. We present two decentralized solutions to this problem that operate with reduced sets of information. We define the upper and lower bounds to these solutions and evaluate them in the OMNet++ simulation environment. Both solutions provide a substantial improvement in performance compared to the lower bound.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Network Selection for Multicast Groups in Heterogeneous Wireless Environments\",\"authors\":\"S. Boudko, W. Leister\",\"doi\":\"10.1145/2536853.2536871\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coexistence of various wireless access networks and the ability of mobile terminals to switch between them make an optimal selection of serving networks for multicast groups a challenging problem. Since optimal network selection requires large dimensions of data to be collected from several network locations and sent between several network components, the scalability can easily become a bottleneck in large-scale systems. Therefore, reducing data exchange within heterogeneous wireless networks is important. We study the decision-making process and the data that needs to be sent between different network components. We present two decentralized solutions to this problem that operate with reduced sets of information. We define the upper and lower bounds to these solutions and evaluate them in the OMNet++ simulation environment. Both solutions provide a substantial improvement in performance compared to the lower bound.\",\"PeriodicalId\":135195,\"journal\":{\"name\":\"Advances in Mobile Multimedia\",\"volume\":\"115 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mobile Multimedia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2536853.2536871\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mobile Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2536853.2536871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Network Selection for Multicast Groups in Heterogeneous Wireless Environments
Coexistence of various wireless access networks and the ability of mobile terminals to switch between them make an optimal selection of serving networks for multicast groups a challenging problem. Since optimal network selection requires large dimensions of data to be collected from several network locations and sent between several network components, the scalability can easily become a bottleneck in large-scale systems. Therefore, reducing data exchange within heterogeneous wireless networks is important. We study the decision-making process and the data that needs to be sent between different network components. We present two decentralized solutions to this problem that operate with reduced sets of information. We define the upper and lower bounds to these solutions and evaluate them in the OMNet++ simulation environment. Both solutions provide a substantial improvement in performance compared to the lower bound.