Behnam Barzegar

Behnam Barzegar

Auto-generated profile, based on publicly available information

Behnam Barzegar

Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 March 2022 in International Journal of Communication Systems
Verified
Journal Article
Closed access
EHEhsan Heidari
Ehsan Heidari
AMAli Movaghar
Ali Movaghar
HMHomayun Motameni
Homayun Motameni
BBBehnam Barzegar
Behnam Barzegar

3 August 2022 in IEEE Access
Verified
Journal Article
Open access
BNBadieh Nikzad
Badieh Nikzad
BBBehnam Barzegar
Behnam Barzegar
HMHomayun Motameni
Homayun Motameni
Increasing demand for computational resource as services over the internet has led to the expansion of datacenter infrastructures. Thus, datacenter authorities are striving to adopt optimal power usage schemes to minimize costs, emissions and Service Level Agreement (SLA) violations in their task scheduling for heterogeneous computation centers. One of the most effective strategies to reduce datacenter energy consumption is to maximize the utilization of physical machines and shut down the idle ones. This can be realized through two main algorithms, namely virtual machine placement and virtual machine consolidation. The VM placement method is a dynamic process to put these virtual devices on physical machines. The consolidation technique, however, tries to improve physical machine efficiency through grouping and live migration of dispersed virtual machines on lower number of active physical machine. In this paper, a novel approach is proposed for improving the physical machine efficiency. The approach employs heuristics and meta-heuristic algorithms with eight performance criteria and is implemented on small to medium scale data centers using simulated cloud module. The results indicates that the proposed method showed up to 10.3%, 5.3%, and 12.5% the more significant efficiency rather best previous algorithms, respectively, in terms of the energy consumption, number of SLA violation and number of VMs migration.

20 December 2021 in IEEE Access
Verified
Journal Article
Open access
JMJavad Masoudi
Javad Masoudi
BBBehnam Barzegar
Behnam Barzegar
HMHomayun Motameni
Homayun Motameni
Energy management is considered the major concern in cloud computing, which supports the rapid growth of data centers and computing centers; therefore, energy and load balancing have become crucial issues in cloud data centers. To address this issue, the present paper proposed a two-phase energy-aware load balancing (EALB) scheduling algorithm using the virtual machine migration through the Particle Swarm Optimization (PSO) algorithm to be applicable to dynamic voltage frequency scaling-enabled cloud data centers, which is called EALBPSO. In the first phase, an objective function was employed to deactivate a large number of physical machines in order to reduce energy consumption. The main idea of the algorithm was to maximize load balancing in the second phase, in which the remaining virtual and physical machines were used as the PSO inputs, and an objective function was also defined to distribute the load appropriately among the physical machines. In addition, a dataset was developed to test different parameters and scenarios with the aim of assessing the effectiveness of the proposed EALBPSO algorithm in comparison with other algorithms already proposed in the literature for similar purposes. The experimental results demonstrated that the proposed algorithm was capable of saving up to 0.896%, 9.716%, and 10.8% energy compared with the MDPSO algorithm, Kumar et al.’s algorithm, and Dahsti et al.’s algorithm, respectively, and also it showed 5.91%, 16%, and 16.267% improvements for the number of virtual machines migrations, and 3.867%, 8.623%, and 6.953% improvements for the deviation of processors, all compared with their competitors stated above, respectively.

19 September 2022 in IEEE Access
Verified
Journal Article
Open access
YFYong Fang
Yong Fang
APAmir Panah
Amir Panah
JMJavad Masoudi
Javad Masoudi
BBBehnam Barzegar
Behnam Barzegar
SFSaeed Fatehi
Saeed Fatehi
The navigation of a mobile robot is a very important issue, especially for an autonomous mobile robot. A robot autonomously can track the area by interpreting the arena, building an adequate map, and localizing itself to this map. This paper proposes a Hybrid filter for Concurrent Localization and Mapping (CLAM) in the navigation to rectify the faults, basically Unscented Fast Simultaneous Localization and Mapping (SLAM) (UFS). We also interrogate the effectiveness of the IF system to investigate nonlinear attributes. A probabilistic method has planned the solution to the CLAM issue, which is an essential requirement for the navigation of robots. The Hybrid filter CLAM contains an Intuitionistic Fuzzy Logic (IFL) and Unscented Kalman Filter (UKF). The IFL is first ordered by using a correctness function explained on score functions for the non-membership function (NMF) and membership function (MF) of the IFL. Then this ordering is utilized to develop a method for a sufficient decision on the CLAM issue. The proposed method has a few privileges in management robot navigation with nonlinear movements owing to the inference feature of the IFL, which also needs a fewer quantity of comparisons than the UFS and shows much better efficiency from the robustness, perspective assessment exactitude, and reliability than the UFS, also, for learning the measurement and control noise covariance matrices for increasing correctness and consistency are utilized IFL. The Hybrid filter CLAM proficiency compared with the UFS has a smaller quantity of computations and good efficiency for bigger areas as demonstrate in the results of simulation and experimental.

29 September 2021 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
MNMohammad Hossein Nejat
Mohammad Hossein Nejat
HMHomayun Motameni
Homayun Motameni
HVHamed Vahdat-Nejad
Hamed Vahdat-Nejad
BBBehnam Barzegar
Behnam Barzegar

1 January 2025 in IET Wireless Sensor Systems
Verified
Journal Article
Open access
MBMohamadhosein Behzadi
Mohamadhosein Behzadi
HMHomayun Motameni
Homayun Motameni
HMHosein Mohamadi
Hosein Mohamadi
BBBehnam Barzegar
Behnam Barzegar
Efficient resource management remains a critical challenge in wireless sensor networks (WSNs) due to the constrained nature of sensor nodes. This paper proposes a novel hybrid clustering protocol to address this issue, aiming to optimise energy consumption, extend network lifetime and enhance scalability. Our approach combines the improved version of binary dragonfly algorithm (IVBDA) for cluster head (CH) selection and the Mamdani fuzzy inference system for effective cluster formation. After CH selection and cluster formation, a multi‐hop routing mechanism transmits data packets within the WSN. To validate the performance of the proposed protocol, extensive simulations are conducted on various network topologies, evaluating metrics such as average energy consumption, live node count, network lifetime, and packet reception at the base station (BS). Comparative analyses with existing clustering protocols and other metaheuristic algorithms, including binary particle swarm optimisation (BPSO), binary whale optimisation algorithm (BWOA) and binary dragonfly algorithm (BDA), demonstrate the superior performance of the proposed hybrid approach in terms of energy efficiency, network longevity and overall WSN performance. The improved version of BDA shows faster convergence than BPSO, BWOA and BDA, as ascertained by examining the multi‐objective fitness function. This paper contributes significantly to the development of efficient clustering protocols and showcases the potential of hybrid metaheuristic and fuzzy inference techniques for optimising resource allocation in WSNs. The proposed protocol outperforms other protocols in network lifetime and overall performance, indicating its potential to be a valuable solution for resource management in WSNs. The evaluation of metaheuristic algorithms highlights the importance of considering convergence speed in optimising energy‐efficient clustering.