24 March 2021 in IEEE Internet of Things Journal
To realize the vision of the Internet of Things (IoT), mobile-edge computing (MEC) has recently emerged as a promising paradigm to meet the computation demand from mobile users (MUs). In this article, we study the network performance in large-scale stochastic MEC wireless networks, where the tasks can be computed locally by the local computation capabilities (LCCs) or be offloaded to MEC servers for edge computing. To this end, a MEC network is modeled featuring random node distribution, dynamic task requests, orthogonal frequency-division multiple access, task retransmission, and parallel computing in MEC servers. Given the model, a 2-D discrete-time Markov chain is first adopted to characterize the task execution process, including local computing and task offloading. Based on the coupling between communication and computing, the average outage probability of the task transmission and the average MEC computation load are derived by integrating the stochastic geometry and queuing theory. Furthermore, by jointly analyzing the local computation latency, transmission latency, and edge computation latency, we derive the average end-to-end latency of the task execution. Our results show that the LCCs in MUs can improve the network performance, including communication and computation performance, in stochastic MEC networks. In addition, useful guidelines for MEC network provisioning and planning are provided to avoid either the local computing or the task offloading being the latency performance bottleneck.
6 August 2021 in IEEE Transactions on Wireless Communications
Coded caching is a technique that promises significant reductions in network traffic by exploiting the multicast opportunities among multiple cache-enabled users. Most works in this area investigate the fundamental performance limits of coded caching from an information-theoretic perspective. In this paper, from a practical perspective, we focus on the design and analysis of the coded caching scheme in large-scale stochastic networks with dynamic traffic. Aiming at the challenges of the large number of users, dynamic packet requests, and distance-dependent interference, the packet caching scheme and packet delivery scheme are jointly designed to ensure the availability of the coded caching gain. To characterize the coded caching performance, the queue dynamic of the packet requests and channel state are first analyzed. Then by combining the successive group decoding theory and stochastic geometry approach, the network interference is characterized and the successful transmission probability of the multicast coded signal is further derived. Moreover, the coded caching scheme is optimized to minimize the average delay of the packet request, which is proved to ensure service fairness and reduce the complexities of network performance analysis. The analytical and numerical results provide useful insights for the provisioning and planning of the coded caching network.
4 December 2017 in IEEE Transactions on Vehicular Technology
In this paper, we propose an opportunistic cooperation scheme in a two-user buffer-aided cognitive radio network. In each time slot, the secondary user (SU) will either transmit its own packets, or help the primary user (PU) to forward packets, based on a priority factor $\alpha$. According to previous cooperation schemes, some time slots will be wasted if the selected buffer is empty. However, under the proposed scheme, these time slots will be handed over to the non-empty buffer's transmission, which increases the average service rates of buffers at the SU. Considering the bursty nature of sources, we characterize the evolution of buffer states by using the Markov chain. By calculating the probability of time slot handing over, the increased service rates can be theoretically analyzed, so as to the improvements on the stable throughput region and the average end-to-end transmission delay. Moreover, we further discuss the throughput and delay tradeoffs between the two users, which indicates that we can adjust the traffic load by adjusting the priority factor. Simulations validate our analysis, and reveal that the proposed cooperation scheme with time slot handing over offers a far larger throughput while maintaining a shorter transmission delay compared with previous schemes.
17 January 2020 in IEEE Transactions on Communications
In this paper, we analyze the system performance of a stochastic network, which is in the stationary state. Different from previous full-loaded assumptions that base stations (BSs) are always transmitting signals, which overestimates the inter-cell interference (ICI), dynamic traffic is considered in our model and BSs can be silent in some time slots. Packet retransmission is adopted, which brings a coupled relationship between the outage probability and the buffer empty probability. That is, as the outage probability increases, packets that are not successfully received will remain at the head of the buffer and be retransmitted until they are successfully received, which increases the proportion of active BSs and aggravates the ICI in turn. To better analyze this coupled relationship, the ICI is analyzed with the aid of the probability generating function and the Laplace transform. Then a queuing model is established to depict the packet arrival and departure processes. Some important system metrics, including the outage probability, the buffer empty probability, and the stable throughput region, are derived. Numerical results verify our theoretical analysis, and it is revealed that packet retransmission can enhance the system performance when the packet request rate is within the stable throughput region.
21 February 2018 in arXiv
Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities between different links. Hence, the system performance is always limited by the weaker links. In this paper, from the whole system throughput view, we propose an optimal multi-user scheduling scheme for the multi-user full-duplex (FD) buffer aided relay systems. We first formulate the throughput maximization problem. Then, according to the characteristics of the Karush-Kuhn-Tucker conditions, we obtain the optimal decision functions and the optimal weighted factors of different links of the proposed scheme. Simulation results show that the proposed scheme not only solves the disparities of the qualities between $S_i$-$R$ and $R$-$D_i$ links, but also that between different $S_{i}$-$R$ or $D_{i}$-$R$ links, which can be used as guidance in the design of the practical systems.