The Internet of Things(IoT)technology provides data acquisition,transmission,and analysis to control rehabilitation robots,encompassing sensor data from the robots as well as lidar signals for trajectory planning(desi...The Internet of Things(IoT)technology provides data acquisition,transmission,and analysis to control rehabilitation robots,encompassing sensor data from the robots as well as lidar signals for trajectory planning(desired trajectory).In IoT rehabilitation robot systems,managing nonvanishing uncertainties and input quantization is crucial for precise and reliable control performance.These challenges can cause instability and reduced effectiveness,particularly in adaptive networked control.This paper investigates networked control with guaranteed performance for IoT rehabilitation robots under nonvanishing uncertainties and input quantization.First,input quantization is managed via a quantization-aware control design,ensur stability and minimizing tracking errors,even with discrete control inputs,to avoid chattering.Second,the method handles nonvanishing uncertainties by adjusting control parameters via real-time neural network adaptation,maintaining consistent performance despite persistent disturbances.Third,the control scheme guarantees the desired tracking performance within a specified time,with all signals in the closed-loop system remaining uniformly bounded,offering a robust,reliable solution for IoT rehabilitation robot control.The simulation verifies the benefits and efficacy of the proposed control strategy.展开更多
The problem of guaranteed cost active fault-tolerant controller （AFTC） design for networked control systems （NCSs） with both packet dropout and transmission delay is studied in this paper. Considering the packet d...The problem of guaranteed cost active fault-tolerant controller （AFTC） design for networked control systems （NCSs） with both packet dropout and transmission delay is studied in this paper. Considering the packet dropout and transmission delay, a piecewise constant controller is adopted. With a guaranteed cost function, optimal controllers whose number is equal to the number of actuators are designed, and the design process is formulated as a convex optimal problem that can be solved by existing software. The control strategy is proposed as follows： when actuator failures appear, the fault detection and isolation unit sends out the information to the controller choosing strategy, and then the optimal stabilizing controller with the smallest guaranteed cost value is chosen. Two illustrative examples are given to demonstrate the effectiveness of the proposed approach. By comparing with the existing methods, it can be seen that our method has a better performance.展开更多
The problem of guaranteed cost control for the networked control systems(NCSs) with time-varying delays, time-varying sampling intervals and signals quantization was investigated, wherein the physical plant was contin...The problem of guaranteed cost control for the networked control systems(NCSs) with time-varying delays, time-varying sampling intervals and signals quantization was investigated, wherein the physical plant was continuous-time one, and the control input was discrete-time one. By using an input delay approach and a sector bound method, the network induced delays, quantization parameter and sampling intervals were presented in one framework in the case of the state and the control input by quantized in a logarithmic form. A novel Lyapunov function with discontinuity, which took full advantages of the NCS characteristic information, was exploited. In addition, it was shown that Lyapunov function decreased at the jump instants. Furthermore, the Leibniz-Newton formula and free-weighting matrix methods were used to obtain the guaranteed cost controller design conditions which were dependent on the NCS characteristic information. A numerical example was used to illustrate the effectiveness of the proposed methods.展开更多
Existing position-based routing algorithms,where packets are forwarded in the geographic direction of the destination,normally require that the forwarding node should know the positions of all neighbors in its transmi...Existing position-based routing algorithms,where packets are forwarded in the geographic direction of the destination,normally require that the forwarding node should know the positions of all neighbors in its transmission range.This information on direct neighbors is gained by observing beacon messages that each node sends out periodically.Several beaconless greedy routing schemes have been proposed recently.However,none of the existing beaconless schemes guarantee the delivery of packets.Moreover,they incur communication overhead by sending excessive control messages or by broadcasting data packets.In this paper,we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless,while preserving the same routes.In our guaranteed delivery beaconless routing scheme,the next hop is selected through the use of control RTS/CTS messages and biased timeouts.In greedy mode,the neighbor closest to destination responds first.In recovery mode,nodes closer to the source will select shorter timeouts,so that other neighbors,overhearing CTS packets,can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph.Nodes also cancel their packets after receiving data message sent by source to the selected neighbor.We analyze the behavior of our scheme on our simulation environment assuming ideal MAC,following GOAFR+and GFG routing schemes.Our results demonstrate low communication overhead in addition to guaranteed delivery.展开更多
The guaranteed cost control for a class of uncertain discrete-time networked control systems with random delays is addressed. The sensor-to-controller （S-C） and contraller-to-actuator （C-A） random network-induced ...The guaranteed cost control for a class of uncertain discrete-time networked control systems with random delays is addressed. The sensor-to-controller （S-C） and contraller-to-actuator （C-A） random network-induced delays are modeled as two Markov chains. The focus is on the design of a two-mode-dependent guar- anteed cost controller, which depends on both the current S-C delay and the most recently available C-A delay. The resulting closed-loop systems are special jump linear systems. Sufficient conditions for existence of guaranteed cost controller and an upper bound of cost function are established based on stochastic Lyapunov-Krasovakii functions and linear matrix inequality （LMI） approach. A simulation example illustrates the effectiveness of the proposed method.展开更多
The varied network performance in the cloud hurts application performance.This increases the tenant’s cost and becomes the key hindrance to cloud adoption.It is because virtual machines(VMs)belonging to one tenant ca...The varied network performance in the cloud hurts application performance.This increases the tenant’s cost and becomes the key hindrance to cloud adoption.It is because virtual machines(VMs)belonging to one tenant can reside in multiple physical servers and communication interference across tenants occasionally occurs when encountering network congestion.In order to prevent such unpredictability,it is critical for cloud providers to offer the guaranteed network performance at tenant level.Such a critical issue has drawn increasing attention in both academia and industry.Many elaborate mechanisms are proposed to provide guaranteed network performance,such as guaranteed bandwidth or bounded message delay across tenants.However,due to the intrinsic complexities and limited capabilities of commodity hardware,the deployment of these mechanisms still faces great challenges in current cloud datacenters.Moreover,with the rapid development of new technologies,there are new opportunities to improve the performance of existing works,but these possibilities are not under full discussion yet.Therefore,in this paper,we survey the latest development of the network performance guarantee approaches and summarize them based on their features.Then,we explore and discuss the possibilities of using emerging technologies as knobs to upgrade the performance or overcome the inherent shortcomings of existing advances.We hope this article will help readers quickly Received:Apr.07,2020 Revised:Oct.23,2020 Editor:Haifeng Zheng understand the causes of the problems and serve as a guide to motivate researchers to develop innovative algorithms and frameworks.展开更多
The risk points in the credit guarantee network of steel trade enterprises were identified by using the network analysis method in this paper. Firstly, the formation and operation mechanism of steel trade credit guara...The risk points in the credit guarantee network of steel trade enterprises were identified by using the network analysis method in this paper. Firstly, the formation and operation mechanism of steel trade credit guarantee network was analyzed.Secondly,a guarantee network was established to analyze the related network structure indexes based on the mutual guarantee data of 83 enterprises in a steel trade market. These indexes included centrality,honest broker,and structural hole. The results suggest that network analysis method can be used to find out the risk points of the guarantee network. Additionally,some recommendations are brought forth to reduce or prevent future crises.展开更多
Dynamic bandwidth allocation(DBA)is an open and hot topic in the Ethernet passive optical network(EPON),which is regarded as one of the best choices for next-generation access networks.However,most proposed DBA scheme...Dynamic bandwidth allocation(DBA)is an open and hot topic in the Ethernet passive optical network(EPON),which is regarded as one of the best choices for next-generation access networks.However,most proposed DBA schemes ignore the quality of service(QoS)guarantee on maximum delay and delay jitter for the real-time traffic and the downstream bandwidth utilization under light upstream load in EPON.In this paper,a new DBA scheme,QoS guaranteed adaptive downstream bandwidth utilization(QoS-ADBU),is proposed.This scheme can provide better QoS assurance by determining the maximum transmission cycle time according to the maximum acceptable packet delay and delay jitter for real-time traffic.Besides,the downstream utilization can also be improved by adapting the polling frequency to downstream traffic load.展开更多
An event-triggered scheme is proposed to solve the problems of robust guaranteed cost control for a class of two-dimensional(2-D)discrete-time systems.Firstly,an eventtriggered scheme is proposed for 2-D discrete-time...An event-triggered scheme is proposed to solve the problems of robust guaranteed cost control for a class of two-dimensional(2-D)discrete-time systems.Firstly,an eventtriggered scheme is proposed for 2-D discrete-time systems with parameter uncertainties and sector nonlinearities.Then,according to the Lyapunov functional method,the sufficient conditions for the existence of event-triggered robust guaranteed cost controller for 2-D discrete-time systems with parameter uncertainties and sector nonlinearities are given.Furthermore,based on the sufficient conditions and the linear matrix inequality(LMI)technique,the problem of designing event-triggered robust guaranteed cost controller is transformed into a feasible solution problem of LMI.Finally,a numerical example is given to demonstrate that,under the proposed event-triggered robust guaranteed cost control,the closed-loop system is asymptotically stable and fewer communication resources are occupied.展开更多
The problems of identification and stabilization of a class of Hammerstein systems over a wireless network are investigated in this paper. A new approach for the proof of iterative identification is presented first. T...The problems of identification and stabilization of a class of Hammerstein systems over a wireless network are investigated in this paper. A new approach for the proof of iterative identification is presented first. Then a guaranteed performance controller is designed to stabilize the system. The effectiveness of the proposed approach is demonstrated by numerical examples.展开更多
针对传统铁路电话专网数字化迁移中业务连续性与成本等方面的挑战,提出一种基于切片分组网(Slicing Packet Network,SPN)架构的平滑迁移技术方案。该技术方案融合双模并行割接、7号信令系统(Signaling System No.7,SS7)至铁路会话初始协...针对传统铁路电话专网数字化迁移中业务连续性与成本等方面的挑战,提出一种基于切片分组网(Slicing Packet Network,SPN)架构的平滑迁移技术方案。该技术方案融合双模并行割接、7号信令系统(Signaling System No.7,SS7)至铁路会话初始协议(Session Initiation Protocol for Railway,SIP-R)转换、切片服务质量(Quality of Service,QoS)保障及长短期记忆(Long Short-Term Memory,LSTM)异常监测机制,实现了业务无中断迁移。实验结果表明,所提技术方案的迁移成功率达98%,端到端时延降至80 ms,设备复用率超过70%,为铁路通信系统的数字化、智能化转型提供了可靠且可复制的技术路径。展开更多
A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol sta...A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.展开更多
To guarantee the heterogeneous delay requirements of the diverse vehicular services,it is necessary to design a full cooperative policy for both Vehicle to Infrastructure(V2I)and Vehicle to Vehicle(V2V)links.This pape...To guarantee the heterogeneous delay requirements of the diverse vehicular services,it is necessary to design a full cooperative policy for both Vehicle to Infrastructure(V2I)and Vehicle to Vehicle(V2V)links.This paper investigates the reduction of the delay in edge information sharing for V2V links while satisfying the delay requirements of the V2I links.Specifically,a mean delay minimization problem and a maximum individual delay minimization problem are formulated to improve the global network performance and ensure the fairness of a single user,respectively.A multi-agent reinforcement learning framework is designed to solve these two problems,where a new reward function is proposed to evaluate the utilities of the two optimization objectives in a unified framework.Thereafter,a proximal policy optimization approach is proposed to enable each V2V user to learn its policy using the shared global network reward.The effectiveness of the proposed approach is finally validated by comparing the obtained results with those of the other baseline approaches through extensive simulation experiments.展开更多
基金supported in part by the National Natural Science Foundation of China under Grant 62302475in part by the Research Funds of Centre for Leading Medicine and Advanced Technologies of IHM under Grant 2023IHM01081 and 2023IHM01085+1 种基金in part by the Hefei Municipal Natural Science Foundation under Grant 202328partly by the Anhui Science and Technology Innovation Tackling Plan Project under Grant 202423k09020044。
文摘The Internet of Things(IoT)technology provides data acquisition,transmission,and analysis to control rehabilitation robots,encompassing sensor data from the robots as well as lidar signals for trajectory planning(desired trajectory).In IoT rehabilitation robot systems,managing nonvanishing uncertainties and input quantization is crucial for precise and reliable control performance.These challenges can cause instability and reduced effectiveness,particularly in adaptive networked control.This paper investigates networked control with guaranteed performance for IoT rehabilitation robots under nonvanishing uncertainties and input quantization.First,input quantization is managed via a quantization-aware control design,ensur stability and minimizing tracking errors,even with discrete control inputs,to avoid chattering.Second,the method handles nonvanishing uncertainties by adjusting control parameters via real-time neural network adaptation,maintaining consistent performance despite persistent disturbances.Third,the control scheme guarantees the desired tracking performance within a specified time,with all signals in the closed-loop system remaining uniformly bounded,offering a robust,reliable solution for IoT rehabilitation robot control.The simulation verifies the benefits and efficacy of the proposed control strategy.
基金supported by National Outstanding Youth Foundation (No. 60525303)National Natural Science Foundation of China(No. 60704009)+1 种基金Key Project for Natural Science Research of Hebei Education Department (No. ZD200908)the Doctor Fund of YanShan University (No. B203)
文摘The problem of guaranteed cost active fault-tolerant controller （AFTC） design for networked control systems （NCSs） with both packet dropout and transmission delay is studied in this paper. Considering the packet dropout and transmission delay, a piecewise constant controller is adopted. With a guaranteed cost function, optimal controllers whose number is equal to the number of actuators are designed, and the design process is formulated as a convex optimal problem that can be solved by existing software. The control strategy is proposed as follows： when actuator failures appear, the fault detection and isolation unit sends out the information to the controller choosing strategy, and then the optimal stabilizing controller with the smallest guaranteed cost value is chosen. Two illustrative examples are given to demonstrate the effectiveness of the proposed approach. By comparing with the existing methods, it can be seen that our method has a better performance.
基金Project(61104106) supported by the National Natural Science Foundation of ChinaProject(201202156) supported by the Natural Science Foundation of Liaoning Province,ChinaProject(LJQ2012100) supported by Program for Liaoning Excellent Talents in University(LNET)
文摘The problem of guaranteed cost control for the networked control systems(NCSs) with time-varying delays, time-varying sampling intervals and signals quantization was investigated, wherein the physical plant was continuous-time one, and the control input was discrete-time one. By using an input delay approach and a sector bound method, the network induced delays, quantization parameter and sampling intervals were presented in one framework in the case of the state and the control input by quantized in a logarithmic form. A novel Lyapunov function with discontinuity, which took full advantages of the NCS characteristic information, was exploited. In addition, it was shown that Lyapunov function decreased at the jump instants. Furthermore, the Leibniz-Newton formula and free-weighting matrix methods were used to obtain the guaranteed cost controller design conditions which were dependent on the NCS characteristic information. A numerical example was used to illustrate the effectiveness of the proposed methods.
基金Supported by Natural Sciences and Engineering Research Council,Collaborative Research and Development Grant(319848)of Canada
文摘Existing position-based routing algorithms,where packets are forwarded in the geographic direction of the destination,normally require that the forwarding node should know the positions of all neighbors in its transmission range.This information on direct neighbors is gained by observing beacon messages that each node sends out periodically.Several beaconless greedy routing schemes have been proposed recently.However,none of the existing beaconless schemes guarantee the delivery of packets.Moreover,they incur communication overhead by sending excessive control messages or by broadcasting data packets.In this paper,we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless,while preserving the same routes.In our guaranteed delivery beaconless routing scheme,the next hop is selected through the use of control RTS/CTS messages and biased timeouts.In greedy mode,the neighbor closest to destination responds first.In recovery mode,nodes closer to the source will select shorter timeouts,so that other neighbors,overhearing CTS packets,can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph.Nodes also cancel their packets after receiving data message sent by source to the selected neighbor.We analyze the behavior of our scheme on our simulation environment assuming ideal MAC,following GOAFR+and GFG routing schemes.Our results demonstrate low communication overhead in addition to guaranteed delivery.
基金supported by the NSFC-Guangdong Joint Foundation Key Project(U0735003)the Overseas Cooperation Foundation(60828006)+1 种基金the Scientific Research Foundation for Returned Overseas Chinese Scholars,State Education Ministry,the Fundamental Research Funds for the Central Universities(2009ZM0076)the Natural Science Foundation of Guangdong Province(06105413)
文摘The guaranteed cost control for a class of uncertain discrete-time networked control systems with random delays is addressed. The sensor-to-controller （S-C） and contraller-to-actuator （C-A） random network-induced delays are modeled as two Markov chains. The focus is on the design of a two-mode-dependent guar- anteed cost controller, which depends on both the current S-C delay and the most recently available C-A delay. The resulting closed-loop systems are special jump linear systems. Sufficient conditions for existence of guaranteed cost controller and an upper bound of cost function are established based on stochastic Lyapunov-Krasovakii functions and linear matrix inequality （LMI） approach. A simulation example illustrates the effectiveness of the proposed method.
基金This project is partially supported by the National Natural Science Foundation of China(No.61872401)Fok Ying Tung Education Foundation(No.171059).
文摘The varied network performance in the cloud hurts application performance.This increases the tenant’s cost and becomes the key hindrance to cloud adoption.It is because virtual machines(VMs)belonging to one tenant can reside in multiple physical servers and communication interference across tenants occasionally occurs when encountering network congestion.In order to prevent such unpredictability,it is critical for cloud providers to offer the guaranteed network performance at tenant level.Such a critical issue has drawn increasing attention in both academia and industry.Many elaborate mechanisms are proposed to provide guaranteed network performance,such as guaranteed bandwidth or bounded message delay across tenants.However,due to the intrinsic complexities and limited capabilities of commodity hardware,the deployment of these mechanisms still faces great challenges in current cloud datacenters.Moreover,with the rapid development of new technologies,there are new opportunities to improve the performance of existing works,but these possibilities are not under full discussion yet.Therefore,in this paper,we survey the latest development of the network performance guarantee approaches and summarize them based on their features.Then,we explore and discuss the possibilities of using emerging technologies as knobs to upgrade the performance or overcome the inherent shortcomings of existing advances.We hope this article will help readers quickly Received:Apr.07,2020 Revised:Oct.23,2020 Editor:Haifeng Zheng understand the causes of the problems and serve as a guide to motivate researchers to develop innovative algorithms and frameworks.
基金Social Science Programs Foundation of Ministry of Education of China(No.10YJA910002)
文摘The risk points in the credit guarantee network of steel trade enterprises were identified by using the network analysis method in this paper. Firstly, the formation and operation mechanism of steel trade credit guarantee network was analyzed.Secondly,a guarantee network was established to analyze the related network structure indexes based on the mutual guarantee data of 83 enterprises in a steel trade market. These indexes included centrality,honest broker,and structural hole. The results suggest that network analysis method can be used to find out the risk points of the guarantee network. Additionally,some recommendations are brought forth to reduce or prevent future crises.
基金supported by the Tianjin Enterprise Innovation Fund under Grant No.08ZXCXGX17500
文摘Dynamic bandwidth allocation(DBA)is an open and hot topic in the Ethernet passive optical network(EPON),which is regarded as one of the best choices for next-generation access networks.However,most proposed DBA schemes ignore the quality of service(QoS)guarantee on maximum delay and delay jitter for the real-time traffic and the downstream bandwidth utilization under light upstream load in EPON.In this paper,a new DBA scheme,QoS guaranteed adaptive downstream bandwidth utilization(QoS-ADBU),is proposed.This scheme can provide better QoS assurance by determining the maximum transmission cycle time according to the maximum acceptable packet delay and delay jitter for real-time traffic.Besides,the downstream utilization can also be improved by adapting the polling frequency to downstream traffic load.
基金This work was supported by the National Natural Science Foundation of China （61273107, 61573077, 61503003）, the Dalian Leading, Dalian, China, the Doctoral Foundation of Tianjin Normal University （135202XB1613）, the Postdoctoral Science Foundation of China （2015M581332）, and the Natural Science Foundation of Anhui Province （150808. 5QF126）
基金supported by the National Natural Science Foundation of China(61573129 U1804147)+2 种基金the Innovative Scientists and Technicians Team of Henan Provincial High Education(20IRTSTHN019)the Innovative Scientists and Technicians Team of Henan Polytechnic University(T2019-2 T2017-1)
文摘An event-triggered scheme is proposed to solve the problems of robust guaranteed cost control for a class of two-dimensional(2-D)discrete-time systems.Firstly,an eventtriggered scheme is proposed for 2-D discrete-time systems with parameter uncertainties and sector nonlinearities.Then,according to the Lyapunov functional method,the sufficient conditions for the existence of event-triggered robust guaranteed cost controller for 2-D discrete-time systems with parameter uncertainties and sector nonlinearities are given.Furthermore,based on the sufficient conditions and the linear matrix inequality(LMI)technique,the problem of designing event-triggered robust guaranteed cost controller is transformed into a feasible solution problem of LMI.Finally,a numerical example is given to demonstrate that,under the proposed event-triggered robust guaranteed cost control,the closed-loop system is asymptotically stable and fewer communication resources are occupied.
基金supported by Shanghai Engineering Research Center of Green Energy Grid-Connected Technology Center(No.13DZ2251900)Shanghai Natural Science Foundation(No.15ZR1417500)+1 种基金Young Teacher Training Program and Industry-Study-Research Cooperation Project from Shanghai Education Commission(Nos.ZZsdl13008 and CXYsdl14012)Science and Technology Commission of Shanghai Municipality(No.11jc1404000)
文摘The problems of identification and stabilization of a class of Hammerstein systems over a wireless network are investigated in this paper. A new approach for the proof of iterative identification is presented first. Then a guaranteed performance controller is designed to stabilize the system. The effectiveness of the proposed approach is demonstrated by numerical examples.
文摘针对传统铁路电话专网数字化迁移中业务连续性与成本等方面的挑战,提出一种基于切片分组网(Slicing Packet Network,SPN)架构的平滑迁移技术方案。该技术方案融合双模并行割接、7号信令系统(Signaling System No.7,SS7)至铁路会话初始协议(Session Initiation Protocol for Railway,SIP-R)转换、切片服务质量(Quality of Service,QoS)保障及长短期记忆(Long Short-Term Memory,LSTM)异常监测机制,实现了业务无中断迁移。实验结果表明,所提技术方案的迁移成功率达98%,端到端时延降至80 ms,设备复用率超过70%,为铁路通信系统的数字化、智能化转型提供了可靠且可复制的技术路径。
基金supported by the National Science and Technology Major Project of the Ministry of Science and Technology of China (Grant No. 2014ZX03006003)the ZTE Research and Development Fund
文摘A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.
基金supported in part by the National Natural Science Foundation of China under grants 61901078,61771082,61871062,and U20A20157in part by the Science and Technology Research Program of Chongqing Municipal Education Commission under grant KJQN201900609+2 种基金in part by the Natural Science Foundation of Chongqing under grant cstc2020jcyj-zdxmX0024in part by University Innovation Research Group of Chongqing under grant CXQT20017in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)under grant 2021FNA04008.
文摘To guarantee the heterogeneous delay requirements of the diverse vehicular services,it is necessary to design a full cooperative policy for both Vehicle to Infrastructure(V2I)and Vehicle to Vehicle(V2V)links.This paper investigates the reduction of the delay in edge information sharing for V2V links while satisfying the delay requirements of the V2I links.Specifically,a mean delay minimization problem and a maximum individual delay minimization problem are formulated to improve the global network performance and ensure the fairness of a single user,respectively.A multi-agent reinforcement learning framework is designed to solve these two problems,where a new reward function is proposed to evaluate the utilities of the two optimization objectives in a unified framework.Thereafter,a proximal policy optimization approach is proposed to enable each V2V user to learn its policy using the shared global network reward.The effectiveness of the proposed approach is finally validated by comparing the obtained results with those of the other baseline approaches through extensive simulation experiments.
