DZDikai Zou

Dikai Zou

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Dikai Zou has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • RASE: Efficient Privacy-Preserving Data Aggregation Against Disclosure Attacks for IoTs

    by Zuyan Wang, Jun Tao, Dikai Zou

    The growing popular awareness of personal privacy raises the following quandary: what is the new paradigm for collecting and protecting the data produced by ever-increasing sensor devices. Most previous studies on co-design of data aggregation and privacy preservation assume that a trusted fusion center adheres to privacy regimes. Very recent work has taken steps towards relaxing the assumption by allowing data contributors to locally perturb their own data. Although these solutions withhold some data content to mitigate privacy risks, they have been shown to offer insufficient protection against disclosure attacks. Aiming at providing a more rigorous data safeguard for the Internet of Things (IoTs), this paper initiates the study of privacy-preserving data aggregation. We propose a novel paradigm (called RASE), which can be generalized into a 3-step sequential procedure–noise addition, followed by random permutation, and then parameter estimation. Specially, we design a differentially private randomizer, which carefully guides data contributors to obfuscate the truth. Then, a shuffler is employed to receive the noisy data from all data contributors. After that, it breaks the correct linkage between senders and receivers by applying a random permutation. The estimation phase involves using inaccurate data to calculate an approximate aggregate value. Extensive simulations are provided to explore the privacy-utility landscape of our RASE.


  • A Preference-Driven Malicious Platform Detection Mechanism for Users in Mobile Crowdsensing

    by Haotian Wang, Jun Tao, Dingwen Chi, Yu Gao, Zuyan Wang, Dikai Zou, Yifan Xu

    Exploiting mobile crowdsensing to conduct data collection and analysis brings unprecedented opportunities to promote the development of the Internet of Things(IoT). However, malicious platforms may provide untrusted data or illegally leak users’ information, which leads users in crowdsensing networks to be reluctant to participate in sensing activities. Besides, users are unwilling to report malicious platforms without sufficient incentives. To tackle the problem, a new incentive mechanism is proposed by modeling users’ preferences in this paper. Specifically, two scenarios are considered to detect malicious platforms when users join sensing activities according to the system grasps user’s information, i.e., complete information scenario and partial information scenario. Different incentive algorithms are designed for each scenario to optimize the systems incentive cost. In the complete information scenario, we minimize the total incentive cost by ranking users’ preferences. In the partial information scenario, uniform Distribution and Laplace Distribution are employed to model the distribution of users’ preferences to find the optimal cost. Specifically, we incorporate the concept of non-convexity into design the incentive mechanism, when user preferences obey the Laplace Distribution. By conducting an in-depth exploration the properties of Laplace Distribution, we can transform it into a convex problem to solve it efficiently. The analysis based on these mechanisms lays a theoretical foundation on the detection of malicious platforms. Furthermore, the soundness of modeling and the accuracy of analysis are verified through extensive simulation, which also guides the design of more sophisticated incentive schemes for the detection of malicious platforms.


  • IMRSG: Incentive Mechanism Based on Rubinstein-Starr Game for Mobile CrowdSensing

    by Haotian Wang, Jun Tao, Dingwen Chi, Yu Gao, Zuyan Wang, Dikai Zou, Yifan Xu

    Exploiting mobile crowdsensing to conduct data collection and analysis has become an emerging trend in IoT computing models. However, in practice, mobile users in crowdsensing networks are unwilling to participate in perceptual tasks without effective stimulation due to limited resources and strategic selfishness. To tackle the problem, a new incentive mechanism is proposed by adopting game theory in this paper. Specifically, the mobile users' preference is considered comprehensively and their energy is changed dynamically through the scheme. Furthermore, the users' preference and energy changes are exploited as equation factors between subsequent users and the platform. To motivate users, we introduce the concept of virtual currency and set a price function that rewards users for participating in sensing tasks in the form of virtual currency. To fit into practical scenarios, we map task interactions to a Rubinstein-Starr bargaining game between a user and sensing platforms based on a fully informative turn-based bargaining model. Through multiple rounds of games between users and crowdsensing platforms, we prove that there is a unique Nash Equilibrium point in the sub-game process of both parties. The analysis based on these models lays a theoretical foundation on the incentive process of mobile crowdsensing. The soundness of modeling and the accuracy of analysis are verified through extensive simulation, which also guides the design of more sophisticated incentive schemes.


  • Open Access

    Toward the Minimal Wait-for Delay for Rechargeable WSNs with Multiple Mobile Chargers

    by Zuyan Wang, Jun Tao, Yifan Xu, Yang Gao, Dikai Zou

    Nowadays, the flourish of the internet of things incurs a great demand for progressive technologies to prolong the lifetime of Wireless Sensor Networks. Exploiting a fleet of Mobile Chargers (MCs) to replenish the energy-critical sensor nodes provides a new dimension to maintain long-term network operations, but may suffer from high charging delay due to MC’s limited mobility. Most existing studies focus on the reduction of server-oriented delay, i.e., the overall time taken by MCs (servers) to carry out sensor charging and travel inside the sensing field. However, these solutions may not be robust enough as some energy-critical sensor nodes will run out of the stored energy before the charger’s arrival. In this article, we address this challenge by reducing the client-oriented delay—referred to as the wait-for delay —which is defined as the “arrival times” at the to-be-charged sensor nodes (clients). To this end, we first formulate a novel wait-for charging delay minimization problem under the multi-node energy charging scheme. We then prove the NP-hardness of the proposed problem. Inspired by empirical observations, we devise an efficient approximation algorithm with a provable approximation ratio for the problem. We have evaluated the proposed algorithm using real-life system settings. The experimental results suggest that the proposed algorithm certainly performs better than the existing benchmarks; it could reduce the wait-for delay by up to 87.4 percent.


  • Open Access

    Joint Optimization between Task Offloading and Resource Allocation in Mobile Edge Computing with multiple UAVs

    by Rujie Chen, Yang Gao, Dikai Zou, Xinyu Chen, Jun Tao

    Energy consumption and completion time are two hot issues in UAV (Unmanned Aerial Vehicles) assisted edge computing.The current research is mainly focused on the interaction between UAVs and edge servers, while the interplay between UAVs is rarely considered.In this paper, in the considered scenario with multiple UAVs and servers, the UAVs may possess idle resources, and thus function as temporary servers to provide task offloading services for other UAVs.We begin by formulating a multi-objective joint optimization problem, which aims to balance the energy consumption and time delay in order to maximize the benefits of the system. Then we use a multi-objective genetic algorithm called Non-dominated Sorting Genetic Algorithm II (NSGA-II) to iteratively find the optimal offloading strategy.Through numerical simulation, the results obtained from the numerical simulation demonstrate the superiority of the proposed method in achieving the Pareto optimal frontier that balances energy consumption and completion time.