VLDB 2026 Research / reviewers in the wild / expert
Bangning Zhang 0001
dblp:38/10828-1
· DBLP profile ↗
5ranked-venue papers
0as first author
5since 2021 · last 2024
0000-0002-6670-7426ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 5 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Can We Realize Data Freshness Optimization for Privacy Preserving-Mobile Crowdsensing With Artificial Noise?abstractBy utilizing intelligent mobile terminals, mobile crowdsensing (MCS) can realize the sensing data collection effectively and economically. However, the privacy security and freshness quality of the obtained sensing data are two major concerns to be addressed in MCS, as they directly impact the system security and timeliness performance. In this regard, we focus on improving the data freshness performance and protecting sensing data content, sensing terminals' identification, and location information simultaneously. Accordingly, based on the artificial noise (AN)-based differential privacy and covert communication technologies, we aim to jointly minimize the Age of Information (AoI) metric and weighted privacy preservation budget in the single terminal scenario. Besides, we achieve the goal of average AoI optimization with data computing requirements in multiple terminal systems, where the privacy preservation budget is treated as the critical constraint. Furthermore, by using the backward induction (BI) method and block successive upper-bound minimization (BSUM) approach, we solve the above two optimization problems, respectively. Finally, compared with the listed baselines, the results evaluate the proposed schemes' effectiveness under various simulation settings. Yaoqi Yang, Bangning Zhang 0001, Daoxing Guo 0001, Zehui Xiong, Dusit Niyato, Zhu Han 0001 |
IEEE Trans. Mob. Comput. | 2 |
| 2022 | Parameter estimation of multiple frequency-hopping signals based on Bayesian compressive sensing and atomic norm soft thresholding with missing observationsabstractAbstract In this study, the problem of estimating multiple frequency‐hopping (FH) signal parameters in situations in which random observations are missing is addressed. A uniform linear array (ULA) is utilized to receive FH signals, and the missing observations are considered to be equivalent to randomly missing elements in the space‐time matrix obtained from the ULA. Bayesian compressed sensing (BCS) estimates the hopping time of received FH signals by the spatial information from the space‐time matrix and restores the missing observations. The estimated hopping time is implemented as the boundary to divide the signals such that each segment contains a superposition of time‐invariant multiple components. Then, the instantaneous frequency (IF) of multiple components can be estimated precisely by atomic norm soft thresholding (AST) within each segment. After estimating the hopping time and IF, the direction of arrival (DOA) of multiple signals is directly calculated using these two parameters. The simulation results show that the proposed method is superior to existing approaches. Provided that sufficient array elements are available, multi‐FH signal parameters can be estimated with satisfactory accuracy even when a large portion of observations is missing. Hongbin Wang 0007, Bangning Zhang 0001, Heng Wang 0011, Binbin Wu, Daoxing Guo 0001 |
IET Commun. | 2 |
| 2022 | Completion time minimization for UAV enabled data collection with communication link constrainedabstractAbstract This paper studies unmanned aerial vehicles (UAV) enabled industrial Internet of Things while a UAV dispatched to collect data of low‐power ground sensor nodes (SNs) in multi‐obstacle environment. The authors aim to minimize the completion time while satisfying the communication link constraints of each SN and obstacle avoidance, data collection requirements etc. To this end, the authors first formulate the completion time minimization problem by jointly optimizing the UAV trajectory and collection sequence of SNs. The problem is difficult to be optimally solved, as it is non‐convex. To tackle this problem, the authors first transform the original problem to a Traveling Salesman Problem‐like (TSP‐like) problem based on a hover point that can naturally satisfy the communication link constraints of data collection. The dynamic programming (DP) algorithm to figure out the order in which the UAV collects each SN, which gives the initial path of the UAV traversing each SN from the beginning point to the end point. Next, the authors consider the general scenarios of data collection tasks where the UAV also communicates while flying. The authors construct an equivalent problem with integer variable constraints for the original problem with indicative function constraints. The authors rewrite the non‐convex constraints of the equal problem by introducing slack variables and leveraging the SCA, and add the discrete region threat constraints for the traditional path discretization method. Finally, the simulation results verify the effectiveness of the proposed algorithm under different parameter configurations. Binbin Wu, Daoxing Guo 0001, Bangning Zhang 0001, Hongbin Wang 0007, Haichao Wang 0001, Hao Jiang 0006 |
IET Commun. | 3 |
| 2022 | Stochastic Geometry-Based Analysis of Cache-Enabled Hybrid Satellite-Aerial-Terrestrial Networks With Non-Orthogonal Multiple AccessabstractDue to the emergence of non-terrestrial platforms with extensive coverage, flexible deployment, and reconfigurable characteristics, the hybrid satellite-aerial-terrestrial networks (HSATNs) can accommodate a great variety of wireless access services in different applications. To effectively reduce the transmission latency and facilitate the frequent update of files with improved spectrum efficiency, we investigate the performance of cache-enabled HSATN, where the user retrieves the required content files from the cache-enabled aerial node (AN) or the satellite with the non-orthogonal multiple access (NOMA) scheme. If the required content files of the user are cached in the AN, the cache-enabled node would serve directly. Otherwise, the user would retrieve the content file from the satellite system, where the satellite system seeks opportunities for proactive content pushing to ANs during the user content delivery phase. Specifically, taking into account the uncertainty of the number and location of ANs, along with the channel fading of terrestrial users, the outage probability and hit probability of the considered network are, respectively, derived based on stochastic geometry. Numerical results unveil the effectiveness of the cache-enabled HSATN with the NOMA scheme and proclaim the influence of key factors on the system performance. The realistic, tractable, and expandable framework, as well as associated methodology, provide both useful guidance and a solid foundation for evolved networks with advanced configurations in the performance of cache-enabled HSATN. Bangning Zhang 0001, Kang An 0001, Gan Zheng 0001, Symeon Chatzinotas, Daoxing Guo 0001 |
IEEE Trans. Wirel. Commun. | 2 |
| 2021 | Outage-Constrained Robust Multigroup Multicast Beamforming for Satellite-Based Internet of Things Coexisting With Terrestrial NetworksabstractSatellite-based Internet of Things (IoT) is recognized as a cost-effective approach for global access. In this article, we aim at improving the spectrum efficiency of satellite systems to serve a huge number of IoT devices. To this end, we present a cognitive satellite-terrestrial framework, where a multibeam satellite system with full frequency reuse shares the spectrum with terrestrial networks based on the underlay paradigm. Considering DVB-S2X recommendations, geometric configurations, and channel characteristics, we investigate a robust multigroup multicast beamforming design for the satellite-based IoT coexisting with terrestrial networks in the presence of a phase error on channel state information, and characterize the achievable rate region under the outage probability constraint for the terminal and the power consumption constraint for the satellite. Based on the concept of rate profile, an associated optimization problem is formulated to design robust beamformers and determine the Pareto boundary of the region. To solve the intractable problem, we propose a two-level iterative algorithm on the basis of joint bisection search and penalty function enabled nonsmooth optimization. In particular, we develop a Bernstein-type inequality aided method and a large deviation inequality aided method to obtain a tractable and conservative approximation for the probabilistic constraint, respectively. Numerical results are provided to confirm the validity and superiority of our proposed scheme over the existing approaches and reveal the impact of key parameters on the achievable system performance. Yan Yan 0016, Kang An 0001, Bangning Zhang 0001, Wei-Ping Zhu 0001, Guoru Ding, Daoxing Guo 0001 |
IEEE Internet Things J. | 3 |