In this paper, we propose a mobile edge computing (MEC)-enabled unmanned aerial vehicle (UAV)-assisted vehicular ad hoc network (VANET) architecture, based on which a number of vehicles are served by UAVs equipped with computation resource. Each vehicle has to offload its computing tasks to the proper MEC server on the UAV due to the limited computation ability. To counter the problems above, we first model and analyze the transmission model and the security assurance model from the vehicle to the MEC server on UAV, and the task computation model of the local vehicle and the edge UAV. Then, the vehicle offloading problem is formulated as a multi-objective optimization problem by jointly considering the task offloading, the resource allocation, and the security assurance. For tackling this hard problem, we decouple the multi-objective optimization problem as two subproblems and propose an efficient iterative algorithm to jointly make the MEC selection decision based on the criteria of load balancing and optimize the offloading ratio and the computation resource according to the Lagrangian dual decomposition. Finally, the simulation results demonstrate that our proposed scheme achieves significant performance superiority compared with other schemes in terms of the successful task processing ratio and the task processing delay.

No abstract

No abstract

No abstract

No abstract

The Dempster-Shafer theory (DST) is an information fusion framework and widely used in many fields. However, the uncertainty measure of a basic probability assignment (BPA) is still an open issue in DST. There are many methods to quantify the uncertainty of BPAs. However, the existing methods have some limitations. In this paper, a new total uncertainty measure from a perspective of maximum entropy requirement is proposed. The proposed method can measure both dissonance and non-specificity in BPA, which includes two components. The first component is consistent with Yager’s dissonance measure. The second component is the non-specificity measurement with different functions. We also prove the desirable properties of the proposed method. Besides, numerical examples and applications are provided to illustrate the effectiveness of the proposed total uncertainty measure.

No abstract

Dempster–Shafer theory (DST), which is widely used in information fusion, can process uncertain information without prior information; however, when the evidence to combine is highly conflicting, it may lead to counter-intuitive results. Moreover, the existing methods are not strong enough to process real-time and online conflicting evidence. In order to solve the above problems, a novel information fusion method is proposed in this paper. The proposed method combines the uncertainty of evidence and reinforcement learning (RL). Specifically, we consider two uncertainty degrees: the uncertainty of the original basic probability assignment (BPA) and the uncertainty of its negation. Then, Deng entropy is used to measure the uncertainty of BPAs. Two uncertainty degrees are considered as the condition of measuring information quality. Then, the adaptive conflict processing is performed by RL and the combination two uncertainty degrees. The next step is to compute Dempster’s combination rule (DCR) to achieve multi-sensor information fusion. Finally, a decision scheme based on correlation coefficient is used to make the decision. The proposed method not only realizes adaptive conflict evidence management, but also improves the accuracy of multi-sensor information fusion and reduces information loss. Numerical examples verify the effectiveness of the proposed method.