In recent years, in order to provide a better quality of service (QoS) to IoT devices, the cloud computing paradigm has shifted towards the edge. However, the resource capacity (e.g. bandwidth) in Fog network is limited and it is essential to efficiently bind the IoT applications with stringent QoS requirements with the available network infrastructure. In this paper, we formulate a joint user association and resource allocation problem in the downlink of the Fog Network considering the evergrowing demand of QoS requirements imposed by the Ultra- Reliable Low Latency Communications (URLLC) and enhanced Mobile Broadband (eMBB) services. First, we determine the priority of different QoS requirements of heterogeneous IoT applications at the Fog Network by enforcing the analytical framework using an analytic hierarchy process (AHP). Using the AHP, we then formulate a two-sided matching game to initiate stable association between the Fog Network infrastructure (i.e., Fog devices) and IoT devices. Subsequently, we consider the externalities in the matching game which occurs due to job delay and solve the network resource allocation problem by applying the best-fit resource allocation strategy during matching. The simulation results illustrate the stability of the user association and efficiency of resource allocation with higher utility gain.
We study the problem of user clustering and power assignment for a network comprised of cellular users and underlay device-to-device (D2D) users operating under a non-orthogonal multiple access (NOMA) scheme. Our goal is to maximize the sum-rate of the network by jointly optimizing the user clustering and power assignment. Moreover, we also aim to provide interference protection for the cellular users. The formulated optimization problem is a mixed-integer non-convex problem. Thus, the original problem is decomposed into two subproblems. The first subproblem of user clustering is formulated as a matching game with externalities, where this matching game is solved sequentially while the second subproblem pertaining to power assignment is solved using complementary Geometric programming. Finally, an efficient joint iterative algorithm is proposed that can achieve a suboptimal solution for the mix integer non-convex NP-hard problem. Simulation results show that the proposed algorithm can achieve up to 70% and 92% of performance gains in terms of the average sum-rate in comparison with the general NOMA and traditional orthogonal frequency-division multiple access (OFDMA) schemes, respectively. Moreover, our results show that the proposed scheme significantly enhances the network connectivity in terms of the number of admitted users compared with the traditional OFDMA, NOMA, and D2D schemes.
23 July 2019 in IEEE Transactions on Vehicular Technology
Remarkable prevalence of cloud computing has enabled smart cars to provide infotainment services. However, retrieving infotainment contents from long-distance data centers poses a significant delay. Consequently, hindering to offer stringent latency-aware infotainment services. Alternatively, Multi-access Edge Computing is a promising option to meet strict latency requirements. However, it imposes severe resource constraints with respect to caching and computation. Similarly, communication resources utilized to fetch the infotainment contents are scarce. In this paper, we jointly consider communication, caching, and computation (3C) to reduce infotainment content retrieval delay for smart cars. We formulate the problem as a mix-integer, non-linear, and non-convex optimization to minimize the latency. Furthermore, we relax the formulated problem from NP-hard to linear programming. Then, we propose a joint solution (3C) based on the alternative direction method of multipliers technique which operates in a distributed manner. We compare the proposed 3C solution with various approaches, namely, greedy, random, and centralized. Simulation results reveal that the proposed solution reduces delay up to 9% and 28% compared to the greedy and random approaches, respectively.
25 May 2021 in IEEE Transactions on Intelligent Transportation Systems
The proliferation of compute-intensive services in next-generation vehicular networks will impose an unprecedented computation demand to meet stringent latency and resource requirements. Vehicular edge or fog computing has been a widely adopted solution to enhance the computational capacity of vehicular networks; however, the computation requirements of these compute hungry applications will surpass the capabilities of such a solution. To address this challenge, the on-board resources of neighboring mobile vehicles can be utilized. However, such resource utilization requires an incentive mechanism to motivate privately owned neighboring vehicles to participate in sharing their resources. In this paper, we propose a contract theory-based incentive mechanism that maximizes the social welfare of the vehicular networks by motivating neighboring vehicles to participate in sharing their resources. The proposed approach enables the Road Side Units (RSUs) to provide appropriate rewards by offering a tailored contract to each resource sharing vehicle based on their contribution and unique characteristics. Moreover, we derive an optimal contract scheme for computational task offloading, taking into account the individual rationality and incentive-compatible constraints. Finally, we perform numerical evaluations to demonstrate the effectiveness of our proposed scheme. The proposed scheme achieves up to 28% higher computing resource utilization, 17.2% lower energy consumption per computing resource utilization, and 17.1% lesser energy consumption per task completed when compared to the linear pricing incentive baseline.
Wireless network virtualization is identified as one of the key enabling technologies to bring fifth-generation networks into fruition. In this letter, we model the service selection and resource purchasing problem as a two-stage combinatorial optimization problem. To solve this problem, we propose a hierarchical matching game-based scheme, which satisfies the efficient resource allocation and strict isolation requirements. Simulation results show that our proposal outperforms the fixed sharing approach by 32% and achieves up to 97% of performance obtained by the optimal approach (general sharing scheme) in terms of average sum rate.