{"title":"MMSE-based passive beamforming for reconfigurable intelligent surface aided millimeter wave MIMO","authors":"Prabhat Raj Gautam, Li Zhang, Pingzhi Fan","doi":"10.1049/cmu2.12873","DOIUrl":"https://doi.org/10.1049/cmu2.12873","url":null,"abstract":"<p>Reconfigurable intelligent surfaces (RISs) have emerged as propitious solution to configure random wireless channel into suitable propagation environment by adjusting a large number of low-cost passive reflecting elements. It is considered that narrowband downlink millimeter wave (mmWave) multiple-input multiple-output (MIMO) communication is aided by deploying an RIS. Large antenna arrays are used to counter the huge propagation loss suffered by the mmWave signals. Hybrid precoding in which precoding is performed in digital and analog domains is employed to reduce the number of costly and power-consuming radio frequency (RF) chains. Passive beamforming at RIS is designed together with precoder and combiner through joint optimization problem to minimize the mean square error between the transmit signal and the estimate of signal at the receiver. The optimization problem is solved by an iterative procedure in which solution to the non-convex reflecting coefficients design problem is approximated by extracting the phases of the solution to unconstrained problem without unit amplitude constraint of the reflecting elements. It is shown that the proposed design principle also applies to the wideband channel. Simulation results show that the proposed design delivers performance better than existing state-of-the-art solutions, but at lower complexity.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12873","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143112693","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}
Nemalikanti Anand, Saifulla M A, Pavan Kumar Aakula, Raveendra Babu Ponnuru, Rizwan Patan, Chegireddy Rama Prakasha Reddy
{"title":"Enhancing intrusion detection against denial of service and distributed denial of service attacks: Leveraging extended Berkeley packet filter and machine learning algorithms","authors":"Nemalikanti Anand, Saifulla M A, Pavan Kumar Aakula, Raveendra Babu Ponnuru, Rizwan Patan, Chegireddy Rama Prakasha Reddy","doi":"10.1049/cmu2.12879","DOIUrl":"https://doi.org/10.1049/cmu2.12879","url":null,"abstract":"<p>As organizations increasingly rely on network services, the prevalence and severity of Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks have emerged as significant threats. The cornerstone of effectively addressing these challenges lies in the timely and precise detection capabilities offered by advanced intrusion detection systems (IDS). Hence, an innovative IDS framework is introduced that seamlessly integrates the extended Berkeley Packet Filter (eBPF) with powerful machine learning algorithms—specifically Decision Tree (DT), Random Forest (RF), Support Vector Machine (SVM), and TwinSVM—enabling unparalleled real-time detection of DDoS attacks. This cutting-edge solution provides a robust and scalable IDS framework to combat DoS and DDoS threats with high efficiency, leveraging eBPF's capabilities within the Linux kernel to bypass typical user space constraints. The methodology encompasses several key steps: (a) Collection of data from the renowned CIC-IDS-2017 repository; (b) Processing the raw data through a meticulous series of steps, including transmission, cleaning, reduction, and discretization; (c) Utilizing an ANOVA F-test for the extraction of critical features from the preprocessed data; (d) Application of various ML algorithms (DT, RF, SVM, and TwinSVM) to analyze the extracted features for potential intrusion; (e) Implementing an eBPF program to capture network traffic and harness trained model parameters for efficient attack detection directly within the kernel. The experimental results reveal outstanding accuracy rates of 99.38%, 99.44%, 88.73%, and 93.82% for DT, RF, SVM, and TwinSVM, respectively, alongside remarkable precision values of 99.71%, 99.65%, 84.31%, and 98.49%. This high-speed, accurate detection model is ideally suited for high-traffic environments such as data centers. Furthermore, its foundational architecture paves the way for future advancements, including the potential integration of eBPF with XDP to achieve even lower-latency packet processing. The experimental code is available at the GitHub repository link: https://github.com/NemalikantiAnand/Project.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12879","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143112694","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}
Mustafa Raad Kadhim, Guangxi Lu, Yinong Shi, Jianbo Wang, Wu Kui
{"title":"Lightweight on-edge clustering for wireless AI-driven applications","authors":"Mustafa Raad Kadhim, Guangxi Lu, Yinong Shi, Jianbo Wang, Wu Kui","doi":"10.1049/cmu2.12874","DOIUrl":"https://doi.org/10.1049/cmu2.12874","url":null,"abstract":"<p>Advanced wireless communication is important in distribution systems for sharing information among Internet of Things (IoT) edges. Artificial intelligence (AI) analyzed the generated IoT data to make these decisions, ensuring efficient and effective operations. These technologies face significant security challenges, such as eavesdropping and adversarial attacks. Recent studies addressed this issue by using clustering analysis (CA) to uncover hidden patterns to provide AI models with clear interpretations. The high volume of overlapped samples in IoT data affects partitioning, interpretation, and reliability of CAs. Recent CA models have integrated machine learning techniques to address these issues, but struggle in the limited resources of IoT environments. These challenges are addressed by proposing a novel unsupervised lightweight distance clustering (DC) model based on data separation (<span></span><math>\u0000 <semantics>\u0000 <mi>β</mi>\u0000 <annotation>$beta$</annotation>\u0000 </semantics></math>). <span></span><math>\u0000 <semantics>\u0000 <mi>β</mi>\u0000 <annotation>$beta$</annotation>\u0000 </semantics></math> raises the tension between samples using cannot-link relations to separate the overlap, thus DC provides the interpretations. The optimal time and space complexity enables DC-<span></span><math>\u0000 <semantics>\u0000 <mi>β</mi>\u0000 <annotation>$beta$</annotation>\u0000 </semantics></math> to be implemented on on-edge computing, reducing data transmission overhead, and improving the robustness of the AI-IoT application. Extensive experiments were conducted across various datasets under different circumstances. The results show that the data separated by <span></span><math>\u0000 <semantics>\u0000 <mi>β</mi>\u0000 <annotation>$beta$</annotation>\u0000 </semantics></math> improved the efficiency of the proposed solution, with DC outperforming the baseline model.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12874","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143110814","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}
Meilin He, Mingjue Zhu, Zhaoyang Zhang, Rui Guo, Haiquan Wang
{"title":"K\u0000 $K$\u0000 -user cyclic shift-aided serial concatenated code for Gaussian multiple access channel","authors":"Meilin He, Mingjue Zhu, Zhaoyang Zhang, Rui Guo, Haiquan Wang","doi":"10.1049/cmu2.12875","DOIUrl":"https://doi.org/10.1049/cmu2.12875","url":null,"abstract":"<p>A <span></span><math>\u0000 <semantics>\u0000 <mi>K</mi>\u0000 <annotation>$K$</annotation>\u0000 </semantics></math>-user cyclic shift-aided serial concatenated code (SCC) is proposed over a Gaussian multiple access channel (MAC). In this code, a cyclic shift-aided SCC, which integrates a regular repeat-accumulate code with rate-<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>1</mn>\u0000 <mo>/</mo>\u0000 <mi>q</mi>\u0000 </mrow>\u0000 <annotation>$1/q$</annotation>\u0000 </semantics></math> and cyclic shift spreading (CSS), is employed for each user. Here, CSS consists of a length-<span></span><math>\u0000 <semantics>\u0000 <mi>L</mi>\u0000 <annotation>$L$</annotation>\u0000 </semantics></math> bit spreading, a same chip-level interleaver and a user-specific cyclic shifter. This change avoids repeated complex interleaver generation operation and the main objective is to replace the random interleaver. At the receiver, iterative decoding is considered. For the design and optimization of the proposed code, a fixed point analysis (FPA) is developed to obtain the optimal <span></span><math>\u0000 <semantics>\u0000 <msup>\u0000 <mi>q</mi>\u0000 <mo>∗</mo>\u0000 </msup>\u0000 <annotation>$q^*$</annotation>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <msup>\u0000 <mi>L</mi>\u0000 <mo>∗</mo>\u0000 </msup>\u0000 <annotation>$L^*$</annotation>\u0000 </semantics></math> that achieves the maximum sum rate. Then, an analytic expression of collision probability is derived as a function of <span></span><math>\u0000 <semantics>\u0000 <mi>q</mi>\u0000 <annotation>$q$</annotation>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <mi>L</mi>\u0000 <annotation>$L$</annotation>\u0000 </semantics></math>. Finally, the advantage is analysed by comparing the generation time of interleaver. Moreover, FPA provides lower computation complexity in optimizing system parameters than the traditional EXIT chart method. Numerical results show that the design and optimization of the proposed code is more accurate, and support distinguishing between the users. The proposed code not only outperforms the traditional IDMA scheme in the bit error rate performance, but also provides much lower generation time of interleaver, especially for multiuser scenarios.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12875","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143110851","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}