23 June 2020 in IEEE Transactions on Network Science and Engineering
Vehicular edge computing (VEC) extends edge computing to vehicular networks by exploiting computation resources of proximate vehicles to offload tasks for service requesters. However, VEC faces several critical challenges such as the potential security issues caused by untrusted and opaque environment and the lack of incentive mechanism under a practical scenario with asymmetric information. To solve the above challenges, we propose a vehicular consortium blockchain for secure resource sharing in VEC. Then, we design multi-step smart contracts to achieve secure resource sharing and defend against the malicious behaviours of service requesters and vehicles with selfish purposes. Afterwards, a byzantine fault tolerance-based proof-of-stake (BFT-based PoS) consensus protocol is applied in vehicular consortium blockchain to reach consensus efficiently. Furthermore, we design a contract-based incentive mechanism to motivate vehicles to share their computation resources with service requesters. A practical asymmetric information scenario where the service requesters are not aware of the private information of vehicles is considered. The optimal contracts are derived to maximize the service requesters' expected utility as well as social welfare. Finally, simulation results demonstrate that the proposed incentive mechanism is more effective and efficient than the traditional schemes.
7 September 2020 in IEEE Transactions on Signal Processing
In this paper, we investigate a large intelligent surface-enhanced (LIS-enhanced) system, where a LIS is deployed to assist secure transmission. Our design aims to maximize the achievable secrecy rates in different channel models, i.e., Rician fading and (or) independent and identically distributed Gaussian fading for the legitimate and eavesdropper channels. In addition, we take into consideration an artificial noise-aided transmission structure for further improving system performance. The difficulties of tackling the aforementioned problems are the structure of the expected secrecy rate expressions and the non-convex phase shift constraint. To facilitate the design, we propose two frameworks, namely the sample average approximation based (SAA-based) algorithm and the hybrid stochastic projected gradient-convergent policy (hybrid SPG-CP) algorithm, to calculate the expectation terms in the secrecy rate expressions. Meanwhile, majorization minimization (MM) is adopted to address the non-convexity of the phase shift constraint. In addition, we give some analyses on two special scenarios by making full use of the expectation terms. Simulation results show that the proposed algorithms effectively optimize the secrecy communication rate for the considered setup, and the LIS-enhanced system greatly improves secrecy performance compared to conventional architectures without LIS.
9 April 2021 in IEEE Transactions on Computational Social Systems
Mobile crowdsensing (MCS) has heated up and has become a new paradigm of data collection. In the process of the task allocation of MCS, users are often required to provide their own location information with the server to conveniently dispatch some suitable tasks to them. However, it is possible for malicious servers to infer some sensitive information based on the user’s location such as the user’s home address or the user’s trajectory and so on which will cause serious privacy issues. Recently, differential privacy (DP) has become a promising privacy protection scheme. However, the existing DP schemes in location privacy protection for MCS do not pay attention to the accuracy of task allocation as equally as the effects of privacy protection, which often results in the task allocation to be inaccurate and inefficient. In order to overcome the shortcoming, we propose a novel MCS task allocation scheme integrating the mapping accuracy of task-worker with the privacy-preserving effect on the user’s location. Besides edge devices, its implementation system consists of a task allocation server and a third party, both of which are semitrusted, that is, both of them only know about the user’s rough location information but cannot obtain the user’s exact location. At first, to improve the response speed of MCS task requests and the location privacy protection of MCS users, our scheme can exploit more than one edge-computing node nearby a user to cooperatively participate in MCS task allocation by aggregating him/her and the near users into groups. Then, our scheme can further enhance the location privacy protection effect based on the Johnson–Lindenstrauss (JL) transformation, which can achieve accurate task allocation and hold the merits of DP. Finally, we verify the feasibility by some experiments based on two data sets. The performance is compared with that of $t$ he typical DP. The results show that our scheme not only provides strict privacy guarantees but also has higher performance.
18 June 2021 in IEEE Transactions on Computational Social Systems
The development of the content-centric Internet of Things (C2IoT) enriches the services provided by the IoT devices, which diversifies the provided contents. However, system resources are terribly wasted by repeated delivering the same content. Efficiently utilizing caching resources can reduce the link load caused by delivering and forwarding contents, further improving the users’ quality of experience (QoE). However, the collaboration among independent decision nodes is insufficient, which consumes substantial energy redundantly. To solve the mentioned issue, we propose a genetic-algorithm-based collaborative caching scheme integrating on-path strategy and off-path strategy, named cost-oriented caching scheme (CCS), to minimize the energy consumption of requesting contents. First, based on the analysis of content popularity, users’ historical requests, and transmission delay, an optimization problem is formulated to minimize the communication delay of obtaining content. Then, we formulate a submodular function optimization problem to optimize energy consumption, and an improved genetic algorithm is proposed to solve the mentioned problem. Performance evaluations demonstrate that the proposed CCS is superior to other existing caching schemes.
2 June 2021 in Science China Information Sciences
1 June 2021 in IEEE Wireless Communications
The recent COVID-19 pandemic has brought significant challenges to the traditional healthcare industry. A novel eHealth system is required to cope with infectious and chronic diseases. This article proposes an online eHealth system to monitor patients and provides edge computing services based on the Internet of Unmanned Aerial Vehicles (UAVs). In order to minimize the health monitoring latency and guarantee the resource utilization efficiency of UAVs, the Lyapunov optimization method is utilized to decompose the long-term optimization problem into a series of instantaneous optimization problems. Then the decomposed sub-problem is formulated as a minimum cost maximum flow problem by constructing a bipartite graph that maps medical analysis requests to target UAVs. Extensive experimental results demonstrate the effectiveness of our system. Finally, system analyses illustrate that the robustness and scalability of our eHealth system is favorable, and our system can provide agile edge computing services for dispersed patients.