BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Van-Dinh Nguyen

Van-Dinh Nguyen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
eess.SPInformation Theorymath.ITComputer VisionCryptography and Security

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
10works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

10 published item(s)

preprint2026arXiv

ChronoSC: Task-Oriented Semantic Communication via Temporal-to-Color Encoding

Semantic communication (SC) aims to reduce transmission overhead by conveying task-relevant information rather than raw data. However, existing SC approaches for video largely focus on pixel-level reconstruction or rely on complex spatiotemporal pipelines, leading to excessive bandwidth usage and latency that are unsuitable for low-resource deployments. In this paper, we propose ChronoSC, a task-oriented semantic communication framework for Video Question Answering (VideoQA). ChronoSC introduces Chrono-Color Stacking, a lightweight and lossless projection scheme that encodes temporal video dynamics into a single static image, enabling extreme temporal compression before transmission. This compact semantic representation is transmitted using a lightweight Deep Joint Source-Channel Coding (DeepJSCC) transceiver and explicitly reconstructed at the receiver. Unlike latent-space methods, explicit visual reconstruction enables the direct reuse of pre-trained vision-language models; specifically, a pre-trained BLIP model is employed to infer answers from noisy, reconstructed chrono-images. Experiments on the CLEVRER dataset show that ChronoSC achieves up to 192 times bandwidth reduction compared to raw video transmission while maintaining high VideoQA accuracy.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

An Efficient Deep CNN Design for EH Short-Packet Communications in Multihop Cognitive IoT Networks

In this paper, we design an efficient deep convolutional neural network (CNN) to improve and predict the performance of energy harvesting (EH) short-packet communications in multi-hop cognitive Internet-of-Things (IoT) networks. Specifically, we propose a Sum-EH scheme that allows IoT nodes to harvest energy from either a power beacon or primary transmitters to improve not only packet transmissions but also energy harvesting capabilities. We then build a novel deep CNN framework with feature enhancement-collection blocks based on the proposed Sum-EH scheme to simultaneously estimate the block error rate (BLER) and throughput with high accuracy and low execution time. Simulation results show that the proposed CNN framework achieves almost exactly the BLER and throughput of Sum-EH one, while it considerably reduces computational complexity, suggesting a real-time setting for IoT systems under complex scenarios. Moreover, the designed CNN model achieves the root-mean-square-error (RMSE) of ${1.33\times10^{-2}}$ on the considered dataset, which exhibits the lowest RMSE compared to the deep neural network and state-of-the-art machine learning approaches.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Hybrid Active-Passive Reconfigurable Intelligent Surface-Assisted Multi-User MISO Systems

We consider a multi-user multiple-input single-output (MISO) communications system which is assisted by a hybrid active-passive reconfigurable intelligent surface (RIS). Unlike conventional passive RISs, hybrid RIS is equipped with a few active elements with the ability to reflect and amplify incident signals to significantly improve the system performance. Towards a fairness-oriented design, we maximize the minimum rate among all users through jointly optimizing the transmit beamforming vectors and RIS reflecting/amplifying coefficients. Combining tools from block coordinate ascent and successive convex approximation, the challenging nonconvex problem is efficiently solved by a low-complexity iterative algorithm. The numerical results show that a hybrid RIS with 4 active elements out of a total of 50 elements with a power budget of -1 dBm offers an improvement of up to 80% to the considered system, while that achieved by a fully passive RIS is only 27%.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Intelligent Blockchain-based Edge Computing via Deep Reinforcement Learning: Solutions and Challenges

The convergence of mobile edge computing (MEC) and blockchain is transforming the current computing services in wireless Internet-of-Things networks, by enabling task offloading with security enhancement based on blockchain mining. Yet the existing approaches for these enabling technologies are isolated, providing only tailored solutions for specific services and scenarios. To fill this gap, we propose a novel cooperative task offloading and blockchain mining (TOBM) scheme for a blockchain-based MEC system, where each edge device not only handles computation tasks but also deals with block mining for improving system utility. To address the latency issues caused by the blockchain operation in MEC, we develop a new Proof-of-Reputation consensus mechanism based on a lightweight block verification strategy. To accommodate the highly dynamic environment and high-dimensional system state space, we apply a novel distributed deep reinforcement learning-based approach by using a multi-agent deep deterministic policy gradient algorithm. Experimental results demonstrate the superior performance of the proposed TOBM scheme in terms of enhanced system reward, improved offloading utility with lower blockchain mining latency, and better system utility, compared to the existing cooperative and non-cooperative schemes. The paper concludes with key technical challenges and possible directions for future blockchain-based MEC research.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Energy Efficiency Maximization in RIS-Aided Cell-Free Network with Limited Backhaul

Integrating the reconfigurable intelligent surface in a cell-free (RIS-CF) network is an effective solution to improve the capacity and coverage of future wireless systems with low cost and power consumption. The reflecting coefficients of RISs can be programmed to enhance signals received at users. This letter addresses a joint design of transmit beamformers at access points and reflecting coefficients at RISs to maximize the energy efficiency (EE) of RIS-CF networks, taking into account the limited backhaul capacity constraints. Due to a very computationally challenging nonconvex problem, we develop a simple yet efficient alternating descent algorithm for its solution. Numerical results verify that the EE of RIS-CF networks is greatly improved, showing the benefit of using RISs.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Machine Learning-Enabled Joint Antenna Selection and Precoding Design: From Offline Complexity to Online Performance

We investigate the performance of multi-user multiple-antenna downlink systems in which a BS serves multiple users via a shared wireless medium. In order to fully exploit the spatial diversity while minimizing the passive energy consumed by radio frequency (RF) components, the BS is equipped with M RF chains and N antennas, where M < N. Upon receiving pilot sequences to obtain the channel state information, the BS determines the best subset of M antennas for serving the users. We propose a joint antenna selection and precoding design (JASPD) algorithm to maximize the system sum rate subject to a transmit power constraint and QoS requirements. The JASPD overcomes the non-convexity of the formulated problem via a doubly iterative algorithm, in which an inner loop successively optimizes the precoding vectors, followed by an outer loop that tries all valid antenna subsets. Although approaching the (near) global optimality, the JASPD suffers from a combinatorial complexity, which may limit its application in real-time network operations. To overcome this limitation, we propose a learning-based antenna selection and precoding design algorithm (L-ASPA), which employs a DNN to establish underlaying relations between the key system parameters and the selected antennas. The proposed L-ASPD is robust against the number of users and their locations, BS&#39;s transmit power, as well as the small-scale channel fading. With a well-trained learning model, it is shown that the L-ASPD significantly outperforms baseline schemes based on the block diagonalization and a learning-assisted solution for broadcasting systems and achieves higher effective sum rate than that of the JASPA under limited processing time. In addition, we observed that the proposed L-ASPD can reduce the computation complexity by 95% while retaining more than 95% of the optimal performance.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Novel Heap-based Pilot Assignment for Full Duplex Cell-Free Massive MIMO with Zero-Forcing

This paper investigates the combined benefits of full-duplex (FD) and cell-free massive multiple-input multipleoutput (CF-mMIMO), where a large number of distributed access points (APs) having FD capability simultaneously serve numerous uplink and downlink user equipments (UEs) on the same time-frequency resources. To enable the incorporation of FD technology in CF-mMIMO systems, we propose a novel heapbased pilot assignment algorithm, which not only can mitigate the effects of pilot contamination but also reduce the involved computational complexity. Then, we formulate a robust design problem for spectral efficiency (SE) maximization in which the power control and AP-UE association are jointly optimized, resulting in a difficult mixed-integer nonconvex programming. To solve this problem, we derive a more tractable problem before developing a very simple iterative algorithm based on inner approximation method with polynomial computational complexity. Numerical results show that our proposed methods with realistic parameters significantly outperform the existing approaches in terms of the quality of channel estimate and SE.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

On the Spectral and Energy Efficiencies of Full-Duplex Cell-Free Massive MIMO

In-band full-duplex (FD) operation is practically more suited for short-range communications such as WiFi and small-cell networks, due to its current practical limitations on the self-interference cancellation. In addition, cell-free massive multiple-input multiple-output (CF-mMIMO) is a new and scalable version of MIMO networks, which is designed to bring service antennas closer to end user equipments (UEs). To achieve higher spectral and energy efficiencies (SE-EE) of a wireless network, it is of practical interest to incorporate FD capability into CF-mMIMO systems to utilize their combined benefits. We formulate a novel and comprehensive optimization problem for the maximization of SE and EE in which power control, access point-UE (AP-UE) association and AP selection are jointly optimized under a realistic power consumption model, resulting in a difficult class of mixed-integer nonconvex programming. To tackle the binary nature of the formulated problem, we propose an efficient approach by exploiting a strong coupling between binary and continuous variables, leading to a more tractable problem. In this regard, two low-complexity transmission designs based on zero-forcing (ZF) are proposed. Combining tools from inner approximation framework and Dinkelbach method, we develop simple iterative algorithms with polynomial computational complexity in each iteration and strong theoretical performance guaranteed. Furthermore, towards a robust design for FD CF-mMIMO, a novel heap-based pilot assignment algorithm is proposed to mitigate effects of pilot contamination. Numerical results show that our proposed designs with realistic parameters significantly outperform the well-known approaches (i.e., small-cell and collocated mMIMO) in terms of the SE and EE. Notably, the proposed ZF designs require much less execution time than the simple maximum ratio transmission/combining.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Optimization of Rate Fairness in Multi-Pair Wireless-Powered Relaying Systems

This letter considers a multi-pair decode-and-forward relay network where a power-splitting (PS) protocol is adopted at the energy-constrained relay to provide simultaneous wireless information and energy harvesting (EH). To achieve higher efficiency of EH, we propose a new PS-based EH architecture at the relay by incorporating an alternating current (AC) computing logic, which is employed to directly use the wirelessly harvested AC energy for computational blocks. Under a nonlinear EH circuit, our goal is to maximize the fairness of end-to-end rate among user pairs subject to power constraints, resulting in a nonconvex problem. We propose an iterative algorithm to achieve a suboptimal and efficient solution to this challenging problem by leveraging the inner approximation framework. Numerical results demonstrate that the proposed algorithm outperforms the traditional direct current computing and other baseline schemes.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

UAV-Assisted Secure Communications in Terrestrial Cognitive Radio Networks: Joint Power Control and 3D Trajectory Optimization

This paper considers secure communications for an underlay cognitive radio network (CRN) in the presence of an external eavesdropper (Eve). The secrecy performance of CRNs is usually limited by the primary receiver&#39;s interference power constraint. To overcome this issue, we propose to use an unmanned aerial vehicle (UAV) as a friendly jammer to interfere with Eve in decoding the confidential message from the secondary transmitter (ST). Our goal is to jointly optimize the transmit power and UAV&#39;s trajectory in the three-dimensional (3D) space to maximize the average achievable secrecy rate of the secondary system. The formulated optimization problem is nonconvex due to the nonconvexity of the objective and nonconvexity of constraints, which is very challenging to solve. To obtain a suboptimal but efficient solution to the problem, we first transform the original problem into a more tractable form and develop an iterative algorithm for its solution by leveraging the inner approximation framework. We further extend the proposed algorithm to the case of imperfect location information of Eve, where the average worst-case secrecy rate is considered as the objective function. Extensive numerical results are provided to demonstrate the merits of the proposed algorithms over existing approaches.

0 citations0 reviewsNo code linkedOpen access