Yin Zhang, Zhen Zhen, Yuli Zhao, Francis C. M. Lau, Bochang Ma, Bin Zhang, Hai Yu, Zhiliang Zhu
{"title":"Online fountain code with an improved caching mechanism","authors":"Yin Zhang, Zhen Zhen, Yuli Zhao, Francis C. M. Lau, Bochang Ma, Bin Zhang, Hai Yu, Zhiliang Zhu","doi":"10.1049/cmu2.12868","DOIUrl":"https://doi.org/10.1049/cmu2.12868","url":null,"abstract":"<p>The original online fountain codes discard a large number of symbols that do not meet the requirements at the decoder. To improve channel utilization, this article proposes a new online fountain code. In the completion phase, the proposed code improves the receiving rules of encoded symbols, that is, the encoded symbols discarded in the original online fountain codes are selectively cached. Moreover, an optimal degree selection strategy of encoded symbols is obtained in the proposed scheme. The valid degree range of the proposed strategy is also analyzed, leading to an upper bound of cached events which eventually limits the number of feedbacks. The theoretical analysis and simulation results reveal that the proposed scheme outperforms two state-of-the-art online fountain codes in terms of overhead factors, number of feedback transmissions, and encoding/decoding efficiency.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1813-1825"},"PeriodicalIF":1.5,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12868","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142862224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sujit Biswas, Kashif Sharif, Zohaib Latif, Mohammed J. F. Alenazi, Ashok Kumar Pradhan, Anupam Kumar Bairagi
{"title":"Blockchain controlled trustworthy federated learning platform for smart homes","authors":"Sujit Biswas, Kashif Sharif, Zohaib Latif, Mohammed J. F. Alenazi, Ashok Kumar Pradhan, Anupam Kumar Bairagi","doi":"10.1049/cmu2.12870","DOIUrl":"https://doi.org/10.1049/cmu2.12870","url":null,"abstract":"<p>Smart device manufacturers rely on insights from smart home (SH) data to update their devices, and similarly, service providers use it for predictive maintenance. In terms of data security and privacy, combining distributed federated learning (FL) with blockchain technology is being considered to prevent single point failure and model poising attacks. However, adding blockchain to a FL environment can worsen blockchain's scaling issues and create regular service interruptions at SH. This article presents a scalable Blockchain-based Privacy-preserving Federated Learning (BPFL) architecture for an SH ecosystem that integrates blockchain and FL. BPFL can automate SHs' services and distribute machine learning (ML) operations to update IoT manufacturer models and scale service provider services. The architecture uses a local peer as a gateway to connect SHs to the blockchain network and safeguard user data, transactions, and ML operations. Blockchain facilitates ecosystem access management and learning. The Stanford Cars and an IoT dataset have been used as test bed experiments, taking into account the nature of data (i.e. images and numeric). The experiments show that ledger optimisation can boost scalability by 40–60% in BCN by reducing transaction overhead by 60%. Simultaneously, it increases learning capacity by 10% compared to baseline FL techniques.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1840-1852"},"PeriodicalIF":1.5,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12870","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed GRS-coded differential spatial modulation for half-duplex cooperative network based on relay optimization and joint decoding","authors":"Chen Chen, Fengfan Yang","doi":"10.1049/cmu2.12867","DOIUrl":"https://doi.org/10.1049/cmu2.12867","url":null,"abstract":"<p>To ensure the reliable transmission with increased spectral efficiency of the small information block, this article proposes the novel distributed generalized Reed-Solomon coded differential spatial modulation (DGRSC-DSM) scheme in the relay cooperation manner. Two different generalized Reed-Solomon (GRS) codes with identical lengths are deployed at the source and relay, respectively, where the relay utilizes the subcode of the GRS code, which can construct an ultimate code having a unique algebraic structure at the destination. In addition, the Global search algorithm (Algorithm 1) is developed to obtain an optimal selection mode at the relay, resulting in the final code with an optimal code weight enumeration. Since the complexity of this algorithm is extremely high, the low-complexity Parity-position local search algorithm (Algorithm 2) is then proposed to get the suboptimal mode. Monte-Carlo results indicate that there is a minimal disparity in performance between the two proposed algorithms that both effectively enhance the system performance. Moreover, based on the optimized final code and the special construction of GRS code, the novel <i>Smart-joint</i> decoding algorithm is first presented at the destination which can fully exploit two-way information data and further lower the bit error rate (BER) of the DGRSC-DSM scheme. Also, the analytical union bound of the proposed scheme is formulated over the quasi-static Rayleigh fading channel, which illustrates a tight fit at the high signal-to-noise ratio (SNR) regions.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1795-1812"},"PeriodicalIF":1.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12867","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"M-ary differential chaos shift keying with carrier index modulation for high-data-rate transmission","authors":"Bin Yu, Guo-Ping Jiang, Hua Yang, Ya-Qiong Jia","doi":"10.1049/cmu2.12869","DOIUrl":"https://doi.org/10.1049/cmu2.12869","url":null,"abstract":"<p>A high-data-rate solution for M-ary differential chaos shift keying (MDCSK) based on carrier index modulation is proposed in this paper. At the transmitter, the proposed system employs index selectors, Hilbert transform, and MDCSK encoders. Walsh codes are used for separating different data-bearing wavelets. At the receiver, the proposed system adopts energy comparators and MDCSK detectors. The transmitted chaotic signals are duplicated for several times, and the averaging operation is performed on received signals to reduce noise. Theoretical bit error rate expressions are obtained over the AWGN and the multipath Rayleigh fading channels, respectively. Simulations and comparisons are performed to verify the effectiveness of the proposed scheme.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1826-1839"},"PeriodicalIF":1.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12869","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic hierarchical intrusion detection system for internet of vehicle on edge computing platform","authors":"Syed Sabir Mohamed S, Saranraj Gunasekaran, Rani Chinnamuthu, Gavendra Singh","doi":"10.1049/cmu2.12865","DOIUrl":"https://doi.org/10.1049/cmu2.12865","url":null,"abstract":"<p>In recent days, the Internet of Vehicles (IoV) and its network of connected automobiles have revealed several new security risks. Classical intrusion detection systems face challenges in identifying intrusions due to the growing number of vehicles, the dynamic nature of IoV, and limited resources. A hierarchical clustering method allows dividing the IoV network into clusters. The elements that determine the outcome are the geographical proximity and the traffic density. It is called the Dynamic Hierarchical Intrusion Detection Framework (DHIDF) for the IoV. To protect infrastructure and passengers, an IoV-specific DHIDF using edge computing has been proposed. Because of this, anomaly detection and localised assessment of danger will become less required. The application of DHIDF on a large scale inside the ecosystem of IoV is not entirely out of the question. The term encompasses several subfields, including intelligent transportation networks (ITNs), smart city infrastructure, fleet management, transportation, and autonomous vehicle systems. The efficacy of DHIDF is assessed through simulations that replicate current and potential future threats, including those related to the Internet of Things. Analysis of key performance parameters, including response time, detection accuracy, asset utilization, and scalability, has been conducted to assess the system's feasibility and durability.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1778-1794"},"PeriodicalIF":1.5,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12865","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secret key generation for reconfigurable intelligent surface-assisted MISO multi-user system","authors":"Kexin Liu, Mingliang Li, Kaizhi Huang, Zheng Wan, Qinlong Li, Xiaoli Sun, Xiaoming Xu, Liang Jin","doi":"10.1049/cmu2.12853","DOIUrl":"https://doi.org/10.1049/cmu2.12853","url":null,"abstract":"<p>Reconfigurable intelligent surface (RIS)-assisted physical layer key generation plays an important role in the eavesdropping problem on a typical multi-user scenario of wireless networks. Existing RIS-assisted physical key generation technology mainly solved the security issues in the single-antenna and multi-user scenario, which is based on the idealistic assumption of a spatially independent channel model at the RIS. It limits the degrees of freedom and neglects the existence of channel spatial correlation, which would possibly degrade the sum key generation rate (SKGR). To solve the above problem, this paper proposes a secret key generation scheme for RIS-assisted multiple-input single-output multi-user system. This scheme establishes a spatial correlation channel model, which comprehensively considers the influence of spatial correlation among antennas of the base station (BS), multi-user, and RIS elements on SKGR. Based on this, a key generation framework is designed to generate a more secure secret key with the maximum SKGR. Specifically, a closed-form SKGR expression and an optimization problem formulation are obtained to obtain the joint optimal coefficient of the BS and RIS. Then, the difference convex-successive convex approximation based alternating optimization algorithm is proposed to solve this optimization problem. The simulation results show that the proposed scheme has improved 10-bit/channel use compared with the randomization scheme of BS precoding and RIS reflection coefficient. It also has an improvement of 12-bit/channel use compared with the spatially independent scheme.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1741-1752"},"PeriodicalIF":1.5,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12853","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yan Zhang, Yong Wang, Haotong Cao, Yihua Hu, Zhi Lin, Kang An, Dong Li
{"title":"Self-similar traffic prediction for LEO satellite networks based on LSTM","authors":"Yan Zhang, Yong Wang, Haotong Cao, Yihua Hu, Zhi Lin, Kang An, Dong Li","doi":"10.1049/cmu2.12863","DOIUrl":"https://doi.org/10.1049/cmu2.12863","url":null,"abstract":"<p>Traffic prediction serves as a critical foundation for traffic balancing and resource management in Low Earth Orbit (LEO) satellite networks, ultimately enhancing the efficiency of data transmission. The self-similarity of traffic sequences stands as a key indicator for accurate traffic prediction. In this article, the self-similarity of satellite traffic data was first analyzed, followed by the construction of a satellite traffic prediction model based on an improved Long Short-Term Memory (LSTM). An early stopping mechanism was incorporated to prevent overfitting during the model training process. Subsequently, the Diebold-Mariano (DM) test method was applied to assess the significance of the prediction effect between the proposed model and the comparison model. The experimental results demonstrated that the improved LSTM satellite traffic prediction model achieved the best prediction performance, with Root Mean Squared Error values of 18.351 and 8.828 on the two traffic datasets, respectively. Furthermore, a significant difference was observed in the DM test compared to the other models, providing a solid basis for subsequent satellite traffic planning.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12863","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143115325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis for sparse channel representation based on dictionary learning in massive MIMO systems","authors":"Qing-Yang Guan","doi":"10.1049/cmu2.12850","DOIUrl":"https://doi.org/10.1049/cmu2.12850","url":null,"abstract":"<p>The accuracy analysis of dictionary sparse representation for channels in massive MIMO systems is a relatively unexplored field. Existing research has primarily focused on investigating the accuracy of dictionary sparse representation using simulation in massive MIMO systems, but has not provided quantitative accuracy analysis. To address this gap, the correlation numerical proportional factor is proposed to represent the accuracy performance of non-zero elements in the coefficient matrix. Additionally, a qualitative analytical formula for dictionary sparse representation accuracy is provided and an optimal upper bound for the correlation numerical proportional factor is established. Furthermore, the innovation indicates that the accuracy of dictionary sparse representation is mainly influenced by the cross-correlation between the pilots matrix and the dictionary matrix, as well as sparsity. The author has also developed a method for minimizing the correlation numerical proportional factor. In order to obtain an optimal sparse representation coefficient matrix, a cross-correlation matrix is constructed and an analytical expression is derived for it as well as its use as an optimal hard decision threshold is determined. Finally, a sparse representation coefficient optimization algorithm is proposed using this optimal threshold. Simulation results demonstrate that this algorithm can significantly improve channel sparse dictionary representation accuracy.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1728-1740"},"PeriodicalIF":1.5,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12850","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Correction to “5G based blockchain network for authentic and ethical keyword search engine”","authors":"","doi":"10.1049/cmu2.12866","DOIUrl":"https://doi.org/10.1049/cmu2.12866","url":null,"abstract":"<p>Malviya, M., Hamdi, M., V, V., Mohammed, M. A., Rauf, H. T., & Al-Dhlan, K. A. (2022). 5G based blockchain network for authentic and ethical keyword search engine. <i>IET Communications</i>, <i>16</i>(5), 442–448.</p><p>The affiliation for Hafiz Tayyab Rauf is [Independent Researcher, UK]; the online version of this article has been corrected accordingly.</p><p>We apologize for this error.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1996"},"PeriodicalIF":1.5,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12866","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Anwar Ahmed Khan, Shama Siddiqui, Muhammad Shoaib Siddiqui
{"title":"Delay management for heterogeneous traffic in vehicular sensor networks using packet fragmentation of low priority data","authors":"Anwar Ahmed Khan, Shama Siddiqui, Muhammad Shoaib Siddiqui","doi":"10.1049/cmu2.12861","DOIUrl":"https://doi.org/10.1049/cmu2.12861","url":null,"abstract":"<p>Vehicular sensor networks (VSNs) are expected to revolutionize the transportation systems through automated decision-making. These networks function on the communication between vehicles, traffic infrastructure, and people. One of the major challenges of VSNs is to deal with heterogeneous traffic due to the diverse nature of information and data generated by different types of sensors and devices within the vehicular environment. To ensure an effective operation of the network, it is crucial to offer a differentiated quality of service to each traffic class. Media access control (MAC) protocols offer an opportunity to provide differentiated channel access to the traffic of different priorities. This work is focused on offering comparison of recent MAC schemes in terms of their performance for heterogeneous traffic generated by VSNs. Two protocols FROG-MAC and UrgMAC have been selected: FROG-MAC is developed using a simple concept of packet fragmentation, where the packets of lower priority are fragmented to offer an early transmission opportunity to urgent traffic; on the other hand, urgMAC is designed using advanced cross-layer techniques of two-tiered service differentiation mechanism, adaptive data rate adjustment mechanism, urgency-based contention window size adaptation, traffic type adaptive duty cycle, and multimedia message passing. It has been found that the FROG-MAC outperforms urgMAC in terms of delay, energy consumption and packet delivery ratio.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 20","pages":"1753-1764"},"PeriodicalIF":1.5,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12861","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142860859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}