Xiangyu Wang , Jian Zhang , Shiwen Mao , Senthilkumar CG Periaswamy , Justin Patton
{"title":"A framework for locating multiple RFID tags using RF hologram tensors","authors":"Xiangyu Wang , Jian Zhang , Shiwen Mao , Senthilkumar CG Periaswamy , Justin Patton","doi":"10.1016/j.dcan.2023.12.004","DOIUrl":"10.1016/j.dcan.2023.12.004","url":null,"abstract":"<div><div>In this paper, we present a Deep Neural Network (DNN) based framework that employs Radio Frequency (RF) hologram tensors to locate multiple Ultra-High Frequency (UHF) passive Radio-Frequency Identification (RFID) tags. The RF hologram tensor exhibits a strong relationship between observation and spatial location, helping to improve the robustness to dynamic environments and equipment. Since RFID data is often marred by noise, we implement two types of deep neural network architectures to clean up the RF hologram tensor. Leveraging the spatial relationship between tags, the deep networks effectively mitigate fake peaks in the hologram tensors resulting from multipath propagation and phase wrapping. In contrast to fingerprinting-based localization systems that use deep networks as classifiers, our deep networks in the proposed framework treat the localization task as a regression problem preserving the ambiguity between fingerprints. We also present an intuitive peak finding algorithm to obtain estimated locations using the sanitized hologram tensors. The proposed framework is implemented using commodity RFID devices, and its superior performance is validated through extensive experiments.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 337-348"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139195751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Woong Son , Minkyu Oh , Heejung Yu , Bang Chul Jung
{"title":"Physical-layer security in MU-MISO downlink networks against potential eavesdroppers","authors":"Woong Son , Minkyu Oh , Heejung Yu , Bang Chul Jung","doi":"10.1016/j.dcan.2024.02.004","DOIUrl":"10.1016/j.dcan.2024.02.004","url":null,"abstract":"<div><div>Recently, wireless security has been highlighted as one of the most important techniques for 6G mobile communication systems. Many researchers have tried to improve the Physical-Layer Security (PLS) performance such as Secrecy Outage Probability (SOP) and Secrecy Energy-Efficiency (SEE). The SOP indicates the outage probability that the data transmission between legitimate devices does not guarantee a certain reliability level, and the SEE is defined as the ratio between the achievable secrecy-rate and the consumed transmit power. In this paper, we consider a Multi-User Multi-Input Single-Output (MU-MISO) downlink cellular network where a legitimate Base Station (BS) equipped with multiple transmit antennas sends secure information to multiple legitimate Mobile Stations (MSs), and multiple <em>potential</em> eavesdroppers (EVEs) equipped with a single receive antenna try to eavesdrop on this information. Each potential EVE tries to intercept the secure information, i.e., the private message, from the legitimate BS to legitimate MSs with a certain eavesdropping probability. To securely receive the private information, each legitimate MS feeds back its effective channel gain to the legitimate BS only when the effective channel gain is higher than a certain threshold, i.e., the legitimate MSs adopt an <em>Opportunistic</em> Feedback (OF) strategy. In such eavesdropping channels, both SOP and SEE are analyzed as performance measures of PLS and their closed-form expressions are derived mathematically. Based on the analytical results, it is shown that the SOP of the OF strategy approaches that of a Full Feedback (FF) strategy as the number of legitimate MSs or the number of antennas at the BS increases. Furthermore, the trade-off between SOP and SEE as a function of the channel feedback threshold in the OF strategy is investigated. The analytical results and related observations are verified by numerical simulations.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 424-431"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140464342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Puning Zhang , Lei Tan , Zhigang Yang , Fengyi Huang , Lijun Sun , Haiying Peng
{"title":"Device-edge collaborative occluded face recognition method based on cross-domain feature fusion","authors":"Puning Zhang , Lei Tan , Zhigang Yang , Fengyi Huang , Lijun Sun , Haiying Peng","doi":"10.1016/j.dcan.2024.05.003","DOIUrl":"10.1016/j.dcan.2024.05.003","url":null,"abstract":"<div><div>The lack of facial features caused by wearing masks degrades the performance of facial recognition systems. Traditional occluded face recognition methods cannot integrate the computational resources of the edge layer and the device layer. Besides, previous research fails to consider the facial characteristics including occluded and unoccluded parts. To solve the above problems, we put forward a device-edge collaborative occluded face recognition method based on cross-domain feature fusion. Specifically, the device-edge collaborative face recognition architecture gets the utmost out of maximizes device and edge resources for real-time occluded face recognition. Then, a cross-domain facial feature fusion method is presented which combines both the explicit domain and the implicit domain facial. Furthermore, a delay-optimized edge recognition task scheduling method is developed that comprehensively considers the task load, computational power, bandwidth, and delay tolerance constraints of the edge. This method can dynamically schedule face recognition tasks and minimize recognition delay while ensuring recognition accuracy. The experimental results show that the proposed method achieves an average gain of about 21% in recognition latency, while the accuracy of the face recognition task is basically the same compared to the baseline method.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 482-492"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141051137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yi Gong , Boyuan Yu , Lei Yang , Fanke Meng , Lei Liu , Xinjue Hu , Zhan Xu
{"title":"Toward next-generation networks: A blockchain-based approach for core network architecture and roaming identity verification","authors":"Yi Gong , Boyuan Yu , Lei Yang , Fanke Meng , Lei Liu , Xinjue Hu , Zhan Xu","doi":"10.1016/j.dcan.2024.08.008","DOIUrl":"10.1016/j.dcan.2024.08.008","url":null,"abstract":"<div><div>With the evolution of next-generation communication networks, ensuring robust Core Network (CN) architecture and data security has become paramount. This paper addresses critical vulnerabilities in the architecture of CN and data security by proposing a novel framework based on blockchain technology that is specifically designed for communication networks. Traditional centralized network architectures are vulnerable to Distributed Denial of Service (DDoS) attacks, particularly in roaming scenarios where there is also a risk of private data leakage, which imposes significant operational demands. To address these issues, we introduce the Blockchain-Enhanced Core Network Architecture (BECNA) and the Secure Decentralized Identity Authentication Scheme (SDIDAS). The BECNA utilizes blockchain technology to decentralize data storage, enhancing network security, stability, and reliability by mitigating Single Points of Failure (SPoF). The SDIDAS utilizes Decentralized Identity (DID) technology to secure user identity data and streamline authentication in roaming scenarios, significantly reducing the risk of data breaches during cross-network transmissions. Our framework employs Ethereum, free5GC, Wireshark, and UERANSIM tools to create a robust, tamper-evident system model. A comprehensive security analysis confirms substantial improvements in user privacy and network security. Simulation results indicate that our approach enhances communication CNs security and reliability, while also ensuring data security.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 326-336"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143923026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Boyu Li , Bin Wu , Meng Shen , Hao Peng , Weisheng Li , Hong Zhang , Jie Gan , Zhihong Tian , Guangquan Xu
{"title":"Algorithms for online fault tolerance server consolidation","authors":"Boyu Li , Bin Wu , Meng Shen , Hao Peng , Weisheng Li , Hong Zhang , Jie Gan , Zhihong Tian , Guangquan Xu","doi":"10.1016/j.dcan.2024.06.007","DOIUrl":"10.1016/j.dcan.2024.06.007","url":null,"abstract":"<div><div>We study a novel replication mechanism to ensure service continuity against multiple simultaneous server failures. In this mechanism, each item represents a computing task and is replicated into <span><math><mi>ξ</mi><mo>+</mo><mn>1</mn></math></span> servers for some integer <span><math><mi>ξ</mi><mo>≥</mo><mn>1</mn></math></span>, with workloads specified by the amount of required resources. If one or more servers fail, the affected workloads can be redirected to other servers that host replicas associated with the same item, such that the service is not interrupted by the failure of up to <em>ξ</em> servers. This requires that any feasible assignment algorithm must reserve some capacity in each server to accommodate the workload redirected from potential failed servers without overloading, and determining the optimal method for reserving capacity becomes a key issue. Unlike existing algorithms that assume that no two servers share replicas of more than one item, we first formulate capacity reservation for a general arbitrary scenario. Due to the combinatorial nature of this problem, finding the optimal solution is difficult. To this end, we propose a Generalized and Simple Calculating Reserved Capacity (GSCRC) algorithm, with a time complexity only related to the number of items packed in the server. In conjunction with GSCRC, we propose a robust replica packing algorithm with capacity optimization (RobustPack), which aims to minimize the number of servers hosting replicas and tolerate multiple server failures. Through theoretical analysis and experimental evaluations, we show that the RobustPack algorithm can achieve better performance.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 514-523"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143922948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chen Zhong , Mengting Lou , Chunrong Gu , Lan Tang , Yechao Bai
{"title":"Performance optimization and parameters estimation for MIMO-OFDM dual-functional communication-radar systems","authors":"Chen Zhong , Mengting Lou , Chunrong Gu , Lan Tang , Yechao Bai","doi":"10.1016/j.dcan.2023.12.006","DOIUrl":"10.1016/j.dcan.2023.12.006","url":null,"abstract":"<div><div>Dual-function communication radar systems use common Radio Frequency (RF) signals are used for both communication and detection. For better compatibility with existing communication systems, we adopt Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) signals as integrated signals and investigate the estimation performance of MIMO-OFDM signals. First, we analyze the Cramer-Rao Lower Bound (CRLB) of parameter estimation. Then, the transmit powers over different subcarriers are optimized to achieve the best tradeoff between the transmission rate and the estimation performance. Finally, we propose a more accurate estimation method that uses Canonical Polyadic Decomposition (CPD) of the third-order tensor to obtain the parameter matrices. Due to the characteristic of the column structure of the parameter matrices, we only need to use DFT / IDFT to recover the parameters of multiple targets. The simulation results show that tensor-based estimation method can achieve a performance close to CRLB, and the estimation performance can be improved by optimizing the transmit powers.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 387-400"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143923027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"APFed: Adaptive personalized federated learning for intrusion detection in maritime meteorological sensor networks","authors":"Xin Su, Guifu Zhang","doi":"10.1016/j.dcan.2024.02.001","DOIUrl":"10.1016/j.dcan.2024.02.001","url":null,"abstract":"<div><div>With the rapid development of advanced networking and computing technologies such as the Internet of Things, network function virtualization, and 5G infrastructure, new development opportunities are emerging for Maritime Meteorological Sensor Networks (MMSNs). However, the increasing number of intelligent devices joining the MMSN poses a growing threat to network security. Current Artificial Intelligence (AI) intrusion detection techniques turn intrusion detection into a classification problem, where AI excels. These techniques assume sufficient high-quality instances for model construction, which is often unsatisfactory for real-world operation with limited attack instances and constantly evolving characteristics. This paper proposes an Adaptive Personalized Federated learning (APFed) framework that allows multiple MMSN owners to engage in collaborative training. By employing an adaptive personalized update and a shared global classifier, the adverse effects of imbalanced, Non-Independent and Identically Distributed (Non-IID) data are mitigated, enabling the intrusion detection model to possess personalized capabilities and good global generalization. In addition, a lightweight intrusion detection model is proposed to detect various attacks with an effective adaptation to the MMSN environment. Finally, extensive experiments on a classical network dataset show that the attack classification accuracy is improved by about 5% compared to most baselines in the global scenarios.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 401-411"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139823541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Inam Ullah , Deepak Adhikari , Xin Su , Francesco Palmieri , Celimuge Wu , Chang Choi
{"title":"Integration of data science with the intelligent IoT (IIoT): Current challenges and future perspectives","authors":"Inam Ullah , Deepak Adhikari , Xin Su , Francesco Palmieri , Celimuge Wu , Chang Choi","doi":"10.1016/j.dcan.2024.02.007","DOIUrl":"10.1016/j.dcan.2024.02.007","url":null,"abstract":"<div><div>The Intelligent Internet of Things (IIoT) involves real-world things that communicate or interact with each other through networking technologies by collecting data from these “things” and using intelligent approaches, such as Artificial Intelligence (AI) and machine learning, to make accurate decisions. Data science is the science of dealing with data and its relationships through intelligent approaches. Most state-of-the-art research focuses independently on either data science or IIoT, rather than exploring their integration. Therefore, to address the gap, this article provides a comprehensive survey on the advances and integration of data science with the Intelligent IoT (IIoT) system by classifying the existing IoT-based data science techniques and presenting a summary of various characteristics. The paper analyzes the data science or big data security and privacy features, including network architecture, data protection, and continuous monitoring of data, which face challenges in various IoT-based systems. Extensive insights into IoT data security, privacy, and challenges are visualized in the context of data science for IoT. In addition, this study reveals the current opportunities to enhance data science and IoT market development. The current gap and challenges faced in the integration of data science and IoT are comprehensively presented, followed by the future outlook and possible solutions.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 280-298"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140281749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qi Li , Gaozhan Liu , Qianqian Zhang , Lidong Han , Wei Chen , Rui Li , Jinbo Xiong
{"title":"Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT","authors":"Qi Li , Gaozhan Liu , Qianqian Zhang , Lidong Han , Wei Chen , Rui Li , Jinbo Xiong","doi":"10.1016/j.dcan.2024.05.007","DOIUrl":"10.1016/j.dcan.2024.05.007","url":null,"abstract":"<div><div>Ciphertext-Policy Attribute-Based Encryption (CP-ABE) enables fine-grained access control on ciphertexts, making it a promising approach for managing data stored in the cloud-enabled Internet of Things. But existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute content. Additionally, resource-constrained IoT devices, especially those adopting wireless communication, frequently encounter affordability issues regarding decryption costs. In this paper, we propose an efficient and fine-grained access control scheme with fully hidden policies (named FHAC). FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them. A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access policy. Dictionary attacks are thwarted by providing unauthorized users with invalid values. The heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud servers. Additionally, users can verify the correctness of multiple outsourced decryption results simultaneously. Security analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 473-481"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141050949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Task offloading delay minimization in vehicular edge computing based on vehicle trajectory prediction","authors":"Feng Zeng , Zheng Zhang , Jinsong Wu","doi":"10.1016/j.dcan.2024.08.003","DOIUrl":"10.1016/j.dcan.2024.08.003","url":null,"abstract":"<div><div>In task offloading, the movement of vehicles causes the switching of connected RSUs and servers, which may lead to task offloading failure or high service delay. In this paper, we analyze the impact of vehicle movements on task offloading and reveal that data preparation time for task execution can be minimized via forward-looking scheduling. Then, a Bi-LSTM-based model is proposed to predict the trajectories of vehicles. The service area is divided into several equal-sized grids. If the actual position of the vehicle and the predicted position by the model belong to the same grid, the prediction is considered correct, thereby reducing the difficulty of vehicle trajectory prediction. Moreover, we propose a scheduling strategy for delay optimization based on the vehicle trajectory prediction. Considering the inevitable prediction error, we take some edge servers around the predicted area as candidate execution servers and the data required for task execution are backed up to these candidate servers, thereby reducing the impact of prediction deviations on task offloading and converting the modest increase of resource overheads into delay reduction in task offloading. Simulation results show that, compared with other classical schemes, the proposed strategy has lower average task offloading delays.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 537-546"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143922944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}