scholarly journals A Hierarchical Resource Allocation Scheme Based on Nash Bargaining Game in VANET

Information ◽  
2019 ◽  
Vol 10 (6) ◽  
pp. 196
Author(s):  
Xiaoshuai Zhao ◽  
Xiaoyong Zhang ◽  
Yingjuan Li
Keyword(s):  
Resource Allocation ◽  
Bargaining Game ◽  
Allocation Problem ◽  
Nash Bargaining ◽  
Resource Allocation Problem ◽  
Allocation Scheme ◽  
Computational Overhead ◽  
Nash Bargaining Game ◽  
The Difference ◽  
Resource Allocation Scheme

Due to the selfishness of vehicles and the scarcity of spectrum resources, how to realize fair and effective spectrum resources allocation has become one of the primary tasks in VANET. In this paper, we propose a hierarchical resource allocation scheme based on Nash bargaining game. Firstly, we analyze the spectrum resource allocation problem between different Road Side Units (RSUs), which obtain resources from the central cloud. Thereafter, considering the difference of vehicular users (VUEs), we construct the matching degree index between VUEs and RSUs. Then, we deal with the spectrum resource allocation problem between VUEs and RSUs. To reduce computational overhead, we transform the original problem into two sub-problems: power allocation and slot allocation, according to the time division multiplexing mechanism. The simulation results show that the proposed scheme can fairly and effectively allocate resources in VANET according to VUEs’ demand.

scholarly journals Nash Bargaining Solution as Negotiation Concept for Resource Allocation Problem with Groves-Ledyard Mechanism

2021 ◽  
Vol 14 ◽  
pp. 216-226
Author(s):  
Nikolay A. Korgin ◽  
◽  
Vsevolod O. Korepanov ◽  
Keyword(s):  
Experimental Data ◽  
Resource Allocation ◽  
Nash Bargaining Solution ◽  
Allocation Problem ◽  
Nash Bargaining ◽  
Bargaining Solution ◽  
Resource Allocation Problem ◽  
Proportional Allocation ◽  
Best Response ◽  
Behavior Models

Motivated by research works on Zeuthen-Hicks bargaining, which leads to the Nash bargaining solution, we analyze experimental data of resource allocation gaming with Groves-Ledyard mechanism. The games were designed in the form of negotiation to allow players to reach consensus. Behavior models based on best response, constant behavior, and Nash bargaining solution are defined. Analysis conducted over decisions made by participants shows that a significant share of all decisions leads to an increase of the Nash bargaining value. It is even higher than the share of decisions that are in agreement with the best-response concept. Consensusended games show light attraction to the Nash bargaining solution, it's less than we obtained in games with the mechanism of Yang-Hajek from another class of so-called proportional allocation mechanisms. We discuss differences of consensus-ended games from timeout-ended games, what decisions lead to the situations with the Nash bargaining value increasing and differences between balanced mechanism Groves-Ledyard and unbalanced mechanism Yang-Hajek.

Fulfilling the Rate Demands

2017 ◽  
pp. 55-80
Author(s):  
Ravikant Saini ◽  
Swades De
Keyword(s):  
Resource Allocation ◽  
Communication Networks ◽  
Access Network ◽  
Data Rate ◽  
Spectrum Efficiency ◽  
Resource Allocation Problem ◽  
Allocation Scheme ◽  
Single User ◽  
Resource Allocation Scheme ◽  
Shared Resource Allocation

Mobile connectivity these days is no more a privilege but a basic necessity. This has led to exponentially-increasing data rate demands over the network, causing tremendous pressure to the access network service planners. Orthogonal frequency division multiple access (OFDMA) is being considered for resource allocation in higher generation communication networks, where spectrum efficiency improvement while fulfilling the users' data rate demands is a key aspect of interest. Normally resource allocation is considered from the viewpoint of users, with the users selecting their best available subcarriers. In this chapter, the resource allocation problem is approached from the subcarrier's perspective. Besides the conventional user-based scheme, a recent subcarrier-based shared resource allocation scheme is presented that selects the best user(s) for each subcarrier and assigns the subcarrier either to a single user or more than one user on time-shared basis according to their current SNRs. Unlike the user-based schemes, in the proposed scheme each user can contend for any subcarrier.

scholarly journals Resource Allocation for Efficient IOT Application in Fog Computing

2020 ◽  
Vol 5 (6) ◽  
pp. 1312-1323
Author(s):  
Shubham Verma ◽  
Amit Gupta ◽  
Sushil Kumar ◽  
Vivek Srivastava ◽  
Bipin Kumar Tripathi
Keyword(s):  
Resource Allocation ◽  
Fog Computing ◽  
Quality Of Services ◽  
Low Latency ◽  
Resource Allocation Problem ◽  
Allocation Scheme ◽  
Parameter Evaluation ◽  
Resource Allocation Scheme ◽  
Allocation Algorithms

When it comes across problems in creating Internet of Things (IOT) architecture, the major problem that arises is an automatic stipulation of resources. At the same time in today’s era, it is very important to integrate this problem with better Quality of Services (QoS) because of which the cloud computing is taking a shift. As being well acquainted that in fog computing, network’s bandwidth is limited, therefore it becomes quite important to build a joint architecture with resource allocation problem giving it a better quality of services with enhanced efficiency and low latency communication. Priority of QoS is determined by Systematic Ladder Process (SLP) and decision parameter evaluation by RECK algorithm. In this paper, there will be a design of a better framework for IOT resource allocation scheme with better efficiency and better QoS. The paper too highlights the comparison of the previous works of the resource allocation algorithms and schemes with RECK algorithm.

Sign in / Sign up

Export Citation Format

Share Document