In this paper, we investigate the allocation of resource in D2D-aided Fog computing system with multiple mobile user equipments (MUEs). We consider each MUE has a request for task from a task library and needs to make a decision on task performing with a selection of three processing modes which include local mode, fog offloading mode, and cloud offloading mode. Two scenarios are considered in this paper, which mean task caching and its optimization in off-peak time, task offloading, and its optimization in immediate time. In particular, task caching refers to cache the completed task application and its related data. In the first scenario, to maximize the average utility of MUEs, a task caching optimization problem is formulated with stochastic theory and is solved by a GA-based task caching algorithm. In the second scenario, to maximize the total utility of system, the task offloading and resource optimization problem is formulated as a mixed integer nonlinear programming problem (MINLP) with a joint consideration of the MUE allocation policy, task offloading policy, and computational resource allocation policy. Due to the nonconvex of the problem, we transform it into multi-MUEs association problem (MMAP) and mixed Fog/Cloud task offloading optimization problem (MFCOOP). The former problem is solved by a Gini coefficient-based MUEs allocation algorithm which can select the most proper MUEs who contribute more to the total utility. The task offloading optimization problem is proved as a potential game and solved by a distributed algorithm with Lagrange multiplier. At last, the simulations show the effectiveness of the proposed scheme with the comparison of other baseline schemes.

Sparse code multiple access (SCMA) and wireless multicast are viewed as two effective techniques to improve spectral efficiency. Due to the diversity of channel gains for different receivers in the multicast group, the bit error rate (BER) analysis of the unicast SCMA is not suitable for the multicast SCMA systems. Motivated by this, in this letter, the BER performance of multicast SCMA system with randomly deployed receivers is investigated. More specifically, we derive a tight upper bound expression for the BER of the system. To gain more insights of the expression, asymptotic analysis is conducted. Both theoretical and simulation results show that the BER increases as the number of receivers increases in the multicast group.

The orthogonal frequency division multiple access (OFDMA)-based cooperative multicast (CM) technology realizing the intra-cooperation of multicast group (MG) has improved the performance in throughput and coverage. In the MG scenario, users are uniformly distributed. Due to the small effective transmission range (ETR) of relay user (RU), the cooperation is hindered, which limits the performance of CM. Therefore, non-orthogonal multiple access (NOMA)-based two MGs joint cooperative opportunistic multicast scheme (termed as COM-NOMA) is proposed. In COM-NOMA scheme, two MGs are served as one quasi-MG. Firstly, on the same frequency band, base station (BS) opportunistically multicasts the superposition signal, which is formed by two MGs’ signals, to the users with good channel conditions in the two MGs using NOMA way. Secondly, some successfully receiving users are selected as RUs. The superposition signal is forwarded to the other users by Device-to-Device multicast (D2MD) way. Then, according to the coverage ratio of BS and the decode condition of NOMA, the signal to interference and noise ratio (SINR) threshold for RU selection is given. Finally, the spectral efficiency of COM-NOMA is analyzed and the approximate expression of system coverage ratio is derived. The simulation results show that, spectral efficiency at unit transmit power (spectral efficiency per watt) and system coverage ratio is improved in comparison with other OFDMA-based CM schemes.

This paper studies a multi-user network model based on sparse code multiple access (SCMA), where both unicast and multicast services are considered. In the direct transmission scheme, the communication between the base station (BS) and the users is completed with one stage, in which the relay is inexistent. In the two-stage cooperative transmission scheme, any number of relays are placed to improve the reliability of wireless communication system. The BS broadcasts the requested message to users and relays in the first stage, and the successful relays forward the message to unsuccessful users in the second stage. To characterize the performance of these two schemes, we derive the exact and approximate expressions of average outage probability. Furthermore, to take full advantage of the cooperative diversity, an optimal power allocation and relay location strategy in the high signal-to-noise ratio (SNR) regime is studied. The outage probability reaches the minimum value when the first stage occupies half of the total energy consumed. Simulation and analysis results are presented to demonstrate the performance of these two schemes. The results show that the two-stage cooperative scheme effectively reduce the average outage probability in SCMA network, especially in the high SNR region.

The ubiquity of data-enabled mobile devices and wireless-enabled data applications has fostered the rapid development of wireless content caching, which is an efficient approach to mitigating cellular traffic pressure. Considering the content characteristics and real caching circumstances, a software-defined network (SDN)-based cooperative caching system is presented. First, we define a new file block library with heterogeneous content attributes [file popularity, mobile user (MU) preference, file size]. An SDN-based three-tier caching network is presented in which the base station supplies control coverage for the entire macrocell and cache helpers (CHs), MUs with cache capacities offer data coverage. Using the ‘most popular content’ and ‘largest diversity content’, a distributed cooperative caching strategy is proposed in which the caches of the MUs store the most popular contents of the file block library to mitigate the effect of MU mobility, and those of the CHs store the remaining contents in a probabilistic caching manner to enrich the content diversity and reduce the MU caching pressure. The request meet probability (RMPro) is subsequently proposed, and the optimal caching distribution of the contents in the probabilistic caching strategy is obtained via optimization. Finally, using the result of RMPro optimization, we also analyze the content retrieval delays that occur when a typical MU requests a file block or a whole file. Simulation results demonstrate that the proposed caching system can achieve quasi-optimal revenue performance compared with other contrasting schemes.

The original user relay (UR) selection scheme of non-orthogonal multiple access-based cooperative opportunistic multicast scheme, which realizes inter-group cooperation between two multicast groups, ignores the distribution trend of candidate UR in the cell and adopts fixed efficient relay selection range (ERSR) to select UR. It results in high UR selection ratio. Then the coverage efficiency, defined as the ratio of successfully received users to URs, is low. To tackle this problem, a range-division user relay (RDUR) selection scheme is proposed in this paper. Firstly, it divides the circular coverage range of base station into several continuous annular areas (AAs). Secondly, different ERSRs are assigned to unsuccessfully received users in different AAs. Under different ERSR assignments, the performances of UR selection ratio and coverage ratio are analyzed. Lastly, the radius set of ERSR that optimizes system coverage efficiency is used to perform UR selection. From simulation results, with different radius sets, analytical results of UR selection ratio and coverage ratio match well with their simulated ones. It is proved that ERSR allocation affects UR selection ratio and coverage ratio. With RDUR scheme, coverage efficiency increases by at least 14% and capacity efficiency has also been improved.