The upcoming wireless technology developments in the next generations are expected to substantially transform the vehicle-to-everything (V2X) communication network. The challenge of limited spectrum resources in V2X communication, caused by the need for high data rates, necessitates a thorough analysis of spectrum resource allocation and power control. This complex problem falls under the domain of mixed-integer nonlinear programming; a strategic approach is implemented to overcome these issues, which divides the main challenge into two sub-problems. The issue of resource allocation is addressed by implementing a multiaccess spectrum allocation method, which is deliberately designed to optimize the utilization of the spectrum resources that are currently accessible. Concurrently, the power control issue is resolved by employing a continuous convex approximation technique, which effectively converts non-convex power-allocation issues into convex equivalents. This approach helps to alleviate interference between users. Finally, the simulation results prove that the proposed approaches can improve vehicle performance. The algorithms proposed in this article significantly improve the system throughput and access rate of vehicular user equipment (VUEs) while ensuring the data rate of cellular user equipment (CUEs).

Mobile crowd-sensing (MCS) is a well-known paradigm used for obtaining sensed data by using sensors found in smart devices. With the rise of more sensing tasks and workers in the MCS system, it is now essential to design an efficient approach for task allocation. Moreover, to ensure the completion of the tasks, it is necessary to incentivise the workers by rewarding them for participating in performing the sensing tasks. In this paper, we aim to assist workers in selecting multiple tasks while considering the time constraint of the worker and the requirements of the task. Furthermore, a pricing mechanism is adopted to determine each task budget, which is then used to determine the payment for the workers based on their willingness factor. This paper proves that the task-allocation is a non-deterministic polynomial (NP)-complete problem, which is difficult to solve by conventional optimization techniques. A worker multitask allocation-genetic algorithm (WMTA-GA) is proposed to solve this problem to maximize the workers welfare. Finally, theoretical analysis demonstrates the effectiveness of the proposed WMTA-GA. We observed that it performs better than the state-of-the-art algorithms in terms of average performance, workers welfare, and the number of assigned tasks.