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 Scheme for One-to-Many Cooperative Wireless Systems Using the Bidding Game Strategy

2019 ◽  
pp. 1-14
Author(s):  
Oluseye Adeleke ◽  
Wasana Boonsong
Keyword(s):  
Communication Network ◽  
Resource Allocation ◽  
Communication Networks ◽  
Cooperative Communication ◽  
Source Node ◽  
Allocation Scheme ◽  
Bidding Game ◽  
Optimal Resource ◽  
Single User ◽  
Resource Allocation Scheme

In this paper, we propose a new scheme for optimal resource (i.e, power) allocation in a cooperative wireless communication system, using a type of game called the Bidding game. Previous related works have all considered networks with multiple source nodes interacting with either single or multiple relays, without paying so much attention to how partners are selected for cooperation. However because of the importance of partner selection as an integral part of an efficient cooperative communication network, which also includes resource allocation, we propose this new game-based resource allocation scheme, in which the conventional theories of economic bidding are applied. In this work, we model the cooperative communication network as a single-user, multi-relay system in which the source acts as the auctioneer while the relays or partners act as the bidders in the game. The resource being auctioned here is power. The relay which offers the highest bid in terms of price is first selected by the source node and then allocated power by the source node. Our proposed scheme is aimed at answering the question of how maximally or optimally the power should be allocated in the network by the source node so as not to violate the power constraint. We show that there exists bidding and pricing mechanisms or strategies that lead to the maximization of network throughput or utility in cooperative communication networks. We also see in our simulation results that there is convergence to the Nash equilibrium which proves the correctness of our scheme.

scholarly journals End-to-End Data Rate Performance of Decode-and-Forward Relaying with Different Resource Allocation Schemes

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Inam Ullah ◽  
Alexis Dowhuszko ◽  
Zhong Zheng ◽  
David González González ◽  
Jyri Hämäläinen
Keyword(s):  
Resource Allocation ◽  
Closed Form ◽  
Data Rate ◽  
Allocation Scheme ◽  
Optimal Resource Allocation ◽  
Decode And Forward ◽  
Optimal Resource ◽  
The Mean ◽  
Resource Allocation Scheme ◽  
Resource Allocation Schemes

This paper studies the end-to-end (e2e) data rate of dual-hop Decode-and-Forward (DF) infrastructure relaying under different resource allocation schemes. In this context, we first provide a comparative analysis of the optimal resource allocation scheme with respect to several other approaches in order to provide insights into the system behavior and show the benefits of each alternative. Then, assuming the optimal resource allocation, a closed form expression for the distribution of the mean and outage data rates is derived. It turns out that the corresponding mean e2e data rate formula attains an expression in terms of an integral that does not admit a closed form solution. Therefore, a tight lower bound formula for the mean e2e data rate is presented. Results can be used to select the most convenient resource allocation scheme and perform link dimensioning in the network planning phase, showing the explicit relationships that exist between component link bandwidths, SNR values, and mean data rate.

scholarly journals Optimal Resource Allocation For QOS Supports In Smart Grid Neighborhood Area Network

2021 ◽  
Author(s):  
Mohammad S. Yazdi
Keyword(s):  
Resource Allocation ◽  
Smart Grid ◽  
Communication Networks ◽  
Area Network ◽  
Allocation Scheme ◽  
Optimal Resource Allocation ◽  
Optimal Resource ◽  
Resource Allocation Scheme ◽  
Smart Grid Communication ◽  
Neighborhood Area Network

Smart grid is a utility network, with advanced information and communications technologies for improved control, efficiency, reliability and safety in electric power distribution and management. Smart grid communication network consists of three interconnected communication networks: home area network (HAN), neighborhood area network (NAN), and wide area network (WAN). Our thesis is focused on NAN. The information flow in smart grid communication networks has different Quality of Service (QoS) requirements in terms of packet loss rate, throughput, and latency. By deploying QoS mechanisms, we can get the real time feedbacks which can be used to supply electricity based on need, thus reducing the wastage of electricity. First, we conducted Opnet simulations for NAN. We evaluated two technologies, Zigbee and wireless local area network (WLAN), for NAN. The simulation results demonstrate that latency can be reduced for the data flow with a higher priority with an appropriate QoS mechanism. Next, we proposed an optimal resource allocation scheme to reduce delay and provide differentiated services, in terms of latency, to different classes of traffic in the NAN. The problem is formulated into a linear programming (LP) problem, which can be solved efficiently. The simulation results and comparison demonstrates that the proposed resource allocation scheme can provide overall lower latency of the various data flows. Our method also lowers the delay of the data flow with a higher priority.

Sign in / Sign up

Export Citation Format

Share Document