Search Results - (( simulation implementation clustering algorithm ) OR ( java implementation path algorithm ))

Refine Results
  1. 1

    Improving on the network lifetime of clustered-based wireless sensor network using modified leach algorithm by Zeni, Saltihie

    Published 2012
    “…This document is a study about LEACH algorithm where the implementation was done using OMNeT++ network simulator to study the performance of this algorithm in term of network lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  7. 7

    An Efficient Clustering Technique for Mobile Wireless Sensor Networks by Azman, Nurul Syafiqah

    Published 2014
    “…LEACH clustering algorithm will be implemented on random mobility network. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network by Abdulrazzak H.N., Hock G.C., Mohamed Radzi N.A., Tan N.M.L., Kwong C.F.

    Published 2023
    “…The effectiveness of the clustering model is the most important challenge. The K-Means clustering algorithm is an effective algorithm for multi-clusters that can be used in VANETs. …”
    Article
  9. 9

    Improvement of routing protocol in wireless sensor network for energy consumption to maximize network lifetime by A. Othman, Emad

    Published 2013
    “…This document is a study about hierarchical cluster-based routing protocol algorithm where the implementation was done using Matlab simulator to study the performance of this algorithm in term of lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Application of parallel ensemble Monte Carlo technique in charge dynamics simulation by Umar, Roslan, -, Othman, -, A.P., -, Gopir

    Published 2008
    “…This is done using a computer cluster network in a master-slave model. This paper report the development of a LINUX cluster for the purpose of implementing parallel ensemble Monte Carlo modelling for solid states device. …”
    Get full text
    Get full text
    Article
  11. 11

    Web cluster load balancing via genetic-fuzzy based algorithm by Chin, Wen Cheong, Lim, Amy Hui Lan

    Published 2007
    “…Finally, a simulation of 20 load-weight indices in a topology of 3-cube form Web cluster is implemented to illustrate the functionality of the proposed method.…”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…Core functionality of the simulator are job generation, volunteer generation, simulating algorithms, generating graphical charts and generating reports. …”
    Get full text
    Get full text
    Final Year Project
  13. 13

    Application of parallel ensemble Monte Carlo technique in charge dynamics simulation by A. P. Othman, R. Umar, G. Gopir

    Published 2008
    “…This is done using a computer cluster network in a master-slave model. In this paper we report the development of a LINUX cluster for the purpose of implementing parallel ensemble Monte Carlo modelling for solid states device. …”
    Get full text
    Get full text
    Article
  14. 14

    An improvement of resource consumption in wireless sensor network (WSN) using compressive sensing / Maizatul Akmal Ibrahim and Norkhushaini Awang by Ibrahim, Maizatul Akmal, Awang, Norkhushaini

    Published 2022
    “…The Compressive Sensing (CS) algorithm has been implemented to the network through Cluster Head (CH) to further the lifetime longevity. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Efficient tag grouping RFID anti-collision algorithm for internet of things applications based on improved k-means clustering by Umelo, Nnamdi Henry, Noordin, Nor Kamariah, A. Rasid, Mohd Fadlee, Tan, Kim Geok, Hashim, Fazirulhisyam

    Published 2023
    “…Variants of the proposed kg-DFSA, traditional DFSA and another grouping based DFSA algorithm (FCM-DFSA) were implemented in MATLAB. Extensive Monte Carlo simulation shows the proposed kg-DFSA edges DFSA in terms of success rate 50, system efficiency 65 and identification time 28. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Modeling of vehicle trajectory clustering based on LCSS for traffic pattern extraction by Choong, Mei Yeen, Lorita Angeline, Chin, Renee Ka Yin, Yeo, Kiam Beng, Teo, Kenneth Tze Kin

    Published 2017
    “…Rand Index (RI) is computed to evaluate the clustering performance of two sets trajectories with two different traffic scenes by comparing the simulated clustering result with the ground-truth result.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  18. 18
  19. 19
  20. 20