Peyman Neamatollahi

Dr. Peyman Neamatollahi

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 September 2012 in Ad Hoc Networks
Verified
Journal Article
Closed access
HTHoda Taheri
Hoda Taheri
PNPeyman Neamatollahi
Peyman Neamatollahi
OYOssama Mohamed Younis
Ossama Mohamed Younis
SNShahrzad Naghibzadeh
Shahrzad Naghibzadeh
MYMohammad Hossein Yaghmaee
Mohammad Hossein Yaghmaee

28 September 2017 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
PNPeyman Neamatollahi
Peyman Neamatollahi
SASaeid Abrishami
Saeid Abrishami
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
MMMohammad Hossein Yaghmaee Moghaddam
Mohammad Hossein Yaghmaee Moghaddam
OYOssama Younis
Ossama Younis
Organizing sensor nodes into a clustered architecture is an effective method for load balancing and prolonging the network lifetime. However, a serious drawback of the clustering approach is the imposed energy overhead caused by the "global" clustering operations in every round of the Global Round-Based Policy (GRBP). To mitigate this problem, this work proposes a Hierarchical Clustering-task Scheduling Policy (HCSP), which triggers node-driven clustering as opposed to GRBP's time-driven clustering. Based on HCSP, each cluster is reconfigured only once at each local super round. Therefore, the cluster reconfiguration frequency varies on-demand. However, in order to refresh the entire network structure, global clustering is performed at the end of every global hyper round. Accordingly, HCSP aims to achieve a more flexible, energy-efficient, and scalable clustering-task scheduling than that of GRBP. Energy consumption calculations and extensive simulations show the effectiveness of HCSP in saving energy, and thus in prolonging the network lifetime.

1 March 2019 in Ecological Indicators
Verified
Journal Article
Closed access
MAMorteza Akbari
Morteza Akbari
ENEhsan Neamatollahi
Ehsan Neamatollahi
PNPeyman Neamatollahi
Peyman Neamatollahi

5 September 2017 in IEEE Sensors Journal
Verified
Journal Article
Closed access
PNPeyman Neamatollahi
Peyman Neamatollahi
MNMahmoud Naghibzadeh
Mahmoud Naghibzadeh
SASaeid Abrishami
Saeid Abrishami
Clustering is one of the effective approaches for prolonging the lifetime of a wireless sensor network and increasing its scalability. In current clustering protocols, load balancing is achieved by rotating the costly role of the cluster head among the sensors. To achieve this, the network operation is divided into fixed time durations called rounds. Network nodes are clustered for one round and are reclustered for the next round, i.e., round-based policy. Using this policy, loads of nodes are somewhat balanced. However, the imposed overhead from consecutive reclusterings wastes the energy resource of network nodes. Although many attempts have been made to introduce energy-efficient clustering protocols, the reclustering overhead still remains a serious drawback of these protocols. To mitigate this problem, this paper proposes a fuzzy-based hyper round policy (FHRP) to efficiently and flexibly schedule the clustering-task. In FHRP, instead of every round, clustering is performed at the beginning of every Hyper Round (HR), which is composed of many rounds. During the network lifetime, the length of an HR is not fixed and is computed using a fuzzy inference system. The node's residual energy and its distance from the sink are used as the inputs of this fuzzy system and the HR length is its output. Thus, the nodes' situation is taken into account for determining the reclustering time. Simulation results reveal the effectiveness of FHRP in reducing the clustering energy overhead, lengthening the network lifetime, and conserving the network nodes' energy.

29 January 2018 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
PNPeyman Neamatollahi
Peyman Neamatollahi
MNMahmoud Naghibzadeh
Mahmoud Naghibzadeh

23 January 2020 in IEEE Access
Verified
Journal Article
Open access
PNPeyman Neamatollahi
Peyman Neamatollahi
MHMontassir Hadi
Montassir Hadi
Mahmoud NaghibzadehMahmoud Naghibzadeh
Mahmoud Naghibzadeh
The remarkable growth of biological data is a motivation to accelerate the discovery of solutions in many domains of computational bioinformatics. In different phases of the computational pipelines, pattern matching is a very practical operation. For example, pattern matching enables users to find the locations of particular DNA subsequences in a database or DNA sequence. Furthermore, in these expanding biological databases, some patterns are updated over time. To perform faster searches, high-speed pattern matching algorithms are needed. The present paper introduces three pattern matching algorithms that are specially formulated to speed up searches on large DNA sequences. The proposed algorithms raise performance by utilizing word processing (in place of the character processing presented in previous works) and also by searching the least frequent word of the pattern in the sequence. In terms of time cost, the experimental results demonstrate the superiority of the presented algorithms over the other simulated algorithms.