Searcharxiv⌕ Search

arXiv subjects

Haipeng Dai

Publications and source records attributed to Haipeng Dai.

21 records · Page 2Linked to original sources

Hash Adaptive Bloom Filter

Bloom filter is a compact memory-efficient probabilistic data structure supporting membership testing, i.e., to check whether an element is in a given set. However, as Bloom filter maps each element with uniformly random hash functions, few flexibilities are provided even if the information of negative keys (elements are not in the set) are available. The problem gets worse when the misidentification of negative keys brings different costs. To address the above problems, we propose a new Hash Adaptive Bloom Filter (HABF) that supports the customization of hash functions for keys. The key idea of HABF is to customize the hash functions for positive keys (elements are in the set) to avoid negative keys with high cost, and pack customized hash functions into a lightweight data structure named HashExpressor. Then, given an element at query time, HABF follows a two-round pattern to check whether the element is in the set. Further, we theoretically analyze the performance of HABF and bound the expected false positive rate. We conduct extensive experiments on representative datasets, and the results show that HABF outperforms the standard Bloom filter and its cutting-edge variants on the whole in terms of accuracy, construction time, query time, and memory space consumption (Note that source codes are available in [1]).

cs.DB↗

Air-Ground Collaborative Mobile Edge Computing: Architecture, Challenges, and Opportunities

By pushing computation, cache, and network control to the edge, mobile edge computing (MEC) is expected to play a leading role in fifth generation (5G) and future sixth generation (6G). Nevertheless, facing ubiquitous fast-growing computational demands, it is impossible for a single MEC paradigm to effectively support high-quality intelligent services at end user equipments (UEs). To address this issue, we propose an air-ground collaborative MEC (AGC-MEC) architecture in this article. The proposed AGC-MEC integrates all potentially available MEC servers within air and ground in the envisioned 6G, by a variety of collaborative ways to provide computation services at their best for UEs. Firstly, we introduce the AGC-MEC architecture and elaborate three typical use cases. Then, we discuss four main challenges in the AGC-MEC as well as their potential solutions. Next, we conduct a case study of collaborative service placement for AGC-MEC to validate the effectiveness of the proposed collaborative service placement strategy. Finally, we highlight several potential research directions of the AGC-MEC.

cs.NI↗

Deadline-Driven Multi-node Mobile Charging

Due to the merit without requiring charging cable, wireless power transfer technologies have drawn rising attention as a new method to replenish energy to Wireless Rechargeable Sensor Networks (WRSNs). In this paper, we study mobile charger scheduling problem for multi-node recharging with deadline-series. Our target is to maximize the overall effective charging utility, and minimize the traveling time as well. Instead of charging only once over a scheduling cycle, we incorporate the multiple charging strategy for multi-node charging with deadline constraint, where charging spots and tour are jointly optimized. Specifically, we formulate the effective charging utility maximization problem as to maximize a monotone submodular function subject to a partition matroid constraint, and propose a simple but effective 1/2 -approximation greedy algorithm. After that, we present the grid-based skip-substitute operation further to save the traveling time, which can increase the charging utility. Finally, we conduct the evaluation for the performance of our scheduling scheme. Comparing to the Early Deadline First scheme, the simulation and field experiment results show that our algorithm outperform EDF by 37.5% and 37.9%, respectively.

cs.NI↗