Tajedin Derikvand
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tajedin Derikvand has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Amin Keshavarzi
Department of Computer Engineering, Marvdasht Branch, Islamic Azad University, Marvdasht, Iran
2 shared publications - Ahmed Mohamed Abdelmoniem
Queen Mary University of London
1 shared publication - Arezoo Ghasemi1 shared publication
- Mahdi Bohlouli
Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran
1 shared publication - Omid Reza Nejati1 shared publication
- Rajab Ali Kamyabi Gol
Department of Mathematics Sciences, Faculty of Math, Ferdowsi University of Mashhad and Center of Excellence in Analysis on Algebraic Structures (CEAAS), Mashhad, Iran
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 2 April 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 280
Edge Intelligence for Intelligent Transport Systems: Approaches, challenges, and future directions
- 2 April 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 280
Top Cited PapersOpen AccessEdge Intelligence for Intelligent Transport Systems: Approaches, challenges, and future directions
- 24 October 2021
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 35 (15) , 1777-1802
Energy Efficient Cluster Head Selection in Internet of Things Using Minimum Spanning Tree (EEMST)
Internet of things network lifetime and energy issues are some of the most important challenges in today’s smart world. Clustering would be an effective solution to this, as all nodes would be arranged into virtual clusters, while one node will serve as the cluster head. The right selection of the cluster head will reduce energy consumption dramatically. This concept is more crucial for the internet of things, which is being widely distributed in environments such as forests or the smart agriculture sector. In this paper, an Energy Efficient Minimum Spanning Tree algorithm (EEMST) is presented to select the optimal cluster head and data routing based on graph theory for a multihop Internet of Things. This algorithm calculates the Euclidean distance-based minimum spanning tree based on a weighted graph. As a result, we use a weighted minimum spanning tree to choose the optimal cluster head and accordingly determine the shortest path for data transmission between member nodes and the cluster head. The proposed EEMST algorithm provides the possibility of intracluster multihop routing and also the possibility of intercluster single-hop routing. The simulated experimental results approve a significant improvement of the proposed algorithm in the IoT systems’ lifetime compared to the baselines.
- 24 October 2021
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 35 (15) , 1777-1802
Energy Efficient Cluster Head Selection in Internet of Things Using Minimum Spanning Tree (EEMST)
Internet of things network lifetime and energy issues are some of the most important challenges in today’s smart world. Clustering would be an effective solution to this, as all nodes would be arranged into virtual clusters, while one node will serve as the cluster head. The right selection of the cluster head will reduce energy consumption dramatically. This concept is more crucial for the internet of things, which is being widely distributed in environments such as forests or the smart agriculture sector. In this paper, an Energy Efficient Minimum Spanning Tree algorithm (EEMST) is presented to select the optimal cluster head and data routing based on graph theory for a multihop Internet of Things. This algorithm calculates the Euclidean distance-based minimum spanning tree based on a weighted graph. As a result, we use a weighted minimum spanning tree to choose the optimal cluster head and accordingly determine the shortest path for data transmission between member nodes and the cluster head. The proposed EEMST algorithm provides the possibility of intracluster multihop routing and also the possibility of intercluster single-hop routing. The simulated experimental results approve a significant improvement of the proposed algorithm in the IoT systems’ lifetime compared to the baselines.
- 30 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 79-81
Reconstructing Image From Noisy Radon Projections Using Shearlet Transform
The Radon transform on the two-dimensional space, called X-ray transform, is reviewed. Some methods to reconstruct an X-ray image from its sinogram are investigated. Important details are lost when the shearlet transform is used to retrieve an image from its noisy Rdadon data. We present a new theorem to relate the shearlet and Radon transforms to come up with this challenge. An optimum threshold to use is obtained. The algorithm of fast finite shearlet transform is improved, and numerical results show the notable superiority of the proposed method over other existing algorithms.
- 30 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 79-81
Reconstructing Image From Noisy Radon Projections Using Shearlet Transform
The Radon transform on the two-dimensional space, called X-ray transform, is reviewed. Some methods to reconstruct an X-ray image from its sinogram are investigated. Important details are lost when the shearlet transform is used to retrieve an image from its noisy Rdadon data. We present a new theorem to relate the shearlet and Radon transforms to come up with this challenge. An optimum threshold to use is obtained. The algorithm of fast finite shearlet transform is improved, and numerical results show the notable superiority of the proposed method over other existing algorithms.