Mobile edge computing (MEC) is emerging as a critical technology for supporting latency-sensitive and computation-intensive services-however, random wireless channel fading limits offloading rates, posing a significant challenge to MEC performance. In MEC systems, effective energy management and high-speed communication links between user devices and MEC servers are essential for supporting services that require low latency and high computation power. Reconfigurable intelligent surfaces (RIS) have been proposed as a promising solution to enhance the quality of communication links between users and MEC servers by dynamically reconfiguring the wireless propagation environment to overcome these challenges. We formulate a trade-off optimization problem to balance SE and EE in RIS-aided MEC systems, which is crucial due to limited system resources and the need for dynamic adaptation to varying network requirements-aimed at joint optimization of transmission power, phase-shift matrix, and MEC offloading and computation delays. Given the problem’s intractability, we develop an alternating optimization-based iterative algorithm incorporating quadratic transformation and successive convex approximation techniques to obtain sub-optimal solutions. Firstly, we address the minimum delay power allocation and task offloading by using quadratic transformations for fractional problems and closed-form solutions. Afterward, we optimize the phase shifts through semidefinite programming and a penalty-based approach. Simulation results validate the effectiveness of the proposed framework, demonstrating significant improvements in SE and EE compared to conventional systems without RIS or with static RIS configurations.
{"title":"Spectral Efficiency and Energy Efficiency Tradeoff in Multiuser RIS-Aided Mobile Edge Computing Networks","authors":"Nazanin Kalantarinejad;Dariush Abbasi-Moghadam;Halim Yanikomeroglu","doi":"10.1109/OJCOMS.2024.3497756","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3497756","url":null,"abstract":"Mobile edge computing (MEC) is emerging as a critical technology for supporting latency-sensitive and computation-intensive services-however, random wireless channel fading limits offloading rates, posing a significant challenge to MEC performance. In MEC systems, effective energy management and high-speed communication links between user devices and MEC servers are essential for supporting services that require low latency and high computation power. Reconfigurable intelligent surfaces (RIS) have been proposed as a promising solution to enhance the quality of communication links between users and MEC servers by dynamically reconfiguring the wireless propagation environment to overcome these challenges. We formulate a trade-off optimization problem to balance SE and EE in RIS-aided MEC systems, which is crucial due to limited system resources and the need for dynamic adaptation to varying network requirements-aimed at joint optimization of transmission power, phase-shift matrix, and MEC offloading and computation delays. Given the problem’s intractability, we develop an alternating optimization-based iterative algorithm incorporating quadratic transformation and successive convex approximation techniques to obtain sub-optimal solutions. Firstly, we address the minimum delay power allocation and task offloading by using quadratic transformations for fractional problems and closed-form solutions. Afterward, we optimize the phase shifts through semidefinite programming and a penalty-based approach. Simulation results validate the effectiveness of the proposed framework, demonstrating significant improvements in SE and EE compared to conventional systems without RIS or with static RIS configurations.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7368-7379"},"PeriodicalIF":6.3,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10752574","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142777757","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}
Unmanned aerial vehicles (UAVs) are getting significant attention from both researchers and the industry due to their wide range of applications. Remote sensing is one such application, in which UAVs are deployed to sense remote areas and transmit the data to a ground station for processing. However, due to the mobility and limited transmission range of UAVs, data transfer requires multiple hops. Nevertheless, the higher the number of hops, the larger the network latency. Thus, there is a need to reduce the number of hops and improve the connectivity. This can be achieved by creating small-world networks (SWNs) that perform better than traditional networks in terms of network evaluation metrics. The SWNs are created by adding shortcuts to the traditional network. In the literature, many theoretical works have been proposed for the creation of SWNs. However, these works add shortcuts randomly into the existing conventional network and fail to account for the costs incurred with the added shortcuts. As a result, these works are ineffective in improving the overall performance of the network. Thus, this work presents a novel reinforcement learning technique that uses a Q-learning algorithm to optimize throughput in delay-critical and energy-aware small-world UAV-assisted wireless networks (SW-UAV-WNs). The proposed algorithm populates the Q-matrix with all possible shortcuts and updates the Q-values based on the reward/penalty. It then adds shortcuts based on descending Q-values until the SW-UAV-WN is established. Through numerical results, we demonstrate that the proposed framework surpasses the conventional SWC approach, canonical particle swarm data delivery method, Low Energy Adaptive Clustering Hierarchy (LEACH), modified LEACH, and conventional shortest path routing method in terms of network latency, lifetime, packet delivery ratio, and throughput. Furthermore, we discuss the effect of different UAV velocities and different heights of the layers in which the UAVs hover on the performance of the proposed approach.
{"title":"Throughput Maximization in Delay-Critical and Energy-Aware SW-UAV-WNs Using Q-Learning","authors":"Sreenivasa Reddy Yeduri;Neha Sharma;Om Jee Pandey;Linga Reddy Cenkeramaddi","doi":"10.1109/OJCOMS.2024.3496740","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3496740","url":null,"abstract":"Unmanned aerial vehicles (UAVs) are getting significant attention from both researchers and the industry due to their wide range of applications. Remote sensing is one such application, in which UAVs are deployed to sense remote areas and transmit the data to a ground station for processing. However, due to the mobility and limited transmission range of UAVs, data transfer requires multiple hops. Nevertheless, the higher the number of hops, the larger the network latency. Thus, there is a need to reduce the number of hops and improve the connectivity. This can be achieved by creating small-world networks (SWNs) that perform better than traditional networks in terms of network evaluation metrics. The SWNs are created by adding shortcuts to the traditional network. In the literature, many theoretical works have been proposed for the creation of SWNs. However, these works add shortcuts randomly into the existing conventional network and fail to account for the costs incurred with the added shortcuts. As a result, these works are ineffective in improving the overall performance of the network. Thus, this work presents a novel reinforcement learning technique that uses a Q-learning algorithm to optimize throughput in delay-critical and energy-aware small-world UAV-assisted wireless networks (SW-UAV-WNs). The proposed algorithm populates the Q-matrix with all possible shortcuts and updates the Q-values based on the reward/penalty. It then adds shortcuts based on descending Q-values until the SW-UAV-WN is established. Through numerical results, we demonstrate that the proposed framework surpasses the conventional SWC approach, canonical particle swarm data delivery method, Low Energy Adaptive Clustering Hierarchy (LEACH), modified LEACH, and conventional shortest path routing method in terms of network latency, lifetime, packet delivery ratio, and throughput. Furthermore, we discuss the effect of different UAV velocities and different heights of the layers in which the UAVs hover on the performance of the proposed approach.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7228-7243"},"PeriodicalIF":6.3,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10750848","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713960","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}
Pub Date : 2024-11-07DOI: 10.1109/OJCOMS.2024.3494548
Garima Thakur;Deepika Gautam;Pankaj Kumar;Ashok Kumar Das;Vivekananda Bhat K.;Joel J. P. C. Rodrigues
The preface of the permeated metaverse together with Web 3.0, has confluenced virtual and physical reality and can revolutionize social networks, healthcare, gaming and the educational system. Unfortunately, this assimilation has divulged ways for physical and virtual-reality-synthesized security threats like avatar impersonation and sybil attacks. Furthermore, the divergence in metaverse platforms and the involvement of central intermediaries prompted the demand for interoperability, security provisions and decentralization. Therefore, this paper projects a blockchain-integrated authentication protocol for a seamless interface in a cross-platform metaverse network with Web 3.0. The proposed mechanisms are structured for user and avatar authentication within cross-platforms while furnishing conditional traceability, an avatar-update phase and a revocation phase. The blockchain network hinges on characteristics of a consortium blockchain and the voting-based Practical Byzantine Fault Tolerance (PBFT) consensus algorithm. The security of the proposed network is displayed by harnessing the Real-or-Random (RoR) oracle model and informal analysis. The operational effectiveness of the suggested system is gauged through an assessment of relevant existing work based on metrics such as communication, bandwidth, and computational costs. The study’s results indicate that the proposed system exhibits better computation and communication overhead compared to other systems, making it well-suited for metaverse applications in Web 3.0.
渗透式元宇宙和 Web 3.0 的出现，将虚拟和物理现实融为一体，并将彻底改变社交网络、医疗保健、游戏和教育系统。不幸的是，这种同化为虚拟现实和物理现实的安全威胁提供了途径，如虚拟化身假冒和假人攻击。此外，元宇宙平台的分化和中央中介机构的介入，促使人们对互操作性、安全规定和去中心化提出了要求。因此，本文提出了一种区块链集成身份验证协议，以实现跨平台元宇宙网络与 Web 3.0 的无缝对接。所提议的机制是在跨平台内对用户和头像进行认证，同时提供条件可追溯性、头像更新阶段和撤销阶段。区块链网络基于联盟区块链的特点和基于投票的实用拜占庭容错（PBFT）共识算法。通过利用真实或随机（RoR）甲骨文模型和非正式分析，展示了所建议网络的安全性。通过对基于通信、带宽和计算成本等指标的现有相关工作进行评估，衡量了所建议系统的运行效果。研究结果表明，与其他系统相比，建议的系统具有更好的计算和通信开销，非常适合 Web 3.0 中的元数据应用。
{"title":"Blockchain-Assisted Cross-Platform Authentication Protocol With Conditional Traceability for Metaverse Environment in Web 3.0","authors":"Garima Thakur;Deepika Gautam;Pankaj Kumar;Ashok Kumar Das;Vivekananda Bhat K.;Joel J. P. C. Rodrigues","doi":"10.1109/OJCOMS.2024.3494548","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3494548","url":null,"abstract":"The preface of the permeated metaverse together with Web 3.0, has confluenced virtual and physical reality and can revolutionize social networks, healthcare, gaming and the educational system. Unfortunately, this assimilation has divulged ways for physical and virtual-reality-synthesized security threats like avatar impersonation and sybil attacks. Furthermore, the divergence in metaverse platforms and the involvement of central intermediaries prompted the demand for interoperability, security provisions and decentralization. Therefore, this paper projects a blockchain-integrated authentication protocol for a seamless interface in a cross-platform metaverse network with Web 3.0. The proposed mechanisms are structured for user and avatar authentication within cross-platforms while furnishing conditional traceability, an avatar-update phase and a revocation phase. The blockchain network hinges on characteristics of a consortium blockchain and the voting-based Practical Byzantine Fault Tolerance (PBFT) consensus algorithm. The security of the proposed network is displayed by harnessing the Real-or-Random (RoR) oracle model and informal analysis. The operational effectiveness of the suggested system is gauged through an assessment of relevant existing work based on metrics such as communication, bandwidth, and computational costs. The study’s results indicate that the proposed system exhibits better computation and communication overhead compared to other systems, making it well-suited for metaverse applications in Web 3.0.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7244-7261"},"PeriodicalIF":6.3,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10747237","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142713957","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}
Pub Date : 2024-11-07DOI: 10.1109/OJCOMS.2024.3494059
Bertrand Le Gal
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 $400~mu $ s. These performances are equivalent to FPGA-based solutions and overclass CPU and GPU related works by factors up to $5times $ .
{"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}
Pub Date : 2024-11-07DOI: 10.1109/OJCOMS.2024.3493417
David Franco;Marivi Higuero;Ane Sanz;Juanjo Unzilla;Maider Huarte
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 $500~mu s$ and a total frame loss rate below 0.005% in all cases, including those with a 35 Gbps load.
{"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}
Pub Date : 2024-11-06DOI: 10.1109/OJCOMS.2024.3492695
Lorenzo Giorgi;Carlo Puliafito;Antonio Virdis;Enzo Mingozzi
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.
边缘计算将计算设施带到用户附近，从而为大量具有严格要求的应用铺平了道路。边缘系统具有高度动态性，客户可能需要在不同时间、不同地点访问边缘服务。在这种情况下，保证服务的无缝连续性至关重要，即让端点透明地相互连接，并且对性能没有影响或影响微乎其微。在这项工作中，我们为边缘环境提出了一种服务连续性解决方案，其核心要素是利用分布式边缘代理生态系统。边缘代理在客户端应用程序和边缘服务之间进行调解，并由系统协调器动态地重新配置，以确保在客户端的代理需要更改时服务的连续性。我们的代理利用 HTTP 替代服务（HTTP 标准的扩展）通知客户端要访问的新代理。我们的方法对应用逻辑完全透明，不需要修改任何非标准协议。我们实施了一个概念验证，并在一个小规模测试平台上对我们的解决方案进行了评估。我们考虑了不同的实验场景和拟议策略的变体，并将其与其他方法（即边缘代理不发生变化的方法和基于 DNS 解析的方法）进行了比较。实验结果表明了所提方法的有效性和优越性能。
{"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}
Pub Date : 2024-11-05DOI: 10.1109/OJCOMS.2024.3491947
Orangel Azuaje;Ana Aguiar
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.
{"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}
Pub Date : 2024-11-05DOI: 10.1109/OJCOMS.2024.3492093
Gal Ben-Itzhak;Miguel Saavedra-Melo;Benjamin Bradshaw;Ender Ayanoglu;Filippo Capolino;A. Lee Swindlehurst
A Reconfigurable Intelligent Surface (RIS) consists of many small reflective elements whose reflection properties can be adjusted to change the wireless propagation environment. Envisioned implementations require that each RIS element be connected to a controller, and as the number of RIS elements on a surface may be on the order of hundreds or more, the number of required electrical connectors creates a difficult wiring problem. A potential solution to this problem was previously proposed by the authors in which “biasing transmission lines” carrying standing waves are sampled at each RIS location to produce the desired bias voltage for each RIS element. This paper presents models for the RIS elements that account for mutual coupling and realistic varactor characteristics, as well as circuit models for sampling the transmission line to generate the RIS control signals. The paper investigates two techniques for conversion of the transmission line standing wave voltage to the varactor bias voltage, namely an envelope detector and a sample-and-hold circuit. The paper also develops a modal decomposition approach for generating standing waves that are able to generate beams and nulls in the resulting RIS radiation pattern that maximize either the Signal-to-Noise Ratio (SNR) or the Signal-to-Leakage-plus-Noise Ratio (SLNR). The paper provides five algorithms, two for the case of the envelope detector, one for the sample-and-hold circuit, one for pursuing the global minimum for both circuits, and one for simultaneous beam and null steering. Extensive simulation results show that while the envelope detector is simpler to implement, the sample-and-hold circuit has substantially better performance and runs in substantially less time. In addition, the wave-controlled RIS is able to generate strong beams and deep nulls in desired directions. This is in contrast with the case of arbitrary control of each varactor element and idealized RIS models.
{"title":"Design and Operation Principles of a Wave-Controlled Reconfigurable Intelligent Surface","authors":"Gal Ben-Itzhak;Miguel Saavedra-Melo;Benjamin Bradshaw;Ender Ayanoglu;Filippo Capolino;A. Lee Swindlehurst","doi":"10.1109/OJCOMS.2024.3492093","DOIUrl":"https://doi.org/10.1109/OJCOMS.2024.3492093","url":null,"abstract":"A Reconfigurable Intelligent Surface (RIS) consists of many small reflective elements whose reflection properties can be adjusted to change the wireless propagation environment. Envisioned implementations require that each RIS element be connected to a controller, and as the number of RIS elements on a surface may be on the order of hundreds or more, the number of required electrical connectors creates a difficult wiring problem. A potential solution to this problem was previously proposed by the authors in which “biasing transmission lines” carrying standing waves are sampled at each RIS location to produce the desired bias voltage for each RIS element. This paper presents models for the RIS elements that account for mutual coupling and realistic varactor characteristics, as well as circuit models for sampling the transmission line to generate the RIS control signals. The paper investigates two techniques for conversion of the transmission line standing wave voltage to the varactor bias voltage, namely an envelope detector and a sample-and-hold circuit. The paper also develops a modal decomposition approach for generating standing waves that are able to generate beams and nulls in the resulting RIS radiation pattern that maximize either the Signal-to-Noise Ratio (SNR) or the Signal-to-Leakage-plus-Noise Ratio (SLNR). The paper provides five algorithms, two for the case of the envelope detector, one for the sample-and-hold circuit, one for pursuing the global minimum for both circuits, and one for simultaneous beam and null steering. Extensive simulation results show that while the envelope detector is simpler to implement, the sample-and-hold circuit has substantially better performance and runs in substantially less time. In addition, the wave-controlled RIS is able to generate strong beams and deep nulls in desired directions. This is in contrast with the case of arbitrary control of each varactor element and idealized RIS models.","PeriodicalId":33803,"journal":{"name":"IEEE Open Journal of the Communications Society","volume":"5 ","pages":"7730-7751"},"PeriodicalIF":6.3,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10742896","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859242","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}
Pub Date : 2024-11-05DOI: 10.1109/OJCOMS.2024.3491354
Son Dinh-van;Hien Quoc Ngo;Simon L. Cotton;Yuen Kwan Mo;Matthew D. Higgins
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.
{"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}
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：