Yunhua He , Yigang Yang , Chao Wang , Anke Xie , Li Ma , Bin Wu , Yongdong Wu
{"title":"A verifiable EVM-based cross-language smart contract implementation scheme for matrix calculation","authors":"Yunhua He , Yigang Yang , Chao Wang , Anke Xie , Li Ma , Bin Wu , Yongdong Wu","doi":"10.1016/j.dcan.2024.03.003","DOIUrl":"10.1016/j.dcan.2024.03.003","url":null,"abstract":"<div><div>The wide application of smart contracts allows industry companies to implement some complex distributed collaborative businesses, which involve the calculation of complex functions, such as matrix operations. However, complex functions such as matrix operations are difficult to implement on Ethereum Virtual Machine (EVM)-based smart contract platforms due to their distributed security environment limitations. Existing off-chain methods often result in a significant reduction in contract execution efficiency, thus a platform software development kit interface implementation method has become a feasible way to reduce overheads, but this method cannot verify operation correctness and may leak sensitive user data. To solve the above problems, we propose a verifiable EVM-based smart contract cross-language implementation scheme for complex operations, especially matrix operations, which can guarantee operation correctness and user privacy while ensuring computational efficiency. In this scheme, a verifiable interaction process is designed to verify the computation process and results, and a matrix blinding technology is introduced to protect sensitive user data in the calculation process. The security analysis and performance tests show that the proposed scheme can satisfy the correctness and privacy of the cross-language implementation of smart contracts at a small additional efficiency cost.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 432-441"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140279080","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}
Sancheng Peng , Lihong Cao , Guojun Wang , Zhouhao Ouyang , Yongmei Zhou , Shui Yu
{"title":"A survey on textual emotion cause extraction in social networks","authors":"Sancheng Peng , Lihong Cao , Guojun Wang , Zhouhao Ouyang , Yongmei Zhou , Shui Yu","doi":"10.1016/j.dcan.2024.07.004","DOIUrl":"10.1016/j.dcan.2024.07.004","url":null,"abstract":"<div><div>With the rapid development of web technology, Social Networks (SNs) have become one of the most popular platforms for users to exchange views and to express their emotions. More and more people are used to commenting on a certain hot spot in SNs, resulting in a large amount of texts containing emotions. Textual Emotion Cause Extraction (TECE) aims to automatically extract causes for a certain emotion in texts, which is an important research issue in natural language processing. It is different from the previous tasks of emotion recognition and emotion classification. In addition, it is not limited to the shallow-level emotion classification of text, but to trace the emotion source. In this paper, we provide a survey for TECE. First, we introduce the development process and classification of TECE. Then, we discuss the existing methods and key factors for TECE. Finally, we enumerate the challenges and developing trend for TECE.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 524-536"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143923028","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}
Zhou Zhou , Youliang Tian , Jinbo Xiong , Changgen Peng , Jing Li , Nan Yang
{"title":"Blockchain and signcryption enabled asynchronous federated learning framework in fog computing","authors":"Zhou Zhou , Youliang Tian , Jinbo Xiong , Changgen Peng , Jing Li , Nan Yang","doi":"10.1016/j.dcan.2024.03.004","DOIUrl":"10.1016/j.dcan.2024.03.004","url":null,"abstract":"<div><div>Federated learning combines with fog computing to transform data sharing into model sharing, which solves the issues of data isolation and privacy disclosure in fog computing. However, existing studies focus on centralized single-layer aggregation federated learning architecture, which lack the consideration of cross-domain and asynchronous robustness of federated learning, and rarely integrate verification mechanisms from the perspective of incentives. To address the above challenges, we propose a Blockchain and Signcryption enabled Asynchronous Federated Learning (BSAFL) framework based on dual aggregation for cross-domain scenarios. In particular, we first design two types of signcryption schemes to secure the interaction and access control of collaborative learning between domains. Second, we construct a differential privacy approach that adaptively adjusts privacy budgets to ensure data privacy and local models' availability of intra-domain user. Furthermore, we propose an asynchronous aggregation solution that incorporates consensus verification and elastic participation using blockchain. Finally, security analysis demonstrates the security and privacy effectiveness of BSAFL, and the evaluation on real datasets further validates the high model accuracy and performance of BSAFL.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 442-454"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140282967","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}
Yudong Li , Hongcheng Zhuang , Long Xu , Shengquan Li , Haibo Lu
{"title":"Hierarchical detection and tracking for moving targets in underwater wireless sensor networks","authors":"Yudong Li , Hongcheng Zhuang , Long Xu , Shengquan Li , Haibo Lu","doi":"10.1016/j.dcan.2024.03.008","DOIUrl":"10.1016/j.dcan.2024.03.008","url":null,"abstract":"<div><div>It is difficult to improve both energy consumption and detection accuracy simultaneously, and even to obtain the trade-off between them, when detecting and tracking moving targets, especially for Underwater Wireless Sensor Networks (UWSNs). To this end, this paper investigates the relationship between the Degree of Target Change (DoTC) and the detection period, as well as the impact of individual nodes. A Hierarchical Detection and Tracking Approach (HDTA) is proposed. Firstly, the network detection period is determined according to DoTC, which reflects the variation of target motion. Secondly, during the network detection period, each detection node calculates its own node detection period based on the detection mutual information. Taking DoTC as pheromone, an ant colony algorithm is proposed to adaptively adjust the network detection period. The simulation results show that the proposed HDTA with the optimizations of network level and node level significantly improves the detection accuracy by 25% and the network energy consumption by 10% simultaneously, compared to the traditional adaptive period detection schemes.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 556-562"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140405037","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}
Dapeng Wu , Jian Liu , Yangliang Wan , Zhigang Yang , Ruyan Wang , Xinqi Lin
{"title":"C-privacy: A social relationship-driven image customization sharing method in cyber-physical networks","authors":"Dapeng Wu , Jian Liu , Yangliang Wan , Zhigang Yang , Ruyan Wang , Xinqi Lin","doi":"10.1016/j.dcan.2024.03.009","DOIUrl":"10.1016/j.dcan.2024.03.009","url":null,"abstract":"<div><div>Cyber-Physical Networks (CPN) are comprehensive systems that integrate information and physical domains, and are widely used in various fields such as online social networking, smart grids, and the Internet of Vehicles (IoV). With the increasing popularity of digital photography and Internet technology, more and more users are sharing images on CPN. However, many images are shared without any privacy processing, exposing hidden privacy risks and making sensitive content easily accessible to Artificial Intelligence(AI) algorithms. Existing image sharing methods lack fine-grained image sharing policies and cannot protect user privacy. To address this issue, we propose a social relationship-driven privacy customization protection model for publishers and co-photographers. We construct a heterogeneous social information network centered on social relationships, introduce a user intimacy evaluation method with time decay, and evaluate privacy levels considering user interest similarity. To protect user privacy while maintaining image appreciation, we design a lightweight face-swapping algorithm based on Generative Adversarial Network (GAN) to swap faces that need to be protected. Our proposed method minimizes the loss of image utility while satisfying privacy requirements, as shown by extensive theoretical and simulation analyses.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 563-573"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140405551","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}
Tianping Deng , Xiaohui Xu , Zeyan Ding , Xiao Xiao , Ming Zhu , Kai Peng
{"title":"Automatic collaborative water surface coverage and cleaning strategy of UAV and USVs","authors":"Tianping Deng , Xiaohui Xu , Zeyan Ding , Xiao Xiao , Ming Zhu , Kai Peng","doi":"10.1016/j.dcan.2022.12.014","DOIUrl":"10.1016/j.dcan.2022.12.014","url":null,"abstract":"<div><div>As the problem of surface garbage pollution becomes more serious, it is necessary to improve the efficiency of garbage inspection and picking rather than traditional manual methods. Due to lightness, Unmanned Aerial Vehicles (UAVs) can traverse the entire water surface in a short time through their flight field of view. In addition, Unmanned Surface Vessels (USVs) can provide battery replacement and pick up garbage. In this paper, we innovatively establish a system framework for the collaboration between UAV and USVs, and develop an automatic water cleaning strategy. First, on the basis of the partition principle, we propose a collaborative coverage path algorithm based on UAV off-site takeoff and landing to achieve global inspection. Second, we design a task scheduling and assignment algorithm for USVs to balance the garbage loads based on the particle swarm optimization algorithm. Finally, based on the swarm intelligence algorithm, we also design an autonomous obstacle avoidance path planning algorithm for USVs to realize autonomous navigation and collaborative cleaning. The system can simultaneously perform inspection and clearance tasks under certain constraints. The simulation results show that the proposed algorithms have higher generality and flexibility while effectively improving computational efficiency and reducing actual cleaning costs compared with other schemes.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 365-376"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45009466","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":"A reconstruction and recovery network-based channel estimation in high-speed railway wireless communications","authors":"Qingmiao Zhang , Yuhao Zhao , Hanzhi Dong , Junhui Zhao","doi":"10.1016/j.dcan.2024.06.006","DOIUrl":"10.1016/j.dcan.2024.06.006","url":null,"abstract":"<div><div>The integration of high-speed railway communication systems with 5G technology is widely recognized as a significant development. Due to the considerable mobility of trains and the complex nature of the environment, the wireless channel exhibits non-stationary characteristics and fast time-varying characteristics, which presents significant hurdles in terms of channel estimation. In addition, the use of massive MIMO technology in the context of 5G networks also leads to an increase in the complexity of estimation. To address the aforementioned issues, this paper presents a novel approach for channel estimation in high mobility scenarios using a reconstruction and recovery network. In this method, the time-frequency response of the channel is considered as a two-dimensional image. The Fast Super-Resolution Convolution Neural Network (FSRCNN) is used to first reconstruct channel images. Next, the Denoising Convolution Neural Network (DnCNN) is applied to reduce the channel noise and improve the accuracy of channel estimation. Simulation results show that the accuracy of the channel estimation model surpasses that of the standard channel estimation method, while also exhibiting reduced algorithmic complexity.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 505-513"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143922947","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}
Xu Yang , Hongyan Xing , Xinyuan Ji , Wei Xu , Witold Pedrycz
{"title":"Fuzzy clustering for electric field characterization and its application to thunderstorm interpretability","authors":"Xu Yang , Hongyan Xing , Xinyuan Ji , Wei Xu , Witold Pedrycz","doi":"10.1016/j.dcan.2024.03.010","DOIUrl":"10.1016/j.dcan.2024.03.010","url":null,"abstract":"<div><div>Changes in the Atmospheric Electric Field Signal (AEFS) are highly correlated with weather changes, especially with thunderstorm activities. However, little attention has been paid to the ambiguous weather information implicit in AEFS changes. In this paper, a Fuzzy <em>C</em>-Means (FCM) clustering method is used for the first time to develop an innovative approach to characterize the weather attributes carried by AEFS. First, a time series dataset is created in the time domain using AEFS attributes. The AEFS-based weather is evaluated according to the time-series Membership Degree (MD) changes obtained by inputting this dataset into the FCM. Second, thunderstorm intensities are reflected by the change in distance from a thunderstorm cloud point charge to an AEF apparatus. Thus, a matching relationship is established between the normalized distance and the thunderstorm dominant MD in the space domain. Finally, the rationality and reliability of the proposed method are verified by combining radar charts and expert experience. The results confirm that this method accurately characterizes the weather attributes and changes in the AEFS, and a negative distance-MD correlation is obtained for the first time. The detection of thunderstorm activity by AEF from the perspective of fuzzy set technology provides a meaningful guidance for interpretable thunderstorms.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 299-307"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140766979","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}
Yankai Yin , Zhe Sun , Peiying Ruan , Ruidong Li , Feng Duan
{"title":"Learned distributed image compression with decoder side information","authors":"Yankai Yin , Zhe Sun , Peiying Ruan , Ruidong Li , Feng Duan","doi":"10.1016/j.dcan.2024.06.001","DOIUrl":"10.1016/j.dcan.2024.06.001","url":null,"abstract":"<div><div>With the rapid development of digital communication and the widespread use of the Internet of Things, multi-view image compression has attracted increasing attention as a fundamental technology for image data communication. Multi-view image compression aims to improve compression efficiency by leveraging correlations between images. However, the requirement of synchronization and inter-image communication at the encoder side poses significant challenges, especially for constrained devices. In this study, we introduce a novel distributed image compression model based on the attention mechanism to address the challenges associated with the availability of side information only during decoding. Our model integrates an encoder network, a quantization module, and a decoder network, to ensure both high compression performance and high-quality image reconstruction. The encoder uses a deep Convolutional Neural Network (CNN) to extract high-level features from the input image, which then pass through the quantization module for further compression before undergoing lossless entropy coding. The decoder of our model consists of three main components that allow us to fully exploit the information within and between images on the decoder side. Specifically, we first introduce a channel-spatial attention module to capture and refine information within individual image feature maps. Second, we employ a semi-coupled convolution module to extract both shared and specific information in images. Finally, a cross-attention module is employed to fuse mutual information extracted from side information. The effectiveness of our model is validated on various datasets, including KITTI Stereo and Cityscapes. The results highlight the superior compression capabilities of our method, surpassing state-of-the-art techniques.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 349-358"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141401634","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":"Toward zero trust in 5G Industrial Internet collaboration systems","authors":"Han Zhang , Ziyan Zhang , Liquan Chen","doi":"10.1016/j.dcan.2024.03.011","DOIUrl":"10.1016/j.dcan.2024.03.011","url":null,"abstract":"<div><div>With the introduction of 5G, users and devices can access the industrial network from anywhere in the world. Therefore, traditional perimeter-based security technologies for industrial networks can no longer work well. To solve this problem, a new security model called Zero Trust(ZT) is desired, which believes in “never trust and always verify”. Every time the asset in the industrial network is accessed, the subject is authenticated and its trustworthiness is assessed. In this way, the asset in industrial network can be well protected, whether the subject is in the internal network or the external network. However, in order to construct the zero trust model in the 5G Industrial Internet collaboration system, there are still many problems to be solved. In this paper, we first introduce the security issues in the 5G Industrial Internet collaboration system, and illustrate the zero trust architecture. Then, we analyze the gap between existing security techniques and the zero trust architecture. Finally, we discuss several potential security techniques that can be used to implement the zero trust model. The purpose of this paper is to point out the further direction for the realization of the Zero Trust Architecture (ZTA) in the 5G Industrial Internet collaboration system.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 2","pages":"Pages 547-555"},"PeriodicalIF":7.5,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143922945","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}