A Comparison Between MADM Methods and Utility Functions in the Network Selection Context

2019 ◽  
pp. 201-210
Author(s):  
Mouad Mansouri ◽  
Cherkaoui Leghris
Keyword(s):  
Utility Functions ◽  
Network Selection

scholarly journals An Analysis of the Network Selection Problem for Heterogeneous Environments with User-Operator Joint Satisfaction and Multi-RAT Transmission

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
J. J. Escudero-Garzás ◽  
C. Bousoño-Calzón
Keyword(s):  
Wireless Networks ◽  
Quality Of Service ◽  
Heterogeneous Networks ◽  
Network Topology ◽  
Utility Functions ◽  
Selection Problem ◽  
Network Selection ◽  
Heterogeneous Environments ◽  
Radio Access

The trend in wireless networks is that several wireless radio access technologies (RATs) coexist in the same area, forming heterogeneous networks in which the users may connect to any of the available RATs. The problem of associating a user to the most suitable RAT, known as network selection problem (NSP), is of capital importance for the satisfaction of the users in these emerging environments. However, also the satisfaction of the operator is important in this scenario. In this work, we propose that a connection may be served by more than one RAT by using multi-RAT terminals. We formulate the NSP with multiple RAT association based on utility functions that take into consideration both user’s satisfaction and provider’s satisfaction. As users are characterized according to their expected quality of service, our results exhaustively analyze the influence of the user’s profile, along with the network topology and the type of applications served.

A throughput-aware joint vehicle route and access network selection approach based on SMDP

2020 ◽  
Vol 17 (5) ◽  
pp. 243-265 ◽  
Author(s):  
Jiandong Xie ◽  
Sa Xiao ◽  
Ying-Chang Liang ◽  
Li Wang ◽  
Jun Fang
Keyword(s):  
Access Network ◽  
Network Selection ◽  
Vehicle Route ◽  
Selection Approach ◽  
Access Network Selection

Network Selection in Wireless Heterogeneous Environment Based on Available Bandwidth Estimation

2019 ◽  
Vol 12 ◽  
Author(s):  
Kiran Ahuja ◽  
Brahmjit Singh ◽  
Rajesh Khanna
Keyword(s):  
Real Time ◽  
Estimation Error ◽  
Network Selection ◽  
Bandwidth Estimation ◽  
Heterogeneous Environment ◽  
Bootstrap Approximation ◽  
Available Bandwidth ◽  
Internet Connection ◽  
Available Bandwidth Estimation ◽  
Selection Of

Background: With the availability of multiple options in wireless network simultaneously, Always Best Connected (ABC) requires dynamic selection of the best network and access technologies. Objective: In this paper, a novel dynamic access network selection algorithm based on the real time is proposed. The available bandwidth (ABW) of each network is required to be estimated to solve the network selection problem. Method: Proposed algorithm estimates available bandwidth by taking averages, peaks, low points and bootstrap approximation for network selection. It monitors real-time internet connection and resolves the selection issue in internet connection. The proposed algorithm is capable of adapting to prevailing network conditions in heterogeneous environment of 2G, 3G and WLAN networks without user intervention. It is implemented in temporal and spatial domains to check its robustness. Estimation error, overhead, estimation time with the varying size of traffic and reliability are used as the performance metrics. Results: Through numerical results, it is shown that the proposed algorithm’s ABW estimation based on bootstrap approximation gives improved performance in terms of estimation error (less than 20%), overhead (varies from 0.03% to 83%) and reliability (approx. 99%) with respect to existing techniques. Conclusion: Our proposed methodology of network selection criterion estimates the available bandwidth by taking averages, peaks, and low points and bootstrap approximation method (standard deviation) for the selection of network in the wireless heterogeneous environment. It monitors real-time internet connection and resolves internet connections selection issue. All the real-time usage and test results demonstrate the productivity and adequacy of available bandwidth estimation with bootstrap approximation as a practical solution for consistent correspondence among heterogeneous wireless networks by precise network selection for multimedia services.

User-Driven Network Selection during Vertical Handover in 4G Networks

2017 ◽  
Vol 10 ◽  
pp. 1
Author(s):  
Abubakar Muhammad Miyim ◽  
Mahamod Ismail ◽  
Rosdiadee Nordin
Keyword(s):  
Blocking Probability ◽  
Service Selection ◽  
Vertical Handover ◽  
Network Selection ◽  
Selection Strategy ◽  
Intelligent Network ◽  
Decision Algorithm ◽  
Radio Access ◽  
Service Application ◽  
Multi Access

The importance of network selection for wireless networks, is to facilitate users with various personal wireless devices to access their desired services via a range of available radio access networks. The inability of these networks to provide broadband data service applications to users poses a serious challenge in the wireless environment. Network Optimization has therefore become necessary, so as to accommodate the increasing number of users’ service application demands while maintaining the required quality of services. To achieve that, the need to incorporate intelligent and fast mechanism as a solution to select the best value network for the user arises. This paper provides an intelligent network selection strategy based on the user- and network-valued metrics to suit their preferences when communicating in multi-access environment. A user-driven network selection strategy that employs Multi-Access Service Selection Vertical Handover Decision Algorithm (MASS-VHDA) via three interfaces; Wi-Fi, WiMAX and LTE-A is proposed, numerically evaluated and simulated. The results from the performance analysis demonstrate some improvement in the QoS and network blocking probability to satisfy user application requests for multiple simultaneous services.

A Model for Applying Information and Utility Functions

1963 ◽  
Vol 30 (3) ◽  
pp. 267-273 ◽  
Author(s):  
David Harrah
Keyword(s):  
Utility Functions

scholarly journals Pareto Efficient Auctions with Interest Rates

2019 ◽  
Vol 33 ◽  
pp. 1989-1995
Author(s):  
Gagan Goel ◽  
Vahab Mirrokni ◽  
Renato Paes Leme
Keyword(s):  
Interest Rate ◽  
Interest Rates ◽  
Utility Functions ◽  
Limited Access ◽  
Incentive Compatible ◽  
Pareto Efficient ◽  
Available Resources

We consider auction settings in which agents have limited access to monetary resources but are able to make payments larger than their available resources by taking loans with a certain interest rate. This setting is a strict generalization of budget constrained utility functions (which corresponds to infinite interest rates). Our main result is an incentive compatible and Pareto-efficient auction for a divisible multi-unit setting with 2 players who are able to borrow money with the same interest rate. The auction is an ascending price clock auction that bears some similarities to the clinching auction but at the same time is a considerable departure from this framework: allocated goods can be de-allocated in future and given to other agents and prices for previously allocated goods can be raised.

Sign in / Sign up

Export Citation Format

Share Document