To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to...To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to the main system in a controllable range.We propose a three-slot one-way vehicle system model where the mobile vehicle nodes complete information interaction with the assistance of other independent nodes by borrowing the unused radio spectrum with the primary networks.The end-to-end SNR relationship in overlay and underlay cognitive communication system mode are analyzed by using two forwarding protocol,namely,decode-and-forward(DF)protocol and amplify-and-forward(AF)protocol,respectively.The system outage probability is derived and the optimal power allocation factor is obtained via seeking the minimum value of the approximation of system outage probability.The analytical results have been confirmed by means of Monte Carlo simulations.Simulation results show that the proposed system performance in terms of outage under the optimal power allocation is superior to that under the average power allocation,and is also better than that under other power allocation systems.展开更多
As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicl...As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicles need to be authen-ticated before accessing the network.Most existing authentication protocols in VANET adopt the Trusted Authority(TA)with centralized structure which is re-sponsible for the authentication tasks of all vehicles.However,the large-scale network consume a lot of computing resources,which leads to unacceptable de-lay in message transmission in VANET.For reducing the computational cost of TA,an efficient three-factor privacy-preserving authentication and key agreement protocol was proposed in our paper.Different from before,the RoadSide Unit(RSU)no longer acts as an intermediate node but is responsible for assisting user authentication,which lead to the computational cost of TA is very low.Through formal and informal analysis,our protocol demonstrates excellent security.Com-pared with previous studies,our work emerges advan-tages and superiorities in the following aspects:com-putational cost,communication cost,security proper-ties and functions,message loss ratio,and message de-lay.These data and evidence indicate that our protocol is an ideal choice for large-scale VANET.展开更多
5G technology has endowed mobile communication terminals with features such as ultrawideband access,low latency,and high reliability transmission,which can complete the network access and interconnection of a large nu...5G technology has endowed mobile communication terminals with features such as ultrawideband access,low latency,and high reliability transmission,which can complete the network access and interconnection of a large number of devices,thus realizing richer application scenarios and constructing 5G-enabled vehicular networks.However,due to the vulnerability of wireless communication,vehicle privacy and communication security have become the key problems to be solved in vehicular networks.Moreover,the large-scale communication in the vehicular networks also makes the higher communication efficiency an inevitable requirement.In order to achieve efficient and secure communication while protecting vehicle privacy,this paper proposes a lightweight key agreement and key update scheme for 5G vehicular networks based on blockchain.Firstly,the key agreement is accomplished using certificateless public key cryptography,and based on the aggregate signature and the cooperation between the vehicle and the trusted authority,an efficient key updating method is proposed,which reduces the overhead and protects the privacy of the vehicle while ensuring the communication security.Secondly,by introducing blockchain and using smart contracts to load the vehicle public key table for key management,this meets the requirements of vehicle traceability and can dynamically track and revoke misbehaving vehicles.Finally,the formal security proof under the eck security model and the informal security analysis is conducted,it turns out that our scheme is more secure than other authentication schemes in the vehicular networks.Performance analysis shows that our scheme has lower overhead than existing schemes in terms of communication and computation.展开更多
Data sharing and privacy securing present extensive opportunities and challenges in vehicular network.This paper introducestrust access authentication scheme’as a mechanism to achieve real-time monitoring and promote...Data sharing and privacy securing present extensive opportunities and challenges in vehicular network.This paper introducestrust access authentication scheme’as a mechanism to achieve real-time monitoring and promote collaborative sharing for vehicles.Blockchain,which can provide secure authentication and protected privacy,is a crucial technology.However,traditional cloud computing performs poorly in supplying low-latency and fast-response services for moving vehicles.In this situation,edge computing enabled Blockchain network appeals to be a promising method,where moving vehicles can access storage or computing resource and get authenticated from Blockchain edge nodes directly.In this paper,a hierarchical architecture is proposed consist of vehicular network layer,Blockchain edge layer and Blockchain network layer.Through a authentication mechanism adopting digital signature algorithm,it achieves trusted authentication and ensures valid verification.Moreover,a caching scheme based on many-to-many matching is proposed to minimize average delivery delay of vehicles.Simulation results prove that the proposed caching scheme has a better performance than existing schemes based on central-ized model or edge caching strategy in terms of hit ratio and average delay.展开更多
As an important application scenario of 5G, the vehicular network has a huge amount of computing data, which brings challenges to the scarce network resources. Mobile edge computing(MEC) sinks cloud services to the ed...As an important application scenario of 5G, the vehicular network has a huge amount of computing data, which brings challenges to the scarce network resources. Mobile edge computing(MEC) sinks cloud services to the edge of network, which reduces the delay jitter caused by remote cloud computing. Software-defined networking(SDN) is an emerging network paradigm with the features of logic centralized control and programmability. In this paper, we construct an SDN-assisted MEC network architecture for the vehicular network. By introducing SDN controller, the efficiency and flexibility of vehicular network are improved, and the network state can be perceived from the global perspective. To further reduce the system overhead, the problem of vehicle to everything(V2X) offloading and resource allocation is proposed, where the optimal offloading decision, transmission power control, subchannels assignment, and computing resource allocation scheme are given. The optimization problem is transformed into three stages because of the heterogeneity of the offloaded tasks and the NP-hard property of the problem. Firstly, the analytic hierarchy process is used to select initial offloading node, then stateless Q-learning is adopted to allocate transmission power, subchannels and computing resources. In addition, the offloading decision is modeled as a potential game, and the Nash equilibrium is proved by the potential function construction. Finally, the numerical results show that the proposed mechanism can effectively reduce the system overhead and achieve better results compared with others’ algorithms.展开更多
Encouraged by next-generation networks and autonomous vehicle systems,vehicular networks must employ advanced technologies to guarantee personal safety,reduce traffic accidents and ease traffic jams.By leveraging the ...Encouraged by next-generation networks and autonomous vehicle systems,vehicular networks must employ advanced technologies to guarantee personal safety,reduce traffic accidents and ease traffic jams.By leveraging the computing ability at the network edge,multi-access edge computing(MEC)is a promising technique to tackle such challenges.Compared to traditional full offloading,partial offloading offers more flexibility in the perspective of application as well as deployment of such systems.Hence,in this paper,we investigate the application of partial computing offloading in-vehicle networks.In particular,by analyzing the structure of many emerging applications,e.g.,AR and online games,we convert the application structure into a sequential multi-component model.Focusing on shortening the application execution delay,we extend the optimization problem from the single-vehicle computing offloading(SVCOP)scenario to the multi-vehicle computing offloading(MVCOP)by taking multiple constraints into account.A deep reinforcement learning(DRL)based algorithm is proposed as a solution to this problem.Various performance evaluation results have shown that the proposed algorithm achieves superior performance as compared to existing offloading mechanisms in deducing application execution delay.展开更多
In order to support advanced vehicular Internet-of-Things(IoT)applications,information exchanges among different vehicles are required to find efficient solutions for catering to different application requirements in ...In order to support advanced vehicular Internet-of-Things(IoT)applications,information exchanges among different vehicles are required to find efficient solutions for catering to different application requirements in complex and dynamic vehicular environments.Federated learning(FL),which is a type of distributed learning technology,has been attracting great interest in recent years as it performs knowledge exchange among different network entities without a violation of user privacy.However,client selection and networking scheme for enabling FL in dynamic vehicular environments,which determines the communication delay between FL clients and the central server that aggregates the models received from the clients,is still under-explored.In this paper,we propose an edge computing-based joint client selection and networking scheme for vehicular IoT.The proposed scheme assigns some vehicles as edge vehicles by employing a distributed approach,and uses the edge vehicles as FL clients to conduct the training of local models,which learns optimal behaviors based on the interaction with environments.The clients also work as forwarder nodes in information sharing among network entities.The client selection takes into account the vehicle velocity,vehicle distribution,and the wireless link connectivity between vehicles using a fuzzy logic algorithm,resulting in an efficient learning and networking architecture.We use computer simulations to evaluate the proposed scheme in terms of the communication overhead and the information covered in learning.展开更多
In MEC-enabled vehicular network with limited wireless resource and computation resource,stringent delay and high reliability requirements are challenging issues.In order to reduce the total delay in the network as we...In MEC-enabled vehicular network with limited wireless resource and computation resource,stringent delay and high reliability requirements are challenging issues.In order to reduce the total delay in the network as well as ensure the reliability of Vehicular UE(VUE),a Joint Allocation of Wireless resource and MEC Computing resource(JAWC)algorithm is proposed.The JAWC algorithm includes two steps:V2X links clustering and MEC computation resource scheduling.In the V2X links clustering,a Spectral Radius based Interference Cancellation scheme(SR-IC)is proposed to obtain the optimal resource allocation matrix.By converting the calculation of SINR into the calculation of matrix maximum row sum,the accumulated interference of VUE can be constrained and the the SINR calculation complexity can be effectively reduced.In the MEC computation resource scheduling,by transforming the original optimization problem into a convex problem,the optimal task offloading proportion of VUE and MEC computation resource allocation can be obtained.The simulation further demonstrates that the JAWC algorithm can significantly reduce the total delay as well as ensure the communication reliability of VUE in the MEC-enabled vehicular network.展开更多
Collaborative vehicular networks is a key enabler to meet the stringent ultra-reliable and lowlatency communications(URLLC)requirements.A user vehicle(UV)dynamically optimizes task offloading by exploiting its collabo...Collaborative vehicular networks is a key enabler to meet the stringent ultra-reliable and lowlatency communications(URLLC)requirements.A user vehicle(UV)dynamically optimizes task offloading by exploiting its collaborations with edge servers and vehicular fog servers(VFSs).However,the optimization of task offloading in highly dynamic collaborative vehicular networks faces several challenges such as URLLC guaranteeing,incomplete information,and dimensionality curse.In this paper,we first characterize URLLC in terms of queuing delay bound violation and high-order statistics of excess backlogs.Then,a Deep Reinforcement lEarning-based URLLCAware task offloading algorithM named DREAM is proposed to maximize the throughput of the UVs while satisfying the URLLC constraints in a besteffort way.Compared with existing task offloading algorithms,DREAM achieves superior performance in throughput,queuing delay,and URLLC.展开更多
In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximat- ed by an exponential distribution. The probabilities of Vehicular Ad Hoc Network con...In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximat- ed by an exponential distribution. The probabilities of Vehicular Ad Hoc Network connectivity for difference cases are derived. Furthermore we proof that the nodes in a sub-interval [z1, z1 ＋ △z] of interval [0,z],z 〉 0 where all the nodes are independently uniform distributed is a Poisson process and the relationship of Vehicle Ad hoc Networks and one-dimensional Ad Hoc networks where nodes independently uniform distributed in [zl, z1 ＋ △z] is explained. The analysis is validated by computing the probability of network connectivity and comparing it with the Mont Carlo simu- lation results.展开更多
Most of previous video recording devices in mobile vehicles commonly store captured video contents locally. With the rapid development of 4G/Wi Fi networks, there emerges a new trend to equip video recording devices w...Most of previous video recording devices in mobile vehicles commonly store captured video contents locally. With the rapid development of 4G/Wi Fi networks, there emerges a new trend to equip video recording devices with wireless interfaces to enable video uploading to the cloud for video playback in a later time point. In this paper, we propose a QoE-aware mobile cloud video recording scheme in the roadside vehicular networks, which can adaptively select the proper wireless interface and video bitrate for video uploading to the cloud. To maximize the total utility, we need to design a control strategy to carefully balance the transmission cost and the achieved QoE for users. To this purpose, we investigate the tradeoff between cost incurred by uploading through cellular networks and the achieved QoE of users. We apply the optimization framework to solve the formulated problem and design an online scheduling algorithm. We also conduct extensive trace-driven simulations and our results show that our algorithm achieves a good balance between the transmission cost and user QoE.展开更多
Large intelligent surface(LIS)is considered as a new solution to enhance the performance of wireless networks[1].LIS comprises low-cost passive elements which can be well controlled.In this paper,a LIS is invoked in t...Large intelligent surface(LIS)is considered as a new solution to enhance the performance of wireless networks[1].LIS comprises low-cost passive elements which can be well controlled.In this paper,a LIS is invoked in the vehicular networks.We analyze the system performance under Weibull fading.We derive a novel exact analytical expression for outage probability in closed form.Based on the analytical result,we discuss three special scenarios including high SNR case,low SNR case,as well as weak interference case.The corresponding approximations for three cases are provided,respectively.In order to gain more insights,we obtain the diversity order of outage probability and it is proved that the outage probability at high SNR depends on the interference,threshold and fading parameters which leads to 0 diversity order.Furthermore,we investigate the ergodic achievable rate of LIS-assisted vehicular networks and present the closed-form tight bounds.Similar to the outage performance,three special cases are studied and the asymptotic expressions are provided in simple forms.A rate ceiling is shown for high SNRs due to the existence of interference which results 0 high SNR slope.Finally,we give the energy efficiency of LIS-assisted vehicular network.Numerical results are presented to verify the accuracy of our analysis.It is evident that the performance of LIS-assisted vehicular networks with optimal phase shift scheme exceeds that of traditional vehicular networks and random phase Received:Aug.6,2020 Revised:Nov.17,2020 Editor:Caijun Zhong shift scheme significantly.展开更多
In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship ...In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion, a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold. Simulations were done to compare the performance of CEB with that of RBEB and BEB, and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.展开更多
In this paper,multi-UAV trajectory planning and resource allocation are jointly investigated to improve the information freshness for vehicular networks,where the vehicles collect time-critical traffic information by ...In this paper,multi-UAV trajectory planning and resource allocation are jointly investigated to improve the information freshness for vehicular networks,where the vehicles collect time-critical traffic information by on-board sensors and upload to the UAVs through their allocated spectrum resource.We adopt the expected sum age of information(ESAoI)to measure the network-wide information freshness.ESAoI is jointly affected by both the UAVs trajectory and the resource allocation,which are coupled with each other and make the analysis of ESAoI challenging.To tackle this challenge,we introduce a joint trajectory planning and resource allocation procedure,where the UAVs firstly fly to their destinations and then hover to allocate resource blocks(RBs)during a time-slot.Based on this procedure,we formulate a trajectory planning and resource allocation problem for ESAoI minimization.To solve the mixed integer nonlinear programming(MINLP)problem with hybrid decision variables,we propose a TD3 trajectory planning and Round-robin resource allocation(TTPRRA).Specifically,we exploit the exploration and learning ability of the twin delayed deep deterministic policy gradient algorithm(TD3)for UAVs trajectory planning,and utilize Round Robin rule for the optimal resource allocation.With TTP-RRA,the UAVs obtain their flight velocities by sensing the locations and the age of information(AoI)of the vehicles,then allocate the RBs to the vehicles in a descending order of AoI until the remaining RBs are not sufficient to support another successful uploading.Simulation results demonstrate that TTP-RRA outperforms the baseline approaches in terms of ESAoI and average AoI(AAoI).展开更多
This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside inf...This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other moving vehicles. For such a system, we propose a mobile-service based max-min fairness resource scheduling scheme, where service amount which is more suitable for high mobility scenarios is adopted to characterize the information transmission capacity of the links and the max-min criteria is adopted to meet the fairness requirement of the moving vehicles. Simulation results demonstrate the effectiveness of our proposed scheme. It is shown that our proposed scheme archives higher throughput and better fairness compared with random scheduling scheme and non-relaying scheme.展开更多
Vehicular ad hoc networks （VANETs） that use the IEEE 802.11p communication standard face a number of challenges, not least when it comes to safety messages on the VANET control channel （CCH） where short delay time...Vehicular ad hoc networks （VANETs） that use the IEEE 802.11p communication standard face a number of challenges, not least when it comes to safety messages on the VANET control channel （CCH） where short delay times and reliable delivery are of pri- mary importance. In this paper we propose a vehicular machine-to-machine （VM2M） overlay network that uses Long Term Evolu- tion （LTE） physical random access channel （PRACH） to emulate VANET CCH. The overlay network uses dedicated preambles to separate vehicular traffic from regular LTE traffic and a cartier sense multiple access with collision avoidance （CSMA-CA） layer similar to the one used in IEEE 802.15.4 to avoid the four step handshake and the overhead it incurs. The performance of the pro- posed overlay is evaluated under a wide range of PRACH parameters which conform to the scenarios with high vehicle velocities and large distances between roadside units （RSUs） that may be encountered in rural areas and on highways.展开更多
This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigati...This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigation is popular with drivers either for efficient driv- ing in unfamiliar road networks or for a better route, even in familiar road networks with heavy traffic. In this paper, we describe how to take advantage of vehicle trajectories in order to design data-forwarding schemes for information exchange in vehicular networks. The design of data-forwarding schemes takes into account not only the macro-scoped mobility of vehicular traffic statistics in road net- works, but also the micro-scoped mobility of individual vehicle trajectories. This paper addresses the importance of vehicle trajectory in the design of multihop vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes. First, we explain the modeling of packet delivery delay and vehicle travel delay in both a road segment and an end-to-end path in a road net- work. Second, we describe a state-of-the-art data forwarding scheme using vehicular traffic statistics for the estimation of the end-to- end delivery delay as a forwarding metric. Last, we describe two data forwarding schemes based on both vehicle trajectory and vehicu- lar traffic statistics in a privacy-preserving manner.展开更多
Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploit...Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques.展开更多
Heterogeneous vehicular networks （HetVNETs） are regarded as a promising technique for meeting various requirements of intelli- gent transportation system （ITS） services. With the rapid development of mobile Intern...Heterogeneous vehicular networks （HetVNETs） are regarded as a promising technique for meeting various requirements of intelli- gent transportation system （ITS） services. With the rapid development of mobile Internet in the past decade, social networks （SNs） have become an indispensable part of human life. Based on this indivisible relationship between vehicles and users, social charac- teristics and human behaviors can significantly affect vehicular network performance. Hence, we firstly present two architectures for SNs by introducing social characteristics into the HetVNETs. Then, several user cases are also given in this paper, in which service requirements are analyzed simultaneously. At last, we briefly discuss potential challenges raised by the HetVNETs for SNs.展开更多
The growing demand for low delay vehicular content has put tremendous strain on the backbone network.As a promising alternative,cooperative content caching among different cache nodes can reduce content access delay.H...The growing demand for low delay vehicular content has put tremendous strain on the backbone network.As a promising alternative,cooperative content caching among different cache nodes can reduce content access delay.However,heterogeneous cache nodes have different communication modes and limited caching capacities.In addition,the high mobility of vehicles renders the more complicated caching environment.Therefore,performing efficient cooperative caching becomes a key issue.In this paper,we propose a cross-tier cooperative caching architecture for all contents,which allows the distributed cache nodes to cooperate.Then,we devise the communication link and content caching model to facilitate timely content delivery.Aiming at minimizing transmission delay and cache cost,an optimization problem is formulated.Furthermore,we use a multi-agent deep reinforcement learning(MADRL)approach to model the decision-making process for caching among heterogeneous cache nodes,where each agent interacts with the environment collectively,receives observations yet a common reward,and learns its own optimal policy.Extensive simulations validate that the MADRL approach can enhance hit ratio while reducing transmission delay and cache cost.展开更多
基金funded by the Six Talent Peaks Project in Jiangsu Province(No.KTHY-052)the National Natural Science Foundation of China(No.61971245)+1 种基金the Science and Technology program of Nantong(Contract No.JC2018048)the Key Lab of Advanced Optical Manufacturing Technologies of Jiangsu Province&Key Lab of Modern Optical Technologies of Education Ministry of China,Soochow University(No.KJS1858).
文摘To achieve the better system performance for cooperative communication in non-orthogonal cognitive radio vehicular adhoc networks(CR-VANETs),this paper investigates the power allocation considering the interference to the main system in a controllable range.We propose a three-slot one-way vehicle system model where the mobile vehicle nodes complete information interaction with the assistance of other independent nodes by borrowing the unused radio spectrum with the primary networks.The end-to-end SNR relationship in overlay and underlay cognitive communication system mode are analyzed by using two forwarding protocol,namely,decode-and-forward(DF)protocol and amplify-and-forward(AF)protocol,respectively.The system outage probability is derived and the optimal power allocation factor is obtained via seeking the minimum value of the approximation of system outage probability.The analytical results have been confirmed by means of Monte Carlo simulations.Simulation results show that the proposed system performance in terms of outage under the optimal power allocation is superior to that under the average power allocation,and is also better than that under other power allocation systems.
基金the National Natural Sci-ence Foundation of China under Grant No.61772185.
文摘As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and industry.In order to ensure the security of VANET,vehicles need to be authen-ticated before accessing the network.Most existing authentication protocols in VANET adopt the Trusted Authority(TA)with centralized structure which is re-sponsible for the authentication tasks of all vehicles.However,the large-scale network consume a lot of computing resources,which leads to unacceptable de-lay in message transmission in VANET.For reducing the computational cost of TA,an efficient three-factor privacy-preserving authentication and key agreement protocol was proposed in our paper.Different from before,the RoadSide Unit(RSU)no longer acts as an intermediate node but is responsible for assisting user authentication,which lead to the computational cost of TA is very low.Through formal and informal analysis,our protocol demonstrates excellent security.Com-pared with previous studies,our work emerges advan-tages and superiorities in the following aspects:com-putational cost,communication cost,security proper-ties and functions,message loss ratio,and message de-lay.These data and evidence indicate that our protocol is an ideal choice for large-scale VANET.
基金supported in part by the National Natural Science Foundation of China under Grant 61941113,Grant 61971033,and Grant 61671057by the Henan Provincial Department of Science and Technology Project(No.212102210408)by the Henan Provincial Key Scientific Research Project(No.22A520041).
文摘5G technology has endowed mobile communication terminals with features such as ultrawideband access,low latency,and high reliability transmission,which can complete the network access and interconnection of a large number of devices,thus realizing richer application scenarios and constructing 5G-enabled vehicular networks.However,due to the vulnerability of wireless communication,vehicle privacy and communication security have become the key problems to be solved in vehicular networks.Moreover,the large-scale communication in the vehicular networks also makes the higher communication efficiency an inevitable requirement.In order to achieve efficient and secure communication while protecting vehicle privacy,this paper proposes a lightweight key agreement and key update scheme for 5G vehicular networks based on blockchain.Firstly,the key agreement is accomplished using certificateless public key cryptography,and based on the aggregate signature and the cooperation between the vehicle and the trusted authority,an efficient key updating method is proposed,which reduces the overhead and protects the privacy of the vehicle while ensuring the communication security.Secondly,by introducing blockchain and using smart contracts to load the vehicle public key table for key management,this meets the requirements of vehicle traceability and can dynamically track and revoke misbehaving vehicles.Finally,the formal security proof under the eck security model and the informal security analysis is conducted,it turns out that our scheme is more secure than other authentication schemes in the vehicular networks.Performance analysis shows that our scheme has lower overhead than existing schemes in terms of communication and computation.
基金support by Research on Key Technologies of Dynamically Secure Identity Authentication and Risk Control of Power Business in the Science and Technology Project of State Grid Electric Power Company(No.5204XA19003F)National Natural Science Foundation of China(Grant No.601702048)
文摘Data sharing and privacy securing present extensive opportunities and challenges in vehicular network.This paper introducestrust access authentication scheme’as a mechanism to achieve real-time monitoring and promote collaborative sharing for vehicles.Blockchain,which can provide secure authentication and protected privacy,is a crucial technology.However,traditional cloud computing performs poorly in supplying low-latency and fast-response services for moving vehicles.In this situation,edge computing enabled Blockchain network appeals to be a promising method,where moving vehicles can access storage or computing resource and get authenticated from Blockchain edge nodes directly.In this paper,a hierarchical architecture is proposed consist of vehicular network layer,Blockchain edge layer and Blockchain network layer.Through a authentication mechanism adopting digital signature algorithm,it achieves trusted authentication and ensures valid verification.Moreover,a caching scheme based on many-to-many matching is proposed to minimize average delivery delay of vehicles.Simulation results prove that the proposed caching scheme has a better performance than existing schemes based on central-ized model or edge caching strategy in terms of hit ratio and average delay.
基金the National Nature Science Foundation of China (61801065, 61601071)Program for Changjiang Scholars and Innovative Research Team in University of Ministry of Education of China (IRT16R72)General project on foundation and cutting-edge research plan of Chongqing (No. cstc2018jcyjAX0463)
文摘As an important application scenario of 5G, the vehicular network has a huge amount of computing data, which brings challenges to the scarce network resources. Mobile edge computing(MEC) sinks cloud services to the edge of network, which reduces the delay jitter caused by remote cloud computing. Software-defined networking(SDN) is an emerging network paradigm with the features of logic centralized control and programmability. In this paper, we construct an SDN-assisted MEC network architecture for the vehicular network. By introducing SDN controller, the efficiency and flexibility of vehicular network are improved, and the network state can be perceived from the global perspective. To further reduce the system overhead, the problem of vehicle to everything(V2X) offloading and resource allocation is proposed, where the optimal offloading decision, transmission power control, subchannels assignment, and computing resource allocation scheme are given. The optimization problem is transformed into three stages because of the heterogeneity of the offloaded tasks and the NP-hard property of the problem. Firstly, the analytic hierarchy process is used to select initial offloading node, then stateless Q-learning is adopted to allocate transmission power, subchannels and computing resources. In addition, the offloading decision is modeled as a potential game, and the Nash equilibrium is proved by the potential function construction. Finally, the numerical results show that the proposed mechanism can effectively reduce the system overhead and achieve better results compared with others’ algorithms.
基金the National Natural Science Foundation of China(NSFC)(Grant No.61671072).
文摘Encouraged by next-generation networks and autonomous vehicle systems,vehicular networks must employ advanced technologies to guarantee personal safety,reduce traffic accidents and ease traffic jams.By leveraging the computing ability at the network edge,multi-access edge computing(MEC)is a promising technique to tackle such challenges.Compared to traditional full offloading,partial offloading offers more flexibility in the perspective of application as well as deployment of such systems.Hence,in this paper,we investigate the application of partial computing offloading in-vehicle networks.In particular,by analyzing the structure of many emerging applications,e.g.,AR and online games,we convert the application structure into a sequential multi-component model.Focusing on shortening the application execution delay,we extend the optimization problem from the single-vehicle computing offloading(SVCOP)scenario to the multi-vehicle computing offloading(MVCOP)by taking multiple constraints into account.A deep reinforcement learning(DRL)based algorithm is proposed as a solution to this problem.Various performance evaluation results have shown that the proposed algorithm achieves superior performance as compared to existing offloading mechanisms in deducing application execution delay.
基金This research was supported in part by the National Natural Science Foundation of China under Grant No.62062031 and 61877053in part by Inner Mongolia natural science foundation grant number 2019MS06035,and Inner Mongolia Science and Technology Major Project,China+1 种基金in part by ROIS NII Open Collaborative Research 21S0601in part by JSPS KAKENHI grant numbers 18KK0279,19H04093,20H00592,and 21H03424.
文摘In order to support advanced vehicular Internet-of-Things(IoT)applications,information exchanges among different vehicles are required to find efficient solutions for catering to different application requirements in complex and dynamic vehicular environments.Federated learning(FL),which is a type of distributed learning technology,has been attracting great interest in recent years as it performs knowledge exchange among different network entities without a violation of user privacy.However,client selection and networking scheme for enabling FL in dynamic vehicular environments,which determines the communication delay between FL clients and the central server that aggregates the models received from the clients,is still under-explored.In this paper,we propose an edge computing-based joint client selection and networking scheme for vehicular IoT.The proposed scheme assigns some vehicles as edge vehicles by employing a distributed approach,and uses the edge vehicles as FL clients to conduct the training of local models,which learns optimal behaviors based on the interaction with environments.The clients also work as forwarder nodes in information sharing among network entities.The client selection takes into account the vehicle velocity,vehicle distribution,and the wireless link connectivity between vehicles using a fuzzy logic algorithm,resulting in an efficient learning and networking architecture.We use computer simulations to evaluate the proposed scheme in terms of the communication overhead and the information covered in learning.
基金This work was supported in part by the National Key R&D Program of China under Grant 2019YFE0114000in part by the National Natural Science Foundation of China under Grant 61701042+1 种基金in part by the 111 Project of China(Grant No.B16006)the research foundation of Ministry of EducationChina Mobile under Grant MCM20180101.
文摘In MEC-enabled vehicular network with limited wireless resource and computation resource,stringent delay and high reliability requirements are challenging issues.In order to reduce the total delay in the network as well as ensure the reliability of Vehicular UE(VUE),a Joint Allocation of Wireless resource and MEC Computing resource(JAWC)algorithm is proposed.The JAWC algorithm includes two steps:V2X links clustering and MEC computation resource scheduling.In the V2X links clustering,a Spectral Radius based Interference Cancellation scheme(SR-IC)is proposed to obtain the optimal resource allocation matrix.By converting the calculation of SINR into the calculation of matrix maximum row sum,the accumulated interference of VUE can be constrained and the the SINR calculation complexity can be effectively reduced.In the MEC computation resource scheduling,by transforming the original optimization problem into a convex problem,the optimal task offloading proportion of VUE and MEC computation resource allocation can be obtained.The simulation further demonstrates that the JAWC algorithm can significantly reduce the total delay as well as ensure the communication reliability of VUE in the MEC-enabled vehicular network.
基金This work was partially supported by the Open Funding of the Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data under Grant Number IPBED3supported by the National Natural Science Foundation of China(NSFC)under Grant Number 61971189supported by the Fundamental Research Funds for the Central Universities under Grant Number 2020MS001.
文摘Collaborative vehicular networks is a key enabler to meet the stringent ultra-reliable and lowlatency communications(URLLC)requirements.A user vehicle(UV)dynamically optimizes task offloading by exploiting its collaborations with edge servers and vehicular fog servers(VFSs).However,the optimization of task offloading in highly dynamic collaborative vehicular networks faces several challenges such as URLLC guaranteeing,incomplete information,and dimensionality curse.In this paper,we first characterize URLLC in terms of queuing delay bound violation and high-order statistics of excess backlogs.Then,a Deep Reinforcement lEarning-based URLLCAware task offloading algorithM named DREAM is proposed to maximize the throughput of the UVs while satisfying the URLLC constraints in a besteffort way.Compared with existing task offloading algorithms,DREAM achieves superior performance in throughput,queuing delay,and URLLC.
基金supported by National Science Fund for Distinguished Young Scholars (No.60525110)National 973 Program (No. 2007CB307100, 2007CB307103)+2 种基金National Natural Science Foundation of China (No. 60902051)Chinese Universities Scientific Fund (BUP-T2009RC0505)Development Fund Project for Electronic and Information Industry (Mobile Service and Application System Based on 3G)
文摘In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximat- ed by an exponential distribution. The probabilities of Vehicular Ad Hoc Network connectivity for difference cases are derived. Furthermore we proof that the nodes in a sub-interval [z1, z1 ＋ △z] of interval [0,z],z 〉 0 where all the nodes are independently uniform distributed is a Poisson process and the relationship of Vehicle Ad hoc Networks and one-dimensional Ad Hoc networks where nodes independently uniform distributed in [zl, z1 ＋ △z] is explained. The analysis is validated by computing the probability of network connectivity and comparing it with the Mont Carlo simu- lation results.
基金supported in part by the National Science Foundation of China under Grant 61272397,Grant 61572538,Grant 61174152,Grant 61331008in part by the Guangdong Natural Science Funds for Distinguished Young Scholar under Grant S20120011187
文摘Most of previous video recording devices in mobile vehicles commonly store captured video contents locally. With the rapid development of 4G/Wi Fi networks, there emerges a new trend to equip video recording devices with wireless interfaces to enable video uploading to the cloud for video playback in a later time point. In this paper, we propose a QoE-aware mobile cloud video recording scheme in the roadside vehicular networks, which can adaptively select the proper wireless interface and video bitrate for video uploading to the cloud. To maximize the total utility, we need to design a control strategy to carefully balance the transmission cost and the achieved QoE for users. To this purpose, we investigate the tradeoff between cost incurred by uploading through cellular networks and the achieved QoE of users. We apply the optimization framework to solve the formulated problem and design an online scheduling algorithm. We also conduct extensive trace-driven simulations and our results show that our algorithm achieves a good balance between the transmission cost and user QoE.
基金supported by the National Natural Science Foundation of China(No.61701201,61771252,61801244,61801238)the National Key Research and Development Program(No.2020YFB1806608,2019YFB2103004)+1 种基金Six Talent Peaks Project in Jiangsu ProvinceProject of Key Laboratory of Wireless Communications of Jiangsu Province.
文摘Large intelligent surface(LIS)is considered as a new solution to enhance the performance of wireless networks[1].LIS comprises low-cost passive elements which can be well controlled.In this paper,a LIS is invoked in the vehicular networks.We analyze the system performance under Weibull fading.We derive a novel exact analytical expression for outage probability in closed form.Based on the analytical result,we discuss three special scenarios including high SNR case,low SNR case,as well as weak interference case.The corresponding approximations for three cases are provided,respectively.In order to gain more insights,we obtain the diversity order of outage probability and it is proved that the outage probability at high SNR depends on the interference,threshold and fading parameters which leads to 0 diversity order.Furthermore,we investigate the ergodic achievable rate of LIS-assisted vehicular networks and present the closed-form tight bounds.Similar to the outage performance,three special cases are studied and the asymptotic expressions are provided in simple forms.A rate ceiling is shown for high SNRs due to the existence of interference which results 0 high SNR slope.Finally,we give the energy efficiency of LIS-assisted vehicular network.Numerical results are presented to verify the accuracy of our analysis.It is evident that the performance of LIS-assisted vehicular networks with optimal phase shift scheme exceeds that of traditional vehicular networks and random phase Received:Aug.6,2020 Revised:Nov.17,2020 Editor:Caijun Zhong shift scheme significantly.
基金supported by National Basic Research Program of China (2013CB329005)National Natural Science Foundation of China (61302100, 61201162, 61471203)+1 种基金Basic Research Program of Jiangsu Province (BK2011027)Specialized Research Fund for the Doctoral Program of Higher Education (20133223120002)
文摘In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion, a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold. Simulations were done to compare the performance of CEB with that of RBEB and BEB, and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.
基金supported in part by the Project of International Cooperation and Exchanges NSFC under Grant No.61860206005in part by the Joint Funds of the NSFC under Grant No.U22A2003.
文摘In this paper,multi-UAV trajectory planning and resource allocation are jointly investigated to improve the information freshness for vehicular networks,where the vehicles collect time-critical traffic information by on-board sensors and upload to the UAVs through their allocated spectrum resource.We adopt the expected sum age of information(ESAoI)to measure the network-wide information freshness.ESAoI is jointly affected by both the UAVs trajectory and the resource allocation,which are coupled with each other and make the analysis of ESAoI challenging.To tackle this challenge,we introduce a joint trajectory planning and resource allocation procedure,where the UAVs firstly fly to their destinations and then hover to allocate resource blocks(RBs)during a time-slot.Based on this procedure,we formulate a trajectory planning and resource allocation problem for ESAoI minimization.To solve the mixed integer nonlinear programming(MINLP)problem with hybrid decision variables,we propose a TD3 trajectory planning and Round-robin resource allocation(TTPRRA).Specifically,we exploit the exploration and learning ability of the twin delayed deep deterministic policy gradient algorithm(TD3)for UAVs trajectory planning,and utilize Round Robin rule for the optimal resource allocation.With TTP-RRA,the UAVs obtain their flight velocities by sensing the locations and the age of information(AoI)of the vehicles,then allocate the RBs to the vehicles in a descending order of AoI until the remaining RBs are not sufficient to support another successful uploading.Simulation results demonstrate that TTP-RRA outperforms the baseline approaches in terms of ESAoI and average AoI(AAoI).
基金supported by the Chinese Postdoctoral Science Foundation No. 2015M570937the Open Research Fund of National Mobile Communications Research Laboratory,Southeast University No. 2014D03+2 种基金the National High-Tech R&D Program(863 Program) No.2015AA010301the National Natural Science Foundation of Chinaunder Grant No.61572072the Fundamental Research Funds for the Central Universities "Research on the System of Personalized Education using Big Data"
文摘This paper investigates the resource scheduling for heterogeneous vehicular networks, where some moving vehicles are selected and scheduled as helping relays to assist information transmission between the roadside infrastructure and other moving vehicles. For such a system, we propose a mobile-service based max-min fairness resource scheduling scheme, where service amount which is more suitable for high mobility scenarios is adopted to characterize the information transmission capacity of the links and the max-min criteria is adopted to meet the fairness requirement of the moving vehicles. Simulation results demonstrate the effectiveness of our proposed scheme. It is shown that our proposed scheme archives higher throughput and better fairness compared with random scheduling scheme and non-relaying scheme.
文摘Vehicular ad hoc networks （VANETs） that use the IEEE 802.11p communication standard face a number of challenges, not least when it comes to safety messages on the VANET control channel （CCH） where short delay times and reliable delivery are of pri- mary importance. In this paper we propose a vehicular machine-to-machine （VM2M） overlay network that uses Long Term Evolu- tion （LTE） physical random access channel （PRACH） to emulate VANET CCH. The overlay network uses dedicated preambles to separate vehicular traffic from regular LTE traffic and a cartier sense multiple access with collision avoidance （CSMA-CA） layer similar to the one used in IEEE 802.15.4 to avoid the four step handshake and the overhead it incurs. The performance of the pro- posed overlay is evaluated under a wide range of PRACH parameters which conform to the scenarios with high vehicle velocities and large distances between roadside units （RSUs） that may be encountered in rural areas and on highways.
基金supported by Faculty Research Fund,Sungkyunkwan University,2013 and by DGIST CPS Global Centerpartly supported by Next-Generation Information Computing Development Program through the National Research Foundation of Korea(NRF)+1 种基金funded by the Ministry of Science,ICT & Future Planning(No.2012033347)the ITR & D program of MKE/KEIT(10041244,SmartTV 2.0 Software Platform)
文摘This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigation is popular with drivers either for efficient driv- ing in unfamiliar road networks or for a better route, even in familiar road networks with heavy traffic. In this paper, we describe how to take advantage of vehicle trajectories in order to design data-forwarding schemes for information exchange in vehicular networks. The design of data-forwarding schemes takes into account not only the macro-scoped mobility of vehicular traffic statistics in road net- works, but also the micro-scoped mobility of individual vehicle trajectories. This paper addresses the importance of vehicle trajectory in the design of multihop vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes. First, we explain the modeling of packet delivery delay and vehicle travel delay in both a road segment and an end-to-end path in a road net- work. Second, we describe a state-of-the-art data forwarding scheme using vehicular traffic statistics for the estimation of the end-to- end delivery delay as a forwarding metric. Last, we describe two data forwarding schemes based on both vehicle trajectory and vehicu- lar traffic statistics in a privacy-preserving manner.
基金supported by China 973 Program(2014CB340303)NSFC(No.61170238,60903190)National 863 Program(2013AA01A601)
文摘Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques.
基金supported in part by National Science Foundation of China(No.61331009)National Key Technology R&D Program of China(No.2015ZX03002009-004)
文摘Heterogeneous vehicular networks （HetVNETs） are regarded as a promising technique for meeting various requirements of intelli- gent transportation system （ITS） services. With the rapid development of mobile Internet in the past decade, social networks （SNs） have become an indispensable part of human life. Based on this indivisible relationship between vehicles and users, social charac- teristics and human behaviors can significantly affect vehicular network performance. Hence, we firstly present two architectures for SNs by introducing social characteristics into the HetVNETs. Then, several user cases are also given in this paper, in which service requirements are analyzed simultaneously. At last, we briefly discuss potential challenges raised by the HetVNETs for SNs.
基金supported by the National Natural Science Foundation of China(62231020,62101401)the Youth Innovation Team of Shaanxi Universities。
文摘The growing demand for low delay vehicular content has put tremendous strain on the backbone network.As a promising alternative,cooperative content caching among different cache nodes can reduce content access delay.However,heterogeneous cache nodes have different communication modes and limited caching capacities.In addition,the high mobility of vehicles renders the more complicated caching environment.Therefore,performing efficient cooperative caching becomes a key issue.In this paper,we propose a cross-tier cooperative caching architecture for all contents,which allows the distributed cache nodes to cooperate.Then,we devise the communication link and content caching model to facilitate timely content delivery.Aiming at minimizing transmission delay and cache cost,an optimization problem is formulated.Furthermore,we use a multi-agent deep reinforcement learning(MADRL)approach to model the decision-making process for caching among heterogeneous cache nodes,where each agent interacts with the environment collectively,receives observations yet a common reward,and learns its own optimal policy.Extensive simulations validate that the MADRL approach can enhance hit ratio while reducing transmission delay and cache cost.
