Abstract

The advent of 5G opens up hitherto unimagined opportunities for delivering the much-anticipated Internet of Vehicles (IoV). There are two typical types of services in IoV, i.e., safety service and non-safety service. However, the existing IoV framework cannot efficiently support the differentiated IoV services. In addition, maximizing the number of accessed vehicles/users is another critical issue in IoV, especially in the dense urban area. To address these problems, in this paper, we utilize the emerging network slicing technology to support different services and employ Non-Orthogonal Multiple Access technology (NOMA) to help increase the connectivity. In particular, for the safety service, we take advantage of the finite blocklength capacity to correctly record the delay. Our goal is to maximize the connectivity of users by jointly considering the user association and their beamforming vectors, under the restrictions of limited physical resource. The problem is formulated as a Mixed-Integer Nonlinear Programming problem (MINLP). To tackle the intractable MINLP, we propose a two-stage scheme. Firstly, we exploit efficient approaches to solve the beamforming problem, i.e., successive convex approximation, semidefinite relaxation and second-order cone programming. Secondly, we propose a low-complexity Greedy User Association (GUA) algorithm to solve the user association problem. Finally, comprehensive simulations verify that our proposed GUA algorithm is close to global optimal solution and outperforms the benchmark schemes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call