Peyman Neamatollahi

Peyman Neamatollahi
Ferdowsi University Of Mashhad | FUM · Department of Computer Engineering

PhD

About

28
Publications
11,673
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
673
Citations
Citations since 2017
15 Research Items
559 Citations
2017201820192020202120222023020406080100
2017201820192020202120222023020406080100
2017201820192020202120222023020406080100
2017201820192020202120222023020406080100
Introduction
Peyman Neamatollahi received the Ph.D. degree in computer engineering from the Ferdowsi University of Mashhad, in 2017. His research interests are in distributed algorithms, bioinformatics, job scheduling, Internet of Things (IoT), and green communicatins. He also serves as a Reviewer of the IEEE Transactions on Mobile Computing, IEEE Transactions on Vehicular Technologies, IEEE Sensors Journal, and some other journals.
Education
October 2013 - September 2017
Ferdowsi University Of Mashhad
Field of study
  • Computer Engineering

Publications

Publications (28)
Article
Full-text available
Clustering is an effective approach for organizing a network into a connected hierarchy, load balancing, and prolonging the network lifetime. On the other hand, fuzzy logic is capable of wisely blending different parameters. This paper proposes an energy-aware distributed dynamic clustering protocol (ECPF) which applies three techniques: (1) non-pr...
Article
Full-text available
In this paper, we propose a token-based fully distributed algorithm with token-asking method for Distributed Mutual Exclusion (DME) in a computer network composed of NN nodes that communicate by message exchanges. The main goal is to introduce a new class of token-based DME algorithms called info-based algorithms. In some previous algorithms, the r...
Article
Full-text available
In token-based distributed mutual exclusion algorithms a unique object (token) is used to grant the right to enter the critical section. For the movement of the token within the computer network, two possible methods can be considered: perpetual mobility of the token and token-asking method. This paper presents a distributed token-based algorithm s...
Article
Full-text available
Cluster architectures are an effective approach for organizing sensor networks to balance the load and prolong network life. To cluster wireless sensor networks, this paper proposes an energy-efficient distributed algorithm. This algorithm uses two techniques (partial clustering and multi-criterion cluster formation) for efficient use of the sensor...
Article
Full-text available
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 d...
Patent
Full-text available
Method for Decentralized Clustring in Wireless Sensor Networks
Article
Full-text available
The accurate evaluation of ecological resources plays a critical role in optimal planning for spatial development. For its study of an area of about 11.6 Mha, the present research aimed to assess land suitability in arid regions of eastern Iran by employing a fuzzy inference system in a GIS environment. Primary data, such as the physical properties...
Patent
Full-text available
An improved method of dynamically scheduling clustering operations in a network includes determining if one or more conditions for reclustering are met before deciding to perform the next reclustering operation. Therefore, to achieve load balancing for a network, the method of dynamically scheduling clustering operations schedules reclustering oper...
Patent
Full-text available
An improved method of clustering wireless sensor networks includes selecting cluster heads in the network based on a score calculated for each node. The score is calculated based on one or more predetermined criteria of each node and determines which node is selected as a cluster head among one or more nodes in the vicinity of each other. As a resu...
Article
The accurate evaluation of ecological resources plays a critical role in optimal planning for spatial development. For its study of an area of about 11.6 Mha, the present research aimed to assess land suitability in arid regions of eastern Iran by employing a fuzzy inference system in a GIS environment. Primary data, such as the physical properties...
Article
The accurate evaluation of ecological resources plays a critical role in optimal planning for spatial development. For its study of an area of about 11.6 Mha, the present research aimed to assess land suitability in arid regions of eastern Iran by employing a fuzzy inference system in a GIS environment. Primary data, such as the physical properties...
Article
Full-text available
Clustering is a promising and popular approach to organize sensor nodes into a hierarchical structure, reduce transmitting data to the base station by aggregation methods, and prolong the network lifetime. However, a heavy traffic load may cause the sudden death of nodes due to energy resource depletion in some network regions, i.e., hot spots that...
Article
Full-text available
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...
Article
Full-text available
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 round...
Article
Full-text available
Solving the problem of mutually exclusive access to a critical resource is a major challenge in distributed systems. In some solutions, there is a unique token in the whole system which acts as a privilege to access a critical resource. Practical and easily implemented, the token-ring algorithm is one of the most popular token-based mutual exclusio...
Article
Full-text available
Prolonging the network life cycle is an essential requirement for many types of Wireless Sensor Network (WSN) applications. Dynamic clustering of sensors into groups is a popular strategy to maximize the network lifetime and increase scalability. In this strategy, to achieve the sensor nodes’ load balancing, with the aim of prolonging lifetime, net...
Conference Paper
Full-text available
Clustering is an effective approach for organizing network nodes into hierarchical topology, aggregating sending data to the base station and prolonging the network lifetime. However, it may cause sudden death of nodes in some network regions, i.e., hot spots, due to heavy traffic load leading to disruption in network services. This problem is trad...
Conference Paper
Full-text available
Clustering is a promising solution to conserve sensor energy levels and to organize tasks among nodes. This paper presents a distributed energy efficient protocol to cluster wireless sensor networks using two techniques: local re-clustering and multi-criteria cluster formation. When a Cluster Head (CH) maintains an acceptable part of its remaining...
Conference Paper
Full-text available
Recently, researchers have applied semipartitioned approaches to improve performance of hard real-time scheduling algorithms in multiprocessor architectures. RMLS is one of these methods. However, advantages of using semi-partitioned methods are often limited by well-known scheduling algorithms such as RM and EDF, which the former is simple but ine...
Conference Paper
Full-text available
Semi-partitioned scheduling algorithms attempt to utilize the spare capacity in the partitioned approaches by splitting a number of tasks between processors. The main challenge in these approaches is how to split tasks and assign each partition to a different processor to achieve the highest system utilization while the lowest number of processors...
Article
Full-text available
The most important consideration in designing protocols for wireless sensor networks is the energy constraint of nodes because in most cases battery recharging is inconvenient or impossible. Therefore, many research have been done to overcome this demerit. Clustering is one of the main approaches in designing scalable and energy-efficient protocols...
Article
Full-text available
We propose an algorithm to allocate critical resources (mutual exclusion problem) in a computer network composed of N nodes that communicate by message exchanges. The algorithm uses a logical structure in the form of wraparound two-dimensional array which is imposed on the network. In this algorithm some nodes know the token-holding node and lead c...
Article
Full-text available
Clustering is one of the basic approaches for designing energy-efficient and scalable distributed sensor networks. HEED is a well known energy efficient clustering protocol. In this protocol, the message overhead is low and cluster heads are distributed fairly across the network. Our distributed clustering protocol, HEED*, improves HEED protocol to...
Article
Full-text available
Clustering is an effective approach for organizing the network into a connected hierarchy, load balancing, and prolonging network lifetime. Clustering protocols in wireless sensor networks are classified into static and dynamic. In static clustering, clusters are formed once, forever and role of the cluster head is scheduled among the nodes in a cl...
Conference Paper
Full-text available
Clustering sensor nodes is an effective topology control for increasing network lifetime and scalability. It also, balances the load on the sensor nodes. HEED is a well known distributed clustering protocol that uses both energy and communication cost to elect Cluster Heads (CHs) in a probabilistic way. This paper improves HEED protocol using fuzzy...
Conference Paper
Full-text available
Organizing sensor networks into clustered architectures is an effective approach for load balancing, and prolonging the network lifetime. This paper proposes a Distributed Energy Efficient Scheme to Cluster Wireless Sensor Networks (DESC). This protocol achieves energy efficiency using two techniques: on demand clustering and a multi-criteria clust...

Network

Cited By