Communication resource allocation is important for improving the performance of users in mobile edge computing (MEC) scenarios. In existing studies, the users in the MEC system typically suffer from unfair resource allocation, which results in the inefficient resource utilization and degraded user performance. To address this challenge, in this paper we propose a fair resource allocation approach to maximize the overall network throughput, under the constraint of each mobile user’s minimum transmission rate. We formulate the problem as a fair Nash bargaining resource allocation game, and the existence and uniqueness of the solution to this game model are analyzed. By adopting the time-sharing variable, we obtain the near optimal bargaining resource allocation strategy for the mixed integer nonlinear programming optimization. The user’s priority is further considered in the iterative implementation of the proposed algorithm by considering the time delay constraint of users. Simulation results show that the proposed scheme outperforms existing methods in terms of resource allocation fairness and overall system throughput.

Fair Resource Allocation for System Throughput Maximization in Mobile Edge Computing

In this paper, Hybrid of Particle Swarm Optimization (PSO) and Neuro-Fuzzy (NF) has been proposed for improving Vertical Hand-off (VHO) decision for the Ubiquitous Heterogeneous Wireless Network (UHWN). The mobile users have made VHO decision based on data-rate, dwelling time and service type, residue energy and network connection time. To reduce the computational complexity, the pre-decision of VHO is made based on preference of user and number of non-occupied channel. The main aim is the improvement of Quality of Service (QoS) of link and reduction of hand-off frequency. This method is able to reduce call blocking probability, hand-off latency and hand-off call dropping probability, improve the throughput and also balance the load of radio access technologies. The execution of the proposed system has been performed using NS 2 simulator. The numerical results of the proposed algorithm outperforms the state-of-the-art method.

PSO-NF based vertical handoff decision for ubiquitous heterogeneous wireless network(UHWN)

In this paper, we propose a dynamic bandwidth allocation scheme based on Stackelberg game for a heterogeneous network to simultaneously offer mobile social users with bandwidth via multiple homing access. In specific, network operators in the heterogeneous network compete with each other to determine the price of the bandwidth based on the prediction of mobile social users' demands. Then, mobile social users with the same interests form a social community as a coalition to dynamically request bandwidth and share the cost with each other. We formulate the bandwidth allocation problem as a Stackelberg game to model the interactions among mobile social users and network operators. In addition, with a backward induction, an iterative algorithm is proposed to obtain the Stackelberg equilibrium. Finally, simulation results show that the proposed scheme can improve both the efficiency ratio of bandwidth allocation and load balance of networks compared with uniform bandwidth allocation, random bandwidth allocation, and single access scheme.

Dynamic bandwidth allocation in mobile social networks with multiple homing access

Resource Allocation in Heterogeneous Broadband Wireless Access Networks

Handover management framework for WiMAX Point-to-Multi-Point networks

In this paper, we present a new resource allocation scheme for cell-edge active users to achieve improved performance in terms of a higher system capacity and better quality-of-service (QoS) guarantee of the users, where we utilize the two-dimensional resource allocation flexibility of orthogonal frequency division multiple access (OFDMA) networks. Here, the mobile stations (MSs) at the cell-edge can maintain parallel connections with more than one base station (BS) when it is in their coverage area. A MS, before handoff to a new BS, seeks to utilize additional resources from the other BSs if the BS through which its current session is registered is not able to satisfy its requirements. The handoff procedure is termed as split handoff. The BSs participate in split handoff operation while guaranteeing that they are able to maintain QoS of the existing connections associated with them. In this study, first, we present the proposed shared resource allocation architecture and protocol functionalities in split handoff, and give a theoretical proof of concept of system capacity gain associated with the shared resource allocation approach. Then, we provide a differentiated QoS provisioning approach that accounts for the MS speed, its channel quality, as well as the loads at different BSs. Via extensive simulations in Qualnet, the benefits of the proposed class-based split handoff approach is demonstrated. The results also indicate traffic load balancing property of the proposed scheme in heavy traffic conditions.

Satish Kumar

Papers

Class-Based Shared Resource Allocation for Cell-Edge Users in OFDMA Networks