Pub Date : 2024-03-31DOI: 10.1109/JSYST.2024.3402156
Ahmed M. Jasim;Hamed Al-Raweshidy
Edge/fog computing has gained significant popularity as a computing paradigm that facilitates real-time applications, especially in healthcare systems. However, deploying these systems in real-world healthcare scenarios presents technical challenges, among which load balancing is a key concern. Load balancing aims to distribute workloads evenly across multiple nodes in a network to optimize processing and communication efficiency. This article proposes an adaptive load-balancing method that combines the strengths of static and software-defined networking (SDN)-based load balancing algorithms for edge/fog-based healthcare systems. A new algorithm called load balancing of optimal edge-server placement (LB-OESP) is proposed to balance the workload statically in the systems, followed by the presentation of an SDN-based greedy heuristic (SDN-GH) algorithm to manage the data flow dynamically within the network. The LB-OESP algorithm effectively balances workloads while minimizing the number of edge servers required, thereby improving system performance and saving costs. The SDN-GH algorithm leverages the benefits of SDN to dynamically balance the load and provide a more efficient system. Simulation results demonstrate that the proposed method provides an adaptive load-balancing solution that takes into consideration changing network conditions and ensures improved system performance and reliability. Furthermore, the proposed method offers a 12% reduction in system latency and up to 28% lower deployment costs compared to the previous studies. The proposed method is a promising solution for edge/fog-based healthcare systems, providing an efficient and cost-effective approach to managing workloads.
边缘/雾计算作为一种可促进实时应用的计算范例，特别是在医疗保健系统中，已经获得了极大的普及。然而，在现实世界的医疗保健场景中部署这些系统面临着技术挑战，其中负载平衡是一个关键问题。负载平衡的目的是将工作负载平均分配到网络中的多个节点上，以优化处理和通信效率。本文提出了一种自适应负载平衡方法，它结合了静态和基于软件定义网络（SDN）的负载平衡算法的优势，适用于基于边缘/雾的医疗系统。我们提出了一种名为 "最佳边缘服务器位置负载平衡（LB-OESP）"的新算法，用于静态平衡系统中的工作负载，随后又提出了一种基于 SDN 的贪婪启发式（SDN-GH）算法，用于动态管理网络中的数据流。LB-OESP 算法能有效平衡工作负载，同时最大限度地减少所需的边缘服务器数量，从而提高系统性能并节约成本。SDN-GH 算法利用 SDN 的优势动态平衡负载，提供更高效的系统。仿真结果表明，所提出的方法提供了一种自适应负载平衡解决方案，能考虑到不断变化的网络条件，确保提高系统性能和可靠性。此外，与之前的研究相比，所提出的方法可将系统延迟降低 12%，部署成本最多可降低 28%。所提出的方法为基于边缘/雾的医疗保健系统提供了一种高效、经济的工作负载管理方法，是一种很有前途的解决方案。
{"title":"An Adaptive SDN-Based Load Balancing Method for Edge/Fog-Based Real-Time Healthcare Systems","authors":"Ahmed M. Jasim;Hamed Al-Raweshidy","doi":"10.1109/JSYST.2024.3402156","DOIUrl":"10.1109/JSYST.2024.3402156","url":null,"abstract":"Edge/fog computing has gained significant popularity as a computing paradigm that facilitates real-time applications, especially in healthcare systems. However, deploying these systems in real-world healthcare scenarios presents technical challenges, among which load balancing is a key concern. Load balancing aims to distribute workloads evenly across multiple nodes in a network to optimize processing and communication efficiency. This article proposes an adaptive load-balancing method that combines the strengths of static and software-defined networking (SDN)-based load balancing algorithms for edge/fog-based healthcare systems. A new algorithm called load balancing of optimal edge-server placement (LB-OESP) is proposed to balance the workload statically in the systems, followed by the presentation of an SDN-based greedy heuristic (SDN-GH) algorithm to manage the data flow dynamically within the network. The LB-OESP algorithm effectively balances workloads while minimizing the number of edge servers required, thereby improving system performance and saving costs. The SDN-GH algorithm leverages the benefits of SDN to dynamically balance the load and provide a more efficient system. Simulation results demonstrate that the proposed method provides an adaptive load-balancing solution that takes into consideration changing network conditions and ensures improved system performance and reliability. Furthermore, the proposed method offers a 12% reduction in system latency and up to 28% lower deployment costs compared to the previous studies. The proposed method is a promising solution for edge/fog-based healthcare systems, providing an efficient and cost-effective approach to managing workloads.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1139-1150"},"PeriodicalIF":4.0,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10543196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190754","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}
Pub Date : 2024-03-30DOI: 10.1109/JSYST.2024.3402664
Baogang Li;Lu Chen;Zhi Yang;Hongyin Xiang
The time-sensitive networking (TSN) working group standardizes time-aware shapes (TAS) to reduce network latency, but the traditional TAS standard lacks adaptability and cannot perform well in dynamically changing environments. The continuously developing artificial intelligence techniques can be combined with TSN to better adapt the dynamically changing environments. Therefore, we utilize deep reinforcement learning (DRL) algorithms to dynamically configure the network to improve its adaptability. Meanwhile, we propose the queuing transmission method in TAS by incorporating transmission windows for different types of traffic, to make resource allocation simpler and more efficient. However, DRL algorithms usually take a lot of time to train, which is contrary to the delay sensitivity of TAS. Hence, we propose an improved DRL algorithm, called preDQN, where the network prediction is used to help the agent explore the environment more efficiently. Experimental validation is carried out in a simulation environment, and the experimental results show that the scheme can significantly improve the resource utilization, reduce the end-to-end delay and packet loss rate.
时间敏感网络（TSN）工作组将时间感知形状（TAS）标准化，以减少网络延迟，但传统的 TAS 标准缺乏适应性，无法在动态变化的环境中发挥良好作用。不断发展的人工智能技术可以与 TSN 相结合，从而更好地适应动态变化的环境。因此，我们利用深度强化学习（DRL）算法对网络进行动态配置，以提高其适应性。同时，我们在 TAS 中提出了队列传输方法，为不同类型的流量加入传输窗口，使资源分配更简单、更高效。然而，DRL 算法通常需要大量时间来训练，这与 TAS 的延迟敏感性相悖。因此，我们提出了一种改进的 DRL 算法，称为 preDQN，其中网络预测用于帮助代理更有效地探索环境。我们在仿真环境中进行了实验验证，实验结果表明，该方案能显著提高资源利用率，降低端到端延迟和丢包率。
{"title":"preDQN-Based TAS Traffic Scheduling in Intelligence Endogenous Networks","authors":"Baogang Li;Lu Chen;Zhi Yang;Hongyin Xiang","doi":"10.1109/JSYST.2024.3402664","DOIUrl":"10.1109/JSYST.2024.3402664","url":null,"abstract":"The time-sensitive networking (TSN) working group standardizes time-aware shapes (TAS) to reduce network latency, but the traditional TAS standard lacks adaptability and cannot perform well in dynamically changing environments. The continuously developing artificial intelligence techniques can be combined with TSN to better adapt the dynamically changing environments. Therefore, we utilize deep reinforcement learning (DRL) algorithms to dynamically configure the network to improve its adaptability. Meanwhile, we propose the queuing transmission method in TAS by incorporating transmission windows for different types of traffic, to make resource allocation simpler and more efficient. However, DRL algorithms usually take a lot of time to train, which is contrary to the delay sensitivity of TAS. Hence, we propose an improved DRL algorithm, called preDQN, where the network prediction is used to help the agent explore the environment more efficiently. Experimental validation is carried out in a simulation environment, and the experimental results show that the scheme can significantly improve the resource utilization, reduce the end-to-end delay and packet loss rate.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"997-1008"},"PeriodicalIF":4.0,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-29DOI: 10.1109/JSYST.2024.3401148
Yuyang Du;Liang Hao;Yiming Lei;Qun Yang;Shiqi Xu
Signal clipping is a well-established method employed in orthogonal frequency division multiplexing (OFDM) systems to mitigate peak-to-average power ratio. The utilization of this technique is widespread in electronic devices with limited power or resource capabilities due to its high efficiency and low complexity. While clipping effectively diminishes nonlinear distortion stemming from power amplifiers (PAs), it introduces additional distortion known as clipping distortion. The optimization of system performance, considering both clipping distortions and the nonlinearity of PAs, remains an unresolved challenge due to the intricate modeling of PAs. In this article, we undertake an analysis of PA nonlinearity utilizing the Bessel–Fourier PA model and simplify its power expression through intermodulation product analysis. We mathematically derive expressions for the receiver signal-to-noise ratio and system symbol error rate (SER) for nonlinear clipped OFDM systems. Using these derivations, we explore the optimal system configuration required to achieve the lower bound of SER in practical OFDM systems, taking into account both PA nonlinearity and clipping distortion. The results and methodologies presented in this article contribute to an improved comprehension of system-level optimization in nonlinear OFDM systems employing clipping technology.
{"title":"Nonlinear Multicarrier Transmitter System With Signal Clipping: Measurement, Analysis, and Optimization","authors":"Yuyang Du;Liang Hao;Yiming Lei;Qun Yang;Shiqi Xu","doi":"10.1109/JSYST.2024.3401148","DOIUrl":"10.1109/JSYST.2024.3401148","url":null,"abstract":"Signal clipping is a well-established method employed in orthogonal frequency division multiplexing (OFDM) systems to mitigate peak-to-average power ratio. The utilization of this technique is widespread in electronic devices with limited power or resource capabilities due to its high efficiency and low complexity. While clipping effectively diminishes nonlinear distortion stemming from power amplifiers (PAs), it introduces additional distortion known as clipping distortion. The optimization of system performance, considering both clipping distortions and the nonlinearity of PAs, remains an unresolved challenge due to the intricate modeling of PAs. In this article, we undertake an analysis of PA nonlinearity utilizing the Bessel–Fourier PA model and simplify its power expression through intermodulation product analysis. We mathematically derive expressions for the receiver signal-to-noise ratio and system symbol error rate (SER) for nonlinear clipped OFDM systems. Using these derivations, we explore the optimal system configuration required to achieve the lower bound of SER in practical OFDM systems, taking into account both PA nonlinearity and clipping distortion. The results and methodologies presented in this article contribute to an improved comprehension of system-level optimization in nonlinear OFDM systems employing clipping technology.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1426-1435"},"PeriodicalIF":4.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141198098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article deals with the asynchronous event-triggered passive consensus issue for two-time-scale semi-Markov jump multiagent systems in continuous-time domain against denial-of-service (DoS) attacks. The multiagent systems are modeled with two-time-scale structures and the parameter changes are assumed to follow semi-Markov jump processes. For multiagent systems with two-time-scale structures, singular perturbed approaches are introduced to separate the coupled slow and fast dynamics of each agent. Then, double-rate sampling mechanisms are adopted for slow and fast dynamics with different evolution rates, and a novel asynchronous event-triggered scheme (AETS) with two independent triggering conditions is proposed. The asynchronous event-triggered scheme based on double-rate sampled-data reduces the transmission of unnecessary data and saves limited bandwidth resources by triggering independently on two time-scales. In addition, a consensus strategy is proposed to assure the multiagent system of achieving consensus with a specified passive performance level. Finally, the simulation example verifies that the asynchronous event-triggered scheme saves about 50% of network resources than the synchronous scheme under the premise of the same control effect.
{"title":"Asynchronous Event-Triggered Passive Consensus of Semi-Markov Jump Multiagent Systems With Two-Time-Scale Feature Under DoS Attacks","authors":"Guanzheng Zhang;Ya-Nan Wang;Feng Li;Jing Wang;Hao Shen","doi":"10.1109/JSYST.2024.3400963","DOIUrl":"10.1109/JSYST.2024.3400963","url":null,"abstract":"This article deals with the asynchronous event-triggered passive consensus issue for two-time-scale semi-Markov jump multiagent systems in continuous-time domain against denial-of-service (DoS) attacks. The multiagent systems are modeled with two-time-scale structures and the parameter changes are assumed to follow semi-Markov jump processes. For multiagent systems with two-time-scale structures, singular perturbed approaches are introduced to separate the coupled slow and fast dynamics of each agent. Then, double-rate sampling mechanisms are adopted for slow and fast dynamics with different evolution rates, and a novel asynchronous event-triggered scheme (AETS) with two independent triggering conditions is proposed. The asynchronous event-triggered scheme based on double-rate sampled-data reduces the transmission of unnecessary data and saves limited bandwidth resources by triggering independently on two time-scales. In addition, a consensus strategy is proposed to assure the multiagent system of achieving consensus with a specified passive performance level. Finally, the simulation example verifies that the asynchronous event-triggered scheme saves about 50% of network resources than the synchronous scheme under the premise of the same control effect.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1277-1287"},"PeriodicalIF":4.0,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141190829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article presents reconfigurable intelligent surface (RIS)-aided deep learning (DL)-based spectrum sensing for next-generation cognitive radios (CRs). To that end, the secondary user (SU) monitors the primary transmitter (PT) signal, where the RIS plays a pivotal role in increasing the strength of the PT signal at the SU. The spectrograms of the synthesized dataset, including the fourth-generation long-term evolution and fifth-generation new radio signals, are mapped to images utilized for training the state-of-the-art object detection approaches, namely, Detectron2 and YOLOv7. By conducting extensive experiments using a real RIS prototype, we demonstrate that the RIS can consistently and significantly improve the performance of the DL detectors to identify the PT signal type along with its time and frequency utilization. This study also paves the way for optimizing spectrum utilization through RIS-assisted CR application in next-generation wireless communication systems.
{"title":"Practical Implementation of RIS-Aided Spectrum Sensing: A Deep-Learning-Based Solution","authors":"Sefa Kayraklik;Ibrahim Yildirim;Ertugrul Basar;Ibrahim Hokelek;Ali Gorcin","doi":"10.1109/JSYST.2024.3376986","DOIUrl":"10.1109/JSYST.2024.3376986","url":null,"abstract":"This article presents reconfigurable intelligent surface (RIS)-aided deep learning (DL)-based spectrum sensing for next-generation cognitive radios (CRs). To that end, the secondary user (SU) monitors the primary transmitter (PT) signal, where the RIS plays a pivotal role in increasing the strength of the PT signal at the SU. The spectrograms of the synthesized dataset, including the fourth-generation long-term evolution and fifth-generation new radio signals, are mapped to images utilized for training the state-of-the-art object detection approaches, namely, Detectron2 and YOLOv7. By conducting extensive experiments using a real RIS prototype, we demonstrate that the RIS can consistently and significantly improve the performance of the DL detectors to identify the PT signal type along with its time and frequency utilization. This study also paves the way for optimizing spectrum utilization through RIS-assisted CR application in next-generation wireless communication systems.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1481-1488"},"PeriodicalIF":4.0,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140315228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, the high expansion of independent energy sources and development of multiagent structures have resulted in new challenges in the efficient power management of distribution networks. In this regard, decentralized management along considering operational concerns of the system will be a key factor in running the future multiagent systems. Therefore, this article proposes a decentralized framework based on the alternating direction method of multipliers for managing the peer-to-peer (P2P) energy trading in a multiagent distribution system while considering the technical constraints and reliability of the network. This strategy facilitates considering the effects of the network reliability while running the agents’ optimization in a decentralized manner. Respectively, each agent would tend to exchange energy with more reliable agents, which would result in the resilient operation of the network. Moreover, the uncertainty of renewable energy sources is addressed using distributionally robust optimization. Additionally, with the aim of increasing the security of the P2P energy market against communication errors and agents’ misbehavior, an algorithm is developed to identify the existence of a problem in the market convergence as well as how it could be mitigated. Finally, this scheme is investigated on 37 and 69 bus test systems to study its capability in running sustainable energy systems.
{"title":"Decentralized Energy Management of Multiagent Distribution Systems Considering the Grid Reliability and Agent Misbehavior","authors":"Farshid Aghamohammadi;Ali Abbaspour;Hossein Saber;Sajjad Fattaheian-Dehkordi;Matti Lehtonen","doi":"10.1109/JSYST.2024.3369871","DOIUrl":"10.1109/JSYST.2024.3369871","url":null,"abstract":"In recent years, the high expansion of independent energy sources and development of multiagent structures have resulted in new challenges in the efficient power management of distribution networks. In this regard, decentralized management along considering operational concerns of the system will be a key factor in running the future multiagent systems. Therefore, this article proposes a decentralized framework based on the alternating direction method of multipliers for managing the peer-to-peer (P2P) energy trading in a multiagent distribution system while considering the technical constraints and reliability of the network. This strategy facilitates considering the effects of the network reliability while running the agents’ optimization in a decentralized manner. Respectively, each agent would tend to exchange energy with more reliable agents, which would result in the resilient operation of the network. Moreover, the uncertainty of renewable energy sources is addressed using distributionally robust optimization. Additionally, with the aim of increasing the security of the P2P energy market against communication errors and agents’ misbehavior, an algorithm is developed to identify the existence of a problem in the market convergence as well as how it could be mitigated. Finally, this scheme is investigated on 37 and 69 bus test systems to study its capability in running sustainable energy systems.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"905-916"},"PeriodicalIF":4.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10478176","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140198348","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}
Pub Date : 2024-03-22DOI: 10.1109/JSYST.2024.3399761
Yiguang Wang;Peng Shi;Xiaojie Li
In this article, the event-triggered observation-based tracking control issue of nonlinear mixed-order multiagent systems (MASs) under the actuator saturation is investigated. The studied mixed-order MASs include heterogeneous agents which have nonidentical orders of dynamics and different quantities and types of states to be synchronized. To relieve the communication load and decrease the tear and wear due to the frequent regulation of actuators, a distributed cooperative tracking control strategy utilizing the event-triggered mechanism is proposed to realize the final synchronization for all nonlinear mixed-order followers. In addition, the distributed disturbance observer is developed for the heterogeneous followers to lower the impact of unknown dynamics and external disturbances. And, the actuator saturation problem is considered to ensure the wider applicability of the presented control strategy in actual applications. The stability of the controlled mixed-order MASs is proved by Lyapunov theory for ensuring the synchronization of all states under the proposed event-triggered observation-based cooperative control strategy. Finally, the example of unmanned aerial vehicle is utilized to verify the effectiveness of the consensus cooperative control strategy.
本文研究了致动器饱和状态下非线性混合阶多代理系统（MAS）基于事件触发观测的跟踪控制问题。所研究的混序多代理系统包括异构代理，这些代理具有非相同的动力学阶数，需要同步的状态数量和类型也各不相同。为了减轻通信负荷，减少频繁调节执行器造成的磨损，提出了一种利用事件触发机制的分布式协同跟踪控制策略，以实现所有非线性混合阶跟随器的最终同步。此外，还为异构跟随器开发了分布式干扰观测器，以降低未知动态和外部干扰的影响。此外，还考虑了执行器饱和问题，以确保所提出的控制策略在实际应用中具有更广泛的适用性。利用李雅普诺夫理论证明了受控混合阶 MAS 的稳定性，以确保在所提出的基于事件触发观测的协同控制策略下所有状态的同步。最后，以无人驾驶飞行器为例，验证了共识合作控制策略的有效性。
{"title":"Event-Triggered Observation-Based Control of Nonlinear Mixed-Order Multiagent Systems Under Input Saturation","authors":"Yiguang Wang;Peng Shi;Xiaojie Li","doi":"10.1109/JSYST.2024.3399761","DOIUrl":"10.1109/JSYST.2024.3399761","url":null,"abstract":"In this article, the event-triggered observation-based tracking control issue of nonlinear mixed-order multiagent systems (MASs) under the actuator saturation is investigated. The studied mixed-order MASs include heterogeneous agents which have nonidentical orders of dynamics and different quantities and types of states to be synchronized. To relieve the communication load and decrease the tear and wear due to the frequent regulation of actuators, a distributed cooperative tracking control strategy utilizing the event-triggered mechanism is proposed to realize the final synchronization for all nonlinear mixed-order followers. In addition, the distributed disturbance observer is developed for the heterogeneous followers to lower the impact of unknown dynamics and external disturbances. And, the actuator saturation problem is considered to ensure the wider applicability of the presented control strategy in actual applications. The stability of the controlled mixed-order MASs is proved by Lyapunov theory for ensuring the synchronization of all states under the proposed event-triggered observation-based cooperative control strategy. Finally, the example of unmanned aerial vehicle is utilized to verify the effectiveness of the consensus cooperative control strategy.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1392-1401"},"PeriodicalIF":4.0,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-21DOI: 10.1109/JSYST.2024.3374761
Jie Chen;Changlei Zhan;Ke Xu;Rongpei Zhou
Vertex cover (VC) problem is an important combinatorial optimization problem that has a wide range of applications. In this article, we investigate the existing works on solving the VC problem from game theoretic perspective; these works treated each vertex of a network as a completely rational player. In contrast, we consider the impact of player's subjective behavior, that is, each player is not necessarily completely rational. First, we establish a game model under the expected utility theory (EUT) and the framing effect (FE) of the prospect theory. Second, we analyze the relationship between VC and game model under the EUT and the FE. Third, we propose a relaxed greedy behavioral algorithm, and prove that our proposed algorithm can guarantee that the strategies of all vertices converge to a strict Nash equilibrium under the EUT and the FE. Finally, the simulation results not only evaluate the influence of FE on the overall cover level of networks but also demonstrate the effectiveness and superiority of our proposed algorithm compared with the existing bounded rationality algorithm on representative networks and standard benchmark.
顶点覆盖（VC）问题是一个重要的组合优化问题，有着广泛的应用。在本文中，我们从博弈论的角度研究了解决顶点覆盖（VC）问题的现有工作；这些工作将网络中的每个顶点视为完全理性的玩家。相比之下，我们考虑了玩家主观行为的影响，即每个玩家不一定是完全理性的。首先，我们建立了预期效用理论（EUT）和前景理论框架效应（FE）下的博弈模型。其次，我们分析了 EUT 和 FE 下的 VC 与博弈模型之间的关系。第三，我们提出了一种宽松的贪婪行为算法，并证明了我们提出的算法可以保证所有顶点的策略都收敛到 EUT 和 FE 下的严格纳什均衡。最后，仿真结果不仅评估了 FE 对网络整体覆盖水平的影响，还在代表性网络和标准基准上证明了我们提出的算法与现有有界理性算法相比的有效性和优越性。
{"title":"Framing Effect in Vertex Cover of Networks Under Prospect Theory","authors":"Jie Chen;Changlei Zhan;Ke Xu;Rongpei Zhou","doi":"10.1109/JSYST.2024.3374761","DOIUrl":"10.1109/JSYST.2024.3374761","url":null,"abstract":"Vertex cover (VC) problem is an important combinatorial optimization problem that has a wide range of applications. In this article, we investigate the existing works on solving the VC problem from game theoretic perspective; these works treated each vertex of a network as a completely rational player. In contrast, we consider the impact of player's subjective behavior, that is, each player is not necessarily completely rational. First, we establish a game model under the expected utility theory (EUT) and the framing effect (FE) of the prospect theory. Second, we analyze the relationship between VC and game model under the EUT and the FE. Third, we propose a relaxed greedy behavioral algorithm, and prove that our proposed algorithm can guarantee that the strategies of all vertices converge to a strict Nash equilibrium under the EUT and the FE. Finally, the simulation results not only evaluate the influence of FE on the overall cover level of networks but also demonstrate the effectiveness and superiority of our proposed algorithm compared with the existing bounded rationality algorithm on representative networks and standard benchmark.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1092-1103"},"PeriodicalIF":4.0,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140205620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The demand for various types of services is growing rapidly with the development of beyond 5G/6G networks, network slicing (NS) is considered as an effective technology to cope with the multiple services and large traffic demand. In this article, a NS resource allocation optimization algorithm based on multiactor-attention-critic (MAAC) joint with bidding is proposed to guarantee the service satisfaction rate (SSR) while increasing the profit of mobile virtual network operator (MVNO) in heterogeneous integrated networks. First, a pricing and bidding strategies are designed for users with different service requirements and service indexes, and the resource allocation is modeled to maximize the sum of utility of all MVNO subjected to MVNO's pricing and bandwidth constraints accordingly. Second, the optimization problem is analyzed based on the augment Lagrange method, relaxed and has been proved as a convex optimization, and then, the alternating direction multiplier method is adopted to obtain the theoretical upper bound with 32.047 of the network utility. Meanwhile, the gradient descent method with different learning rates is used to accelerate the convergence rate. Third, the MAAC-based algorithm is proposed and the resource allocation procedures are transformed into a partially observable Markov decision process, in which the interactions with multiagent environment are performed accurately. Finally, the simulation results indicate that the network utility of the proposed algorithm can be improved by 25.074% while ensuring the users' SSR. Compared with multiagent deep determination strategy gradient and dueling deep Q network, the network utility by the proposed algorithm can be improved by 6.265% and 39.791%, respectively, up to 27.664, which can be closest to the theoretical upper bound at the greatest extent.
{"title":"Network Slicing Resource Allocation Optimization Based on Multiactor-Attention-Critic Joint With Bidding in Heterogeneous Integrated Network","authors":"Geng Chen;Xu Zhang;Shuhu Qi;Qingtian Zeng;Yu-Dong Zhang","doi":"10.1109/JSYST.2024.3397829","DOIUrl":"10.1109/JSYST.2024.3397829","url":null,"abstract":"The demand for various types of services is growing rapidly with the development of beyond 5G/6G networks, network slicing (NS) is considered as an effective technology to cope with the multiple services and large traffic demand. In this article, a NS resource allocation optimization algorithm based on multiactor-attention-critic (MAAC) joint with bidding is proposed to guarantee the service satisfaction rate (SSR) while increasing the profit of mobile virtual network operator (MVNO) in heterogeneous integrated networks. First, a pricing and bidding strategies are designed for users with different service requirements and service indexes, and the resource allocation is modeled to maximize the sum of utility of all MVNO subjected to MVNO's pricing and bandwidth constraints accordingly. Second, the optimization problem is analyzed based on the augment Lagrange method, relaxed and has been proved as a convex optimization, and then, the alternating direction multiplier method is adopted to obtain the theoretical upper bound with 32.047 of the network utility. Meanwhile, the gradient descent method with different learning rates is used to accelerate the convergence rate. Third, the MAAC-based algorithm is proposed and the resource allocation procedures are transformed into a partially observable Markov decision process, in which the interactions with multiagent environment are performed accurately. Finally, the simulation results indicate that the network utility of the proposed algorithm can be improved by 25.074% while ensuring the users' SSR. Compared with multiagent deep determination strategy gradient and dueling deep Q network, the network utility by the proposed algorithm can be improved by 6.265% and 39.791%, respectively, up to 27.664, which can be closest to the theoretical upper bound at the greatest extent.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1186-1197"},"PeriodicalIF":4.0,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141147295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-20DOI: 10.1109/JSYST.2024.3399002
Jin-Yuan Wang;Pan Feng;Li-Hua Hong;Hao-Nan Yang;Na Liu
This article considers an unmanned aerial vehicle-based hybrid dual-hop free-space optical (FSO)/underwater optical wireless communication (UOWC) system with a decode-and-forward relay, where the FSO channel is influenced by atmospheric loss, turbulence, pointing error, and angle-of-arrival fluctuation, and the UOWC channel is affected by oceanic path loss, turbulence, and pointing error. Using direct detection and heterodyne detection, we obtain tractable analytical expressions of the outage probability (OP) and bit error rate (BER), respectively. We then derive asymptotic bounds of the OP and BER to reveal more insights into the effects of various parameters. As an extension, we also analyze the system performance over a more general channel model. After that, we consider a serial multirelay-based hybrid FSO/UOWC system, and jointly optimize the relay number and the relay distance vector to obtain a tradeoff between system cost and OP performance. Numerical results are provided to validate the accuracy of the derivations and the superiority of the proposed optimization scheme. We also discuss the influences of various parameters on system performance.
本文研究了一种基于无人机的混合双跳自由空间光（FSO）/水下光无线通信（UOWC）系统，该系统采用解码前向中继，其中 FSO 信道受大气损耗、湍流、指向误差和到达角波动的影响，UOWC 信道受海洋路径损耗、湍流和指向误差的影响。通过直接检测和外差检测，我们分别得到了中断概率（OP）和误码率（BER）的可控分析表达式。然后，我们推导出 OP 和 BER 的渐近限值，以揭示各种参数的影响。作为扩展，我们还分析了更一般信道模型下的系统性能。之后，我们考虑了基于串行多中继的 FSO/UOWC 混合系统，并联合优化了中继数和中继距离向量，以在系统成本和 OP 性能之间取得平衡。我们提供了数值结果，以验证推导的准确性和所提优化方案的优越性。我们还讨论了各种参数对系统性能的影响。
{"title":"Performance Evaluation and Optimization of UAV-Based Hybrid Dual-Hop FSO/UOWC Systems","authors":"Jin-Yuan Wang;Pan Feng;Li-Hua Hong;Hao-Nan Yang;Na Liu","doi":"10.1109/JSYST.2024.3399002","DOIUrl":"10.1109/JSYST.2024.3399002","url":null,"abstract":"This article considers an unmanned aerial vehicle-based hybrid dual-hop free-space optical (FSO)/underwater optical wireless communication (UOWC) system with a decode-and-forward relay, where the FSO channel is influenced by atmospheric loss, turbulence, pointing error, and angle-of-arrival fluctuation, and the UOWC channel is affected by oceanic path loss, turbulence, and pointing error. Using direct detection and heterodyne detection, we obtain tractable analytical expressions of the outage probability (OP) and bit error rate (BER), respectively. We then derive asymptotic bounds of the OP and BER to reveal more insights into the effects of various parameters. As an extension, we also analyze the system performance over a more general channel model. After that, we consider a serial multirelay-based hybrid FSO/UOWC system, and jointly optimize the relay number and the relay distance vector to obtain a tradeoff between system cost and OP performance. Numerical results are provided to validate the accuracy of the derivations and the superiority of the proposed optimization scheme. We also discuss the influences of various parameters on system performance.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1020-1031"},"PeriodicalIF":4.0,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141147298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：