﻿<?xml version="1.0" encoding="utf-8"?><records><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>151</startPage><endPage>168</endPage><documentType>article</documentType><title language="eng">Multi-Agent Deep Reinforcement Learning-Based Decentralized Computation Offloading in Mobile Edge Computing  </title><authors><author><name>Atousa Daghayeghi</name><email>atousa.daghayeghi@stu.qom.ac.ir</email><affiliationId>1</affiliationId></author><author><name>Mohsen Nickray</name><email>nickraymohsen@gmail.com</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Department of computer engineering and information technology, university of Qom, Qom, Iran</affiliationName><affiliationName affiliationId="2" /></affiliationsList><abstract language="eng">&lt;p style="text-align: left;"&gt;It is hardly possible to support latency-sensitive and computational-intensive applications for mobile devices with limited battery capacity and low computing resources. The development of mobile edge computing and wireless power transfer technologies enable mobile devices to offload computing tasks to edge servers and harvest energy to extend their battery lifetime. However, computation offloading faces challenges such as the limited computing resources of the edge server, the quality of the available communication channel, and the limited time for energy harvesting. In this paper, we study the joint problem of decentralized computation offloading and resource allocation in the dynamic environment of mobile edge computing. To this end, we propose a multi-agent deep reinforcement learning-based offloading scheme that considers the cooperation between mobile devices to adjust their strategies. To be specific, we propose an improved version of the multi-agent deep deterministic policy gradient algorithm by employing the features of clipped double Q-learning, delayed policy update, target policy smoothing, and prioritized experience replay. The simulation results reveal that the proposed offloading scheme has better convergence performance than other baseline methods and also reduces the average energy consumption, average processing delay and task failure rate.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/44275</fullTextUrl><keywords><keyword>Computation offloading</keyword><keyword> resource allocation</keyword><keyword> mobile edge computing</keyword><keyword> multi-agent deep reinforcement learning</keyword><keyword> energy harvesting</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>169</startPage><endPage>182</endPage><documentType>article</documentType><title language="eng">Improvement of Integrated Wireless Networks by Markov Games</title><authors><author><name>Payam Porkar Rezaeiye</name><email>payam.porkar@srbiau.ac.ir</email><affiliationId>1</affiliationId></author><author><name>Hamid Shokrzadeh</name><email>shokrzadeh@gmail.com</email><affiliationId>2</affiliationId></author><author><name>Dehghan Mehdi</name><email>dehghan@aut.ac.ir</email><affiliationId>3</affiliationId></author><author><name>Amir Masoud Rahmani</name><email>rahmani74@srbiau.ac.ir</email><affiliationId>4</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran</affiliationName><affiliationName affiliationId="2" /><affiliationName affiliationId="3">Department of Computer Engineering, Amirkabir University, Tehran, Iran</affiliationName><affiliationName affiliationId="4">Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran</affiliationName></affiliationsList><abstract language="eng">&lt;p class="MsoNormal" style="text-align: justify;"&gt;Nowadays integrated wireless networks have become very important. Among the important technologies in this field is the combined technology of visible light and radio frequency communications, an important example of which is the combination of Wi-Fi and Li-Fi local networks. This combination covers the weaknesses and strengthens the strengths of the local wireless network.&lt;/p&gt;
&lt;p class="MsoNormal" style="text-align: justify;"&gt;Also, an issue that can increase productivity in the network is load balancing, especially when the presence of access points from both networks will lead to more choices. In fact, in the proposed access point selection algorithm in this research, it has been done in such a way that when being at an access point, the decision to choose the location is based on the balance between the factors in the Markov game based on the strategic behavior of objects. In this way, network delay will be reduced and load balance will be increased.&lt;/p&gt;
&lt;p class="MsoNormal" style="text-align: justify;"&gt;Therefore, a dynamic method has been proposed, which can be used to make decisions according to the conditions at any time, especially when the topology changes in the network. The proposed method has advantages such as dynamic selection of access points according to network conditions, direct feedback on the efficiency of the network and shared channel, intelligence and learning towards changes to select points, interaction with similar agents in nodes, and reducing the probability of congestion at each access point. Also, with the increase in user traffic, which leads to congested conditions and the possibility of congestion in nodes and access points, this method helps more in terms of load balancing and reducing the level of congestion. So that its difference with compared methods that use more stable techniques such as fuzzy method increases significantly.&lt;/p&gt;
&lt;p class="MsoNormal" style="text-align: justify;"&gt;According to the obtained results, this method has been able to improve the efficiency of the local network by more than 10% compared to the previous methods such as the fuzzy method and more than 30% compared to the SSS selection policy in high traffic load conditions.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/39801</fullTextUrl><keywords><keyword>Integrated local networks</keyword><keyword> Li-Fi network</keyword><keyword> Wi-Fi network</keyword><keyword> access points and load balancing</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>183</startPage><endPage>196</endPage><documentType>article</documentType><title language="eng">Improving Offloading in IIoT with Awareness of Energy and the Age of Information by Reinforcement Genetic Algorithm</title><authors><author><name>seyed ebrahim dashti</name><email>sayed.dashty@gmail.com</email><affiliationId>1</affiliationId></author><author><name>fatemeh moayedi</name><email>fmoayyedi@gmail.com</email><affiliationId>2</affiliationId></author><author><name>adel salemi</name><email>adelsalemi.sadaf@gmail.com</email><affiliationId>3</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1" /><affiliationName affiliationId="2">Larestan university</affiliationName><affiliationName affiliationId="3">Islamic Azad University</affiliationName></affiliationsList><abstract language="eng">&lt;p style="direction: ltr;"&gt;With the increasing use of Internet of Things in daily life and especially in industry, improving efficiency and delay time with the help of data offloading is one of the goals of these issues. Controlling these factors will improve energy consumption and longer use of things batteries. In this article, the method is introduced to improve sensor data processing and edge and cloud computing in industrial Internet of Things systems. The architecture is considered in accordance with the real world; in this architecture, edge servers with computing capabilities at the edge of the network, especially Used in base stations. Delay-sensitive requests can be forwarded to nearby edge servers through wireless channels, thereby reducing traffic in the core network and user data transmission latency, especially for data-intensive industrial applications. In the Industrial Internet of Things aims to manage network resources, transfer calculations and minimize energy consumption in Internet of Things devices by guaranteeing the freshness of sensor data. The network environment and input tasks are variable with time. In this article, the environment of the problem and its limitations are expressed with formulas. This problem has been solved using the proposed genetic algorithm and reinforcement learning. The proposed solution has improved the dynamic environment of the problem for offloading data and tasks by considering energy and transferring calculations and data by considering their freshness. The results show an average improvement of 40% compared to the previous methods.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/43859</fullTextUrl><keywords><keyword>Offloading</keyword><keyword> Industrial Internet of Things (IIoT)</keyword><keyword> genetic algorithm</keyword><keyword> reinforcement learning.</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>197</startPage><endPage>206</endPage><documentType>article</documentType><title language="eng">Automatic Test-Case Generation Based on Rule-Based Behavioral Specification</title><authors><author><name>Ali Habibi</name><email>habibi.ali@ut.ac.ir</email><affiliationId>1</affiliationId></author><author><name>Ramtin Khosravi</name><email>r.khosravi@ut.ac.ir</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">School of ECE, University of Tehran, Tehran, Iran</affiliationName><affiliationName affiliationId="2">University of Tehran</affiliationName></affiliationsList><abstract language="eng">&lt;p style="direction: ltr;"&gt;With the increasing use of software in safety-critical applications, such as the automotive, defense, and medical industries, achieving high levels of assurance regarding the quality of these software systems is essential. Model-based testing is an automated test-case generation method that, on one hand, provides relative assurance by covering a formal description of the system&amp;rsquo;s behavior, ensuring that various execution scenarios of the program are tested. On the other hand, by automating the generation of these test cases, it significantly reduces the cost of test production. In this research, a model-based testing framework is presented that utilizes a rule-based model and can generate test cases based on two criteria: rule coverage and active rule condition coverage. To generate test cases, this framework employs a search-based approach using a genetic algorithm. The proposed method enables the definition of a system with a large state space and the generation of test cases for it. The framework has been evaluated through a case study on an embedded industrial software, and the evaluation results demonstrate its applicability to real-world problems in the industry.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/44039</fullTextUrl><keywords><keyword>Model-based testing</keyword><keyword> search-based testing</keyword><keyword> formal specification</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>207</startPage><endPage>216</endPage><documentType>article</documentType><title language="eng">Sensors Positioning in IoT-Based Smart Parking Systems with Grasshopper Optimization Algorithm</title><authors><author><name>Ahmad Baratian</name><email>baratian.ahmad.22@gmail.com</email><affiliationId>1</affiliationId></author><author><name>Esmaeil Kheirkhah</name><email>e.kheirkhah@gmail.com</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Department of Computer Engineering, Mashhad Branch, Islamic Azad niversity, Mashhad, Iran</affiliationName><affiliationName affiliationId="2">Department of Computer, Mashhad Branch, Islamic Azad University, Mashhad, Iran</affiliationName></affiliationsList><abstract language="eng">&lt;p style="direction: ltr;"&gt;Considering the growth of the population of cities and the number of vehicles that are increasing exponentially, a challenge in parking lots is the positioning of vehicles. In a smart parking system, the driver can park without delay and by spending less energy; But its requirement is to use sensors (empty parking spaces) and parking guides for this purpose. With the progress of research in the Internet of Things, researchers have provided promising solutions in the smart parking system based on wireless sensors. Among these researches is the use of the gray wolf algorithm (GWO) in the optimal positioning of wireless sensors in the Internet of Things parking environment. In this article, due to the search power and high convergence of the Grasshopper Optimization Algorithm (GOA), this algorithm is used for the first time in the positioning of wireless sensors in the parking lot. The grasshopper optimization algorithm is used to determine the best anchor nodes to collect data from other sensors; So that it can reduce the positioning error and energy consumption of the sensors and increase their lifespan. The results showed that the proposed method was able to achieve an average improvement of 5.92% in reducing the positioning error, 6.43% in reducing the amount of energy consumption and 23.6% in increasing the lifetime of the network compared to the gray wolf algorithm. Also, the proposed method has been able to have more time for the first node to die, and this is an important advantage in smart parking because the efficiency of all sensors in the parking environment is required.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/45070</fullTextUrl><keywords><keyword>Grasshopper optimization algorithm</keyword><keyword> smart parking system</keyword><keyword> sensor positioning</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>217</startPage><endPage>225</endPage><documentType>article</documentType><title language="eng">Development of an Enhanced Multi-Objective Algorithm for Optimal Quality-aware Web Service Composition in the Internet of Things</title><authors><author><name>Narges Zahiri</name><email>nargess.zahiri@gmail.com</email><affiliationId>1</affiliationId></author><author><name>Fereshte Dehghani</name><email>fdehghani@kashanu.ac.ir</email><affiliationId>2</affiliationId></author><author><name>Salman Goli</name><email>salmangoli@kashanu.ac.ir</email><affiliationId>3</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Computer Engineering Department, Faculty of Electrical And Computer Engineering, University of Kashan, Kashan, Isfahan</affiliationName><affiliationName affiliationId="2">Computer Engineering Department, Faculty of Electrical And Computer Engineering, University of Kashan, Kashan, Isfahan</affiliationName><affiliationName affiliationId="3">Computer Engineering Department, Faculty of Electrical And Computer Engineering, University of Kashan, Kashan, Isfahan</affiliationName></affiliationsList><abstract language="eng">&lt;p&gt;The emergence of the Internet of Things (IoT) has intensified the focus on web service composition and the fulfillment of increasingly complex and diverse user requirements. IoT-based systems often encounter numerous service candidates with varying qualitative attributes, presenting a significant challenge in selecting an optimal combination. This problem, categorized as NP-hard, requires efficient approaches for resolution. This study proposes a near-optimal solution for web service composition in IoT environments by leveraging the NSGA-III multi-objective metaheuristic algorithm to identify the optimal Pareto front. To further enhance the quality and diversity of the solutions, an improved algorithm integrating NSGA-III with a novel fitness function is introduced. The proposed approach optimizes service composition using nine quality parameters, which are subsequently streamlined into three principal objectives for better computational efficiency. Experimental evaluations demonstrate that the proposed method outperforms the baseline NSGA-III algorithm in terms of the average performance of two out of three objectives. Additionally, the approach achieves an average of 11% higher coverage based on performance indices and exhibits superior solution distribution and dispersion compared to alternative algorithms.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/42589</fullTextUrl><keywords><keyword>Evolutionary Algorithm</keyword><keyword> Internet of Things</keyword><keyword> multi-objective optimization</keyword><keyword> optimal web service composition and selection</keyword><keyword> quality-aware web services</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>226</startPage><endPage>234</endPage><documentType>article</documentType><title language="eng">Content Sharing Using D2D communications over 5G Networks</title><authors><author><name>meisam kargar</name><email>meisamcho2@gmail.com</email><affiliationId>1</affiliationId></author><author><name>Marzieh Varposhti</name><email>mvarposhti@sku.ac.ir</email><affiliationId>2</affiliationId></author><author><name>Leila Samimi</name><email>rsamimi@sku.ac.i</email><affiliationId>3</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">Department of computer engineering, Shahrekorf university</affiliationName><affiliationName affiliationId="2">Shahrekord University</affiliationName><affiliationName affiliationId="3">Department of Computer Engineering, Shahrekord University</affiliationName></affiliationsList><abstract language="eng">&lt;p style="direction: ltr;"&gt;The rapid development of intelligent hardware, Internet of Things (IoT), and the emergence of various applications has led to an unprecedented increase in mobile data traffic. Therefore, the efficiency of network resource utilization and bandwidth needs to be improved effectively. Currently, Device-to-Device (D2D) communication technology can provide an effective tool for enhancing 5G networks by enabling direct communication between devices. The use of D2D communication can reduce the load on the 5G network and improve service quality. One of the main issues in this regard is how to manage communication resources and select communication links. In this article, we examine the problem of managing D2D communication links for content transmission between communication devices and formulate it as a binary linear optimization problem. To solve this problem, we propose a method based on game theory, where considering user devices containing the desired files for transmission as players, we design an exact potential game and then propose a distributed learning algorithm to reach a Nash equilibrium. Simulation results confirm the satisfactory performance of the proposed algorithm.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/43039</fullTextUrl><keywords><keyword>D2D communications</keyword><keyword> Potential game</keyword><keyword> Edge caching</keyword><keyword> 5G network</keyword></keywords></record><record><language>per</language><publisher>  Iranian Research Institute for Electrical Engineering</publisher><journalTitle>فصلنامه مهندسی برق و مهندسی کامپيوتر ايران</journalTitle><issn>16823745</issn><eissn>16823745</eissn><publicationDate>2024-12</publicationDate><volume>22</volume><issue>3</issue><startPage>235</startPage><endPage>242</endPage><documentType>article</documentType><title language="eng">A Survey on Controller Placement in Software-Defined Networks</title><authors><author><name>Mahdi Sarbazi</name><email>mahdi.sarbazi@uok.ac.ir</email><affiliationId>1</affiliationId></author><author><name>Mohammad Fathi</name><email>fathisam@gmail.com</email><affiliationId>2</affiliationId></author></authors><affiliationsList><affiliationName affiliationId="1">University of Kurdistan</affiliationName><affiliationName affiliationId="2">University of Kurdistan</affiliationName></affiliationsList><abstract language="eng">&lt;p style="direction: ltr;"&gt;Software-defined networks (SDNs) are an emerging area in computer networks, enabling efficient resource management in the network by decomposing data and control plans. In SDNs, network controllers acting as the network operating systems, are responsible for serving application programs. Since a control plan consists of several controllers, the placement of network controllers is a challenging issue in complex networks. While the literature has explored the number of controllers and their placement in the network, several fundamental parameters remain unexplored. Therefore, this topic remains open for more investigations. In this paper, we survey the work in the literature on controller placement in SDNs and introduce the research challenges in this area. Additionally, we present potential future research directions to advance this field.&lt;/p&gt;</abstract><fullTextUrl>http://ijece.org/Article/44474</fullTextUrl><keywords><keyword>Software-defined networks</keyword><keyword> meta-heuristics</keyword><keyword> controller placement</keyword><keyword> machine learning.</keyword></keywords></record></records>