{"title":"Network- and application-aware adaptive congestion control algorithm","authors":"Ramyashree Venkatesh Bhat;Jetmir Haxhibeqiri;Ingrid Moerman;Jeroen Hoebeke","doi":"10.23919/JCN.2023.000052","DOIUrl":"https://doi.org/10.23919/JCN.2023.000052","url":null,"abstract":"More and more traffic is migrating to private networks in use in various professional environments. With this, there comes a growing diversity in applications, each of them requiring different quality of service. This poses challenges to properly managing such networks, which can span both wired and wireless segments. To tackle the issue of network management and application demands in such networks, we introduce a network- and application-aware adaptive congestion control algorithm, which provides congestion-free service differentiation to the flows in wireless networks in a decentralized manner. The designed algorithm operates based on the real-time network information obtained from in-band network telemetry and aggregated flow information from intermediate nodes. The algorithm performs three times better than the existing CUBIC congestion control algorithm and twice better in a multi-flow architecture. The designed algorithm is the first step towards adaptive transport and application layer protocols which are the future of private professional networks.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"344-355"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579716","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495168","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}
Mariana Baracat de Mello;Luciano Leonel Mendes;Daniely Gomes Silva;Paulo Ricardo Branco da Silva;Tiago Cardoso Barbosa
{"title":"FTN-GFDM detection based on reduced-complexity soft sphere decoding integrated with polar codes","authors":"Mariana Baracat de Mello;Luciano Leonel Mendes;Daniely Gomes Silva;Paulo Ricardo Branco da Silva;Tiago Cardoso Barbosa","doi":"10.23919/JCN.2024.000018","DOIUrl":"https://doi.org/10.23919/JCN.2024.000018","url":null,"abstract":"In remote rural areas, it is not possible to employ massive multiple-input multiple-output (MIMO), small cells, and ultra-dense networks (UDNs) with the aim of increasing throughput. A solution is to improve the waveform spectral efficiency, integrating faster than Nyquist (FTN) signaling with generalized frequency division multiplexing (GFDM). However, this presents high self-interference in the time and frequency domains, requiring dedicated detectors for performance loss mitigation. Hard decision detection schemes primarily designed for MIMO have been adapted to detect FTN-GFDM signals without degradation of the uncoded bit error rate (BER), but these schemes are suboptimal in terms of capacity as they do not provide all the information contained in log-likelihood ratios (LLRs). We design and evaluate in this paper a soft sphere detector (SD) algorithm for FTN-GFDM that can be integrated with state-of-the-art forward error control (FEC) decoders for good BER performance over mobile channels. The SD detector is combined with polar codes, and the BER and complexity are evaluated for different channel models. The results show that FTN-GFDM can provide high spectrum efficiency gains without significant coded BER losses and with affordable complexity on the receiver side, which makes this waveform an interesting candidate for mobile networks in remote areas.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"284-296"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579719","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495196","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}
Toan-Van Nguyen;Thien Huynh-The;Vo-Nguyen Quoc Bao
{"title":"Short-packet communications in wireless energy transfer full-duplex IoT networks with deep learning design","authors":"Toan-Van Nguyen;Thien Huynh-The;Vo-Nguyen Quoc Bao","doi":"10.23919/JCN.2024.000015","DOIUrl":"https://doi.org/10.23919/JCN.2024.000015","url":null,"abstract":"In this paper, we study wireless energy transfer full-duplex (FD) Internet-of-things (IoT) networks, where multiple FD IoT relays are deployed to assist short-packet communications between a source and a robot destination with multiple antennas in automation factories. Considering two residual interference (RSI) models for FD relays, we propose a full relay selection (FRS) scheme to maximize the e2e signal-to-noise ratio of packet transmissions. We derive the closed-form expressions for the average block error rate (BLER) and throughput of the considered system, based on which the approximation analysis is also carried out. Towards real-time configurations, we design a deep learning framework based on the FRS scheme to accurately predict the average BLER and system throughput via a short inference process. Simulation results reveal the significant effects of RSI models on the performance of FD IoT networks. Furthermore, the CNN design achieves the lowest root-mean-squared error among other schemes such as the conventional CNN and deep neural network. Furthermore, the DL framework can estimate similar BLER and throughput values as the FRS scheme, but with significantly reduced complexity and execution time, showing the potential of DL design in dealing with complex scenarios of heterogeneous IoT networks.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 3","pages":"297-307"},"PeriodicalIF":2.9,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10579721","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141495103","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}
Julius Ssimbwa;Seok-Hyun Yoon;Yeongrok Lee;Young-Chai Ko
{"title":"Towards 5G-advanced NR-unlicensed systems: Physical layer design and performance","authors":"Julius Ssimbwa;Seok-Hyun Yoon;Yeongrok Lee;Young-Chai Ko","doi":"10.23919/JCN.2024.000002","DOIUrl":"https://doi.org/10.23919/JCN.2024.000002","url":null,"abstract":"In the pursuit of a highly reliable and low-latency-enabled 5G-advanced new radio unlicensed (NR-U) system, addressing the challenge of high error rates and high signaling overhead transmissions remains key to improving network performance. In this context, to reduce error rates, mechanisms such as retransmissions can be employed. However, performing multiple retransmissions comes at the cost of utilizing extra transmission resources, which in turn affects the spectral efficiency of the network. This would further necessitate proper scheduling to alleviate resource wastage and undesirable collisions during data transmission. In this article, we provide an overview of the design specifications of the long-term evolution-license assisted access (LTE-LAA) technology and the prospective enhancements to enable NR-U operation in bands beyond 7 GHz. Additionally, we examine the configurations of selected design features to enable NR-U scheduling. Specifically, we illustrate the benefits and the limitations of the choice of the switching pattern under the frame structure, the feedback value type under the hybrid automatic repeat request (HARQ) procedure, and the timing parameters under the radio link control (RLC) layer. Besides, we present simulation results to depict the impact of the configurations mentioned above on the performance of NR-U.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"207-214"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522523","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880728","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 tasks offloading procedure for an integrated edge-computing architecture","authors":"Benedetta Picano;Romano Fantacci","doi":"10.23919/JCN.2024.000004","DOIUrl":"https://doi.org/10.23919/JCN.2024.000004","url":null,"abstract":"The advent of sixth-generation networks has given rise to numerous challenges, requiring the synergistic exploitation of both ground and air edge computing facilities. This paper considers an integrated ground-air edge computing scenario where the computation offloading of a set of delay sensitive tasks has to be performed in a context where ground and air computational facilities are already involved in monitoring and control proceduers in a remote area under an unpredictable overload of computation requests, e.g., related to the management of an emergency situation. In this reference, a matching game is proposed to assign tasks to the most suitable computation nodes, in order to minimize the outage probability of the newly arrived tasks, i.e., the probability with which tasks experience a completion time greater than the corresponding deadline. To this regard, we have considered that new allocated task suffer for a waiting time due to the time needed to complete the service of all the tasks already in the ground or air computation node. As a consequence, to statistically characterize such waiting time, under proper assumptions, we have resorted to the G/G/1 queuing system model and the Lindley's integral equation approach to define a suitable metric to formulate a tasks allocation procedure based on the matching theory. Furthermore, matching stability has been theoretically proved for the proposed approach. Finally, numerical results have been provided in order to highlight the better behavior of the proposed task allocation scheme in comparison with different state-of-the-art alternatives.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"215-224"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522525","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880786","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":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2024.000021","DOIUrl":"https://doi.org/10.23919/JCN.2024.000021","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"279-281"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522520","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880790","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":"Information for authors","authors":"","doi":"10.23919/JCN.2024.000019","DOIUrl":"https://doi.org/10.23919/JCN.2024.000019","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"274-278"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522522","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880818","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":"SER performance analysis of generalized κ — μ and η — μ fading channels","authors":"Jingjing Guo;Di Zhang;Li You;Xuewan Zhang;Shahid Mumtaz","doi":"10.23919/JCN.2024.000005","DOIUrl":"https://doi.org/10.23919/JCN.2024.000005","url":null,"abstract":"System performance analysis is a vital issue in the fifth generation (5G) and beyond wireless communications, which is widely adopted for the design and estimation of wireless communication systems before deployments. To this end, the versatile system performance expressions that can be used under various conditions are of significant importance. This paper investigates the symbol error rate (SER) performance over the generalized κ — μ and η — μ fading channels, whereby the SER expressions in this case are versatile and can characterize the performance under various wireless channel models. To address the computational complexity associated with high-order trigonometric integration, we present the closed-form SER expressions with arbitrary small errors. Monte Carlo-based simulations demonstrate the validity of our derivation and analysis. Simulation results also show that: 1) the closed-form solutions we derived for SER yield minimal errors upon variations in the truncation factor T and are computationally more efficient, in which T can be set to a minimal value to attain precise outcomes or be optimally chosen contingent on the channel parameters; 2) elevating the values of parameters κ, μ and η results in decreased SER, with μ exerting a more significant impact than κ and η; and 3) our approximate expressions have superior accuracy compared to the previous estimated expressions.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"193-206"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522516","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880797","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":"Private and consortium blockchain-based authentication protocol for IoT devices using PUF","authors":"Tyson Baptist D. Cunha;Kiran Manjappa","doi":"10.23919/JCN.2024.000014","DOIUrl":"https://doi.org/10.23919/JCN.2024.000014","url":null,"abstract":"In this work, a static random access memory-physical unclonable function (SRAM-PUF) based device security framework is proposed which uses the trending blockchain technology for securing the device credentials. The proposed framework produces a unique fingerprint called PUF key for each device based on its hardware characteristics which will act as an authenticating parameter for the devices during the authentication and re-authentication phase. The proposed work uses both consortium and private blockchains for storing device credentials and authentication, unlike the current trend of using either a secured database or only a public blockchain. The consortium blockchain is used for first-time authentication, while the private blockchain is used for repeated authentication which saves the time incurred in accessing the consortium blockchain during repeated authentication. The proposed protocol also includes mutual authentication between the entities involved and thus provides dual security (device authentication and mutual authentication) to the proposed protocol making the system more secure and robust against attacks. Security analysis of the proposed protocol is done using the Scyther tool and the protocol is also theoretically proven to be stable under various attacks using threat analysis and the real-or-random model (ROR). The performance analysis of the protocol is done by analyzing the computation and communication cost of the proposed protocol against other state-of-the-art protocols. Further, the proposed protocol is also evaluated in the blockchain testbed which includes Raspberry PI and Arduino components. The results conveyed that the introduction of a private blockchain reduces the time incurred in the device re-authentication.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"166-181"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522519","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880724","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":"Probabilistic resource rescheduling for C-V2X based on delivery rate estimation","authors":"Doyeon Hyeon;Chaeyeong Lee;Heemin Kim;Sungrae Cho;Jeongyeup Paek;Ramesh Govindan","doi":"10.23919/JCN.2024.000006","DOIUrl":"https://doi.org/10.23919/JCN.2024.000006","url":null,"abstract":"Vehicle-to-everything (V2X) communication is an essential component for fully autonomous vehicles in future intelligent transportation systems, and cellular-V2X (C-V2X) is a standard that allows vehicles to communicate with its surroundings using cellular technology. Among the resource allocation modes of C-V2X, Mode 4 is a distributed scheme in which each vehicle independently selects a radio resource using the sensing-based semi-persistent scheduling (SB-SPS) algorithm. However, it is susceptible to resource conflicts especially with increased vehicle density or mobility, and the conflicts cannot be detected, leading to poor performance due to collisions and interference. To address this problem, this paper proposes a delivery rate estimation based probabilistic resource re-scheduling (EB-PRS) scheme. The delivery ratio is estimated using opportunistic bloom filter-based feedback on which vehicle's messages are received successfully. Based on the estimated delivery rate, EB-PRS carefully reselects resources probabilistically to maximize performance. EB-PRS is evaluated in highway and urban scenarios using WiLabV2Xsim simulator to show that it significantly improves upon the SB-SPS by reducing packet collisions.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"239-251"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522524","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880726","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}