Network selection in heterogeneous wireless environments

Kosmides, P; Rouskas, A; Anagnostou, M

dc.contributor.author	Kosmides, P	en
dc.contributor.author	Rouskas, A	en
dc.contributor.author	Anagnostou, M	en
dc.date.accessioned	2014-03-01T02:47:25Z
dc.date.available	2014-03-01T02:47:25Z
dc.date.issued	2011	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33136
dc.subject	greedy heuristic	en
dc.subject	heterogeneous wireless networks	en
dc.subject	network selection	en
dc.subject	optimization	en
dc.subject.other	Bin-packing	en
dc.subject.other	Capacity resources	en
dc.subject.other	Greedy heuristics	en
dc.subject.other	Heterogeneous wireless network	en
dc.subject.other	Multimode terminals	en
dc.subject.other	network selection	en
dc.subject.other	NP-hard	en
dc.subject.other	Optimization function	en
dc.subject.other	Optimization problems	en
dc.subject.other	Radio access technologies	en
dc.subject.other	Terminal assignment	en
dc.subject.other	Wireless access networks	en
dc.subject.other	Wireless environment	en
dc.subject.other	Information technology	en
dc.subject.other	Optimization	en
dc.subject.other	Rats	en
dc.subject.other	Telecommunication	en
dc.subject.other	Wireless networks	en
dc.title	Network selection in heterogeneous wireless environments	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/CTS.2011.5898929	en
heal.identifier.secondary	http://dx.doi.org/10.1109/CTS.2011.5898929	en
heal.identifier.secondary	5898929	en
heal.publicationDate	2011	en
heal.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. © 2011 IEEE.	en
heal.journalName	2011 18th International Conference on Telecommunications, ICT 2011	en
dc.identifier.doi	10.1109/CTS.2011.5898929	en
dc.identifier.spage	250	en
dc.identifier.epage	255	en