Search Results - (( using ant sensor algorithm ) OR ( using optimization ((method algorithm) OR (path algorithm)) ))

Refine Results
  1. 1

    A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network by Almuslehi, Hussein Saad Mohammed

    Published 2023
    “…The multi-criterion energyefficient routing mechanism uses the ACO algorithm, inspired by ants' foraging behaviour. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…The first scheme is a SensorAnt, which is a self-optimization mechanism for WSN. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Trust-based enhanced ACO algorithm for secure routing in IoT by Sharmin, Afsah, Motakabber, S M A, Hassan Abdalla Hashim, Aisha

    Published 2024
    “…In order to provide an energy-efficient and secure routing method for sensors deployed within a dynamic IoT network, this paper presents a trust-aware enhanced ant colony optimization (ACO)-based routing algorithm, incorporating a lightweight trust evaluation model. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    A novel bio-inspired routing algorithm based on ACO for WSNs by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2019
    “…A novel approach of ant colony optimization (ACO) algorithm for discovering the optimum route for information transmission in the WSNs is proposed here for optimization and enhancement. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    A noble approach of ACO algorithm for WSN by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2018
    “…A noble approach of ant colony optimization (ACO) algorithm for discovering the optimum route in the WSNs for data transmission is proposed here for enhancement and optimization considering the issue of path selection to reach the nodes. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  6. 6
  7. 7

    A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

    Published 2024
    “…Methods: It is suggested that the objective function that will be optimized using NMM is the mean squared error of the range of all neighboring anchor nodes installed in the studied WSNs. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2024
    “…Additionally, simulation results confirm that the proposed algorithm IWDSA exhibits outstanding performance compared to other algorithms utilizing optimization techniques, including genetic algorithms, bat algorithms, ant colony optimization, and swarm optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
  13. 13
  14. 14

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
    Get full text
    Get full text
    Thesis
  16. 16

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…Since 1800s when first mathematical problems related to TSP was treated, it became an interesting topic of optimization problem to be studied. In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
    Get full text
    Get full text
    Final Year Project
  18. 18
  19. 19

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  20. 20

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…Dijkstra’s algorithm was one of the shortest path algorithms that would be used to identify the path with the least cost. …”
    Get full text
    Get full text
    Get full text
    Article