اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultiple Access Computational Offloading: Communication Resource Allocation in the Two-User Case (Extended Version)
231
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
By offering shared computational facilities to which mobile devices can offload their computational tasks, the mobile edge computing framework is expanding the scope of applications that can be provided on resource-constrained devices. When multiple devices seek to use such a facility simultaneously, both the available computational resources and the available communication resources need to be appropriately allocated. In this manuscript, we seek insight into the impact of the choice of the multiple access scheme by developing solutions to the mobile energy minimization problem in the two-user case with plentiful shared computational resources. In that setting, the allocation of communication resources is constrained by the latency constraints of the applications, the computational capabilities and the transmission power constraints of the devices, and the achievable rate region of the chosen multiple access scheme. For both indivisible tasks and the limiting case of tasks that can be infinitesimally partitioned, we provide a closed-form and quasi-closed-form solution, respectively, for systems that can exploit the full capabilities of the multiple access channel, and for systems based on time-division multiple access (TDMA). For indivisible tasks, we also provide quasi-closed-form solutions for systems that employ sequential decoding without time sharing or independent decoding. Analyses of our results show that when the channel gains are equal and the transmission power budgets are larger than a threshold, TDMA (and the suboptimal multiple access schemes that we have considered) can achieve an optimal solution. However, when the channel gains of each user are significantly different and the latency constraints are tight, systems that take advantage of the full capabilities of the multiple access channel can substantially reduce the energy required to offload.
قيم البحث
اقرأ أيضاً
The mobile edge computing framework offers the opportunity to reduce the energy that devices must expend to complete computational tasks. The extent of that energy reduction depends on the nature of the tasks, and on the choice of the multiple access
scheme. In this paper, we first address the uplink communication resource allocation for offloading systems that exploit the full capabilities of the multiple access channel (FullMA). For indivisible tasks we provide a closed-form optimal solution of the energy minimization problem when a given set of users with different latency constraints are offloading, and a tailored greedy search algorithm for finding a good set of offloading users. For divisible tasks we develop a low-complexity algorithm to find a stationary solution. To highlight the impact of the choice of multiple access scheme, we also consider the TDMA scheme, which, in general, cannot exploit the full capabilities of the channel, and we develop low-complexity optimal resource allocation algorithms for indivisible and divisible tasks under that scheme. The energy reduction facilitated by FullMA is illustrated in our numerical experiments. Further, those results show that the proposed algorithms outperform existing algorithms in terms of energy consumption and computational cost.
Non-orthogonal multiple access (NOMA) is envisioned to be one of the most beneficial technologies for next generation wireless networks due to its enhanced performance compared to other conventional radio access techniques. Although the principle of
NOMA allows multiple users to use the same frequency resource, due to decoding complication, information of users in practical systems cannot be decoded successfully if many of them use the same channel. Consequently, assigned spectrum of a system needs to be split into multiple subchannels in order to multiplex that among many users. Uplink resource allocation for such systems is more complicated compared to the downlink ones due to the individual users power constraints and discrete nature of subchannel assignment. In this paper, we propose an uplink subchannel and power allocation scheme for such systems. Due to the NP-hard and non-convex nature of the problem, the complete solution, that optimizes both subchannel assignment and power allocation jointly, is intractable. Consequently, we solve the problem in two steps. First, based on the assumption that the maximal power level of a user is subdivided equally among its allocated subchannels, we apply many-to-many matching model to solve the subchannel-user mapping problem. Then, in order to enhance the performance of the system further, we apply iterative water-filling and geometric programming two power allocation techniques to allocate power in each allocated subchannel-user slot optimally. Extensive simulation has been conducted to verify the effectiveness of the proposed scheme. The results demonstrate that the proposed scheme always outperforms all existing works in this context under all possible scenarios.
In this paper, we study inter-operator spectrum sharing and intra-operator resource allocation in shared spectrum access communication systems and propose efficient dynamic solutions to address both inter-operator and intra-operator resource allocati
on optimization problems. For inter-operator spectrum sharing, we present two competent approaches, namely the subcarrier gain based sharing and fragmentation based sharing, which carry out fair and flexible allocation of the available shareable spectrum among the operators subject to certain well-defined sharing rules, traffic demands and channel propagation characteristics. Subcarrier gain based spectrum sharing scheme has been found to be more efficient in terms of achieved throughput. However, fragmentation based sharing is more attractive in terms of computational complexity. For intra-operator resource allocation, we consider resource allocation problem with users dissimilar service requirements, where the operator supports users with delay-constraint and non-delay constraint service requirements, simultaneously. This optimization problem is a mixed integer nonlinear programming problem and nonconvex, which is computationally very expensive, and the complexity grows exponentially with the number of integer variables. We propose less-complex and efficient suboptimal solution based on formulating exact linearization, linear approximation and convexification techniques for the nonlinear and/or non-convex objective functions and constraints. Extensive simulation performance analysis has been carried out that validates the efficiency of the proposed solution.
The proliferation of mobile Internet and connected devices, offering a variety of services at different levels of performance, represents a major challenge for the fifth generation wireless networks and beyond. This requires a paradigm shift towards
the development of key enabling techniques for the next generation wireless networks. In this respect, visible light communication (VLC) has recently emerged as a new communication paradigm that is capable of providing ubiquitous connectivity by complementing radio frequency communications. One of the main challenges of VLC systems, however, is the low modulation bandwidth of the light-emitting-diodes, which is in the megahertz range. This article presents a promising technology, referred to as optical- non-orthogonal multiple access (O-NOMA), which is envisioned to address the key challenges in the next generation of wireless networks. We provide a detailed overview and analysis of the state-of-the-art integration of O-NOMA in VLC networks. Furthermore, we provide insights on the potential opportunities and challenges as well as some open research problems that are envisioned to pave the way for the future design and implementation of O-NOMA in VLC systems.
Mobile-edge computing (MEC) has recently emerged as a prominent technology to liberate mobile devices from computationally intensive workloads, by offloading them to the proximate MEC server. To make offloading effective, the radio and computational
resources need to be dynamically managed, to cope with the time-varying computation demands and wireless fading channels. In this paper, we develop an online joint radio and computational resource management algorithm for multi-user MEC systems, with the objective as minimizing the long-term average weighted sum power consumption of the mobile devices and the MEC server, subject to a task buffer stability constraint. Specifically, at each time slot, the optimal CPU-cycle frequencies of the mobile devices are obtained in closed forms, and the optimal transmit power and bandwidth allocation for computation offloading are determined with the Gauss-Seidel method; while for the MEC server, both the optimal frequencies of the CPU cores and the optimal MEC server scheduling decision are derived in closed forms. Besides, a delay-improved mechanism is proposed to reduce the execution delay. Rigorous performance analysis is conducted for the proposed algorithm and its delay-improved version, indicating that the weighted sum power consumption and execution delay obey an $left[Oleft(1slash Vright),Oleft(Vright)right]$ tradeoff with $V$ as a control parameter. Simulation results are provided to validate the theoretical analysis and demonstrate the impacts of various parameters.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
