Journal of Communications and Networks最新文献

{"title":"Statistical analysis of cascaded Nakagami-m fading channels with generalized correlation","authors":"Ibrahim Ghareeb;Osama Al-Shalali","doi":"10.23919/JCN.2024.000001","DOIUrl":"https://doi.org/10.23919/JCN.2024.000001","url":null,"abstract":"This paper studies the statistical analysis of cascaded Nakagami-m fading channels that are arbitrarily correlated and not necessarily identically distributed. The probability density function (PDF), cumulative distribution function (CDF), and the nth moment for the product of N correlated Nakagami-m random variables (RVs) are derived and presented in exact form expressions using the Meijer's G function. The cascaded channels are assumed to have flat and slow fading with arbitrarily non-identical fading severity parameters. Using these results, the impact of channel correlation and fading severity parameters are investigated for the cascaded Nakagami-m channels. Furthermore, performance analysis addressed by outage probability (OP), average channel capacity, and average bit error probability (BEP) for coherently detected binary PSK and FSK signals are derived. As a consequence of the versatility of Nakagami-m distribution, the derived expressions can compromise the statistics of other useful multivariate distributions such as One-sided Gaussian distribution with m = 1/2 and Rayleigh distribution with m = 1. To the best of the authors' knowledge, the derived expressions are novel and have not been reported in the literature. To aid and verify the theoretical analysis, numerical results authenticated by Monte Carlo simulation are presented.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"1-18"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459136","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Analyzing age of information in multiaccess networks with time-varying channels: A fluid limits approach","authors":"Feng Yuan;Zeyu Hu;Zhiyuan Jiang","doi":"10.23919/JCN.2024.000003","DOIUrl":"https://doi.org/10.23919/JCN.2024.000003","url":null,"abstract":"In this paper, we adopt the fluid limits approach to analyze the age of information (AoI) in a wireless multi-access network where users share the channel and transmissions are unreliable. We prove the convergence of the AoI occupancy measure to the fluid limit, represented by a partial differential equation (PDE). Furthermore, we demonstrate the global convergence to the equilibrium of the PDE, i.e., the stationary AoI distribution. Within this framework, we first consider the case of i.i.d. channel conditions and generate-at-will statuses for users. We demonstrate that a previously established AoI lower bound in the literature is asymptotically accurate, and a straightforward threshold-based access policy can be asymptotically optimal. Next, we consider the case where the channel states are time-varying, i.e., the Gilbert-Elliott channel model. We assume partial channel state information (CSI) is available due to channel probing singals. Theoretical analysis reveals that only a fraction of CSI is required to approach the optimal performance. Additionally, we numerically evaluate the performance of the proposed policy and the existing Whittle's index policy under time-varying channels. Simulation results demonstrate that the proposed policy outperforms the Whittle's index policy since the latter cannot adapt to time-varying channels.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"49-64"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459132","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Traffic engineering and QoS/QoE supporting techniques for emerging service-oriented software-defined network","authors":"Mykola Beshley;Natalia Kryvinska;Halyna Beshley;Oleksiy Panchenko;Mykhailo Medvetskyi","doi":"10.23919/JCN.2023.000065","DOIUrl":"https://doi.org/10.23919/JCN.2023.000065","url":null,"abstract":"The future integration of software-defined network (SDN) with the service-oriented architecture (SOA) paradigm requires new solutions to ensure the quality of service (QoS) according to the users' requirements. The paper presents a user experience-centric approach to traffic engineering and QoS/quality of experience (QoE) support for service-oriented software-defined network (SOSDN) architecture. This approach is to enable end-to-end QoS across the networking and computing domain by monitoring and agreeing on the dynamic state of their functioning. The proposed SOSDN is based on improved traffic engineering techniques, such as adaptive prioritization of services, server selection, and QoS/QoE-based routing. The developed adaptive service prioritization algorithm automatically changes the priority of flows in the network operation mode by the SDN controller for individual users under the concluded service level agreements (SLA) contract. We proposed a mathematical model of correlation of user satisfaction level by QoE score with technical QoS parameters. This model is based on the normalized value of the integral additive QoS criterion. Accordingly, ensuring the ordered user-centric QoS/QoE is carried out by means of proposed multi-criteria adaptive routing of data flows, the metric of which is based on the integral additive QoS criterion. The simulation results showed that, in contrast to known practical solutions, the integrated use of the proposed method of adaptive multi-criteria routing and prioritization of data flows provides a high level of QoE required by users in the SOSDN paradigm.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"99-114"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459131","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Classification and characterization of encoded traffic in SCADA network using hybrid deep learning scheme","authors":"Love Allen Chijioke Ahakonye;Gabriel Chukwunonso Amaizu;Cosmas Ifeanyi Nwakanma;Jae Min Lee;Dong-Seong Kim","doi":"10.23919/JCN.2023.000067","DOIUrl":"https://doi.org/10.23919/JCN.2023.000067","url":null,"abstract":"The domain name system (DNS) has evolved into an essential component of network communications, as well as a critical component of critical industrial systems (CIS) and Supervisory Control and Data Acquisition (SCADA) network connection. DNS over HTTPS (DoH) encapsulating DNS within hypertext transfer protocol secure (HTTPS) does not eliminate network access exploitation. This paper proposes a hybrid deep learning model for the early classification of encoded network traffic into one of the two classes: DoH and NonDoH. They can be malicious, benign, or zero-day attacks. The proposed scheme incorporates the swiftness of the convolutional neural network (CNN) in extracting useful information and the ease of long short-term memory (LSTM) in learning long-term dependencies. The simulation results showed that the proposed approach accurately classifies the encoded network traffic as DoH or NonDoH and characterizes the traffic as benign, zero-day, or malicious. The proposed robust hybrid deep learning model had high accuracy and precision of 99.28%, recall of 99.75%, and AUC of 0.9975 at a minimal training and testing time of 745s and 0.000324 s, respectively. In addition to outperforming other compared contemporary algorithms and existing techniques, the proposed technique significantly detects all attack types. This study also investigated the impact of the SMOTE technique as a tool for data balancing. To further validate the reliability of the proposed scheme, an industrial control system SCADA (ICS-SCADA) dataset, in addition to two (2) other cyber-security datasets (NSL-KDD and CICDS2017), were evaluated. Mathews correlation coefficient (MCC) was employed to validate the model performance, confirming the applicability of the proposed model in a critical industrial system such as SCADA.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"65-79"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459137","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Copyright transfer form","authors":"","doi":"10.23919/JCN.2024.000010","DOIUrl":"https://doi.org/10.23919/JCN.2024.000010","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"153-155"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459130","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An efficient application based many-to-many resource allocation and sharing with power optimization for D2D communication — A clustered approach","authors":"Raghu Thekke Veedu;Kiran Manjappa","doi":"10.23919/JCN.2023.000062","DOIUrl":"https://doi.org/10.23919/JCN.2023.000062","url":null,"abstract":"This study aims to give an edge to public safety applications over commercial applications in an underlay cellular-assisted device-to-device (D2D) communication. The proposed framework introduces two frameworks: Cluster-based many-to-many resource allocation and resource sharing framework (CMMRARS) and constant time power control algorithm (CTPCA). The RB assigned to a CUE can share with multiple DUE pairs, and the DUE pairs can also use RB assigned to multiple CUEs under the many-to-many strategy. The CMMRARS framework is responsible for resource allocation and resource sharing and accordingly, it is further divided into three sub-problems. The CTPCA framework is divided into two subproblems and used to find optimal power for cellular users and D2D transmitters to avoid cross-tier and co-tier interference. The K-means clustering algorithm is employed to form application-specific clusters, and it ensures that more cellular users fall into the public safety clusters so that the D2D users will get more resource-sharing options. Cellular users use a weighted bipartite graph to form a priority list of D2D users for resource sharing. The main objective of the proposed work is to enhance the system's sum rate by simultaneously reusing the same resource by multiple D2D pairs and safeguarding the Quality of Services provided to all kinds of network users. A theoretical justification is presented to ensure that the proposed frameworks terminate after a certain number of runs and congregate to a consistent matching. Simulation results show that the proposed method influences the overall system's sum rate and provides a preference for public safety applications over commercial applications.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"19-34"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459141","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"IBN@Cloud: An intent-based cloud and overlay network orchestration system","authors":"Mir Muhammad Suleman Sarwar;Afaq Muhammad;Wang-Cheol Song","doi":"10.23919/JCN.2023.000051","DOIUrl":"https://doi.org/10.23919/JCN.2023.000051","url":null,"abstract":"This paper presents an intent-based networking (IBN) system for the orchestration of OpenStack-based clouds and overlay networks between multiple clouds. Clouds need to communicate with other clouds for various reasons such as reducing latency and overcoming single points of failure. An overlay network provides connectivity between multiple Clouds for communication. Moreover, there can be several paths of communication between a source and a destination cloud in the overlay network. A machine learning model can be used to proactively select the best path for efficient network performance. Communication between the source and destination can then be established over the selected path. Communication in such type of a scenario requires complex networking configurations. IBN provides a closed-loop and Intelligent system for cloud to cloud communication. To this end, IBN abstracts complex networking and cloud configurations by receiving an intent from a user, translating the intent, generating complex configurations for the intent, and deploying the configurations, thereby assuring the intent. Therefore, the IBN that is presented here has three major features: (1) It can deploy an OpenStack cloud at a target machine, (2) it can deploy GENEVE tunnels between different clouds that form an overlay network, and (3) it can then leverage the advantages of machine learning to find the best path for communication between any two clouds. As machine learning is an essential component of the intelligent IBN system, two linear and three non-linear models were tested. RNN, LSTM, and GRU models were employed for non-linear modeling. Linear regression and SVR models were employed for linear modeling. Overall all the non-linear models outperformed the linear model with an 81% R\u0000²\u0000 score, exhibiting similar performance. Linear models also showed similar performance but with lower accuracy. The testbed contains an overlay network of 11 GENEVE tunnels between 7 OpenStack-based clouds deployed in Malaysia, Korea, Pakistan, and Cambodia at TEIN.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"131-146"},"PeriodicalIF":3.6,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10416318","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient detectors for uplink massive MIMO systems","authors":"Mahmoud A. Albreem;Saeed Abdallah;Khawla A. Alnajjar;Mahmoud Aldababsa","doi":"10.23919/JCN.2023.000053","DOIUrl":"https://doi.org/10.23919/JCN.2023.000053","url":null,"abstract":"Massive multiple-input multiple-output (MIMO) is one of the essential technologies in beyond fifth generation (B5G) communication systems due to its impact in attaining high power efficiency and spectrum efficiency. The design of low-complexity detectors for massive MIMO continues to attract significant research and industry attention due to the critical need to find the right balance between performance and computational complexity, especially with a large number of antennas at both the transmitting and receiving sides. It has been noticed in several recent studies that appropriate initialization of iterative data detection techniques plays a crucial role in both the performance and the computational complexity. In this article, we propose three efficient initialization methods that achieve a favorable balance between performance and complexity. Instead of using the conventional diagonal matrix, we employ the scaled identity matrix, the stair matrix, and the band matrix with the first iteration of the Newton method to initialize the accelerated overrelaxation (AOR), the successive overrelaxation (SOR), the Gauss-Seidel (GS), the Jacobi (JA), and the Richardson (RI) based detectors. The scaling factor depends on the minimum and maximum eigenvalues of the equalization matrix. The proposed detectors are tested with different massive MIMO configurations, different modulation schemes (QPSK, 16QAM and 64QAM), and perfect and imperfect channel state information (CSI). Using simulations, we show that the proposed detectors achieve a significant performance gain compared to the minimum mean-squared error (MMSE) based detector, the conventional linear massive MIMO detectors, and other existing detectors, at a remarkable complexity reduction.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"35-48"},"PeriodicalIF":3.6,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10416319","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"AUB: A full-duplex MAC protocol for the efficient utilization of the idle uplink period in WLAN","authors":"Hyeongtae Ahn;Harim Lee;Young Deok Park","doi":"10.23919/JCN.2023.000043","DOIUrl":"https://doi.org/10.23919/JCN.2023.000043","url":null,"abstract":"Recently, full-duplex radio has attracted attention as a solution for wireless local area networks (WLANs) where traffic is exploding but available frequency bands are insufficient. Full-duplex radio exploits various self-interference cancellation technologies to transmit and receive signals concurrently in the same frequency band. Thus, the efficiency of the frequency band is doubled compared with that of conventional half-duplex radios. However, to effectively exploit full-duplex radio, new problems that do not exist in conventional half-duplex radio, such as full-duplex link setup, inter-node interference avoidance, and idle uplink period (IUP), must be addressed. We propose a full-duplex medium access control (MAC) protocol to effectively exploit full-duplex radio by addressing these problems. In particular, our MAC protocol uses an IUP to transmit an acknowledgment (ACK) frame and report the buffer information of nodes. Accordingly, an access point can gather the node's buffer information during the IUP and schedule the transmission of nodes without competition. In addition, because the uplink ACK frame is transmitted during the IUP, additional channel usage time for the uplink ACK frame transmission is not required. Therefore, the proposed MAC protocol improves the WLAN throughput by reducing the number of control frame transmissions and the IUP. The results of our performance analysis and simulation show that the MAC protocol achieves throughput improvements compared with those of previous studies.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"750-759"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387276","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Capacity analysis of index modulation multiple access system","authors":"Raed Mesleh;Nareeman Jibreel;Abdelhamid Younis","doi":"10.23919/JCN.2023.000048","DOIUrl":"https://doi.org/10.23919/JCN.2023.000048","url":null,"abstract":"Employing cutting-edge non-orthogonal multiple access (NOMA) techniques, index modulation multiple access (IMMA)introduces an efficient methodology. By leveraging index modulation (IM), IMMA facilitates concurrent data transmission among multiple users. It enhances this process by incorporating an additional constellation diagram that conveys extra information bits per channel utilization. In this work, we conduct a comprehensive investigation. We derive the theoretical capacity of the IMMA system and analyze mutual information across receiver channel estimation scenarios—ranging from perfect to imperfect. To validate our derivations, we execute Monte Carlo simulations, affirming our theoretical results. Notably, our findings confirm that the derived theoretical capacity formula acts as an upper bound for simulated mutual information curves. Additionally, we identify conditions for achieving the derived capacity, rigorously verifying their applicability. Through compelling comparisons, we evaluate the IMMA system's performance in mutual information and capacity against sparse code multiple access (SCMA) systems. This analysis underscores the superior attributes of the IMMA system, showcasing its potential. To illuminate practical constraints, we establish a crucial bound on users effectively sharing orthogonal resources, offering deployment insights. Furthermore, we contrast IMMA systems with traditional orthogonal multiple access (OMA) counterparts, dissecting the implications of overloading. This comprehensive approach yields a holistic comprehension of the scheme's ramifications.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 6","pages":"711-721"},"PeriodicalIF":3.6,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10387273","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139406547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}