Dadmehr Rahbari

Prof. Dadmehr Rahbari

Tallinn University of Technology, Tallinn, Harjumaa, Estonia
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 September 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
PGPegah Gazori
Pegah Gazori
Dadmehr RahbariDadmehr Rahbari
Dadmehr Rahbari
MNMohsen Nickray
Mohsen Nickray

1 March 2019 in Turkish Journal of Electrical Engineering and Computer Sciences
Verified
Journal Article
Closed access
Dadmehr RahbariDadmehr Rahbari
Dadmehr Rahbari
MNMohsen Nickray
Mohsen Nickray
In today’s world, the internet of things (IoT) is developing rapidly. Wireless sensor network (WSN) as an infrastructure of IoT has limitations in the processing power, storage, and delay for data transfer to cloud. The large volume of generated data and their transmission between WSNs and cloud are serious challenges. Fog computing (FC) as an extension of cloud to the edge of the network reduces latency and traffic; thus, it is very useful in IoT applications such as healthcare applications, wearables, intelligent transportation systems, and smart cities. Resource allocation and task scheduling are the NP-hard issues in FC. Each application includes several modules that require resources to run. Fog devices (FDs) have the ability to run resource management algorithms because of their proximity to sensors and cloud as well as the proper processing power. In this paper, we review the scheduling strategies and parameters as well as providing a greedy knapsack-based scheduling (GKS) algorithm for allocating resources appropriately to modules in fog network. Our proposed method was simulated in iFogsim as a standard simulator for FC. The results show that the energy consumption, execution cost, and sensor lifetime in GKS are better than those of the first-come-first-served (FCFS), concurrent, and delay-priority algorithms.

1 February 2019 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
Dadmehr RahbariDadmehr Rahbari
Dadmehr Rahbari
MNMohsen Nickray
Mohsen Nickray

1 November 2017
Verified
Conference Paper
Closed access
Dadmehr RahbariDadmehr Rahbari
Dadmehr Rahbari
MNMohsen Nickray
Mohsen Nickray

1 November 2017
Verified
Conference Paper
Closed access
SKSabihe Kabirzadeh
Sabihe Kabirzadeh
Dadmehr RahbariDadmehr Rahbari
Dadmehr Rahbari
MNMohsen Nickray
Mohsen Nickray

1 December 2017
Verified
Conference Paper
Closed access
Dadmehr RahbariDadmehr Rahbari
Dadmehr Rahbari
SKSabihe Kabirzadeh
Sabihe Kabirzadeh
MNMohsen Nickray
Mohsen Nickray
Fog computing provides a new architecture for the implementation of the Internet of Things (IoT), which can connect sensor nodes to the cloud using the edge of the network. This structure has improved the latency and energy consumption in the cloud. In this heterogeneous and distributed environment, resource allocation is very important. Hence, scheduling will be a challenge to increase productivity and allocate resources appropriately to the tasks. Programs that run in this environment should be protected from intruders. We consider three parameters as authentication, integrity, and confidentiality to maintain security in fog devices. These parameters have time and computational overhead. In the proposed approach, we schedule the modules for the run in fog devices by heuristic algorithms based on data mining technique. The objective function is included CPU utilization, bandwidth, and security overhead. We compare the proposed algorithm with several heuristic algorithms. The results show that our proposed algorithm improved the average energy consumption of 63.27%, cost 44.71% relative to the PSO, ACO, SA algorithms.