IEEE Open Journal of the Communications Society最新文献

{"title":"Scalable High-Throughput and Low-Latency DVB-S2(x) LDPC Decoders on SIMD Devices","authors":"Bertrand Le Gal","doi":"10.1109/OJCOMS.2024.3494059","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3494059","url":null,"abstract":"Low-density parity-check (LDPC) codes are error correction codes (ECC) with near Shannon correction performances limit boosting the reliability of digital communication systems using them. Their efficiency goes hand in hand with their high computational complexity resulting in a computational bottleneck in physical layer processing. Solutions based on multicore and many-core architectures have been proposed to support the development of software-defined radio and virtualized radio access networks (vRANs). Many studies focused on the efficient parallelization of LDPC decoding algorithms. In this study, we propose an efficient SIMD parallelization strategy for DVB-S2(x) LDPC codes. It achieves throughputs from 7 Gbps to 12 Gbps on an INTEL Xeon Gold target when 10 layered decoding iterations are executed. Simultaneously, the latencies are lower than \u0000<inline-formula> <tex-math>$400~mu $ </tex-math></inline-formula>\u0000s. These performances are equivalent to FPGA-based solutions and overclass CPU and GPU related works by factors up to \u0000<inline-formula> <tex-math>$5times $ </tex-math></inline-formula>\u0000.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7216-7227"},"PeriodicalIF":6.3,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10747211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142679408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"vFFR: A Very Fast Failure Recovery Strategy Implemented in Devices With Programmable Data Plane","authors":"David Franco;Marivi Higuero;Ane Sanz;Juanjo Unzilla;Maider Huarte","doi":"10.1109/OJCOMS.2024.3493417","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3493417","url":null,"abstract":"The rapid emergence of new applications and services, and their increased demand for Quality of Service (QoS), have a significant impact on the development of today’s communication networks. As a result, communication networks are constantly evolving towards new architectures, such as the 6th Generation (6G) of communication systems, currently being studied in academic and research environments. One of the most critical aspects of designing communication networks is meeting the restricted delay and packet loss requirements. In this context, although link failure recovery has been widely addressed in the literature, it remains one of the main causes of packet losses and delays in the network. The failure recovery time in currently deployed technologies is still far from the sub-millisecond delay required in 6G networks. The time required for distributed network architectures to converge to a common network state after a link failure is excessive. In contrast, centralized architectures such as Software-Defined Networking (SDN) solve this problem but still need to notify the failure to a centralized controller, which increases the recovery time. This paper proposes a very Fast Failure Recovery (vFFR) strategy that can recover from link failures in sub-millisecond timescales by reacting directly from the data plane of the network devices while maintaining a synchronized state with the centralized controller. We first analyze current failure recovery strategies and classify them according to the techniques used to optimize failure recovery time. Afterward, we describe the design of a vFFR strategy that combines three data plane recovery algorithms to reduce latency and packet loss under varying network conditions. Our vFFR strategy has been modeled in P4 language and tested on an emulation platform to validate the three data plane recovery algorithms under different conditions. The results show that latency varies according to the alternate path selected in the recovery algorithm, and the packet loss rate remains constant even when the background traffic reaches 90% of the link capacity. In addition, the vFFR strategy has been implemented on Intel Tofino devices, achieving a failure recovery time lower than \u0000<inline-formula> <tex-math>$500~mu s$ </tex-math></inline-formula>\u0000 and a total frame loss rate below 0.005% in all cases, including those with a 35 Gbps load.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7121-7146"},"PeriodicalIF":6.3,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10746495","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142671990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Service Continuity in Edge Computing Through Edge Proxies and HTTP Alternative Services","authors":"Lorenzo Giorgi;Carlo Puliafito;Antonio Virdis;Enzo Mingozzi","doi":"10.1109/OJCOMS.2024.3492695","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3492695","url":null,"abstract":"Edge computing brings computation facilities in close proximity to users, hence paving the way to a plethora of applications characterized by stringent requirements. Edge systems are highly dynamic, and clients may have to access their edge services at different locations over time. When this happens, it is fundamental to guarantee seamless service continuity, i.e., letting endpoints reach each other transparently and with no or negligible impact on performance. In this work, we propose a service-continuity solution for edge environments that leverages an ecosystem of distributed edge proxies as its core element. Edge proxies mediate between client applications and edge services and are dynamically reconfigured by a system orchestrator to ensure service continuity when the proxy for a client needs to change. Our proxies exploit HTTP Alternative Services, an extension of the HTTP standard, to inform clients of the new proxy to reach. Our approach is fully transparent to the application logic and does not require any non-standard protocol modification. We implemented a Proof-of-Concept and used it to assess our solution over a small-scale testbed. We considered different experimental scenarios and variants of the proposed strategy, comparing it against alternative approaches, namely one where the edge proxy does not change and one based on DNS resolution. Experimental results show the validity and superior performance of the proposed methodology.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7057-7074"},"PeriodicalIF":6.3,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10745557","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142671120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Delay Guarantees for a Swarm of Mobile Sensors in Safety-Critical Applications","authors":"Orangel Azuaje;Ana Aguiar","doi":"10.1109/OJCOMS.2024.3491947","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3491947","url":null,"abstract":"Swarms of mobile wireless-connected sensors are increasingly deployed for applications such as monitoring, surveillance, and safety-critical operations. Quantifying end-to-end (e2e) delay performance guarantees in these scenarios is paramount. In this paper, we present a theoretical approach using Stochastic Network Calculus (SNC) with Moment Generating Functions (MGFs) to characterize e2e delay bounds in Mobile Wireless Sensor Networks (MWSNs). Our study focuses on a network composed of two segments: the first segment includes multiple nodes connected via a contention-based channel using the Distributed Coordination Function (DCF), while the second segment consists of a link prone to disconnections due to the mobility of nodes in the first segment. We model the first segment by calculating the expected per-packet service time in a non-saturated homogeneous contention channel and the second segment using a Discrete Time Markov Chain (DTMC). Initially, we derive a mathematical expression that correlates the offered load with the saturation status of each node’s queue in a non-saturated contention channel with homogeneous nodes. We then provide numerical e2e delay bounds for an illustrative example of a first responder network, quantifying the effects of non-saturated traffic, communication range on the head-sink link, and scheduling algorithms across different network sizes. Finally, we compare the derived e2e delay bounds with network simulations to assess their accuracy and reliability.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7147-7159"},"PeriodicalIF":6.3,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10742911","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142672016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Distributed Massive MIMO for Wireless Power Transfer in the Industrial Internet of Things","authors":"Son Dinh-van;Hien Quoc Ngo;Simon L. Cotton;Yuen Kwan Mo;Matthew D. Higgins","doi":"10.1109/OJCOMS.2024.3491354","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3491354","url":null,"abstract":"This paper considers wireless power transfer (WPT) for powering low-power devices in massive Machine Type Communication (mMTC) using a distributed massive multiple-input multiple-output (MIMO) system. Each Internet of Things (IoT) device can be served by one or more access points (APs) which is equipped with a massive antenna array. During each time slot, each IoT device transmits pilot sequences to enable APs to perform channel estimation. This process is followed by the WPT using conjugate beamforming. The approach to transmission power control is formulated as a non-convex optimization problem aiming to maximize the total accumulated power achieved by all IoT devices while taking into account the power weights at the APs, pilot power control at the IoT devices, and the non-linearity of practical energy harvesting circuits. An alternating optimization approach is adopted to solve it iteratively, achieving convergence within just a few iterations. Furthermore, since the number of IoT devices might be enormous in mMTC networks, we propose a pilot sharing algorithm allowing IoT devices to reuse pilot sequences effectively. Numerical results are provided to validate the effectiveness of the proposed power control algorithms and the pilot sharing scheme. It is shown that by allowing IoT devices to share the pilot sequences instead of employing the orthogonal pilots, the per-user accumulated performance is enhanced considerably, especially when the number of IoT devices is large relative to the coherence interval. The advantage of using distributed massive MIMO compared to its collocated counterpart is demonstrated in terms of the per-user accumulated power.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7160-7175"},"PeriodicalIF":6.3,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10742936","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142679388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimizing Multi-UAV Multi-User System Through Integrated Sensing and Communication for Age of Information (AoI) Analysis","authors":"Yulin Zhou;Aziz Altaf Khuwaja;Xiaoting Li;Nan Zhao;Yunfei Chen","doi":"10.1109/OJCOMS.2024.3489873","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3489873","url":null,"abstract":"Integrated sensing and communication enhances the spectral efficiency by using shared resources, eliminating the need for separate bandwidth allocations. Unmanned aerial vehicle (UAVs) play a key role in this, offering mobility, flexibility, and extended coverage for serving multiple users, especially in scenarios like disaster response and environmental monitoring. This paper explores multiple UAVs with integrated sensing and communication capabilities, using the Age of Information (AoI) metric to optimize resource allocation for timely data transmission. We propose two algorithms, Variable Particle Swarm Optimization (VPSO) and Twin Variable Neighborhood Particle Swarm Optimization (TVPSO), to jointly optimize power, bandwidth, and UAV trajectories to minimize AoI. Numerical results show the effects of the sensing and communication power ratio, the number of UAVs and the number of users on AoI and energy consumption. Furthermore, TVPSO is shown to outperform other PSO variants and the Deep Q Networks (DQN)-based approach, offering faster convergence and superior performance.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"6918-6931"},"PeriodicalIF":6.3,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10741963","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142650591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-Cluster Frequency-Angle Diffuse Scattering Model and Its Estimation","authors":"Zihang Cheng;Andreas F. Molisch","doi":"10.1109/OJCOMS.2024.3489577","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3489577","url":null,"abstract":"For the development and deployment of upcoming 6G systems, propagation channel measurements in new scenarios, new frequency bands, and for new antenna arrangements will be required. The diffuse multipath component (DMC) contains a non-negligible portion of the channel impulse response, and thus must be considered in channel evaluations and modeling. Previous work observed that multiple DMC clusters exist, which are associated with specular multipath component (MPC) clusters, yet the widely used Kronecker assumption for the delay/angle structure of these DMC clusters rarely holds in reality. In this paper, we propose an estimation algorithm for a parametric multi-cluster DMC model that more accurately models the connection between delay and angular parameters for each cluster, assuming that the Kronecker model is only valid within each cluster instead of for the whole channel. This avoids creating ghost modes that would reduce the DMC covariance matrix estimation accuracy. Our proposed algorithm is incorporated into the framework of the RiMax algorithm, an iterative maximum-likelihood estimation scheme. The effectiveness and correctness of the proposed algorithm are verified on synthetic channels, since they have a known ground truth. Simulations demonstrate improvements not only in the accuracy of the DMC, but also the associated specular MPC compared to the state-of-the-art uni-modal DMC model. Furthermore, the application of this algorithm to real-world sub-THz channel measurements is demonstrated.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7176-7196"},"PeriodicalIF":6.3,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10742108","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142679392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Segment-Encoded Explicit Trees (SEETs) for Stateless Multicast: P4-Based Implementation and Performance Study","authors":"Steffen Lindner;Thomas Stüber;Maximilian Bertsch;Toerless Eckert;Michael Menth","doi":"10.1109/OJCOMS.2024.3490433","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3490433","url":null,"abstract":"IP multicast (IPMC) is used to efficiently distribute one-to-many traffic within networks. It requires per-group state in core nodes and results in large signaling overhead when multicast groups change. Bit Index Explicit Replication (BIER) and its tree engineering variant BIER-TE have been introduced as a stateless transport mechanism for IPMC. To utilize BIER or BIER-TE in a large domain, domains need to be subdivided into smaller sets of receivers or smaller connected subdomains, respectively. Sending traffic to receivers in different sets or subdomains necessarily implies sending multiple packets. While efficient algorithms exist to compute sets for BIER, algorithms for computing BIER-TE subdomains are still missing. In this paper, we present a novel stateless tree encoding mechanism called Segment-Encoded Explicit Tree (SEET). It encodes an explicit multicast distribution tree within a packet header so that tree engineering is supported and sets or subdomains are not needed for large domains. SEET is designed to be implementable on low-cost switching ASICs which we underline by a prototype for the Intel Tofino™. If explicit distribution trees are too large to be accommodated within a single header, multiple packets with different distribution trees are sent. For this purpose, we suggest an effective optimization heuristic. A comprehensive study compares the number of sent packets and resulting overall traffic for SEET and BIER in large domains. In our experiments, SEET outperforms BIER even for large multicast groups with up to 1024 receivers.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"6903-6917"},"PeriodicalIF":6.3,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10742105","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142650586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Performance Analysis of Multi-Hop UAVs Using FSO Communications Under Humidity and Sandstorms Conditions","authors":"Mohammed Salih Mohammed Gismalla;Suhail I. Al-Dharrab;Saleh A. Alawsh;Ali H. Muqaibel","doi":"10.1109/OJCOMS.2024.3489424","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3489424","url":null,"abstract":"This paper investigates the performance of hovering unmanned aerial vehicles (UAVs) using free space optical (FSO) communications with decode-and-forward (DF) relaying. Multi-hop UAV relays are considered. The channel is modeled considering the atmospheric attenuation due to the sandstorm and relative humidity (RH), in addition to the atmospheric turbulence, angle-of-arrival (AOA) fluctuations, and pointing errors (PE). We first obtain a simplified expression for end-to-end (E2E) outage probability considering atmospheric attenuation conditions, then the impact of various parameters such as transmitted power, field of view (FOV) and optical beamwidth on E2E outage probability is incorporated. We also derive a closed form expression for the ergodic capacity and characterize the effect of different system parameters. Monte Carlo simulation is utilized to prove the analytical results. The asymptotic bound for E2E outage probability is validated to offer insights into the effects of different channel coefficients. Analysis of the results indicates that the impact of low visibility due to sandstorms is comparable to that of high RH on FSO links.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"6987-7001"},"PeriodicalIF":6.3,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10740467","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142650587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Transmitter CSI-Free RIS-Randomized CUMA for Extreme Massive Connectivity","authors":"Kai-Kit Wong","doi":"10.1109/OJCOMS.2024.3488503","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3488503","url":null,"abstract":"This paper proposes a transmitter channel state information (CSI)-free, massive connectivity scheme in the downlink that requires no optimization from the base station (BS) side. Inter-user interference is dealt with solely by the mobile users themselves, each equipped with a position-flexible fluid antenna system (FAS). Specifically, we adopt the compact ultra massive antenna (CUMA) receiver architecture at the FAS of each user, which protects the desired user’s signal from interference without the need of the interferers’ CSI. Different from previous work, we incorporate the return loss and isolation parameters into the channel model to properly reflect realistic mutual coupling countermeasures and deploy randomized reconfigurable intelligent surfaces (RISs) in the environment to restore rich scattering channel conditions. Our simulation results demonstrate that under these conditions at \u0000<inline-formula> <tex-math>$26~{textrm {GHz}}$ </tex-math></inline-formula>\u0000, CUMA can accommodate 50 users per channel use to achieve a rate of \u0000<inline-formula> <tex-math>$45~{textrm {bps/Hz}}$ </tex-math></inline-formula>\u0000, without power control and precoding at the BS and also no successive interference cancellation (SIC) at each user. The rate will be increased to \u0000<inline-formula> <tex-math>$54~{textrm {bps/Hz}}$ </tex-math></inline-formula>\u0000 if 100 users are served, revealing the possibility of massive connectivity without the CSI at the BS.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"6890-6902"},"PeriodicalIF":6.3,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10738398","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142600383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}