The Faculty of the Institute of Electrical and Control Engineering, Chang'an University, Xi'an 710064, China.
The Faculty of the Institute of Information Engineering, Chang'an University, Xi'an 710064, China.
Sensors (Basel). 2018 Nov 9;18(11):3846. doi: 10.3390/s18113846.
Vehicular networks are becoming increasingly dense due to expanding wireless services and platooning has been regarded as a promising technology to improve road capacity and on-road safety. Constrained by limited resources, not all communication links in platoons can be allocated to the resources without suffering interference. To guarantee the quality of service, it is required to determine the set of served services at which the scale of demand exceeds the capability of the network. To increase the number of guaranteed services, the resource allocation has to be adjusted to adapt to the dynamic environment of the vehicular network. However, resource re-allocation results in additional costs, including signal overhead and latency. To increase the number of guaranteed services at a low-cost in a resource-limited vehicular network, we propose a time dynamic optimization method that constrains the network re-allocation rate. To decrease the computational complexity, the time dynamic optimization problem is converted into a deterministic optimization problem using the Lyapunov optimization theory. The simulation indicates that the analytical results do approximate the reality, and that the proposed scheme results in a higher number of guaranteed services as compared to the results of a similar algorithm.
车联网由于无线服务的扩展而变得越来越密集，而车队已经被认为是提高道路容量和道路安全的一项很有前途的技术。由于资源有限，并非车队中的所有通信链路都可以分配到不受干扰的资源。为了保证服务质量，需要确定一组服务，其需求规模超过网络的能力。为了增加保证服务的数量，必须调整资源分配以适应车联网的动态环境。然而，资源重新分配会导致额外的成本，包括信号开销和延迟。为了在资源有限的车联网中以低成本增加保证服务的数量，我们提出了一种时间动态优化方法，该方法限制了网络重新分配的速度。为了降低计算复杂度，使用 Lyapunov 优化理论将时间动态优化问题转换为确定性优化问题。仿真结果表明，分析结果接近实际情况，并且与类似算法的结果相比，所提出的方案可以实现更多的保证服务。
