{"title":"异构无线环境下的网络选择","authors":"Pavlos Kosmides, A. Rouskas, M. Anagnostou","doi":"10.1109/CTS.2011.5898929","DOIUrl":null,"url":null,"abstract":"The evolution of wireless access networks has led to the vision of an integrated heterogeneous wireless environment consisting of various Radio Access Technologies (RATs). In such an environment, users with multimode terminals can seamlessly change from one RAT to another RAT attempting to maximize their satisfaction level, while providers may carefully utilize without overloading their subsystems. In this paper, we focus on the Network Selection problem to allocate terminals to most appropriate RATs by jointly examining both users and providers' preferences. We introduce a utility-based optimization function and formulate the terminal assignment problem as an optimization problem which is recognized as NP-hard. We propose a Greedy heuristic which exploits a metric that measures the utility gained versus the capacity resource spent for each allocation and confirm its superior performance against three Bin-Packing heuristics.","PeriodicalId":142306,"journal":{"name":"2011 18th International Conference on Telecommunications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Network selection in heterogeneous wireless environments\",\"authors\":\"Pavlos Kosmides, A. Rouskas, M. Anagnostou\",\"doi\":\"10.1109/CTS.2011.5898929\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The evolution of wireless access networks has led to the vision of an integrated heterogeneous wireless environment consisting of various Radio Access Technologies (RATs). In such an environment, users with multimode terminals can seamlessly change from one RAT to another RAT attempting to maximize their satisfaction level, while providers may carefully utilize without overloading their subsystems. In this paper, we focus on the Network Selection problem to allocate terminals to most appropriate RATs by jointly examining both users and providers' preferences. We introduce a utility-based optimization function and formulate the terminal assignment problem as an optimization problem which is recognized as NP-hard. We propose a Greedy heuristic which exploits a metric that measures the utility gained versus the capacity resource spent for each allocation and confirm its superior performance against three Bin-Packing heuristics.\",\"PeriodicalId\":142306,\"journal\":{\"name\":\"2011 18th International Conference on Telecommunications\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 18th International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CTS.2011.5898929\",\"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 18th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTS.2011.5898929","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Network selection in heterogeneous wireless environments
The evolution of wireless access networks has led to the vision of an integrated heterogeneous wireless environment consisting of various Radio Access Technologies (RATs). In such an environment, users with multimode terminals can seamlessly change from one RAT to another RAT attempting to maximize their satisfaction level, while providers may carefully utilize without overloading their subsystems. In this paper, we focus on the Network Selection problem to allocate terminals to most appropriate RATs by jointly examining both users and providers' preferences. We introduce a utility-based optimization function and formulate the terminal assignment problem as an optimization problem which is recognized as NP-hard. We propose a Greedy heuristic which exploits a metric that measures the utility gained versus the capacity resource spent for each allocation and confirm its superior performance against three Bin-Packing heuristics.