首页 > 最新文献

International Journal of Information and Communication Technology Research最新文献

英文 中文
Energy Efficient Power Allocation in MIMO-NOMA Systems with ZF Precoding Using Cell Division Technique 基于细胞分裂技术的ZF预编码MIMO-NOMA系统的节能功率分配
Pub Date : 2022-09-01 DOI: 10.52547/itrc.14.3.10
Abdolrasoul Sakhaei Gharagezlou, Mahdi Nangir, Nima Imani
—In this paper, the performance of a system in terms of the energy efficiency (EE) is studied. To check the EE performance, an appropriate power is allocated to each user. The system in question in this paper is a multiple-input multiple-output (MIMO) system with non-orthogonal multiple access (NOMA) method. Precoding in this system is considered to be the zero forcing (ZF). It is also assumed that the channel state information (CSI) mode is perfect. First, all the parameters that affect the channel, such as path loss and beam forming are investigated, and then the channel matrix is obtained. To improve system performance, better conditions are provided for users with poor channel conditions. These conditions are created by allocating more appropriate power to these users, or in other words, the total transmission power is divided according to the distance of users from the base station (BS) and the channel conditions of each user. The problem of maximizing the EE is formulated with two constraints of the minimum user rate and the maximum transmission power. This is a non-convex problem that becomes a convex problem using optimization properties, and because the problem is constrained it becomes an unconstrained problem using the Lagrange dual function. Numerical and simulation results are presented to prove the mathematical relationships which show that the performance of the proposed scheme is improved compared to the existing methods. The simulation results are related to two different algorithms with a same objective function. Furthermore, to comparison with performance of other methods, output of these two algorithms are also compared with each other.
本文从能源效率(EE)的角度对系统的性能进行了研究。为了检查EE的性能,为每个用户分配适当的功率。本文所讨论的系统是一个采用非正交多址(NOMA)方法的多输入多输出(MIMO)系统。该系统中的预编码被认为是零强迫(ZF)。还假定通道状态信息(CSI)模式是完美的。首先,研究了影响信道的所有参数,如路径损耗和波束形成,然后得到了信道矩阵。为提高系统性能,为信道条件较差的用户提供了较好的条件。这些条件是通过向这些用户分配更合适的功率来创造的,换句话说,根据用户与基站(BS)的距离以及每个用户的信道条件来划分总发射功率。利用最小用户速率和最大传输功率两个约束条件,提出了EE最大化问题。这是一个非凸问题,利用最优化性质变成了凸问题,由于问题是有约束的,利用拉格朗日对偶函数变成了无约束问题。数值和仿真结果验证了这些数学关系,结果表明,与现有方法相比,所提方案的性能得到了提高。仿真结果与两种不同的算法具有相同的目标函数有关。此外,为了与其他方法的性能进行比较,还对这两种算法的输出结果进行了比较。
{"title":"Energy Efficient Power Allocation in MIMO-NOMA Systems with ZF Precoding Using Cell Division Technique","authors":"Abdolrasoul Sakhaei Gharagezlou, Mahdi Nangir, Nima Imani","doi":"10.52547/itrc.14.3.10","DOIUrl":"https://doi.org/10.52547/itrc.14.3.10","url":null,"abstract":"—In this paper, the performance of a system in terms of the energy efficiency (EE) is studied. To check the EE performance, an appropriate power is allocated to each user. The system in question in this paper is a multiple-input multiple-output (MIMO) system with non-orthogonal multiple access (NOMA) method. Precoding in this system is considered to be the zero forcing (ZF). It is also assumed that the channel state information (CSI) mode is perfect. First, all the parameters that affect the channel, such as path loss and beam forming are investigated, and then the channel matrix is obtained. To improve system performance, better conditions are provided for users with poor channel conditions. These conditions are created by allocating more appropriate power to these users, or in other words, the total transmission power is divided according to the distance of users from the base station (BS) and the channel conditions of each user. The problem of maximizing the EE is formulated with two constraints of the minimum user rate and the maximum transmission power. This is a non-convex problem that becomes a convex problem using optimization properties, and because the problem is constrained it becomes an unconstrained problem using the Lagrange dual function. Numerical and simulation results are presented to prove the mathematical relationships which show that the performance of the proposed scheme is improved compared to the existing methods. The simulation results are related to two different algorithms with a same objective function. Furthermore, to comparison with performance of other methods, output of these two algorithms are also compared with each other.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128146203","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}
引用次数: 1
Implementing Process Mining Techniques to Analyze Performance in EPC Companies 流程挖掘技术在EPC公司绩效分析中的应用
Pub Date : 2022-06-01 DOI: 10.52547/itrc.14.2.66
Seyedeh Motahareh Hosseini, M. Aghdasi, B. Teimourpour, A. Albadvi
—The importance of process analysis in engineering, procurement and construction companies (EPC), due to the complexity of the measures, the high level of communication between people, different and non-integrated information systems, as well as the amount of capital involved in these projects is much higher and more challenging. Limited research has been done on exploring business processes in these companies. In this study, in order to better and more accurately analyze the company's performance, three perspectives of process mining (process flow, case and organizational) is analyzed by using the event logs recorded in the supplier selection process. The results of this study led to the identification of challenges in the process, including repetitive loops, duplicate activities, survey of factors affecting the implementation of the process and also examining the relationships between people involved in the project, which can be used to improve the future performance of the company.
-过程分析在工程,采购和建筑公司(EPC)中的重要性,由于措施的复杂性,人与人之间的高水平沟通,不同和非集成的信息系统,以及这些项目所涉及的资金量要高得多,更具挑战性。在探索这些公司的业务流程方面已经做了有限的研究。在本研究中,为了更好、更准确地分析公司的绩效,利用供应商选择过程中记录的事件日志,从流程挖掘的三个角度(流程流、案例和组织)进行分析。这项研究的结果导致了过程中的挑战,包括重复的循环,重复的活动,调查影响过程实施的因素,也检查了参与项目的人之间的关系,这可以用来提高公司的未来绩效。
{"title":"Implementing Process Mining Techniques to Analyze Performance in EPC Companies","authors":"Seyedeh Motahareh Hosseini, M. Aghdasi, B. Teimourpour, A. Albadvi","doi":"10.52547/itrc.14.2.66","DOIUrl":"https://doi.org/10.52547/itrc.14.2.66","url":null,"abstract":"—The importance of process analysis in engineering, procurement and construction companies (EPC), due to the complexity of the measures, the high level of communication between people, different and non-integrated information systems, as well as the amount of capital involved in these projects is much higher and more challenging. Limited research has been done on exploring business processes in these companies. In this study, in order to better and more accurately analyze the company's performance, three perspectives of process mining (process flow, case and organizational) is analyzed by using the event logs recorded in the supplier selection process. The results of this study led to the identification of challenges in the process, including repetitive loops, duplicate activities, survey of factors affecting the implementation of the process and also examining the relationships between people involved in the project, which can be used to improve the future performance of the company.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114097852","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}
引用次数: 0
Large-Scale Twitter Mining for Extracting the Psychological Impacts of COVID-19 大规模推特挖掘以提取COVID-19的心理影响
Pub Date : 2022-06-01 DOI: 10.52547/itrc.14.2.23
H. Vahdat-Nejad, F. Azizi, Mahdi Hajiabadi, F. Salmani, Sajedeh Abbasi, Mohadese Jamalian, Reyhane Mosafer, H. Hajiabadi, W. Mansoor
—The outbreak of the COVID-19 in 2020 and lack of an effective cure caused psychological problems among humans. This has been reflected widely on social media. Analyzing a large number of English tweets posted in the early stages of the pandemic, this paper addresses three psychological parameters: fear, hope, and depression. The main issue is the extraction of the related tweets with each of these parameters. To this end, three lexicons are proposed for these psychological parameters to extract the tweets through content analysis. A lexicon-based method is then used with GEO Names (i.e. a geographical database) to label tweets with country tags. Fear, hope, and depression trends are then extracted for the entire world and 30 countries. According to the analysis of results, there is a high correlation between the frequency of tweets and the official daily statistics of active cases in many countries. Moreover, fear tweets dominate hope tweets in most countries, something which shows the worldwide fear in the early months of the pandemic. Ultimately, the diagrams of many countries demonstrate unusual spikes caused by the dissemination of specific news and announcements.
——2020年新冠肺炎疫情爆发,由于缺乏有效的治疗手段,导致人类出现心理问题。这在社交媒体上得到了广泛反映。本文分析了疫情初期发布的大量英文推文,分析了恐惧、希望和抑郁这三个心理参数。主要问题是如何从这些参数中提取相关的tweet。为此,我们针对这些心理参数提出了三个词汇,通过内容分析提取推文。然后使用基于词典的方法与GEO Names(即地理数据库)一起使用国家标签标记tweet。然后提取出全世界和30个国家的恐惧、希望和抑郁趋势。根据对结果的分析,在许多国家,推特的频率与官方每日统计的活跃病例之间存在高度相关性。此外,在大多数国家,恐惧的推文主导了希望的推文,这表明在大流行的最初几个月里,世界范围内的恐惧。最终,许多国家的图表显示了由特定新闻和公告的传播引起的不寻常的峰值。
{"title":"Large-Scale Twitter Mining for Extracting the Psychological Impacts of COVID-19","authors":"H. Vahdat-Nejad, F. Azizi, Mahdi Hajiabadi, F. Salmani, Sajedeh Abbasi, Mohadese Jamalian, Reyhane Mosafer, H. Hajiabadi, W. Mansoor","doi":"10.52547/itrc.14.2.23","DOIUrl":"https://doi.org/10.52547/itrc.14.2.23","url":null,"abstract":"—The outbreak of the COVID-19 in 2020 and lack of an effective cure caused psychological problems among humans. This has been reflected widely on social media. Analyzing a large number of English tweets posted in the early stages of the pandemic, this paper addresses three psychological parameters: fear, hope, and depression. The main issue is the extraction of the related tweets with each of these parameters. To this end, three lexicons are proposed for these psychological parameters to extract the tweets through content analysis. A lexicon-based method is then used with GEO Names (i.e. a geographical database) to label tweets with country tags. Fear, hope, and depression trends are then extracted for the entire world and 30 countries. According to the analysis of results, there is a high correlation between the frequency of tweets and the official daily statistics of active cases in many countries. Moreover, fear tweets dominate hope tweets in most countries, something which shows the worldwide fear in the early months of the pandemic. Ultimately, the diagrams of many countries demonstrate unusual spikes caused by the dissemination of specific news and announcements.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121114972","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}
引用次数: 0
Cost Reduction Using SLA-Aware Genetic Algorithm for Consolidation of Virtual Machines in Cloud Data Centers 利用支持sla的遗传算法降低云数据中心虚拟机整合的成本
Pub Date : 2022-06-01 DOI: 10.52547/itrc.14.2.14
Hossein Monshizadeh Naeen
—Cloud computing is a computing model which uses network facilities to provision, use and deliver computing services. Nowadays, the issue of reducing energy consumption has become very important alongside the efficiency for Cloud service providers. Dynamic virtual machine (VM) consolidation is a technology that has been used for energy efficient computing in Cloud data centers. In this paper, we offer solutions to reduce overall costs, including energy consumption and service level agreement (SLA) violation. To consolidate VMs into a smaller number of physical machines, a novel SLA-aware VM placement method based on genetic algorithms is presented. In order to make the VM placement algorithm be SLA-aware, the proposed approach considers workloads as non-stationary stochastic processes, and automatically approximates them as stationary processes using a novel dynamic sliding window algorithm. Simulation results in the CloudSim toolkit confirms that the proposed virtual server consolidation algorithms in this paper provides significant total cost savings (evaluated by ESV metric), which is about 45% better than the best of the benchmark algorithms.
云计算是一种利用网络设施来提供、使用和交付计算服务的计算模式。如今,降低能源消耗的问题与云服务提供商的效率一起变得非常重要。动态虚拟机(VM)整合是一种在云数据中心中用于节能计算的技术。在本文中,我们提供了降低总成本的解决方案,包括能源消耗和服务水平协议(SLA)违反。为了将虚拟机整合到数量较少的物理机中,提出了一种基于遗传算法的感知sla的虚拟机放置方法。为了使虚拟机放置算法能够感知sla,该方法将工作负载视为非平稳随机过程,并使用一种新的动态滑动窗口算法将其自动逼近为平稳过程。CloudSim工具包中的模拟结果证实,本文提出的虚拟服务器整合算法提供了显着的总成本节约(通过ESV度量进行评估),比最佳基准算法高出约45%。
{"title":"Cost Reduction Using SLA-Aware Genetic Algorithm for Consolidation of Virtual Machines in Cloud Data Centers","authors":"Hossein Monshizadeh Naeen","doi":"10.52547/itrc.14.2.14","DOIUrl":"https://doi.org/10.52547/itrc.14.2.14","url":null,"abstract":"—Cloud computing is a computing model which uses network facilities to provision, use and deliver computing services. Nowadays, the issue of reducing energy consumption has become very important alongside the efficiency for Cloud service providers. Dynamic virtual machine (VM) consolidation is a technology that has been used for energy efficient computing in Cloud data centers. In this paper, we offer solutions to reduce overall costs, including energy consumption and service level agreement (SLA) violation. To consolidate VMs into a smaller number of physical machines, a novel SLA-aware VM placement method based on genetic algorithms is presented. In order to make the VM placement algorithm be SLA-aware, the proposed approach considers workloads as non-stationary stochastic processes, and automatically approximates them as stationary processes using a novel dynamic sliding window algorithm. Simulation results in the CloudSim toolkit confirms that the proposed virtual server consolidation algorithms in this paper provides significant total cost savings (evaluated by ESV metric), which is about 45% better than the best of the benchmark algorithms.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"16 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130377107","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}
引用次数: 1
A Review on Internet Traffic Classification Based on Artificial Intelligence Techniques 基于人工智能技术的互联网流量分类研究进展
Pub Date : 2022-06-01 DOI: 10.52547/itrc.14.2.1
Mohammad Pooya Malek, Shaghayegh Naderi, Hossein Gharaee Garakani
—Almost every industry has revolutionized with Artificial Intelligence. The telecommunication industry is one of them to improve customers' Quality of Services and Quality of Experience by enhancing networking infrastructure capabilities which could lead to much higher rates even in 5G Networks. To this end, network traffic classification methods for identifying and classifying user behavior have been used. Traditional analysis with Statistical-Based, Port-Based, Payload-Based, and Flow-Based methods was the key for these systems before the 4th industrial revolution. AI combination with such methods leads to higher accuracy and better performance. In the last few decades, numerous studies have been conducted on Machine Learning and Deep Learning, but there are still some doubts about using DL over ML or vice versa. This paper endeavors to investigate challenges in ML/DL use-cases by exploring more than 140 identical researches. We then analyze the results and visualize a practical way of classifying internet traffic for popular applications.
几乎每个行业都因人工智能而发生了革命性的变化。电信行业是其中之一,通过增强网络基础设施能力来提高客户的服务质量和体验质量,即使在5G网络中也可能带来更高的费率。为此,使用网络流分类方法对用户行为进行识别和分类。在第四次工业革命之前,基于统计、基于端口、基于有效载荷和基于流量的传统分析方法是这些系统的关键。人工智能与这些方法相结合,精度更高,性能更好。在过去的几十年里,人们对机器学习和深度学习进行了大量的研究,但仍然存在一些关于使用深度学习而不是ML或反之亦然的疑问。本文试图通过探索140多个相同的研究来研究ML/DL用例中的挑战。然后,我们分析了结果,并可视化了一种实用的方法来为流行的应用程序分类互联网流量。
{"title":"A Review on Internet Traffic Classification Based on Artificial Intelligence Techniques","authors":"Mohammad Pooya Malek, Shaghayegh Naderi, Hossein Gharaee Garakani","doi":"10.52547/itrc.14.2.1","DOIUrl":"https://doi.org/10.52547/itrc.14.2.1","url":null,"abstract":"—Almost every industry has revolutionized with Artificial Intelligence. The telecommunication industry is one of them to improve customers' Quality of Services and Quality of Experience by enhancing networking infrastructure capabilities which could lead to much higher rates even in 5G Networks. To this end, network traffic classification methods for identifying and classifying user behavior have been used. Traditional analysis with Statistical-Based, Port-Based, Payload-Based, and Flow-Based methods was the key for these systems before the 4th industrial revolution. AI combination with such methods leads to higher accuracy and better performance. In the last few decades, numerous studies have been conducted on Machine Learning and Deep Learning, but there are still some doubts about using DL over ML or vice versa. This paper endeavors to investigate challenges in ML/DL use-cases by exploring more than 140 identical researches. We then analyze the results and visualize a practical way of classifying internet traffic for popular applications.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847486","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}
引用次数: 0
Clustering Large-Scale Data using an Incremental Heap Self-Organizing Map 使用增量堆自组织映射聚类大规模数据
Pub Date : 2022-06-01 DOI: 10.52547/itrc.14.2.41
M. Fasanghari, Helena Bahrami, Hamideh Sadat Cheraghchi
— In machine learning and data analysis, clustering large amounts of data is one of the most challenging tasks. In reality, many fields, including research, health, social life, and commerce, rely on the information generated every second. The significance of this enormous amount of data in all facets of contemporary human existence has prompted numerous attempts to develop new methods for analyzing large amounts of data. In this research, an Incremental Heap Self-Organizing Map (IHSOM) is proposed for clustering a vast amount of data that continues to grow. The gradual nature of IHSOM enables environments to change and evolve. In other words, IHSOM can quickly adapt to the size of a dataset. The heap binary tree structure of the proposed approach offers several advantages over other structures. Initially, the topology or neighborhood relationship between data in the input space is maintained in the output space. The outlier data are then routed to the tree's leaf nodes, where they may be efficiently managed. This capability is supplied by a probability density function as a threshold for allocating more similar data to a cluster and transferring less similar data to the following node. The pruning and expanding nodes process renders the algorithm noise-resistant, more precise in clustering, and memory-efficient. Therefore, heap tree structure accelerates node traversal and reorganization following the addition or deletion of nodes. IHSOM's simple user-defined parameters make it a practical unsupervised clustering approach. On both synthetic and real-world datasets, the performance of the proposed algorithm is evaluated and compared to existing hierarchical self-organizing maps and clustering algorithms. The outcomes of the investigation demonstrated IHSOM's proficiency in clustering
在机器学习和数据分析中,聚类大量数据是最具挑战性的任务之一。在现实中,许多领域,包括研究、健康、社会生活和商业,都依赖于每一秒钟产生的信息。这些海量数据在当代人类生活的各个方面都具有重要意义,这促使人们尝试开发分析海量数据的新方法。在本研究中,提出了一种增量堆自组织映射(IHSOM)来聚类持续增长的大量数据。IHSOM的渐进式特性使环境能够改变和进化。换句话说,IHSOM可以快速适应数据集的大小。所提出的方法的堆二叉树结构与其他结构相比具有几个优点。最初,输入空间中数据之间的拓扑或邻域关系保持在输出空间中。然后将异常数据路由到树的叶节点,在那里它们可以被有效地管理。此功能由概率密度函数提供,作为阈值,用于将更相似的数据分配到集群,并将不太相似的数据传输到下一个节点。节点的修剪和扩展过程使算法具有抗噪声、更精确的聚类和内存效率。因此,堆树结构加速了节点添加或删除后的节点遍历和重组。IHSOM的简单用户定义参数使其成为一种实用的无监督聚类方法。在合成数据集和真实数据集上,对该算法的性能进行了评估,并与现有的分层自组织映射和聚类算法进行了比较。调查结果证明了IHSOM在聚类方面的熟练程度
{"title":"Clustering Large-Scale Data using an Incremental Heap Self-Organizing Map","authors":"M. Fasanghari, Helena Bahrami, Hamideh Sadat Cheraghchi","doi":"10.52547/itrc.14.2.41","DOIUrl":"https://doi.org/10.52547/itrc.14.2.41","url":null,"abstract":"— In machine learning and data analysis, clustering large amounts of data is one of the most challenging tasks. In reality, many fields, including research, health, social life, and commerce, rely on the information generated every second. The significance of this enormous amount of data in all facets of contemporary human existence has prompted numerous attempts to develop new methods for analyzing large amounts of data. In this research, an Incremental Heap Self-Organizing Map (IHSOM) is proposed for clustering a vast amount of data that continues to grow. The gradual nature of IHSOM enables environments to change and evolve. In other words, IHSOM can quickly adapt to the size of a dataset. The heap binary tree structure of the proposed approach offers several advantages over other structures. Initially, the topology or neighborhood relationship between data in the input space is maintained in the output space. The outlier data are then routed to the tree's leaf nodes, where they may be efficiently managed. This capability is supplied by a probability density function as a threshold for allocating more similar data to a cluster and transferring less similar data to the following node. The pruning and expanding nodes process renders the algorithm noise-resistant, more precise in clustering, and memory-efficient. Therefore, heap tree structure accelerates node traversal and reorganization following the addition or deletion of nodes. IHSOM's simple user-defined parameters make it a practical unsupervised clustering approach. On both synthetic and real-world datasets, the performance of the proposed algorithm is evaluated and compared to existing hierarchical self-organizing maps and clustering algorithms. The outcomes of the investigation demonstrated IHSOM's proficiency in clustering","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127518120","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}
引用次数: 1
Toward a Versatile IoT Communication Infrastructure 迈向多功能物联网通信基础设施
Pub Date : 2022-03-01 DOI: 10.52547/itrc.14.1.25
Seyed Mehdi Mousavi, Ahmad Khademzadeh, A. Rahmani
— The IoT can lead to fundamental developments in health, education, urbanization, agriculture, industry, and other areas. Regarding the variety of different end-user applications and needs, developing a versatile communication network that can support such diverse and heterogeneous applications is necessary to decrease the implementation costs than developing a dedicated communication network for each application. LoRa is a type of LPWAN networks that is supported by LoRa Alliance and due to long-range communication and low power and reasonable cost, IoT has become the main goal of establishing LoRa. LoRaWAN covers the protocol and architecture of the system on top of the LoRa physical layer. The LoRa physical layer uses proprietary CSS modulation. This modulation operates below the noise level and is resistant to fading, interference, and blocking attacks, and is difficult to decode. LoRa operates in the unlicensed frequency band below 1GHz with different frequencies in different geographical areas. LoRa is much more useful for IoT applications than short-range protocols such as WiFi and Bluetooth, despite limitations in data transfer speeds and QoS. Therefore, in this manuscript, considering the importance and advantages of LoRa, this protocol is introduced and its various network aspect, importance, and application are examined. Then, a solution based on the cognitive radio technique is presented for QoS improvement to utilize the LoRa technology as a kind of versatile communication infrastructure for IoT.
-物联网可以推动卫生、教育、城市化、农业、工业和其他领域的根本性发展。考虑到各种不同的终端用户应用程序和需求,与为每个应用程序开发专用通信网络相比,开发能够支持这种多样化和异构应用程序的通用通信网络对于降低实现成本是必要的。LoRa是LoRa联盟支持的一种LPWAN网络,由于远程通信和低功耗、合理的成本,物联网成为建立LoRa的主要目标。LoRaWAN在LoRa物理层之上涵盖了系统的协议和体系结构。LoRa物理层使用专有的CSS调制。这种调制在噪声水平以下工作,并且抵抗衰落、干扰和阻塞攻击,并且难以解码。LoRa在1GHz以下的免牌频带内运作,在不同的地理区域有不同的频率。对于物联网应用来说,LoRa比WiFi和蓝牙等短距离协议更有用,尽管在数据传输速度和QoS方面存在限制。因此,在本文中,考虑到LoRa的重要性和优势,介绍了该协议,并对其各个网络方面,重要性和应用进行了研究。然后,提出了一种基于认知无线电技术的QoS改进方案,以利用LoRa技术作为物联网的一种通用通信基础设施。
{"title":"Toward a Versatile IoT Communication Infrastructure","authors":"Seyed Mehdi Mousavi, Ahmad Khademzadeh, A. Rahmani","doi":"10.52547/itrc.14.1.25","DOIUrl":"https://doi.org/10.52547/itrc.14.1.25","url":null,"abstract":"— The IoT can lead to fundamental developments in health, education, urbanization, agriculture, industry, and other areas. Regarding the variety of different end-user applications and needs, developing a versatile communication network that can support such diverse and heterogeneous applications is necessary to decrease the implementation costs than developing a dedicated communication network for each application. LoRa is a type of LPWAN networks that is supported by LoRa Alliance and due to long-range communication and low power and reasonable cost, IoT has become the main goal of establishing LoRa. LoRaWAN covers the protocol and architecture of the system on top of the LoRa physical layer. The LoRa physical layer uses proprietary CSS modulation. This modulation operates below the noise level and is resistant to fading, interference, and blocking attacks, and is difficult to decode. LoRa operates in the unlicensed frequency band below 1GHz with different frequencies in different geographical areas. LoRa is much more useful for IoT applications than short-range protocols such as WiFi and Bluetooth, despite limitations in data transfer speeds and QoS. Therefore, in this manuscript, considering the importance and advantages of LoRa, this protocol is introduced and its various network aspect, importance, and application are examined. Then, a solution based on the cognitive radio technique is presented for QoS improvement to utilize the LoRa technology as a kind of versatile communication infrastructure for IoT.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122677618","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}
引用次数: 0
Energy Efficient Multi-Clustering Using Grey Wolf Optimizer in Wireless Sensor Network 基于灰狼优化器的无线传感器网络节能多聚类
Pub Date : 2022-03-01 DOI: 10.52547/itrc.14.1.1
Maryam Ghorbanvirdi, S. M. Mazinani
—The most important challenge in wireless sensor networks is to extend the network lifetime, which is directly related to the energy consumption. Clustering is one of the well-known energy-saving solutions in WSNs. To put this in perspective, the most studies repeated cluster head selection methods for clustering in each round, which increases the number of sent and received messages. what's more, inappropriate cluster head selection and unbalanced clusters have increased energy dissipation. To create balanced clusters and reduce energy consumption, we used a centralized network and relay nodes, respectively. Besides, we applied a metaheuristic algorithm to select the optimal cluster heads because classical methods are easily trapped in local minimum. In this paper, the Grey Wolf Optimizer(GWO), which is a simple and flexible algorithm that is capable of balancing the two phases of exploration and exploitation is used. To prolong the network lifetime and reduce energy consumption in cluster head nodes, we proposed a centralized multiple clustering based on GWO that uses both energy and distance in cluster head selection. This research is compared with classical and metaheuristic algorithms in three scenarios based on the criteria of "Network Lifetime", "Number of dead nodes in each round" and "Total Remaining Energy(TRE) in the cluster head and relay nodes. The simulation results show that our research performs better than other methods. In addition, to analyze the scalability, it has been evaluated in terms of "number of nodes", "network dimensions" and "BS location". Regarding to the results, by rising 2 and 5 times of these conditions, the network performance is increased by 1.5 and 2 times, respectively.
-无线传感器网络面临的最大挑战是延长网络寿命,这直接关系到网络的能耗。聚类是无线传感器网络中公认的节能解决方案之一。为了更好地理解这一点,大多数研究在每轮聚类中重复簇头选择方法,这增加了发送和接收消息的数量。此外,簇头选择不当和簇的不平衡也增加了能量耗散。为了创建平衡的集群并降低能耗,我们分别使用了集中式网络和中继节点。此外,由于传统方法容易陷入局部最小值,我们采用了一种元启发式算法来选择最优簇头。本文采用了灰狼优化算法(Grey Wolf Optimizer, GWO),它是一种简单灵活的算法,能够平衡探索和开发两个阶段。为了延长网络寿命和降低簇头节点的能量消耗,提出了一种基于GWO的集中多聚类算法,该算法在簇头选择中同时考虑了能量和距离。以“网络生存期”、“每轮死节点数”和“簇头节点和中继节点的总剩余能量(Total Remaining Energy, TRE)”为标准,对三种场景下的经典算法和元启发式算法进行了比较。仿真结果表明,我们的研究方法比其他方法具有更好的性能。此外,为了分析可扩展性,还从“节点数”、“网络规模”和“BS位置”三个方面对其进行了评估。从结果来看,通过将这些条件提高2倍和5倍,网络性能分别提高1.5倍和2倍。
{"title":"Energy Efficient Multi-Clustering Using Grey Wolf Optimizer in Wireless Sensor Network","authors":"Maryam Ghorbanvirdi, S. M. Mazinani","doi":"10.52547/itrc.14.1.1","DOIUrl":"https://doi.org/10.52547/itrc.14.1.1","url":null,"abstract":"—The most important challenge in wireless sensor networks is to extend the network lifetime, which is directly related to the energy consumption. Clustering is one of the well-known energy-saving solutions in WSNs. To put this in perspective, the most studies repeated cluster head selection methods for clustering in each round, which increases the number of sent and received messages. what's more, inappropriate cluster head selection and unbalanced clusters have increased energy dissipation. To create balanced clusters and reduce energy consumption, we used a centralized network and relay nodes, respectively. Besides, we applied a metaheuristic algorithm to select the optimal cluster heads because classical methods are easily trapped in local minimum. In this paper, the Grey Wolf Optimizer(GWO), which is a simple and flexible algorithm that is capable of balancing the two phases of exploration and exploitation is used. To prolong the network lifetime and reduce energy consumption in cluster head nodes, we proposed a centralized multiple clustering based on GWO that uses both energy and distance in cluster head selection. This research is compared with classical and metaheuristic algorithms in three scenarios based on the criteria of \"Network Lifetime\", \"Number of dead nodes in each round\" and \"Total Remaining Energy(TRE) in the cluster head and relay nodes. The simulation results show that our research performs better than other methods. In addition, to analyze the scalability, it has been evaluated in terms of \"number of nodes\", \"network dimensions\" and \"BS location\". Regarding to the results, by rising 2 and 5 times of these conditions, the network performance is increased by 1.5 and 2 times, respectively.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114568211","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}
引用次数: 1
cMaxDriver: A Centrality Maximization Intersection Approach for Prediction of Cancer-Causing Genes in the Transcriptional Regulatory Network cMaxDriver:一种预测转录调控网络中致癌基因的中心性最大化交叉方法
Pub Date : 2022-03-01 DOI: 10.52547/itrc.14.1.57
Sajedeh Lashgari, B. Teimourpour, Mostafa Akhavan-Safar
—Cancer-causing genes are genes in which mutations cause the onset and spread of cancer. These genes are called driver genes or cancer-causal genes. Several computational methods have been proposed so far to find them. Most of these methods are based on the genome sequencing of cancer tissues. They look for key mutations in genome data to predict cancer genes. This study proposes a new approach called centrality maximization intersection, cMaxDriver, as a network-based tool for predicting cancer-causing genes in the human transcriptional regulatory network. In this approach, we used degree, closeness, and betweenness centralities, without using genome data. We first constructed three cancer transcriptional regulatory networks using gene expression data and regulatory interactions as benchmarks. We then calculated the three mentioned centralities for the genes in the network and considered the nodes with the highest values in each of the centralities as important genes in the network. Finally, we identified the nodes with the highest value between at least two centralities as cancer causal genes. We compared the results with eighteen previous computational and network-based methods. The results show that the proposed approach has improved the efficiency and F-measure, significantly. In addition, the cMaxDriver approach has identified unique cancer driver genes, which other methods cannot identify.
致癌基因是指突变导致癌症发生和扩散的基因。这些基因被称为驱动基因或致癌基因。到目前为止,已经提出了几种计算方法来找到它们。这些方法大多是基于癌症组织的基因组测序。他们在基因组数据中寻找关键突变来预测癌症基因。本研究提出了一种称为中心性最大化交集(cMaxDriver)的新方法,作为预测人类转录调控网络中致癌基因的基于网络的工具。在这种方法中,我们使用度、接近度和中间度中心性,而不使用基因组数据。我们首先以基因表达数据和调控相互作用为基准构建了三个癌症转录调控网络。然后,我们计算了网络中基因的三个中心性,并将每个中心性中值最高的节点视为网络中的重要基因。最后,我们确定了至少两个中心性之间具有最大值的节点作为癌症致病基因。我们将结果与之前的18种基于计算和网络的方法进行了比较。结果表明,该方法显著提高了效率和F-measure。此外,cMaxDriver方法还发现了其他方法无法识别的独特的癌症驱动基因。
{"title":"cMaxDriver: A Centrality Maximization Intersection Approach for Prediction of Cancer-Causing Genes in the Transcriptional Regulatory Network","authors":"Sajedeh Lashgari, B. Teimourpour, Mostafa Akhavan-Safar","doi":"10.52547/itrc.14.1.57","DOIUrl":"https://doi.org/10.52547/itrc.14.1.57","url":null,"abstract":"—Cancer-causing genes are genes in which mutations cause the onset and spread of cancer. These genes are called driver genes or cancer-causal genes. Several computational methods have been proposed so far to find them. Most of these methods are based on the genome sequencing of cancer tissues. They look for key mutations in genome data to predict cancer genes. This study proposes a new approach called centrality maximization intersection, cMaxDriver, as a network-based tool for predicting cancer-causing genes in the human transcriptional regulatory network. In this approach, we used degree, closeness, and betweenness centralities, without using genome data. We first constructed three cancer transcriptional regulatory networks using gene expression data and regulatory interactions as benchmarks. We then calculated the three mentioned centralities for the genes in the network and considered the nodes with the highest values in each of the centralities as important genes in the network. Finally, we identified the nodes with the highest value between at least two centralities as cancer causal genes. We compared the results with eighteen previous computational and network-based methods. The results show that the proposed approach has improved the efficiency and F-measure, significantly. In addition, the cMaxDriver approach has identified unique cancer driver genes, which other methods cannot identify.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125852510","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}
引用次数: 0
Spectral and Energy Efficiency WirelessPowered Massive-MIMO HeterogeneousNetwork 频谱和能量效率无线供电大规模mimo异构网络
Pub Date : 2022-03-01 DOI: 10.52547/itrc.14.1.13
Sepideh Haghgoy, M. Mohammadi, Z. Mobini
— In this paper, we study the spectral efficiency (SE) and energy efficiency (EE) of wireless-powered full-duplex (FD) heterogeneous networks (HetNets). In particular, we consider a two-tire HetNet with half duplex (HD) massive multiple-input multiple-output (MIMO) macrocell base stations (MBSs), FD small cell base stations (SBSs) and FD user equipments (UEs). UEs rely on energy harvesting (EH) from radio frequency signals to charge their batteries for communication with serving base stations. During the energy harvesting phase, UEs are associated to MBSs/SBSs based on the mean maximum received power (MMP) scheme. In the consecutive data transmission phase, each UE downloads packets from the same MBSs/SBSs, while uploads packets to the nearest SBSs using the harvested energy. We use tools from stochastic geometry to develop an analytical framework for the average UL power transfer and the UL and DL coverage probability analysis. We further investigate the EE of the proposed DUDe scheme to demonstrate the impact of different system parameters on the EE. Finally, we validate the analytical results through simulation and discuss the significance of the proposed DUDe user association to improve the average DL and UL SE in the wireless-powered FD HetNets.
在本文中,我们研究了无线全双工异构网络(HetNets)的频谱效率(SE)和能量效率(EE)。特别地,我们考虑了一个带有半双工(HD)大规模多输入多输出(MIMO)宏蜂窝基站(MBSs)、FD小蜂窝基站(SBSs)和FD用户设备(ue)的双轮胎HetNet。ue依靠从射频信号中收集能量(EH)来为电池充电,以便与服务基站进行通信。在能量收集阶段,ue基于平均最大接收功率(MMP)方案与mbs / sbs相关联。在连续数据传输阶段,每个终端从相同的MBSs/SBSs下载数据包,同时利用收集到的能量将数据包上传到最近的SBSs。我们使用随机几何工具开发了一个分析框架,用于平均UL功率传输和UL和DL覆盖概率分析。我们进一步研究了所提出的DUDe方案的能效,以证明不同的系统参数对能效的影响。最后,我们通过仿真验证了分析结果,并讨论了所提出的DUDe用户关联对提高无线供电FD HetNets的平均DL和UL SE的意义。
{"title":"Spectral and Energy Efficiency WirelessPowered Massive-MIMO Heterogeneous\u0000Network","authors":"Sepideh Haghgoy, M. Mohammadi, Z. Mobini","doi":"10.52547/itrc.14.1.13","DOIUrl":"https://doi.org/10.52547/itrc.14.1.13","url":null,"abstract":"— In this paper, we study the spectral efficiency (SE) and energy efficiency (EE) of wireless-powered full-duplex (FD) heterogeneous networks (HetNets). In particular, we consider a two-tire HetNet with half duplex (HD) massive multiple-input multiple-output (MIMO) macrocell base stations (MBSs), FD small cell base stations (SBSs) and FD user equipments (UEs). UEs rely on energy harvesting (EH) from radio frequency signals to charge their batteries for communication with serving base stations. During the energy harvesting phase, UEs are associated to MBSs/SBSs based on the mean maximum received power (MMP) scheme. In the consecutive data transmission phase, each UE downloads packets from the same MBSs/SBSs, while uploads packets to the nearest SBSs using the harvested energy. We use tools from stochastic geometry to develop an analytical framework for the average UL power transfer and the UL and DL coverage probability analysis. We further investigate the EE of the proposed DUDe scheme to demonstrate the impact of different system parameters on the EE. Finally, we validate the analytical results through simulation and discuss the significance of the proposed DUDe user association to improve the average DL and UL SE in the wireless-powered FD HetNets.","PeriodicalId":270455,"journal":{"name":"International Journal of Information and Communication Technology Research","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116604687","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}
引用次数: 0
期刊
International Journal of Information and Communication Technology Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1