Digital Communications and Networks最新文献_第5页

Consistency preserving database watermarking algorithm for decision trees 决策树中保持一致性的数据库水印算法

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2022.12.015

Qianwen Li , Xiang Wang , Qingqi Pei , Xiaohua Chen , Kwok-Yan Lam

{"title":"Consistency preserving database watermarking algorithm for decision trees","authors":"Qianwen Li , Xiang Wang , Qingqi Pei , Xiaohua Chen , Kwok-Yan Lam","doi":"10.1016/j.dcan.2022.12.015","DOIUrl":"10.1016/j.dcan.2022.12.015","url":null,"abstract":"<div><div>Database watermarking technologies provide an effective solution to data security problems by embedding the watermark in the database to prove copyright or trace the source of data leakage. However, when the watermarked database is used for data mining model building, such as decision trees, it may cause a different mining result in comparison with the result from the original database caused by the distortion of watermark embedding. Traditional watermarking algorithms mainly consider the statistical distortion of data, such as the mean square error, but very few consider the effect of the watermark on database mining. Therefore, in this paper, a consistency preserving database watermarking algorithm is proposed for decision trees. First, label classification statistics and label state transfer methods are proposed to adjust the watermarked data so that the model structure of the watermarked decision tree is the same as that of the original decision tree. Then, the splitting values of the decision tree are adjusted according to the defined constraint equations. Finally, the adjusted database can obtain a decision tree consistent with the original decision tree. The experimental results demonstrated that the proposed algorithm does not corrupt the watermarks, and makes the watermarked decision tree consistent with the original decision tree with a small distortion.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1851-1863"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45040804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Secure intelligent reflecting surface assisted mobile edge computing system with wireless power transfer 具有无线功率传输的安全智能反射面辅助移动边缘计算系统

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2023.07.007

Dawei Wang , Xuanrui Li , Menghan Wu , Yixin He , Yi Lou , Yu Pang , Yi Lu

{"title":"Secure intelligent reflecting surface assisted mobile edge computing system with wireless power transfer","authors":"Dawei Wang , Xuanrui Li , Menghan Wu , Yixin He , Yi Lou , Yu Pang , Yi Lu","doi":"10.1016/j.dcan.2023.07.007","DOIUrl":"10.1016/j.dcan.2023.07.007","url":null,"abstract":"<div><div>In this paper, we study an Intelligent Reflecting Surface (IRS) assisted Mobile Edge Computing (MEC) system under eavesdropping threats, where the IRS is used to enhance the energy signal transmission and the offloading performance between Wireless Devices (WDs) and the Access Point (AP). Specifically, in the proposed scheme, the AP first powers all WDs with the wireless power transfer through both direct and IRS-assisted links. Then, powered by the harvested energy, all WDs securely offload their computation tasks through the two links in the time division multiple access mode. To determine the local and offloading computational bits, we formulate an optimization problem to jointly design the IRS's phase shift and allocate the time slots constrained by the security and energy requirements. To cope with this non-convex optimization problem, we adopt semidefinite relaxations, singular value decomposition techniques, and Lagrange dual method. Moreover, we propose a dichotomy particle swarm algorithm based on the bisection method to process the overall optimization problem and improve the convergence speed. The numerical results illustrate that the proposed scheme can boost the performance of MEC and secure computation rates compared with other IRS-assisted MEC benchmark schemes.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1874-1880"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47231246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Overview of RIS-enabled secure transmission in 6G wireless networks

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2024.02.005

JungSook Bae , Waqas Khalid , Anseok Lee , Heesoo Lee , Song Noh , Heejung Yu

引用次数: 0

Multi-class Bitcoin mixing service identification based on graph classification

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2024.08.010

Xiaoyan Hu , Meiqun Gui , Guang Cheng , Ruidong Li , Hua Wu

{"title":"Multi-class Bitcoin mixing service identification based on graph classification","authors":"Xiaoyan Hu , Meiqun Gui , Guang Cheng , Ruidong Li , Hua Wu","doi":"10.1016/j.dcan.2024.08.010","DOIUrl":"10.1016/j.dcan.2024.08.010","url":null,"abstract":"<div><div>Due to its anonymity and decentralization, Bitcoin has long been a haven for various illegal activities. Cyber-criminals generally legalize illicit funds by Bitcoin mixing services. Therefore, it is critical to investigate the mixing services in cryptocurrency anti-money laundering. Existing studies treat different mixing services as a class of suspicious Bitcoin entities. Furthermore, they are limited by relying on expert experience or needing to deal with large-scale networks. So far, multi-class mixing service identification has not been explored yet. It is challenging since mixing services share a similar procedure, presenting no sharp distinctions. However, mixing service identification facilitates the healthy development of Bitcoin, supports financial forensics for cryptocurrency regulation and legislation, and provides technical means for fine-grained blockchain supervision. This paper aims to achieve multi-class Bitcoin Mixing Service Identification with a Graph Classification (BMSI-GC) model. First, BMSI-GC constructs 2-hop ego networks (2-egonets) of mixing services based on their historical transactions. Second, it applies graph2vec, a graph classification model mainly used to calculate the similarity between graphs, to automatically extract address features from the constructed 2-egonets. Finally, it trains a multilayer perceptron classifier to perform classification based on the extracted features. BMSI-GC is flexible without handling the full-size network and handcrafting address features. Moreover, the differences in transaction patterns of mixing services reflected in the 2-egonets provide adequate information for identification. Our experimental study demonstrates that BMSI-GC performs excellently in multi-class Bitcoin mixing service identification, achieving an average identification F1-score of 95.08%.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1881-1893"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143355759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A game incentive mechanism for energy efficient federated learning in computing power networks 计算能力网络中高效节能联合学习的博弈激励机制

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2023.10.006

Xiao Lin , Ruolin Wu , Haibo Mei , Kun Yang

{"title":"A game incentive mechanism for energy efficient federated learning in computing power networks","authors":"Xiao Lin , Ruolin Wu , Haibo Mei , Kun Yang","doi":"10.1016/j.dcan.2023.10.006","DOIUrl":"10.1016/j.dcan.2023.10.006","url":null,"abstract":"<div><div>Computing Power Network (CPN) is emerging as one of the important research interests in beyond 5G (B5G) or 6G. This paper constructs a CPN based on Federated Learning (FL), where all Multi-access Edge Computing (MEC) servers are linked to a computing power center via wireless links. Through this FL procedure, each MEC server in CPN can independently train the learning models using localized data, thus preserving data privacy. However, it is challenging to motivate MEC servers to participate in the FL process in an efficient way and difficult to ensure energy efficiency for MEC servers. To address these issues, we first introduce an incentive mechanism using the Stackelberg game framework to motivate MEC servers. Afterwards, we formulate a comprehensive algorithm to jointly optimize the communication resource (wireless bandwidth and transmission power) allocations and the computation resource (computation capacity of MEC servers) allocations while ensuring the local accuracy of the training of each MEC server. The numerical data validates that the proposed incentive mechanism and joint optimization algorithm do improve the energy efficiency and performance of the considered CPN.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1741-1747"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136093691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Information theory based clustering of cellular network usage data for the identification of representative urban areas 基于信息论的蜂窝网络使用数据聚类，用于识别代表性城市区域

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2023.07.002

Mihaela I. Chidean , Luis Ignacio Jiménez Gil , Javier Carmona-Murillo , David Cortés-Polo

{"title":"Information theory based clustering of cellular network usage data for the identification of representative urban areas","authors":"Mihaela I. Chidean , Luis Ignacio Jiménez Gil , Javier Carmona-Murillo , David Cortés-Polo","doi":"10.1016/j.dcan.2023.07.002","DOIUrl":"10.1016/j.dcan.2023.07.002","url":null,"abstract":"<div><div>The exponential growth of the number of network devices in recent years not only entails the need for automation of management tasks, but also leads to the increase of available network data and metadata. 5G and beyond standards already cover those requirements and also include the need to define and use machine learning techniques to take advantage of the data acquired, especially using geolocated Call Detail Record (CDR) data sets. However, this scenario requires novel cellular network analysis methodologies to exploit all these available data, especially for the network usage pattern in order to ease the management tasks. In this work, a novel method based on information theory metrics like the Kullback-Leibler divergence and data classification algorithms is proposed to identify representative urban areas in terms of the network usage pattern. Methodology validation is performed via computer analysis using the Open Big Data CDR data set in the Milan area for different scenarios. Obtained results validate the proposed methodology and also reveal its adaptability in terms of specific scenario characteristics. Network usage patterns are calculated for each representative area, paving the path to several future research lines in network management, such as network usage prediction based on this methodology and using the <em>comportment</em> time series.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1677-1685"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44661601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Secure transmission design for RIS-aided symbiotic radio networks: A DRL approach RIS 辅助共生无线电网络的联合资源分配和波束成形设计：DRL 方法

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2024.03.002

Bin Li, Wenshuai Liu, Wancheng Xie

{"title":"Secure transmission design for RIS-aided symbiotic radio networks: A DRL approach","authors":"Bin Li, Wenshuai Liu, Wancheng Xie","doi":"10.1016/j.dcan.2024.03.002","DOIUrl":"10.1016/j.dcan.2024.03.002","url":null,"abstract":"<div><div>In this paper, we investigate a Reconfigurable Intelligent Surface (RIS)-assisted secure Symbiosis Radio (SR) network to address the information leakage of the primary transmitter (PTx) to potential eavesdroppers. Specifically, the RIS serves as a secondary transmitter in the SR network to ensure the security of the communication between the PTx and the Primary Receiver (PRx), and simultaneously transmits its information to the PTx concurrently by configuring the phase shifts. Considering the presence of multiple eavesdroppers and uncertain channels in practical scenarios, we jointly optimize the active beamforming of PTx and the phase shifts of RIS to maximize the secrecy energy efficiency of RIS-supported SR networks while satisfying the quality of service requirement and the secure communication rate. To solve this complicated non-convex stochastic optimization problem, we propose a secure beamforming method based on Proximal Policy Optimization (PPO), which is an efficient deep reinforcement learning algorithm, to find the optimal beamforming strategy against eavesdroppers. Simulation results show that the proposed PPO-based method is able to achieve fast convergence and realize the secrecy energy efficiency gain by up to 22% when compared to the considered benchmarks.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1566-1575"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140272694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Digital twin empowered cooperative trajectory planning of platoon vehicles for collision avoidance with unexpected obstacles 基于数字孪生的车辆排避碰撞协同轨迹规划

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2023.06.002

Hao Du , Supeng Leng , Jianhua He , Kai Xiong , Longyu Zhou

{"title":"Digital twin empowered cooperative trajectory planning of platoon vehicles for collision avoidance with unexpected obstacles","authors":"Hao Du , Supeng Leng , Jianhua He , Kai Xiong , Longyu Zhou","doi":"10.1016/j.dcan.2023.06.002","DOIUrl":"10.1016/j.dcan.2023.06.002","url":null,"abstract":"<div><div>Road obstacles that unexpectedly appear due to vehicle breakdowns and accidents are major causes of fatal road accidents. Connected Autonomous Vehicles (CAVs) can be used to avoid collisions to ensure road safety through cooperative sensing and driving. However, the collision avoidance performance of CAVs with unexpected obstacles has not been studied in the existing works. In this paper, we first design a platoon-based collision avoidance framework for CAVs. In this framework, we deploy a Digital Twin (DT) system at the head vehicle in a platoon to reduce communication overhead and decision-making delay based on a proposed trajectory planning scheme. In addition, a DT-assistant system is deployed on the assistant vehicle to monitor vehicles out of the sensing range of the head vehicle for the maintenance of the DT system. In this case, the transmission frequency of kinetic states of platoon members can be reduced to ensure low-overhead communication. Moreover, we design a variable resource reservation interval that can ensure DT synchronization between DT and the assistant system with high reliability. To further improve road safety, an urgency level-based trajectory planning algorithm is proposed to avoid unexpected obstacles considering different levels of emergency risks. Simulation results show that our DT system-based scheme can achieve significant performance gains in unexpected obstacle avoidance. Compared to the existing schemes, it can reduce collisions by 95% and is faster by about 10% passing by the unexpected obstacle.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1666-1676"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41834358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Sum-throughput maximization for UAV-aided energy-harvesting WBANs: Hovering altitude design, power control and time allocation 无人机辅助能量采集WBAN的总吞吐量最大化：悬停高度设计、功率控制和时间分配

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2022.12.021

Rongrong Zhang , Mengyu Li , Xinglong Li , Yong Guan , Cheng'an Zhao , Huan Qi , Changquan Qiu

{"title":"Sum-throughput maximization for UAV-aided energy-harvesting WBANs: Hovering altitude design, power control and time allocation","authors":"Rongrong Zhang , Mengyu Li , Xinglong Li , Yong Guan , Cheng'an Zhao , Huan Qi , Changquan Qiu","doi":"10.1016/j.dcan.2022.12.021","DOIUrl":"10.1016/j.dcan.2022.12.021","url":null,"abstract":"<div><div>UAV-aided energy-harvesting WBANs where sensor nodes can harvest RF energy transmitted by a UAV have attracted considerable attention. However, how to maximize the sum-throughput of the sensor nodes with cross-tier interferences from satellite and cellular systems has not been addressed. In order to bridge this gap, we devote this paper to developing two schemes with the fixed or variable duration of the energy-harvesting phase. Specifically, we formulate two non-convex optimization problems corresponding to the two schemes, and transform them to tractable subproblems, and accordingly two algorithms are proposed named HA-PC-TA and UAVPC-TA. In particular, we derive the closed-form optimum transmit power and time allocation for the sensor nodes and obtain the optimum UAV's hovering altitude in HA-PC-TA. We reveal the relationship between the optimum parameters and the allowed maximum transmit power of the VAU in UAVPC-TA. Finally, the simulations are conducted to validate the effectiveness of our proposed solutions.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1894-1903"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48443618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DAG-based swarm learning: A secure asynchronous learning framework for Internet of Vehicles 基于dag的群学习:一种安全的车联网异步学习框架

IF 7.5 2区计算机科学

Digital Communications and Networks Pub Date : 2024-12-01 DOI: 10.1016/j.dcan.2023.10.004

Xiaoge Huang , Hongbo Yin , Qianbin Chen , Yu Zeng , Jianfeng Yao

{"title":"DAG-based swarm learning: A secure asynchronous learning framework for Internet of Vehicles","authors":"Xiaoge Huang , Hongbo Yin , Qianbin Chen , Yu Zeng , Jianfeng Yao","doi":"10.1016/j.dcan.2023.10.004","DOIUrl":"10.1016/j.dcan.2023.10.004","url":null,"abstract":"<div><div>To provide diversified services in the intelligent transportation systems, smart vehicles will generate unprecedented amounts of data every day. Due to data security and user privacy issues, Federated Learning (FL) is considered a potential solution to ensure privacy-preserving in data sharing. However, there are still many challenges to applying the traditional synchronous FL directly in the Internet of Vehicles (IoV), such as unreliable communications and malicious attacks. In this paper, we propose a Directed Acyclic Graph (DAG) based Swarm Learning (DSL), which integrates edge computing, FL, and blockchain technologies to provide secure data sharing and model training in IoVs. To deal with the high mobility of vehicles, the dynamic vehicle association algorithm is introduced, which could optimize the connections between vehicles and road side units to improve the training efficiency. Moreover, to enhance the anti-attack property of the DSL algorithm, a malicious attack detection method is adopted, which could recognize malicious vehicles by the site confirmation rate. Furthermore, an accuracy-based reward mechanism is developed to promote vehicles to participate in the model training with honest behaviors. Finally, simulation results demonstrate that the proposed DSL algorithm could achieve better performance in terms of model accuracy, convergence rates and security compared with existing algorithms.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"10 6","pages":"Pages 1611-1621"},"PeriodicalIF":7.5,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135614283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0