Cellular networks are often modeled using game theory, with base stations as players contending for a shared resource (the radio channel). Alternatively, if base stations are considered as nodes joined by edges (which represent significant interference), we obtain a graph structure. A game represented in this way is called a graphical game. We explore this representation by decomposing the network graph through tree decomposition and apply dynamic programming to find the optimum welfare, i.e., a resource allocation strategy profile most effective from the point of view of the overall network performance. We verify our approach through simulations and discuss the possibility of implementing this solution in a distributed manner.
{"title":"Using Dynamic Programming to Optimize Cellular Networks Modeled as Graphical Games","authors":"Artur Poplawski, S. Szott","doi":"10.36244/icj.2022.4.9","DOIUrl":"https://doi.org/10.36244/icj.2022.4.9","url":null,"abstract":"Cellular networks are often modeled using game theory, with base stations as players contending for a shared resource (the radio channel). Alternatively, if base stations are considered as nodes joined by edges (which represent significant interference), we obtain a graph structure. A game represented in this way is called a graphical game. We explore this representation by decomposing the network graph through tree decomposition and apply dynamic programming to find the optimum welfare, i.e., a resource allocation strategy profile most effective from the point of view of the overall network performance. We verify our approach through simulations and discuss the possibility of implementing this solution in a distributed manner.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"489 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86783125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Covid 19 has dramatically changed people’s lives around the world. It has shut down schools, companies and workplaces, forcing individuals to stay at home and comply to quarantine orders. Thus, individuals have resorted to the Internet as a means for communicating and sharing information in different domains. Unfortunately, some communities are still unserved by commercial service providers. Mobile Adhoc Network (MANET) can be used to fill this gap. One of the core issues in MANET is the authentication of the participating nodes. This mechanism is a fundamental requirement for implementing access control to network resources by confirming a user’s identity. In recent years, security experts worldwide proposed distributed authentication for MANET due to the lack of a central authority to register and authenticate nodes. In this article, decentralized authentication based on the technology of fog computing and the concept of the blockchain is proposed. The evaluation of this mechanism satisfies the diverse security requirements and strongly protects the networks from attacks.
{"title":"Decentralized Authentication Mechanism for Mobile Ad hoc Networks","authors":"Hafida Khalfaoui, A. Farchane, Said Saf","doi":"10.36244/icj.2022.3.4","DOIUrl":"https://doi.org/10.36244/icj.2022.3.4","url":null,"abstract":"Covid 19 has dramatically changed people’s lives around the world. It has shut down schools, companies and workplaces, forcing individuals to stay at home and comply to quarantine orders. Thus, individuals have resorted to the Internet as a means for communicating and sharing information in different domains. Unfortunately, some communities are still unserved by commercial service providers. Mobile Adhoc Network (MANET) can be used to fill this gap. One of the core issues in MANET is the authentication of the participating nodes. This mechanism is a fundamental requirement for implementing access control to network resources by confirming a user’s identity. In recent years, security experts worldwide proposed distributed authentication for MANET due to the lack of a central authority to register and authenticate nodes. In this article, decentralized authentication based on the technology of fog computing and the concept of the blockchain is proposed. The evaluation of this mechanism satisfies the diverse security requirements and strongly protects the networks from attacks.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"12 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90018107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ákos Leiter, Mohamad Saleh Salah, L. Pap, L. Bokor
Software-Defined Networking (SDN) has changed the network landscape. Meanwhile, IP-based mobility management still evolves, and SDN affects it dramatically. Integrating Proxy Mobile IPv6 (PMIPv6) – a network-based mobility management protocol – with the SDN paradigm has created several promising approaches. This paper will present an extensive survey on the joint research area of PMIPv6 and SDN mobility management by detailing the available SDN-integrated network-based techniques and architectures that intend to accelerate handover and mitigate service disruption of mobility events in softwareized telecommunication networks. The article also provides an overview of where PMIPv6 can be used and how SDN may help reach those ways.
{"title":"Survey on PMIPv6-based Mobility Management Architectures for Software-Defined Networking","authors":"Ákos Leiter, Mohamad Saleh Salah, L. Pap, L. Bokor","doi":"10.36244/icj.2022.2.1","DOIUrl":"https://doi.org/10.36244/icj.2022.2.1","url":null,"abstract":"Software-Defined Networking (SDN) has changed the network landscape. Meanwhile, IP-based mobility management still evolves, and SDN affects it dramatically. Integrating Proxy Mobile IPv6 (PMIPv6) – a network-based mobility management protocol – with the SDN paradigm has created several promising approaches. This paper will present an extensive survey on the joint research area of PMIPv6 and SDN mobility management by detailing the available SDN-integrated network-based techniques and architectures that intend to accelerate handover and mitigate service disruption of mobility events in softwareized telecommunication networks. The article also provides an overview of where PMIPv6 can be used and how SDN may help reach those ways.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77248756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the rapid growth of the telecom sector heading towards 5G and 6G and the emergence of high-bandwidth and time-sensitive applications, mobile network operators (MNOs) are driven to plan their networks to meet these new requirements in a cost-effective manner. The cloud radio access network (CRAN) has been presented as a promising architecture that can decrease capital expenditures (Capex) and operating expenditures (Opex) and improve network performance. The fronthaul (FH) is a part of the network that links the remote radio head (RRH) to the baseband unit (BBU); these links need high-capacity and low latency connections necessitating costeffective implementation. On the other hand, the transport delay and FH deployment costs increase if the BBU is not placed in an appropriate location. In this paper, we propose an integer linear program (ILP) that simultaneously optimizes BBU and FH deployment resulting in minimal capital expenditures (Capex). Simulations are run to compare the performance of star and tree topologies with the varying line of sight probabilities (LoS) and delay thresholds. We consider fiber-optic (FO) and free-space optics (FSO) technologies as FH for the CRAN. Finally, we provide an analysis of Opex and the total costs of ownership (TCO), i.e., a technoeconomic analysis.
{"title":"Cost-Effective Delay-Constrained Optical Fronthaul Design for 5G and Beyond","authors":"A. Fayad, T. Cinkler","doi":"10.36244/icj.2022.2.2","DOIUrl":"https://doi.org/10.36244/icj.2022.2.2","url":null,"abstract":"With the rapid growth of the telecom sector heading towards 5G and 6G and the emergence of high-bandwidth and time-sensitive applications, mobile network operators (MNOs) are driven to plan their networks to meet these new requirements in a cost-effective manner. The cloud radio access network (CRAN) has been presented as a promising architecture that can decrease capital expenditures (Capex) and operating expenditures (Opex) and improve network performance. The fronthaul (FH) is a part of the network that links the remote radio head (RRH) to the baseband unit (BBU); these links need high-capacity and low latency connections necessitating costeffective implementation. On the other hand, the transport delay and FH deployment costs increase if the BBU is not placed in an appropriate location. In this paper, we propose an integer linear program (ILP) that simultaneously optimizes BBU and FH deployment resulting in minimal capital expenditures (Capex). Simulations are run to compare the performance of star and tree topologies with the varying line of sight probabilities (LoS) and delay thresholds. We consider fiber-optic (FO) and free-space optics (FSO) technologies as FH for the CRAN. Finally, we provide an analysis of Opex and the total costs of ownership (TCO), i.e., a technoeconomic analysis.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"9 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74585712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As the central public IPv4 address pool has already been exhausted, the deployment of IPv6 has become inevitable. However, the users still require IPv4 Internet access due to some IPv4-only applications. The IPv4aaS (IPv4-as-a-Service) IPv6 transition technologies facilitate that ISPs provide IPv4 service to their customers while using only IPv6 in their access and core networks. This paper discusses the widely used IPv4aaS IPv6 transition technologies in ISP/enterprise networks; we explain their operations, advantages, properties and consider their performances. There are currently many IPv6 transition technologies, nevertheless, in this paper, the five most prominent IPv4aaS IPv6 transition technologies are discussed, namely 464XLAT, Dual-Stack Lite, Lightweight 4over6, MAP-E, and MAP-T. Moreover, the deployment and implementations of these technologies are being analysed and inspected. This paper also overviews the benchmarking methodology for IPv6 transition technologies and surveys several papers that investigated metrics and tools utilized in analysing the performance of different IPv6 transition technologies.
{"title":"A Comprehensive Survey on the Most Important IPv4aaS IPv6 Transition Technologies, their Implementations and Performance Analysis","authors":"Omar D'yab","doi":"10.36244/icj.2022.3.5","DOIUrl":"https://doi.org/10.36244/icj.2022.3.5","url":null,"abstract":"As the central public IPv4 address pool has already been exhausted, the deployment of IPv6 has become inevitable. However, the users still require IPv4 Internet access due to some IPv4-only applications. The IPv4aaS (IPv4-as-a-Service) IPv6 transition technologies facilitate that ISPs provide IPv4 service to their customers while using only IPv6 in their access and core networks. This paper discusses the widely used IPv4aaS IPv6 transition technologies in ISP/enterprise networks; we explain their operations, advantages, properties and consider their performances. There are currently many IPv6 transition technologies, nevertheless, in this paper, the five most prominent IPv4aaS IPv6 transition technologies are discussed, namely 464XLAT, Dual-Stack Lite, Lightweight 4over6, MAP-E, and MAP-T. Moreover, the deployment and implementations of these technologies are being analysed and inspected. This paper also overviews the benchmarking methodology for IPv6 transition technologies and surveys several papers that investigated metrics and tools utilized in analysing the performance of different IPv6 transition technologies.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"11 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81533232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Connecting vehicles to the infrastructure and benefiting from the services provided by the network is one of the main objectives to increase safety and provide well-being for passengers. Providing such services requires finding suitable gateways to connect the source vehicles to the infrastructure. The major feature of using gateways is to decrease the load of the network infrastructure resources so that each gateway is responsible for a group of vehicles. Unfortunately, the implementation of this goal is facing many challenges, including the highly dynamic topology of VANETs, which causes network instability, and the deployment of applications with high bandwidth demand that can cause network congestion, particularly in urban areas with a high-density vehicle. This work introduces a novel gateway selection algorithm for vehicular networks in urban areas, consisting of two phases. The first phase identifies the best gateways among the deployed vehicles using multi-objective integer programming. While in the second phase, reinforcement learning is employed to select a suitable gateway for any vehicular node in need to access the VANET infrastructure. The proposed model is evaluated and compared to other existing solutions. The obtained results show the efficiency of the proposed system in identifying and selecting the gateways.
{"title":"New Gateway Selection Algorithm Based on Multi-Objective Integer Programming and Reinforcement Learning","authors":"Hasanain Alabbas, Árpád Huszák","doi":"10.36244/icj.2022.4.1","DOIUrl":"https://doi.org/10.36244/icj.2022.4.1","url":null,"abstract":"Connecting vehicles to the infrastructure and benefiting from the services provided by the network is one of the main objectives to increase safety and provide well-being for passengers. Providing such services requires finding suitable gateways to connect the source vehicles to the infrastructure. The major feature of using gateways is to decrease the load of the network infrastructure resources so that each gateway is responsible for a group of vehicles. Unfortunately, the implementation of this goal is facing many challenges, including the highly dynamic topology of VANETs, which causes network instability, and the deployment of applications with high bandwidth demand that can cause network congestion, particularly in urban areas with a high-density vehicle. This work introduces a novel gateway selection algorithm for vehicular networks in urban areas, consisting of two phases. The first phase identifies the best gateways among the deployed vehicles using multi-objective integer programming. While in the second phase, reinforcement learning is employed to select a suitable gateway for any vehicular node in need to access the VANET infrastructure. The proposed model is evaluated and compared to other existing solutions. The obtained results show the efficiency of the proposed system in identifying and selecting the gateways.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79823532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Schneider, Paul Patolla, M. Fehr, Dirk Reichelt, Feryel Zoghlami, J. Delsing
The semiconductor industry is strongly increasing the production capacities and the product portfolio for a wide range of applications that are needed in the worldwide supply chains e.g. the automotive, computer and security industry. The complex manufacturing processes require more automation, dig- italisation and IoT frameworks, especially for highly automated semiconductor manufacturing plants. Over the last years, this industry spent much effort to control highly sensitive materials in production by product monitoring using advanced process control by various sensors in production. Nevertheless, until today, sensor integration, especially for such sensors that are not supported by the equipment vendors, is time-consuming and complicated. This article aims to use a micro-service-based approach by Eclipse Arrowhead as an open-source microservice architecture and implementation platform [1]. This architecture is an easy and powerful framework that can be used for multiple sensor applications to control the manufacturing material flow in a modern semiconductor plant with a high product mix. The article describes how the engineering process was designed, the architecture of the use case and the main benefits in the operational business are shown.
{"title":"Micro Service based Sensor Integration Efficiency and Feasibility in the Semiconductor Industry","authors":"G. Schneider, Paul Patolla, M. Fehr, Dirk Reichelt, Feryel Zoghlami, J. Delsing","doi":"10.36244/icj.2022.3.10","DOIUrl":"https://doi.org/10.36244/icj.2022.3.10","url":null,"abstract":"The semiconductor industry is strongly increasing the production capacities and the product portfolio for a wide range of applications that are needed in the worldwide supply chains e.g. the automotive, computer and security industry. The complex manufacturing processes require more automation, dig- italisation and IoT frameworks, especially for highly automated semiconductor manufacturing plants. Over the last years, this industry spent much effort to control highly sensitive materials in production by product monitoring using advanced process control by various sensors in production. Nevertheless, until today, sensor integration, especially for such sensors that are not supported by the equipment vendors, is time-consuming and complicated. This article aims to use a micro-service-based approach by Eclipse Arrowhead as an open-source microservice architecture and implementation platform [1]. This architecture is an easy and powerful framework that can be used for multiple sensor applications to control the manufacturing material flow in a modern semiconductor plant with a high product mix. The article describes how the engineering process was designed, the architecture of the use case and the main benefits in the operational business are shown.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"32 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74108453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
There are many factors that affect the performance of the evolutionary and memetic algorithms. One of these factors is the proper selection of the initial population, as it represents a very important criterion contributing to the convergence speed. Selecting a conveniently preprocessed initial population definitely increases the convergence speed and thus accelerates the probability of steering the search towards better regions in the search space, hence, avoiding premature convergence towards a local optimum. In this paper, we propose a new method for generating the initial individual candidate solution called Circle Group Heuristic (CGH) for Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), which is built with aid of a simple Genetic Algorithm (GA). CGH has been tested for several benchmark reference data of the Travelling Salesman Problem (TSP). The practical results show that CGH gives better tours compared with other well-known heuristic tour construction methods.
{"title":"Effect of the initial population construction on the DBMEA algorithm searching for the optimal solution of the traveling salesman problem","authors":"A. J. Ibada, B. Tüű-Szabó, L. Kóczy","doi":"10.36244/icj.2022.3.9","DOIUrl":"https://doi.org/10.36244/icj.2022.3.9","url":null,"abstract":"There are many factors that affect the performance of the evolutionary and memetic algorithms. One of these factors is the proper selection of the initial population, as it represents a very important criterion contributing to the convergence speed. Selecting a conveniently preprocessed initial population definitely increases the convergence speed and thus accelerates the probability of steering the search towards better regions in the search space, hence, avoiding premature convergence towards a local optimum. In this paper, we propose a new method for generating the initial individual candidate solution called Circle Group Heuristic (CGH) for Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), which is built with aid of a simple Genetic Algorithm (GA). CGH has been tested for several benchmark reference data of the Travelling Salesman Problem (TSP). The practical results show that CGH gives better tours compared with other well-known heuristic tour construction methods.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"22 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84248955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The increasing gap between computing speed and storage latency leads to possible I/O bottlenecks on massively parallel computers. To mitigate this issue, hierarchical storage provides multi-tiered configurations where each tier has its own physical characteristics and associated performance. Selecting the most appropriate file placement policy on this multi-tiered storage is difficult and there is to our knowledge no tool that systematically provides statistics and metrics for optimal file policy selection. In this paper, we present FiLiP (File Lifecycle Profiler), a software which provides statistics and metrics for a better understanding of file access by applications and the consequences on file movements across hierarchical storage. After the description of FiLiP’s main features and architecture, we highlight the usefulness of our tool using three I/O intensive simulation HPC applications: NEMO, S3DIO and NAMD and a three-tiered burst buffer.
{"title":"FiLiP: A File Lifecycle-based Profiler for hierarchical storage","authors":"Adrian Khelili, S. Robert, S. Zertal","doi":"10.36244/icj.2022.4.4","DOIUrl":"https://doi.org/10.36244/icj.2022.4.4","url":null,"abstract":"The increasing gap between computing speed and storage latency leads to possible I/O bottlenecks on massively parallel computers. To mitigate this issue, hierarchical storage provides multi-tiered configurations where each tier has its own physical characteristics and associated performance. Selecting the most appropriate file placement policy on this multi-tiered storage is difficult and there is to our knowledge no tool that systematically provides statistics and metrics for optimal file policy selection. In this paper, we present FiLiP (File Lifecycle Profiler), a software which provides statistics and metrics for a better understanding of file access by applications and the consequences on file movements across hierarchical storage. After the description of FiLiP’s main features and architecture, we highlight the usefulness of our tool using three I/O intensive simulation HPC applications: NEMO, S3DIO and NAMD and a three-tiered burst buffer.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"14 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76239870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Switching-Mode Power Supplies (SMPS) are often used to power on-board satellite payloads due to their good conversion efficiency. However, they emit radiated and conducted noise, which can disturb the operation of other payloads. The current ripple sum of the power supplies will appear on the power bus. There are many methods to reduce this summarized noise, one of them is to interleave the on-switching times of the converters. This ripple cancellation method can decrease the noise component on the switching frequency and on its upper harmonics. In this article we are going to demonstrate the effects of the distributed interleaving with a measurement platform consisting of two Pulse Width Modulation (PWM) controlled Buck controllers.
{"title":"Conducted emission simulation and measurement of interleaved DC-DC converters","authors":"T. Kőnig, L. Nagy","doi":"10.36244/icj.2022.2.4","DOIUrl":"https://doi.org/10.36244/icj.2022.2.4","url":null,"abstract":"Switching-Mode Power Supplies (SMPS) are often used to power on-board satellite payloads due to their good conversion efficiency. However, they emit radiated and conducted noise, which can disturb the operation of other payloads. The current ripple sum of the power supplies will appear on the power bus. There are many methods to reduce this summarized noise, one of them is to interleave the on-switching times of the converters. This ripple cancellation method can decrease the noise component on the switching frequency and on its upper harmonics. In this article we are going to demonstrate the effects of the distributed interleaving with a measurement platform consisting of two Pulse Width Modulation (PWM) controlled Buck controllers.","PeriodicalId":42504,"journal":{"name":"Infocommunications Journal","volume":"27 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82560570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：